./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-100_file-86.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-100_file-86.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 4494aec82e3354bd32c6c13af5c36deffc5336d06a7a21928d54585f4657c423 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 09:24:36,552 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 09:24:36,607 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:24:36,613 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 09:24:36,613 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 09:24:36,647 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 09:24:36,649 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 09:24:36,649 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 09:24:36,649 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 09:24:36,650 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 09:24:36,651 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 09:24:36,651 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 09:24:36,651 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 09:24:36,651 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 09:24:36,652 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 09:24:36,652 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 09:24:36,652 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 09:24:36,652 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 09:24:36,653 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 09:24:36,653 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 09:24:36,653 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 09:24:36,653 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 09:24:36,653 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 09:24:36,653 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 09:24:36,653 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 09:24:36,653 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 09:24:36,653 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 09:24:36,654 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 09:24:36,654 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 09:24:36,654 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 09:24:36,654 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 09:24:36,654 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 09:24:36,655 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 09:24:36,655 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 09:24:36,655 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 09:24:36,655 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 09:24:36,655 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 09:24:36,655 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 09:24:36,655 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 09:24:36,656 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 09:24:36,656 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 09:24:36,656 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 09:24:36,656 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 09:24:36,656 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 09:24:36,656 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 09:24:36,656 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 09:24:36,657 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 09:24:36,657 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 09:24:36,657 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 -> 4494aec82e3354bd32c6c13af5c36deffc5336d06a7a21928d54585f4657c423 [2025-01-09 09:24:36,945 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 09:24:36,954 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 09:24:36,958 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 09:24:36,960 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 09:24:36,960 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 09:24:36,961 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-100_file-86.i [2025-01-09 09:24:38,310 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/fa0791c00/79f0505b50ee47f3bef3ac7bcf66a430/FLAG2c88f0842 [2025-01-09 09:24:38,663 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 09:24:38,664 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-100_file-86.i [2025-01-09 09:24:38,680 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/fa0791c00/79f0505b50ee47f3bef3ac7bcf66a430/FLAG2c88f0842 [2025-01-09 09:24:38,698 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/fa0791c00/79f0505b50ee47f3bef3ac7bcf66a430 [2025-01-09 09:24:38,701 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 09:24:38,703 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 09:24:38,705 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 09:24:38,705 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 09:24:38,709 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 09:24:38,710 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 09:24:38" (1/1) ... [2025-01-09 09:24:38,711 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6b8177ea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:24:38, skipping insertion in model container [2025-01-09 09:24:38,711 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 09:24:38" (1/1) ... [2025-01-09 09:24:38,734 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 09:24:38,884 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-100_file-86.i[916,929] [2025-01-09 09:24:38,991 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 09:24:39,008 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 09:24:39,019 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-100_file-86.i[916,929] [2025-01-09 09:24:39,065 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 09:24:39,087 INFO L204 MainTranslator]: Completed translation [2025-01-09 09:24:39,088 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:24:39 WrapperNode [2025-01-09 09:24:39,088 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 09:24:39,089 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 09:24:39,089 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 09:24:39,090 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 09:24:39,096 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:24:39" (1/1) ... [2025-01-09 09:24:39,107 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:24:39" (1/1) ... [2025-01-09 09:24:39,146 INFO L138 Inliner]: procedures = 26, calls = 56, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 306 [2025-01-09 09:24:39,147 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 09:24:39,149 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 09:24:39,149 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 09:24:39,150 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 09:24:39,158 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:24:39" (1/1) ... [2025-01-09 09:24:39,158 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:24:39" (1/1) ... [2025-01-09 09:24:39,166 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:24:39" (1/1) ... [2025-01-09 09:24:39,189 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:24:39,189 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:24:39" (1/1) ... [2025-01-09 09:24:39,190 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:24:39" (1/1) ... [2025-01-09 09:24:39,199 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:24:39" (1/1) ... [2025-01-09 09:24:39,201 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:24:39" (1/1) ... [2025-01-09 09:24:39,205 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:24:39" (1/1) ... [2025-01-09 09:24:39,209 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:24:39" (1/1) ... [2025-01-09 09:24:39,214 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:24:39" (1/1) ... [2025-01-09 09:24:39,225 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 09:24:39,226 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 09:24:39,226 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 09:24:39,226 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 09:24:39,231 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:24:39" (1/1) ... [2025-01-09 09:24:39,236 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 09:24:39,251 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 09:24:39,266 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:24:39,268 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:24:39,289 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 09:24:39,290 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 09:24:39,290 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 09:24:39,290 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 09:24:39,290 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 09:24:39,290 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 09:24:39,373 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 09:24:39,375 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 09:24:39,989 INFO L? ?]: Removed 23 outVars from TransFormulas that were not future-live. [2025-01-09 09:24:39,989 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 09:24:40,006 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 09:24:40,006 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 09:24:40,009 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 09:24:40 BoogieIcfgContainer [2025-01-09 09:24:40,009 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 09:24:40,011 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 09:24:40,012 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 09:24:40,016 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 09:24:40,017 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 09:24:38" (1/3) ... [2025-01-09 09:24:40,018 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7b5458cc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 09:24:40, skipping insertion in model container [2025-01-09 09:24:40,018 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:24:39" (2/3) ... [2025-01-09 09:24:40,019 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7b5458cc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 09:24:40, skipping insertion in model container [2025-01-09 09:24:40,020 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 09:24:40" (3/3) ... [2025-01-09 09:24:40,021 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-100_file-86.i [2025-01-09 09:24:40,035 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 09:24:40,037 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodesize_ps-cn-100_file-86.i that has 2 procedures, 133 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 09:24:40,119 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 09:24:40,129 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;@720806e0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 09:24:40,130 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 09:24:40,135 INFO L276 IsEmpty]: Start isEmpty. Operand has 133 states, 87 states have (on average 1.4942528735632183) internal successors, (130), 88 states have internal predecessors, (130), 43 states have call successors, (43), 1 states have call predecessors, (43), 1 states have return successors, (43), 43 states have call predecessors, (43), 43 states have call successors, (43) [2025-01-09 09:24:40,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 271 [2025-01-09 09:24:40,151 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 09:24:40,151 INFO L218 NwaCegarLoop]: trace histogram [43, 43, 43, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 09:24:40,152 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 09:24:40,157 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 09:24:40,158 INFO L85 PathProgramCache]: Analyzing trace with hash -1689391143, now seen corresponding path program 1 times [2025-01-09 09:24:40,165 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 09:24:40,166 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [972407893] [2025-01-09 09:24:40,169 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:24:40,170 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 09:24:40,271 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 270 statements into 1 equivalence classes. [2025-01-09 09:24:40,313 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 270 of 270 statements. [2025-01-09 09:24:40,314 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:24:40,314 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:24:40,607 INFO L134 CoverageAnalysis]: Checked inductivity of 3612 backedges. 0 proven. 84 refuted. 0 times theorem prover too weak. 3528 trivial. 0 not checked. [2025-01-09 09:24:40,608 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 09:24:40,608 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [972407893] [2025-01-09 09:24:40,608 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [972407893] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 09:24:40,609 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1449960524] [2025-01-09 09:24:40,609 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:24:40,609 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 09:24:40,609 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 09:24:40,618 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:24:40,628 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:24:40,742 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 270 statements into 1 equivalence classes. [2025-01-09 09:24:40,867 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 270 of 270 statements. [2025-01-09 09:24:40,868 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:24:40,868 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:24:40,872 INFO L256 TraceCheckSpWp]: Trace formula consists of 619 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-01-09 09:24:40,886 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 09:24:40,933 INFO L134 CoverageAnalysis]: Checked inductivity of 3612 backedges. 84 proven. 0 refuted. 0 times theorem prover too weak. 3528 trivial. 0 not checked. [2025-01-09 09:24:40,933 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 09:24:40,933 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1449960524] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 09:24:40,934 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 09:24:40,934 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-01-09 09:24:40,936 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [396577454] [2025-01-09 09:24:40,936 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 09:24:40,942 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 09:24:40,943 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 09:24:40,962 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 09:24:40,962 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 09:24:40,966 INFO L87 Difference]: Start difference. First operand has 133 states, 87 states have (on average 1.4942528735632183) internal successors, (130), 88 states have internal predecessors, (130), 43 states have call successors, (43), 1 states have call predecessors, (43), 1 states have return successors, (43), 43 states have call predecessors, (43), 43 states have call successors, (43) Second operand has 2 states, 2 states have (on average 30.0) internal successors, (60), 2 states have internal predecessors, (60), 2 states have call successors, (43), 2 states have call predecessors, (43), 1 states have return successors, (43), 1 states have call predecessors, (43), 2 states have call successors, (43) [2025-01-09 09:24:41,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 09:24:41,007 INFO L93 Difference]: Finished difference Result 260 states and 470 transitions. [2025-01-09 09:24:41,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 09:24:41,009 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 30.0) internal successors, (60), 2 states have internal predecessors, (60), 2 states have call successors, (43), 2 states have call predecessors, (43), 1 states have return successors, (43), 1 states have call predecessors, (43), 2 states have call successors, (43) Word has length 270 [2025-01-09 09:24:41,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 09:24:41,015 INFO L225 Difference]: With dead ends: 260 [2025-01-09 09:24:41,016 INFO L226 Difference]: Without dead ends: 130 [2025-01-09 09:24:41,020 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 271 GetRequests, 271 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:24:41,022 INFO L435 NwaCegarLoop]: 208 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, 208 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:24:41,025 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 208 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 09:24:41,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2025-01-09 09:24:41,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 130. [2025-01-09 09:24:41,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 85 states have (on average 1.4352941176470588) internal successors, (122), 85 states have internal predecessors, (122), 43 states have call successors, (43), 1 states have call predecessors, (43), 1 states have return successors, (43), 43 states have call predecessors, (43), 43 states have call successors, (43) [2025-01-09 09:24:41,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 208 transitions. [2025-01-09 09:24:41,104 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 208 transitions. Word has length 270 [2025-01-09 09:24:41,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 09:24:41,108 INFO L471 AbstractCegarLoop]: Abstraction has 130 states and 208 transitions. [2025-01-09 09:24:41,108 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 30.0) internal successors, (60), 2 states have internal predecessors, (60), 2 states have call successors, (43), 2 states have call predecessors, (43), 1 states have return successors, (43), 1 states have call predecessors, (43), 2 states have call successors, (43) [2025-01-09 09:24:41,108 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 208 transitions. [2025-01-09 09:24:41,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 271 [2025-01-09 09:24:41,114 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 09:24:41,114 INFO L218 NwaCegarLoop]: trace histogram [43, 43, 43, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 09:24:41,124 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:24:41,315 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:24:41,315 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 09:24:41,316 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 09:24:41,317 INFO L85 PathProgramCache]: Analyzing trace with hash 1158253603, now seen corresponding path program 1 times [2025-01-09 09:24:41,317 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 09:24:41,317 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1412678846] [2025-01-09 09:24:41,317 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:24:41,317 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 09:24:41,351 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 270 statements into 1 equivalence classes. [2025-01-09 09:24:41,459 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 270 of 270 statements. [2025-01-09 09:24:41,463 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:24:41,463 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:24:42,031 INFO L134 CoverageAnalysis]: Checked inductivity of 3612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3612 trivial. 0 not checked. [2025-01-09 09:24:42,033 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 09:24:42,034 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1412678846] [2025-01-09 09:24:42,034 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1412678846] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 09:24:42,034 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 09:24:42,034 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 09:24:42,034 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1693653550] [2025-01-09 09:24:42,034 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 09:24:42,036 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 09:24:42,038 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 09:24:42,039 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 09:24:42,039 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 09:24:42,039 INFO L87 Difference]: Start difference. First operand 130 states and 208 transitions. Second operand has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (43), 1 states have call predecessors, (43), 1 states have return successors, (43), 1 states have call predecessors, (43), 1 states have call successors, (43) [2025-01-09 09:24:42,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 09:24:42,428 INFO L93 Difference]: Finished difference Result 385 states and 619 transitions. [2025-01-09 09:24:42,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 09:24:42,430 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (43), 1 states have call predecessors, (43), 1 states have return successors, (43), 1 states have call predecessors, (43), 1 states have call successors, (43) Word has length 270 [2025-01-09 09:24:42,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 09:24:42,438 INFO L225 Difference]: With dead ends: 385 [2025-01-09 09:24:42,438 INFO L226 Difference]: Without dead ends: 258 [2025-01-09 09:24:42,440 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-01-09 09:24:42,444 INFO L435 NwaCegarLoop]: 203 mSDtfsCounter, 192 mSDsluCounter, 512 mSDsCounter, 0 mSdLazyCounter, 111 mSolverCounterSat, 130 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 192 SdHoareTripleChecker+Valid, 715 SdHoareTripleChecker+Invalid, 241 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 130 IncrementalHoareTripleChecker+Valid, 111 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 09:24:42,444 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [192 Valid, 715 Invalid, 241 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [130 Valid, 111 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 09:24:42,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2025-01-09 09:24:42,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 238. [2025-01-09 09:24:42,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 238 states, 149 states have (on average 1.4228187919463087) internal successors, (212), 149 states have internal predecessors, (212), 86 states have call successors, (86), 2 states have call predecessors, (86), 2 states have return successors, (86), 86 states have call predecessors, (86), 86 states have call successors, (86) [2025-01-09 09:24:42,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 238 states and 384 transitions. [2025-01-09 09:24:42,510 INFO L78 Accepts]: Start accepts. Automaton has 238 states and 384 transitions. Word has length 270 [2025-01-09 09:24:42,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 09:24:42,511 INFO L471 AbstractCegarLoop]: Abstraction has 238 states and 384 transitions. [2025-01-09 09:24:42,511 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (43), 1 states have call predecessors, (43), 1 states have return successors, (43), 1 states have call predecessors, (43), 1 states have call successors, (43) [2025-01-09 09:24:42,511 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 384 transitions. [2025-01-09 09:24:42,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 271 [2025-01-09 09:24:42,515 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 09:24:42,515 INFO L218 NwaCegarLoop]: trace histogram [43, 43, 43, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 09:24:42,516 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 09:24:42,516 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 09:24:42,516 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 09:24:42,517 INFO L85 PathProgramCache]: Analyzing trace with hash 147136353, now seen corresponding path program 1 times [2025-01-09 09:24:42,517 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 09:24:42,517 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [830051241] [2025-01-09 09:24:42,517 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:24:42,517 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 09:24:42,552 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 270 statements into 1 equivalence classes. [2025-01-09 09:24:42,841 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 270 of 270 statements. [2025-01-09 09:24:42,842 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:24:42,842 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:24:51,238 INFO L134 CoverageAnalysis]: Checked inductivity of 3612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3612 trivial. 0 not checked. [2025-01-09 09:24:51,238 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 09:24:51,238 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [830051241] [2025-01-09 09:24:51,238 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [830051241] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 09:24:51,238 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 09:24:51,239 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2025-01-09 09:24:51,239 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [986590541] [2025-01-09 09:24:51,239 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 09:24:51,239 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-01-09 09:24:51,240 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 09:24:51,240 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-01-09 09:24:51,240 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=164, Unknown=0, NotChecked=0, Total=210 [2025-01-09 09:24:51,241 INFO L87 Difference]: Start difference. First operand 238 states and 384 transitions. Second operand has 15 states, 15 states have (on average 3.8666666666666667) internal successors, (58), 15 states have internal predecessors, (58), 1 states have call successors, (43), 1 states have call predecessors, (43), 1 states have return successors, (43), 1 states have call predecessors, (43), 1 states have call successors, (43) [2025-01-09 09:24:54,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 09:24:54,906 INFO L93 Difference]: Finished difference Result 432 states and 680 transitions. [2025-01-09 09:24:54,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-01-09 09:24:54,908 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 3.8666666666666667) internal successors, (58), 15 states have internal predecessors, (58), 1 states have call successors, (43), 1 states have call predecessors, (43), 1 states have return successors, (43), 1 states have call predecessors, (43), 1 states have call successors, (43) Word has length 270 [2025-01-09 09:24:54,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 09:24:54,911 INFO L225 Difference]: With dead ends: 432 [2025-01-09 09:24:54,911 INFO L226 Difference]: Without dead ends: 305 [2025-01-09 09:24:54,915 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 159 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=221, Invalid=649, Unknown=0, NotChecked=0, Total=870 [2025-01-09 09:24:54,919 INFO L435 NwaCegarLoop]: 189 mSDtfsCounter, 364 mSDsluCounter, 1216 mSDsCounter, 0 mSdLazyCounter, 377 mSolverCounterSat, 133 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 364 SdHoareTripleChecker+Valid, 1405 SdHoareTripleChecker+Invalid, 510 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 133 IncrementalHoareTripleChecker+Valid, 377 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-01-09 09:24:54,919 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [364 Valid, 1405 Invalid, 510 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [133 Valid, 377 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-01-09 09:24:54,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 305 states. [2025-01-09 09:24:54,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 305 to 254. [2025-01-09 09:24:54,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 254 states, 165 states have (on average 1.4181818181818182) internal successors, (234), 165 states have internal predecessors, (234), 86 states have call successors, (86), 2 states have call predecessors, (86), 2 states have return successors, (86), 86 states have call predecessors, (86), 86 states have call successors, (86) [2025-01-09 09:24:54,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 406 transitions. [2025-01-09 09:24:54,969 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 406 transitions. Word has length 270 [2025-01-09 09:24:54,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 09:24:54,971 INFO L471 AbstractCegarLoop]: Abstraction has 254 states and 406 transitions. [2025-01-09 09:24:54,972 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 3.8666666666666667) internal successors, (58), 15 states have internal predecessors, (58), 1 states have call successors, (43), 1 states have call predecessors, (43), 1 states have return successors, (43), 1 states have call predecessors, (43), 1 states have call successors, (43) [2025-01-09 09:24:54,972 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 406 transitions. [2025-01-09 09:24:54,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 271 [2025-01-09 09:24:54,977 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 09:24:54,977 INFO L218 NwaCegarLoop]: trace histogram [43, 43, 43, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 09:24:54,978 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 09:24:54,978 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 09:24:54,978 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 09:24:54,979 INFO L85 PathProgramCache]: Analyzing trace with hash 848200931, now seen corresponding path program 1 times [2025-01-09 09:24:54,979 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 09:24:54,979 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [110770700] [2025-01-09 09:24:54,979 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:24:54,979 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 09:24:54,999 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 270 statements into 1 equivalence classes. [2025-01-09 09:24:55,018 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 270 of 270 statements. [2025-01-09 09:24:55,018 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:24:55,018 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:24:55,099 INFO L134 CoverageAnalysis]: Checked inductivity of 3612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3612 trivial. 0 not checked. [2025-01-09 09:24:55,100 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 09:24:55,100 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [110770700] [2025-01-09 09:24:55,100 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [110770700] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 09:24:55,100 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 09:24:55,100 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 09:24:55,100 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1123131025] [2025-01-09 09:24:55,100 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 09:24:55,101 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 09:24:55,101 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 09:24:55,102 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 09:24:55,102 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 09:24:55,102 INFO L87 Difference]: Start difference. First operand 254 states and 406 transitions. Second operand has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 1 states have call successors, (43), 1 states have call predecessors, (43), 1 states have return successors, (43), 1 states have call predecessors, (43), 1 states have call successors, (43) [2025-01-09 09:24:55,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 09:24:55,153 INFO L93 Difference]: Finished difference Result 507 states and 814 transitions. [2025-01-09 09:24:55,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 09:24:55,154 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 1 states have call successors, (43), 1 states have call predecessors, (43), 1 states have return successors, (43), 1 states have call predecessors, (43), 1 states have call successors, (43) Word has length 270 [2025-01-09 09:24:55,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 09:24:55,157 INFO L225 Difference]: With dead ends: 507 [2025-01-09 09:24:55,159 INFO L226 Difference]: Without dead ends: 380 [2025-01-09 09:24:55,160 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:24:55,161 INFO L435 NwaCegarLoop]: 221 mSDtfsCounter, 200 mSDsluCounter, 194 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 200 SdHoareTripleChecker+Valid, 415 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 09:24:55,161 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [200 Valid, 415 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 09:24:55,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 380 states. [2025-01-09 09:24:55,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 380 to 378. [2025-01-09 09:24:55,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 378 states, 245 states have (on average 1.416326530612245) internal successors, (347), 245 states have internal predecessors, (347), 129 states have call successors, (129), 3 states have call predecessors, (129), 3 states have return successors, (129), 129 states have call predecessors, (129), 129 states have call successors, (129) [2025-01-09 09:24:55,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 378 states to 378 states and 605 transitions. [2025-01-09 09:24:55,214 INFO L78 Accepts]: Start accepts. Automaton has 378 states and 605 transitions. Word has length 270 [2025-01-09 09:24:55,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 09:24:55,215 INFO L471 AbstractCegarLoop]: Abstraction has 378 states and 605 transitions. [2025-01-09 09:24:55,215 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 1 states have call successors, (43), 1 states have call predecessors, (43), 1 states have return successors, (43), 1 states have call predecessors, (43), 1 states have call successors, (43) [2025-01-09 09:24:55,216 INFO L276 IsEmpty]: Start isEmpty. Operand 378 states and 605 transitions. [2025-01-09 09:24:55,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 272 [2025-01-09 09:24:55,219 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 09:24:55,220 INFO L218 NwaCegarLoop]: trace histogram [43, 43, 43, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 09:24:55,220 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 09:24:55,220 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 09:24:55,221 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 09:24:55,221 INFO L85 PathProgramCache]: Analyzing trace with hash 319761661, now seen corresponding path program 1 times [2025-01-09 09:24:55,221 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 09:24:55,221 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1475036022] [2025-01-09 09:24:55,221 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:24:55,221 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 09:24:55,238 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 271 statements into 1 equivalence classes. [2025-01-09 09:24:55,354 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 271 of 271 statements. [2025-01-09 09:24:55,355 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:24:55,355 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:25:00,073 INFO L134 CoverageAnalysis]: Checked inductivity of 3612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3612 trivial. 0 not checked. [2025-01-09 09:25:00,073 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 09:25:00,074 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1475036022] [2025-01-09 09:25:00,074 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1475036022] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 09:25:00,074 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 09:25:00,074 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2025-01-09 09:25:00,074 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1000462027] [2025-01-09 09:25:00,074 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 09:25:00,075 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-01-09 09:25:00,075 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 09:25:00,076 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-01-09 09:25:00,076 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=167, Unknown=0, NotChecked=0, Total=210 [2025-01-09 09:25:00,076 INFO L87 Difference]: Start difference. First operand 378 states and 605 transitions. Second operand has 15 states, 15 states have (on average 3.933333333333333) internal successors, (59), 15 states have internal predecessors, (59), 1 states have call successors, (43), 1 states have call predecessors, (43), 1 states have return successors, (43), 1 states have call predecessors, (43), 1 states have call successors, (43) [2025-01-09 09:25:01,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 09:25:01,614 INFO L93 Difference]: Finished difference Result 678 states and 1068 transitions. [2025-01-09 09:25:01,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-01-09 09:25:01,617 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 3.933333333333333) internal successors, (59), 15 states have internal predecessors, (59), 1 states have call successors, (43), 1 states have call predecessors, (43), 1 states have return successors, (43), 1 states have call predecessors, (43), 1 states have call successors, (43) Word has length 271 [2025-01-09 09:25:01,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 09:25:01,627 INFO L225 Difference]: With dead ends: 678 [2025-01-09 09:25:01,627 INFO L226 Difference]: Without dead ends: 427 [2025-01-09 09:25:01,628 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 127 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=185, Invalid=571, Unknown=0, NotChecked=0, Total=756 [2025-01-09 09:25:01,631 INFO L435 NwaCegarLoop]: 199 mSDtfsCounter, 467 mSDsluCounter, 1285 mSDsCounter, 0 mSdLazyCounter, 744 mSolverCounterSat, 175 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 467 SdHoareTripleChecker+Valid, 1484 SdHoareTripleChecker+Invalid, 919 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 175 IncrementalHoareTripleChecker+Valid, 744 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-01-09 09:25:01,631 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [467 Valid, 1484 Invalid, 919 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [175 Valid, 744 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-01-09 09:25:01,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 427 states. [2025-01-09 09:25:01,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 427 to 380. [2025-01-09 09:25:01,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 380 states, 247 states have (on average 1.4129554655870444) internal successors, (349), 247 states have internal predecessors, (349), 129 states have call successors, (129), 3 states have call predecessors, (129), 3 states have return successors, (129), 129 states have call predecessors, (129), 129 states have call successors, (129) [2025-01-09 09:25:01,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 380 states to 380 states and 607 transitions. [2025-01-09 09:25:01,693 INFO L78 Accepts]: Start accepts. Automaton has 380 states and 607 transitions. Word has length 271 [2025-01-09 09:25:01,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 09:25:01,695 INFO L471 AbstractCegarLoop]: Abstraction has 380 states and 607 transitions. [2025-01-09 09:25:01,695 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 3.933333333333333) internal successors, (59), 15 states have internal predecessors, (59), 1 states have call successors, (43), 1 states have call predecessors, (43), 1 states have return successors, (43), 1 states have call predecessors, (43), 1 states have call successors, (43) [2025-01-09 09:25:01,696 INFO L276 IsEmpty]: Start isEmpty. Operand 380 states and 607 transitions. [2025-01-09 09:25:01,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 272 [2025-01-09 09:25:01,699 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 09:25:01,700 INFO L218 NwaCegarLoop]: trace histogram [43, 43, 43, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 09:25:01,700 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 09:25:01,700 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 09:25:01,701 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 09:25:01,701 INFO L85 PathProgramCache]: Analyzing trace with hash 107604247, now seen corresponding path program 1 times [2025-01-09 09:25:01,701 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 09:25:01,701 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [239515007] [2025-01-09 09:25:01,701 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:25:01,701 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 09:25:01,723 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 271 statements into 1 equivalence classes. [2025-01-09 09:25:01,808 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 271 of 271 statements. [2025-01-09 09:25:01,809 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:25:01,809 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:25:02,182 INFO L134 CoverageAnalysis]: Checked inductivity of 3612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3612 trivial. 0 not checked. [2025-01-09 09:25:02,182 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 09:25:02,182 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [239515007] [2025-01-09 09:25:02,182 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [239515007] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 09:25:02,182 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 09:25:02,182 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 09:25:02,182 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1949125446] [2025-01-09 09:25:02,182 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 09:25:02,183 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 09:25:02,183 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 09:25:02,183 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 09:25:02,184 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-09 09:25:02,184 INFO L87 Difference]: Start difference. First operand 380 states and 607 transitions. Second operand has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 1 states have call successors, (43), 1 states have call predecessors, (43), 1 states have return successors, (43), 1 states have call predecessors, (43), 1 states have call successors, (43) [2025-01-09 09:25:02,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 09:25:02,229 INFO L93 Difference]: Finished difference Result 642 states and 1026 transitions. [2025-01-09 09:25:02,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 09:25:02,230 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 1 states have call successors, (43), 1 states have call predecessors, (43), 1 states have return successors, (43), 1 states have call predecessors, (43), 1 states have call successors, (43) Word has length 271 [2025-01-09 09:25:02,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 09:25:02,233 INFO L225 Difference]: With dead ends: 642 [2025-01-09 09:25:02,234 INFO L226 Difference]: Without dead ends: 388 [2025-01-09 09:25:02,235 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:25:02,235 INFO L435 NwaCegarLoop]: 203 mSDtfsCounter, 6 mSDsluCounter, 392 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 595 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 09:25:02,235 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 595 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 09:25:02,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 388 states. [2025-01-09 09:25:02,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 388 to 380. [2025-01-09 09:25:02,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 380 states, 247 states have (on average 1.4008097165991902) internal successors, (346), 247 states have internal predecessors, (346), 129 states have call successors, (129), 3 states have call predecessors, (129), 3 states have return successors, (129), 129 states have call predecessors, (129), 129 states have call successors, (129) [2025-01-09 09:25:02,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 380 states to 380 states and 604 transitions. [2025-01-09 09:25:02,259 INFO L78 Accepts]: Start accepts. Automaton has 380 states and 604 transitions. Word has length 271 [2025-01-09 09:25:02,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 09:25:02,259 INFO L471 AbstractCegarLoop]: Abstraction has 380 states and 604 transitions. [2025-01-09 09:25:02,260 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 1 states have call successors, (43), 1 states have call predecessors, (43), 1 states have return successors, (43), 1 states have call predecessors, (43), 1 states have call successors, (43) [2025-01-09 09:25:02,260 INFO L276 IsEmpty]: Start isEmpty. Operand 380 states and 604 transitions. [2025-01-09 09:25:02,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 272 [2025-01-09 09:25:02,261 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 09:25:02,262 INFO L218 NwaCegarLoop]: trace histogram [43, 43, 43, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 09:25:02,262 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 09:25:02,262 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 09:25:02,262 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 09:25:02,263 INFO L85 PathProgramCache]: Analyzing trace with hash 1882611609, now seen corresponding path program 1 times [2025-01-09 09:25:02,263 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 09:25:02,263 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [381361056] [2025-01-09 09:25:02,263 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:25:02,263 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 09:25:02,278 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 271 statements into 1 equivalence classes. [2025-01-09 09:25:02,375 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 271 of 271 statements. [2025-01-09 09:25:02,375 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:25:02,375 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:25:08,951 INFO L134 CoverageAnalysis]: Checked inductivity of 3612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3612 trivial. 0 not checked. [2025-01-09 09:25:08,952 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 09:25:08,952 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [381361056] [2025-01-09 09:25:08,952 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [381361056] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 09:25:08,952 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 09:25:08,952 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2025-01-09 09:25:08,952 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [356201954] [2025-01-09 09:25:08,952 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 09:25:08,953 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-01-09 09:25:08,953 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 09:25:08,953 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-01-09 09:25:08,953 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=217, Unknown=0, NotChecked=0, Total=272 [2025-01-09 09:25:08,954 INFO L87 Difference]: Start difference. First operand 380 states and 604 transitions. Second operand has 17 states, 17 states have (on average 3.4705882352941178) internal successors, (59), 17 states have internal predecessors, (59), 3 states have call successors, (43), 1 states have call predecessors, (43), 1 states have return successors, (43), 3 states have call predecessors, (43), 3 states have call successors, (43) [2025-01-09 09:25:13,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 09:25:13,173 INFO L93 Difference]: Finished difference Result 438 states and 667 transitions. [2025-01-09 09:25:13,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-01-09 09:25:13,174 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 3.4705882352941178) internal successors, (59), 17 states have internal predecessors, (59), 3 states have call successors, (43), 1 states have call predecessors, (43), 1 states have return successors, (43), 3 states have call predecessors, (43), 3 states have call successors, (43) Word has length 271 [2025-01-09 09:25:13,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 09:25:13,178 INFO L225 Difference]: With dead ends: 438 [2025-01-09 09:25:13,178 INFO L226 Difference]: Without dead ends: 436 [2025-01-09 09:25:13,179 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 130 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=297, Invalid=825, Unknown=0, NotChecked=0, Total=1122 [2025-01-09 09:25:13,180 INFO L435 NwaCegarLoop]: 191 mSDtfsCounter, 432 mSDsluCounter, 1643 mSDsCounter, 0 mSdLazyCounter, 620 mSolverCounterSat, 240 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 432 SdHoareTripleChecker+Valid, 1834 SdHoareTripleChecker+Invalid, 860 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 240 IncrementalHoareTripleChecker+Valid, 620 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-01-09 09:25:13,181 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [432 Valid, 1834 Invalid, 860 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [240 Valid, 620 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-01-09 09:25:13,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 436 states. [2025-01-09 09:25:13,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 436 to 384. [2025-01-09 09:25:13,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 384 states, 250 states have (on average 1.396) internal successors, (349), 250 states have internal predecessors, (349), 129 states have call successors, (129), 4 states have call predecessors, (129), 4 states have return successors, (129), 129 states have call predecessors, (129), 129 states have call successors, (129) [2025-01-09 09:25:13,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 384 states to 384 states and 607 transitions. [2025-01-09 09:25:13,227 INFO L78 Accepts]: Start accepts. Automaton has 384 states and 607 transitions. Word has length 271 [2025-01-09 09:25:13,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 09:25:13,228 INFO L471 AbstractCegarLoop]: Abstraction has 384 states and 607 transitions. [2025-01-09 09:25:13,229 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 3.4705882352941178) internal successors, (59), 17 states have internal predecessors, (59), 3 states have call successors, (43), 1 states have call predecessors, (43), 1 states have return successors, (43), 3 states have call predecessors, (43), 3 states have call successors, (43) [2025-01-09 09:25:13,229 INFO L276 IsEmpty]: Start isEmpty. Operand 384 states and 607 transitions. [2025-01-09 09:25:13,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 272 [2025-01-09 09:25:13,235 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 09:25:13,235 INFO L218 NwaCegarLoop]: trace histogram [43, 43, 43, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 09:25:13,235 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 09:25:13,235 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 09:25:13,236 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 09:25:13,236 INFO L85 PathProgramCache]: Analyzing trace with hash 1438488886, now seen corresponding path program 1 times [2025-01-09 09:25:13,237 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 09:25:13,237 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [961471519] [2025-01-09 09:25:13,237 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:25:13,237 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 09:25:13,256 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 271 statements into 1 equivalence classes. [2025-01-09 09:25:13,344 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 271 of 271 statements. [2025-01-09 09:25:13,344 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:25:13,344 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:25:18,263 INFO L134 CoverageAnalysis]: Checked inductivity of 3612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3612 trivial. 0 not checked. [2025-01-09 09:25:18,263 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 09:25:18,263 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [961471519] [2025-01-09 09:25:18,264 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [961471519] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 09:25:18,264 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 09:25:18,264 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2025-01-09 09:25:18,264 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [438590252] [2025-01-09 09:25:18,264 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 09:25:18,264 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-01-09 09:25:18,265 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 09:25:18,265 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-01-09 09:25:18,265 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=159, Unknown=0, NotChecked=0, Total=210 [2025-01-09 09:25:18,266 INFO L87 Difference]: Start difference. First operand 384 states and 607 transitions. Second operand has 15 states, 15 states have (on average 3.933333333333333) internal successors, (59), 15 states have internal predecessors, (59), 1 states have call successors, (43), 1 states have call predecessors, (43), 1 states have return successors, (43), 1 states have call predecessors, (43), 1 states have call successors, (43) [2025-01-09 09:25:20,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 09:25:20,297 INFO L93 Difference]: Finished difference Result 454 states and 686 transitions. [2025-01-09 09:25:20,298 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-01-09 09:25:20,298 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 3.933333333333333) internal successors, (59), 15 states have internal predecessors, (59), 1 states have call successors, (43), 1 states have call predecessors, (43), 1 states have return successors, (43), 1 states have call predecessors, (43), 1 states have call successors, (43) Word has length 271 [2025-01-09 09:25:20,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 09:25:20,302 INFO L225 Difference]: With dead ends: 454 [2025-01-09 09:25:20,302 INFO L226 Difference]: Without dead ends: 452 [2025-01-09 09:25:20,303 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 169 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=261, Invalid=669, Unknown=0, NotChecked=0, Total=930 [2025-01-09 09:25:20,304 INFO L435 NwaCegarLoop]: 197 mSDtfsCounter, 429 mSDsluCounter, 1048 mSDsCounter, 0 mSdLazyCounter, 492 mSolverCounterSat, 174 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 429 SdHoareTripleChecker+Valid, 1245 SdHoareTripleChecker+Invalid, 666 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 174 IncrementalHoareTripleChecker+Valid, 492 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-01-09 09:25:20,304 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [429 Valid, 1245 Invalid, 666 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [174 Valid, 492 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-01-09 09:25:20,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 452 states. [2025-01-09 09:25:20,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 452 to 394. [2025-01-09 09:25:20,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 394 states, 260 states have (on average 1.3923076923076922) internal successors, (362), 260 states have internal predecessors, (362), 129 states have call successors, (129), 4 states have call predecessors, (129), 4 states have return successors, (129), 129 states have call predecessors, (129), 129 states have call successors, (129) [2025-01-09 09:25:20,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 394 states and 620 transitions. [2025-01-09 09:25:20,345 INFO L78 Accepts]: Start accepts. Automaton has 394 states and 620 transitions. Word has length 271 [2025-01-09 09:25:20,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 09:25:20,346 INFO L471 AbstractCegarLoop]: Abstraction has 394 states and 620 transitions. [2025-01-09 09:25:20,346 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 3.933333333333333) internal successors, (59), 15 states have internal predecessors, (59), 1 states have call successors, (43), 1 states have call predecessors, (43), 1 states have return successors, (43), 1 states have call predecessors, (43), 1 states have call successors, (43) [2025-01-09 09:25:20,346 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states and 620 transitions. [2025-01-09 09:25:20,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 272 [2025-01-09 09:25:20,352 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 09:25:20,352 INFO L218 NwaCegarLoop]: trace histogram [43, 43, 43, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 09:25:20,352 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 09:25:20,352 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 09:25:20,353 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 09:25:20,353 INFO L85 PathProgramCache]: Analyzing trace with hash 2118547256, now seen corresponding path program 1 times [2025-01-09 09:25:20,353 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 09:25:20,353 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [631238458] [2025-01-09 09:25:20,353 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:25:20,353 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 09:25:20,370 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 271 statements into 1 equivalence classes. [2025-01-09 09:25:20,441 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 271 of 271 statements. [2025-01-09 09:25:20,441 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:25:20,442 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:25:24,878 INFO L134 CoverageAnalysis]: Checked inductivity of 3612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3612 trivial. 0 not checked. [2025-01-09 09:25:24,878 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 09:25:24,878 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [631238458] [2025-01-09 09:25:24,878 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [631238458] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 09:25:24,878 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 09:25:24,878 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2025-01-09 09:25:24,878 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1143310340] [2025-01-09 09:25:24,879 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 09:25:24,879 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-01-09 09:25:24,879 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 09:25:24,880 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-01-09 09:25:24,880 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=179, Unknown=0, NotChecked=0, Total=240 [2025-01-09 09:25:24,880 INFO L87 Difference]: Start difference. First operand 394 states and 620 transitions. Second operand has 16 states, 16 states have (on average 3.6875) internal successors, (59), 16 states have internal predecessors, (59), 1 states have call successors, (43), 1 states have call predecessors, (43), 1 states have return successors, (43), 1 states have call predecessors, (43), 1 states have call successors, (43) [2025-01-09 09:25:26,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 09:25:26,667 INFO L93 Difference]: Finished difference Result 448 states and 680 transitions. [2025-01-09 09:25:26,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-01-09 09:25:26,668 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 3.6875) internal successors, (59), 16 states have internal predecessors, (59), 1 states have call successors, (43), 1 states have call predecessors, (43), 1 states have return successors, (43), 1 states have call predecessors, (43), 1 states have call successors, (43) Word has length 271 [2025-01-09 09:25:26,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 09:25:26,672 INFO L225 Difference]: With dead ends: 448 [2025-01-09 09:25:26,672 INFO L226 Difference]: Without dead ends: 446 [2025-01-09 09:25:26,673 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 169 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=280, Invalid=712, Unknown=0, NotChecked=0, Total=992 [2025-01-09 09:25:26,673 INFO L435 NwaCegarLoop]: 195 mSDtfsCounter, 447 mSDsluCounter, 1023 mSDsCounter, 0 mSdLazyCounter, 416 mSolverCounterSat, 176 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 447 SdHoareTripleChecker+Valid, 1218 SdHoareTripleChecker+Invalid, 592 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 176 IncrementalHoareTripleChecker+Valid, 416 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-01-09 09:25:26,673 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [447 Valid, 1218 Invalid, 592 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [176 Valid, 416 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-01-09 09:25:26,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 446 states. [2025-01-09 09:25:26,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 446 to 394. [2025-01-09 09:25:26,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 394 states, 260 states have (on average 1.3923076923076922) internal successors, (362), 260 states have internal predecessors, (362), 129 states have call successors, (129), 4 states have call predecessors, (129), 4 states have return successors, (129), 129 states have call predecessors, (129), 129 states have call successors, (129) [2025-01-09 09:25:26,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 394 states and 620 transitions. [2025-01-09 09:25:26,710 INFO L78 Accepts]: Start accepts. Automaton has 394 states and 620 transitions. Word has length 271 [2025-01-09 09:25:26,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 09:25:26,710 INFO L471 AbstractCegarLoop]: Abstraction has 394 states and 620 transitions. [2025-01-09 09:25:26,711 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 3.6875) internal successors, (59), 16 states have internal predecessors, (59), 1 states have call successors, (43), 1 states have call predecessors, (43), 1 states have return successors, (43), 1 states have call predecessors, (43), 1 states have call successors, (43) [2025-01-09 09:25:26,711 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states and 620 transitions. [2025-01-09 09:25:26,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 273 [2025-01-09 09:25:26,712 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 09:25:26,713 INFO L218 NwaCegarLoop]: trace histogram [43, 43, 43, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 09:25:26,713 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 09:25:26,713 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 09:25:26,714 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 09:25:26,714 INFO L85 PathProgramCache]: Analyzing trace with hash -1715080251, now seen corresponding path program 1 times [2025-01-09 09:25:26,714 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 09:25:26,714 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [115502517] [2025-01-09 09:25:26,714 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:25:26,714 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 09:25:26,730 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 272 statements into 1 equivalence classes. [2025-01-09 09:25:26,803 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 272 of 272 statements. [2025-01-09 09:25:26,803 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:25:26,804 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:25:32,673 INFO L134 CoverageAnalysis]: Checked inductivity of 3612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3612 trivial. 0 not checked. [2025-01-09 09:25:32,673 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 09:25:32,674 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [115502517] [2025-01-09 09:25:32,674 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [115502517] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 09:25:32,674 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 09:25:32,674 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2025-01-09 09:25:32,674 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [732315033] [2025-01-09 09:25:32,674 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 09:25:32,674 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-01-09 09:25:32,675 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 09:25:32,675 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-01-09 09:25:32,675 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=266, Unknown=0, NotChecked=0, Total=306 [2025-01-09 09:25:32,676 INFO L87 Difference]: Start difference. First operand 394 states and 620 transitions. Second operand has 18 states, 18 states have (on average 3.3333333333333335) internal successors, (60), 18 states have internal predecessors, (60), 2 states have call successors, (43), 1 states have call predecessors, (43), 1 states have return successors, (43), 2 states have call predecessors, (43), 2 states have call successors, (43) [2025-01-09 09:25:43,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 09:25:43,384 INFO L93 Difference]: Finished difference Result 882 states and 1356 transitions. [2025-01-09 09:25:43,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2025-01-09 09:25:43,386 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 3.3333333333333335) internal successors, (60), 18 states have internal predecessors, (60), 2 states have call successors, (43), 1 states have call predecessors, (43), 1 states have return successors, (43), 2 states have call predecessors, (43), 2 states have call successors, (43) Word has length 272 [2025-01-09 09:25:43,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 09:25:43,390 INFO L225 Difference]: With dead ends: 882 [2025-01-09 09:25:43,390 INFO L226 Difference]: Without dead ends: 631 [2025-01-09 09:25:43,392 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 756 ImplicationChecksByTransitivity, 6.7s TimeCoverageRelationStatistics Valid=637, Invalid=2443, Unknown=0, NotChecked=0, Total=3080 [2025-01-09 09:25:43,392 INFO L435 NwaCegarLoop]: 365 mSDtfsCounter, 893 mSDsluCounter, 3041 mSDsCounter, 0 mSdLazyCounter, 2134 mSolverCounterSat, 232 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 893 SdHoareTripleChecker+Valid, 3406 SdHoareTripleChecker+Invalid, 2366 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 232 IncrementalHoareTripleChecker+Valid, 2134 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.0s IncrementalHoareTripleChecker+Time [2025-01-09 09:25:43,393 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [893 Valid, 3406 Invalid, 2366 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [232 Valid, 2134 Invalid, 0 Unknown, 0 Unchecked, 5.0s Time] [2025-01-09 09:25:43,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 631 states. [2025-01-09 09:25:43,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 631 to 518. [2025-01-09 09:25:43,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 518 states, 340 states have (on average 1.3941176470588235) internal successors, (474), 340 states have internal predecessors, (474), 172 states have call successors, (172), 5 states have call predecessors, (172), 5 states have return successors, (172), 172 states have call predecessors, (172), 172 states have call successors, (172) [2025-01-09 09:25:43,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 518 states to 518 states and 818 transitions. [2025-01-09 09:25:43,447 INFO L78 Accepts]: Start accepts. Automaton has 518 states and 818 transitions. Word has length 272 [2025-01-09 09:25:43,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 09:25:43,448 INFO L471 AbstractCegarLoop]: Abstraction has 518 states and 818 transitions. [2025-01-09 09:25:43,449 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 3.3333333333333335) internal successors, (60), 18 states have internal predecessors, (60), 2 states have call successors, (43), 1 states have call predecessors, (43), 1 states have return successors, (43), 2 states have call predecessors, (43), 2 states have call successors, (43) [2025-01-09 09:25:43,449 INFO L276 IsEmpty]: Start isEmpty. Operand 518 states and 818 transitions. [2025-01-09 09:25:43,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 273 [2025-01-09 09:25:43,450 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 09:25:43,450 INFO L218 NwaCegarLoop]: trace histogram [43, 43, 43, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 09:25:43,450 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 09:25:43,450 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 09:25:43,451 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 09:25:43,451 INFO L85 PathProgramCache]: Analyzing trace with hash 1698831562, now seen corresponding path program 1 times [2025-01-09 09:25:43,451 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 09:25:43,451 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [841336058] [2025-01-09 09:25:43,451 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:25:43,451 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 09:25:43,469 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 272 statements into 1 equivalence classes. [2025-01-09 09:25:43,536 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 272 of 272 statements. [2025-01-09 09:25:43,537 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:25:43,537 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat