./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-25_file-66.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-25_file-66.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 f51329798d39553bfe6698070ebd1150c84493b84ecd2c17e90b69fb6b7c2e13 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 09:57:13,418 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 09:57:13,471 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:57:13,476 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 09:57:13,477 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 09:57:13,498 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 09:57:13,500 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 09:57:13,500 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 09:57:13,500 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 09:57:13,501 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 09:57:13,501 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 09:57:13,502 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 09:57:13,502 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 09:57:13,502 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 09:57:13,502 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 09:57:13,503 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 09:57:13,503 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 09:57:13,503 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 09:57:13,503 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 09:57:13,503 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 09:57:13,503 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 09:57:13,503 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 09:57:13,503 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 09:57:13,503 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 09:57:13,503 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 09:57:13,503 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 09:57:13,503 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 09:57:13,503 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 09:57:13,503 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 09:57:13,503 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 09:57:13,503 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 09:57:13,504 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 09:57:13,504 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 09:57:13,504 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 09:57:13,504 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 09:57:13,504 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 09:57:13,504 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 09:57:13,504 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 09:57:13,504 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 09:57:13,504 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 09:57:13,504 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 09:57:13,504 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 09:57:13,504 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 09:57:13,504 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 09:57:13,506 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 09:57:13,506 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 09:57:13,506 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 09:57:13,506 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 09:57:13,506 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 -> f51329798d39553bfe6698070ebd1150c84493b84ecd2c17e90b69fb6b7c2e13 [2025-01-09 09:57:13,799 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 09:57:13,812 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 09:57:13,815 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 09:57:13,817 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 09:57:13,817 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 09:57:13,818 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-25_file-66.i [2025-01-09 09:57:15,187 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/292879bbd/aecf8d0ba66c4edbace85ae2c1db0378/FLAG018c5e74f [2025-01-09 09:57:15,520 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 09:57:15,523 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-25_file-66.i [2025-01-09 09:57:15,536 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/292879bbd/aecf8d0ba66c4edbace85ae2c1db0378/FLAG018c5e74f [2025-01-09 09:57:15,758 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/292879bbd/aecf8d0ba66c4edbace85ae2c1db0378 [2025-01-09 09:57:15,761 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 09:57:15,762 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 09:57:15,763 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 09:57:15,763 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 09:57:15,767 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 09:57:15,767 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 09:57:15" (1/1) ... [2025-01-09 09:57:15,768 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@16fd05f3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:57:15, skipping insertion in model container [2025-01-09 09:57:15,768 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 09:57:15" (1/1) ... [2025-01-09 09:57:15,786 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 09:57:15,916 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-25_file-66.i[915,928] [2025-01-09 09:57:15,991 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 09:57:16,008 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 09:57:16,020 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-25_file-66.i[915,928] [2025-01-09 09:57:16,066 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 09:57:16,087 INFO L204 MainTranslator]: Completed translation [2025-01-09 09:57:16,088 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:57:16 WrapperNode [2025-01-09 09:57:16,088 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 09:57:16,089 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 09:57:16,089 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 09:57:16,089 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 09:57:16,095 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:57:16" (1/1) ... [2025-01-09 09:57:16,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:57:16" (1/1) ... [2025-01-09 09:57:16,143 INFO L138 Inliner]: procedures = 26, calls = 45, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 195 [2025-01-09 09:57:16,144 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 09:57:16,145 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 09:57:16,145 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 09:57:16,145 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 09:57:16,155 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:57:16" (1/1) ... [2025-01-09 09:57:16,156 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:57:16" (1/1) ... [2025-01-09 09:57:16,158 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:57:16" (1/1) ... [2025-01-09 09:57:16,190 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:57:16,190 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:57:16" (1/1) ... [2025-01-09 09:57:16,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:57:16" (1/1) ... [2025-01-09 09:57:16,202 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:57:16" (1/1) ... [2025-01-09 09:57:16,203 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:57:16" (1/1) ... [2025-01-09 09:57:16,208 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:57:16" (1/1) ... [2025-01-09 09:57:16,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:57:16" (1/1) ... [2025-01-09 09:57:16,210 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:57:16" (1/1) ... [2025-01-09 09:57:16,217 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 09:57:16,220 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 09:57:16,220 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 09:57:16,220 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 09:57:16,222 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:57:16" (1/1) ... [2025-01-09 09:57:16,227 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 09:57:16,239 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 09:57:16,254 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:57:16,260 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:57:16,282 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 09:57:16,283 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 09:57:16,283 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 09:57:16,283 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 09:57:16,283 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 09:57:16,283 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 09:57:16,349 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 09:57:16,351 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 09:57:16,711 INFO L? ?]: Removed 18 outVars from TransFormulas that were not future-live. [2025-01-09 09:57:16,711 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 09:57:16,723 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 09:57:16,724 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 09:57:16,724 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 09:57:16 BoogieIcfgContainer [2025-01-09 09:57:16,724 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 09:57:16,726 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 09:57:16,726 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 09:57:16,731 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 09:57:16,731 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 09:57:15" (1/3) ... [2025-01-09 09:57:16,732 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@59d9cfa8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 09:57:16, skipping insertion in model container [2025-01-09 09:57:16,733 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:57:16" (2/3) ... [2025-01-09 09:57:16,734 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@59d9cfa8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 09:57:16, skipping insertion in model container [2025-01-09 09:57:16,734 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 09:57:16" (3/3) ... [2025-01-09 09:57:16,735 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-25_file-66.i [2025-01-09 09:57:16,749 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 09:57:16,750 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodesize_ps-cn-25_file-66.i that has 2 procedures, 89 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 09:57:16,804 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 09:57:16,818 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;@6fbc33d4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 09:57:16,818 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 09:57:16,823 INFO L276 IsEmpty]: Start isEmpty. Operand has 89 states, 54 states have (on average 1.3888888888888888) internal successors, (75), 55 states have internal predecessors, (75), 32 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2025-01-09 09:57:16,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2025-01-09 09:57:16,840 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 09:57:16,841 INFO L218 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:57:16,841 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 09:57:16,847 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 09:57:16,848 INFO L85 PathProgramCache]: Analyzing trace with hash 1547448372, now seen corresponding path program 1 times [2025-01-09 09:57:16,855 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 09:57:16,858 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [636574877] [2025-01-09 09:57:16,858 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:57:16,859 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 09:57:16,965 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 203 statements into 1 equivalence classes. [2025-01-09 09:57:17,001 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 203 of 203 statements. [2025-01-09 09:57:17,002 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:57:17,002 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:57:17,255 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 62 refuted. 0 times theorem prover too weak. 1922 trivial. 0 not checked. [2025-01-09 09:57:17,260 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 09:57:17,260 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [636574877] [2025-01-09 09:57:17,261 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [636574877] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 09:57:17,261 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [604876236] [2025-01-09 09:57:17,261 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:57:17,262 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 09:57:17,262 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 09:57:17,273 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:57:17,281 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:57:17,388 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 203 statements into 1 equivalence classes. [2025-01-09 09:57:17,518 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 203 of 203 statements. [2025-01-09 09:57:17,519 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:57:17,519 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:57:17,523 INFO L256 TraceCheckSpWp]: Trace formula consists of 465 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-01-09 09:57:17,533 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 09:57:17,575 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 1922 trivial. 0 not checked. [2025-01-09 09:57:17,575 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 09:57:17,575 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [604876236] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 09:57:17,575 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 09:57:17,576 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-01-09 09:57:17,578 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [384853094] [2025-01-09 09:57:17,578 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 09:57:17,582 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 09:57:17,582 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 09:57:17,601 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 09:57:17,601 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 09:57:17,604 INFO L87 Difference]: Start difference. First operand has 89 states, 54 states have (on average 1.3888888888888888) internal successors, (75), 55 states have internal predecessors, (75), 32 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) Second operand has 2 states, 2 states have (on average 24.0) internal successors, (48), 2 states have internal predecessors, (48), 2 states have call successors, (32), 2 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 2 states have call successors, (32) [2025-01-09 09:57:17,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 09:57:17,640 INFO L93 Difference]: Finished difference Result 172 states and 305 transitions. [2025-01-09 09:57:17,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 09:57:17,644 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 24.0) internal successors, (48), 2 states have internal predecessors, (48), 2 states have call successors, (32), 2 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 2 states have call successors, (32) Word has length 203 [2025-01-09 09:57:17,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 09:57:17,651 INFO L225 Difference]: With dead ends: 172 [2025-01-09 09:57:17,652 INFO L226 Difference]: Without dead ends: 86 [2025-01-09 09:57:17,655 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 204 GetRequests, 204 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:57:17,658 INFO L435 NwaCegarLoop]: 134 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, 134 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:57:17,658 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 134 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 09:57:17,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2025-01-09 09:57:17,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2025-01-09 09:57:17,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 52 states have (on average 1.3461538461538463) internal successors, (70), 52 states have internal predecessors, (70), 32 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2025-01-09 09:57:17,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 134 transitions. [2025-01-09 09:57:17,702 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 134 transitions. Word has length 203 [2025-01-09 09:57:17,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 09:57:17,702 INFO L471 AbstractCegarLoop]: Abstraction has 86 states and 134 transitions. [2025-01-09 09:57:17,702 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 24.0) internal successors, (48), 2 states have internal predecessors, (48), 2 states have call successors, (32), 2 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 2 states have call successors, (32) [2025-01-09 09:57:17,702 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 134 transitions. [2025-01-09 09:57:17,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2025-01-09 09:57:17,706 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 09:57:17,706 INFO L218 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:57:17,713 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-01-09 09:57:17,907 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:57:17,907 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 09:57:17,908 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 09:57:17,908 INFO L85 PathProgramCache]: Analyzing trace with hash -972656588, now seen corresponding path program 1 times [2025-01-09 09:57:17,908 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 09:57:17,908 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [346217365] [2025-01-09 09:57:17,909 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:57:17,909 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 09:57:17,936 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 203 statements into 1 equivalence classes. [2025-01-09 09:57:18,234 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 203 of 203 statements. [2025-01-09 09:57:18,234 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:57:18,234 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:57:23,868 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2025-01-09 09:57:23,869 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 09:57:23,869 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [346217365] [2025-01-09 09:57:23,871 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [346217365] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 09:57:23,871 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 09:57:23,871 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2025-01-09 09:57:23,871 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2142074801] [2025-01-09 09:57:23,871 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 09:57:23,872 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-01-09 09:57:23,872 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 09:57:23,873 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-01-09 09:57:23,875 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=150, Unknown=0, NotChecked=0, Total=210 [2025-01-09 09:57:23,876 INFO L87 Difference]: Start difference. First operand 86 states and 134 transitions. Second operand has 15 states, 15 states have (on average 3.066666666666667) internal successors, (46), 15 states have internal predecessors, (46), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2025-01-09 09:57:24,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 09:57:24,913 INFO L93 Difference]: Finished difference Result 290 states and 429 transitions. [2025-01-09 09:57:24,914 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-01-09 09:57:24,914 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 3.066666666666667) internal successors, (46), 15 states have internal predecessors, (46), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) Word has length 203 [2025-01-09 09:57:24,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 09:57:24,917 INFO L225 Difference]: With dead ends: 290 [2025-01-09 09:57:24,917 INFO L226 Difference]: Without dead ends: 207 [2025-01-09 09:57:24,918 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=82, Invalid=190, Unknown=0, NotChecked=0, Total=272 [2025-01-09 09:57:24,919 INFO L435 NwaCegarLoop]: 120 mSDtfsCounter, 198 mSDsluCounter, 695 mSDsCounter, 0 mSdLazyCounter, 406 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 198 SdHoareTripleChecker+Valid, 815 SdHoareTripleChecker+Invalid, 421 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 406 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-01-09 09:57:24,919 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [198 Valid, 815 Invalid, 421 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 406 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-01-09 09:57:24,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2025-01-09 09:57:24,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 131. [2025-01-09 09:57:24,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 92 states have (on average 1.391304347826087) internal successors, (128), 93 states have internal predecessors, (128), 36 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (36), 35 states have call predecessors, (36), 36 states have call successors, (36) [2025-01-09 09:57:24,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 200 transitions. [2025-01-09 09:57:24,947 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 200 transitions. Word has length 203 [2025-01-09 09:57:24,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 09:57:24,948 INFO L471 AbstractCegarLoop]: Abstraction has 131 states and 200 transitions. [2025-01-09 09:57:24,948 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 3.066666666666667) internal successors, (46), 15 states have internal predecessors, (46), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2025-01-09 09:57:24,949 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 200 transitions. [2025-01-09 09:57:24,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2025-01-09 09:57:24,955 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 09:57:24,955 INFO L218 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:57:24,955 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 09:57:24,955 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 09:57:24,956 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 09:57:24,956 INFO L85 PathProgramCache]: Analyzing trace with hash -970809546, now seen corresponding path program 1 times [2025-01-09 09:57:24,956 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 09:57:24,956 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [350673958] [2025-01-09 09:57:24,956 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:57:24,956 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 09:57:24,971 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 203 statements into 1 equivalence classes. [2025-01-09 09:57:25,042 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 203 of 203 statements. [2025-01-09 09:57:25,042 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:57:25,043 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:57:30,001 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2025-01-09 09:57:30,002 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 09:57:30,002 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [350673958] [2025-01-09 09:57:30,002 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [350673958] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 09:57:30,002 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 09:57:30,002 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2025-01-09 09:57:30,003 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [829386513] [2025-01-09 09:57:30,003 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 09:57:30,003 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-01-09 09:57:30,004 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 09:57:30,004 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-01-09 09:57:30,005 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=171, Unknown=0, NotChecked=0, Total=240 [2025-01-09 09:57:30,005 INFO L87 Difference]: Start difference. First operand 131 states and 200 transitions. Second operand has 16 states, 16 states have (on average 2.875) internal successors, (46), 16 states have internal predecessors, (46), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2025-01-09 09:57:31,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 09:57:31,622 INFO L93 Difference]: Finished difference Result 207 states and 290 transitions. [2025-01-09 09:57:31,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-01-09 09:57:31,622 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.875) internal successors, (46), 16 states have internal predecessors, (46), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) Word has length 203 [2025-01-09 09:57:31,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 09:57:31,625 INFO L225 Difference]: With dead ends: 207 [2025-01-09 09:57:31,625 INFO L226 Difference]: Without dead ends: 205 [2025-01-09 09:57:31,626 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=91, Invalid=215, Unknown=0, NotChecked=0, Total=306 [2025-01-09 09:57:31,627 INFO L435 NwaCegarLoop]: 126 mSDtfsCounter, 202 mSDsluCounter, 625 mSDsCounter, 0 mSdLazyCounter, 400 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 202 SdHoareTripleChecker+Valid, 751 SdHoareTripleChecker+Invalid, 408 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 400 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-01-09 09:57:31,627 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [202 Valid, 751 Invalid, 408 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 400 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-01-09 09:57:31,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2025-01-09 09:57:31,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 131. [2025-01-09 09:57:31,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 92 states have (on average 1.391304347826087) internal successors, (128), 93 states have internal predecessors, (128), 36 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (36), 35 states have call predecessors, (36), 36 states have call successors, (36) [2025-01-09 09:57:31,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 200 transitions. [2025-01-09 09:57:31,656 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 200 transitions. Word has length 203 [2025-01-09 09:57:31,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 09:57:31,658 INFO L471 AbstractCegarLoop]: Abstraction has 131 states and 200 transitions. [2025-01-09 09:57:31,658 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.875) internal successors, (46), 16 states have internal predecessors, (46), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2025-01-09 09:57:31,658 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 200 transitions. [2025-01-09 09:57:31,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2025-01-09 09:57:31,661 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 09:57:31,662 INFO L218 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:57:31,662 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 09:57:31,662 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 09:57:31,663 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 09:57:31,663 INFO L85 PathProgramCache]: Analyzing trace with hash -292598218, now seen corresponding path program 1 times [2025-01-09 09:57:31,663 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 09:57:31,664 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1136591152] [2025-01-09 09:57:31,664 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:57:31,664 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 09:57:31,676 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 203 statements into 1 equivalence classes. [2025-01-09 09:57:31,770 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 203 of 203 statements. [2025-01-09 09:57:31,770 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:57:31,771 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:57:36,261 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2025-01-09 09:57:36,262 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 09:57:36,262 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1136591152] [2025-01-09 09:57:36,262 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1136591152] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 09:57:36,262 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 09:57:36,262 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2025-01-09 09:57:36,263 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1085325167] [2025-01-09 09:57:36,263 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 09:57:36,263 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-01-09 09:57:36,263 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 09:57:36,264 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-01-09 09:57:36,265 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=150, Unknown=0, NotChecked=0, Total=210 [2025-01-09 09:57:36,265 INFO L87 Difference]: Start difference. First operand 131 states and 200 transitions. Second operand has 15 states, 15 states have (on average 3.066666666666667) internal successors, (46), 15 states have internal predecessors, (46), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2025-01-09 09:57:37,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 09:57:37,020 INFO L93 Difference]: Finished difference Result 214 states and 298 transitions. [2025-01-09 09:57:37,021 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-01-09 09:57:37,021 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 3.066666666666667) internal successors, (46), 15 states have internal predecessors, (46), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) Word has length 203 [2025-01-09 09:57:37,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 09:57:37,023 INFO L225 Difference]: With dead ends: 214 [2025-01-09 09:57:37,023 INFO L226 Difference]: Without dead ends: 212 [2025-01-09 09:57:37,024 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=82, Invalid=190, Unknown=0, NotChecked=0, Total=272 [2025-01-09 09:57:37,025 INFO L435 NwaCegarLoop]: 125 mSDtfsCounter, 182 mSDsluCounter, 719 mSDsCounter, 0 mSdLazyCounter, 478 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 182 SdHoareTripleChecker+Valid, 844 SdHoareTripleChecker+Invalid, 478 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 478 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-09 09:57:37,025 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [182 Valid, 844 Invalid, 478 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 478 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-09 09:57:37,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2025-01-09 09:57:37,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 135. [2025-01-09 09:57:37,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 96 states have (on average 1.3958333333333333) internal successors, (134), 97 states have internal predecessors, (134), 36 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (36), 35 states have call predecessors, (36), 36 states have call successors, (36) [2025-01-09 09:57:37,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 206 transitions. [2025-01-09 09:57:37,054 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 206 transitions. Word has length 203 [2025-01-09 09:57:37,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 09:57:37,057 INFO L471 AbstractCegarLoop]: Abstraction has 135 states and 206 transitions. [2025-01-09 09:57:37,057 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 3.066666666666667) internal successors, (46), 15 states have internal predecessors, (46), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2025-01-09 09:57:37,057 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 206 transitions. [2025-01-09 09:57:37,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2025-01-09 09:57:37,061 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 09:57:37,061 INFO L218 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:57:37,062 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 09:57:37,062 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 09:57:37,062 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 09:57:37,063 INFO L85 PathProgramCache]: Analyzing trace with hash -290751176, now seen corresponding path program 1 times [2025-01-09 09:57:37,063 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 09:57:37,064 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [205903518] [2025-01-09 09:57:37,064 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:57:37,064 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 09:57:37,076 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 203 statements into 1 equivalence classes. [2025-01-09 09:57:37,152 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 203 of 203 statements. [2025-01-09 09:57:37,152 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:57:37,153 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:57:42,218 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2025-01-09 09:57:42,219 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 09:57:42,219 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [205903518] [2025-01-09 09:57:42,219 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [205903518] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 09:57:42,219 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 09:57:42,219 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2025-01-09 09:57:42,219 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1655900916] [2025-01-09 09:57:42,219 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 09:57:42,220 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-01-09 09:57:42,220 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 09:57:42,220 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-01-09 09:57:42,220 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=171, Unknown=0, NotChecked=0, Total=240 [2025-01-09 09:57:42,221 INFO L87 Difference]: Start difference. First operand 135 states and 206 transitions. Second operand has 16 states, 16 states have (on average 2.875) internal successors, (46), 16 states have internal predecessors, (46), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2025-01-09 09:57:43,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 09:57:43,228 INFO L93 Difference]: Finished difference Result 212 states and 296 transitions. [2025-01-09 09:57:43,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-01-09 09:57:43,229 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.875) internal successors, (46), 16 states have internal predecessors, (46), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) Word has length 203 [2025-01-09 09:57:43,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 09:57:43,231 INFO L225 Difference]: With dead ends: 212 [2025-01-09 09:57:43,231 INFO L226 Difference]: Without dead ends: 210 [2025-01-09 09:57:43,231 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=91, Invalid=215, Unknown=0, NotChecked=0, Total=306 [2025-01-09 09:57:43,232 INFO L435 NwaCegarLoop]: 133 mSDtfsCounter, 185 mSDsluCounter, 576 mSDsCounter, 0 mSdLazyCounter, 451 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 185 SdHoareTripleChecker+Valid, 709 SdHoareTripleChecker+Invalid, 459 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 451 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-09 09:57:43,232 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [185 Valid, 709 Invalid, 459 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 451 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-09 09:57:43,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2025-01-09 09:57:43,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 131. [2025-01-09 09:57:43,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 92 states have (on average 1.391304347826087) internal successors, (128), 93 states have internal predecessors, (128), 36 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (36), 35 states have call predecessors, (36), 36 states have call successors, (36) [2025-01-09 09:57:43,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 200 transitions. [2025-01-09 09:57:43,247 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 200 transitions. Word has length 203 [2025-01-09 09:57:43,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 09:57:43,247 INFO L471 AbstractCegarLoop]: Abstraction has 131 states and 200 transitions. [2025-01-09 09:57:43,248 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.875) internal successors, (46), 16 states have internal predecessors, (46), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2025-01-09 09:57:43,248 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 200 transitions. [2025-01-09 09:57:43,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2025-01-09 09:57:43,251 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 09:57:43,251 INFO L218 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:57:43,251 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 09:57:43,251 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 09:57:43,252 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 09:57:43,252 INFO L85 PathProgramCache]: Analyzing trace with hash -714491150, now seen corresponding path program 1 times [2025-01-09 09:57:43,252 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 09:57:43,252 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2056318053] [2025-01-09 09:57:43,252 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:57:43,252 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 09:57:43,263 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 203 statements into 1 equivalence classes. [2025-01-09 09:57:43,273 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 203 of 203 statements. [2025-01-09 09:57:43,274 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:57:43,274 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:57:43,322 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2025-01-09 09:57:43,322 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 09:57:43,322 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2056318053] [2025-01-09 09:57:43,322 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2056318053] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 09:57:43,322 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 09:57:43,323 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 09:57:43,323 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [572274572] [2025-01-09 09:57:43,323 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 09:57:43,323 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 09:57:43,323 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 09:57:43,324 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 09:57:43,324 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 09:57:43,325 INFO L87 Difference]: Start difference. First operand 131 states and 200 transitions. Second operand has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2025-01-09 09:57:43,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 09:57:43,381 INFO L93 Difference]: Finished difference Result 368 states and 566 transitions. [2025-01-09 09:57:43,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 09:57:43,382 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) Word has length 203 [2025-01-09 09:57:43,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 09:57:43,385 INFO L225 Difference]: With dead ends: 368 [2025-01-09 09:57:43,385 INFO L226 Difference]: Without dead ends: 240 [2025-01-09 09:57:43,387 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:57:43,387 INFO L435 NwaCegarLoop]: 246 mSDtfsCounter, 121 mSDsluCounter, 120 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 121 SdHoareTripleChecker+Valid, 366 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 09:57:43,388 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [121 Valid, 366 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 09:57:43,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 240 states. [2025-01-09 09:57:43,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 240 to 238. [2025-01-09 09:57:43,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 238 states, 161 states have (on average 1.329192546583851) internal successors, (214), 163 states have internal predecessors, (214), 72 states have call successors, (72), 4 states have call predecessors, (72), 4 states have return successors, (72), 70 states have call predecessors, (72), 72 states have call successors, (72) [2025-01-09 09:57:43,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 238 states and 358 transitions. [2025-01-09 09:57:43,433 INFO L78 Accepts]: Start accepts. Automaton has 238 states and 358 transitions. Word has length 203 [2025-01-09 09:57:43,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 09:57:43,434 INFO L471 AbstractCegarLoop]: Abstraction has 238 states and 358 transitions. [2025-01-09 09:57:43,434 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2025-01-09 09:57:43,434 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 358 transitions. [2025-01-09 09:57:43,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2025-01-09 09:57:43,435 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 09:57:43,436 INFO L218 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:57:43,436 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 09:57:43,436 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 09:57:43,436 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 09:57:43,436 INFO L85 PathProgramCache]: Analyzing trace with hash -1523837776, now seen corresponding path program 1 times [2025-01-09 09:57:43,439 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 09:57:43,440 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [942647577] [2025-01-09 09:57:43,440 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:57:43,440 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 09:57:43,459 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 203 statements into 1 equivalence classes. [2025-01-09 09:57:43,471 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 203 of 203 statements. [2025-01-09 09:57:43,471 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:57:43,471 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:57:43,583 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2025-01-09 09:57:43,583 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 09:57:43,583 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [942647577] [2025-01-09 09:57:43,583 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [942647577] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 09:57:43,583 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 09:57:43,584 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 09:57:43,584 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [398248002] [2025-01-09 09:57:43,584 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 09:57:43,584 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 09:57:43,584 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 09:57:43,585 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 09:57:43,585 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 09:57:43,585 INFO L87 Difference]: Start difference. First operand 238 states and 358 transitions. Second operand has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2025-01-09 09:57:43,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 09:57:43,830 INFO L93 Difference]: Finished difference Result 704 states and 1049 transitions. [2025-01-09 09:57:43,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 09:57:43,831 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) Word has length 203 [2025-01-09 09:57:43,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 09:57:43,836 INFO L225 Difference]: With dead ends: 704 [2025-01-09 09:57:43,837 INFO L226 Difference]: Without dead ends: 469 [2025-01-09 09:57:43,838 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-01-09 09:57:43,839 INFO L435 NwaCegarLoop]: 146 mSDtfsCounter, 91 mSDsluCounter, 252 mSDsCounter, 0 mSdLazyCounter, 197 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 398 SdHoareTripleChecker+Invalid, 210 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 197 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 09:57:43,840 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [91 Valid, 398 Invalid, 210 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 197 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 09:57:43,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 469 states. [2025-01-09 09:57:43,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 469 to 424. [2025-01-09 09:57:43,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 424 states, 275 states have (on average 1.3054545454545454) internal successors, (359), 278 states have internal predecessors, (359), 140 states have call successors, (140), 8 states have call predecessors, (140), 8 states have return successors, (140), 137 states have call predecessors, (140), 140 states have call successors, (140) [2025-01-09 09:57:43,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 424 states to 424 states and 639 transitions. [2025-01-09 09:57:43,906 INFO L78 Accepts]: Start accepts. Automaton has 424 states and 639 transitions. Word has length 203 [2025-01-09 09:57:43,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 09:57:43,906 INFO L471 AbstractCegarLoop]: Abstraction has 424 states and 639 transitions. [2025-01-09 09:57:43,907 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2025-01-09 09:57:43,907 INFO L276 IsEmpty]: Start isEmpty. Operand 424 states and 639 transitions. [2025-01-09 09:57:43,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2025-01-09 09:57:43,909 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 09:57:43,909 INFO L218 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:57:43,909 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 09:57:43,910 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 09:57:43,910 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 09:57:43,910 INFO L85 PathProgramCache]: Analyzing trace with hash -843779406, now seen corresponding path program 1 times [2025-01-09 09:57:43,910 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 09:57:43,910 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1707516979] [2025-01-09 09:57:43,911 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:57:43,911 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 09:57:43,923 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 203 statements into 1 equivalence classes. [2025-01-09 09:57:43,960 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 203 of 203 statements. [2025-01-09 09:57:43,961 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:57:43,961 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:57:46,412 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2025-01-09 09:57:46,412 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 09:57:46,412 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1707516979] [2025-01-09 09:57:46,412 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1707516979] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 09:57:46,412 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 09:57:46,412 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-01-09 09:57:46,412 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [839440955] [2025-01-09 09:57:46,412 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 09:57:46,413 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-01-09 09:57:46,413 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 09:57:46,414 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-01-09 09:57:46,414 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=103, Unknown=0, NotChecked=0, Total=156 [2025-01-09 09:57:46,414 INFO L87 Difference]: Start difference. First operand 424 states and 639 transitions. Second operand has 13 states, 13 states have (on average 3.5384615384615383) internal successors, (46), 13 states have internal predecessors, (46), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2025-01-09 09:57:47,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 09:57:47,162 INFO L93 Difference]: Finished difference Result 570 states and 806 transitions. [2025-01-09 09:57:47,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-01-09 09:57:47,164 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.5384615384615383) internal successors, (46), 13 states have internal predecessors, (46), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) Word has length 203 [2025-01-09 09:57:47,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 09:57:47,169 INFO L225 Difference]: With dead ends: 570 [2025-01-09 09:57:47,169 INFO L226 Difference]: Without dead ends: 568 [2025-01-09 09:57:47,170 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=75, Invalid=135, Unknown=0, NotChecked=0, Total=210 [2025-01-09 09:57:47,170 INFO L435 NwaCegarLoop]: 144 mSDtfsCounter, 303 mSDsluCounter, 536 mSDsCounter, 0 mSdLazyCounter, 403 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 303 SdHoareTripleChecker+Valid, 680 SdHoareTripleChecker+Invalid, 435 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 403 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-09 09:57:47,171 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [303 Valid, 680 Invalid, 435 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 403 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-09 09:57:47,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 568 states. [2025-01-09 09:57:47,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 568 to 480. [2025-01-09 09:57:47,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 480 states, 320 states have (on average 1.2875) internal successors, (412), 325 states have internal predecessors, (412), 148 states have call successors, (148), 11 states have call predecessors, (148), 11 states have return successors, (148), 143 states have call predecessors, (148), 148 states have call successors, (148) [2025-01-09 09:57:47,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 480 states to 480 states and 708 transitions. [2025-01-09 09:57:47,234 INFO L78 Accepts]: Start accepts. Automaton has 480 states and 708 transitions. Word has length 203 [2025-01-09 09:57:47,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 09:57:47,235 INFO L471 AbstractCegarLoop]: Abstraction has 480 states and 708 transitions. [2025-01-09 09:57:47,235 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.5384615384615383) internal successors, (46), 13 states have internal predecessors, (46), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2025-01-09 09:57:47,235 INFO L276 IsEmpty]: Start isEmpty. Operand 480 states and 708 transitions. [2025-01-09 09:57:47,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2025-01-09 09:57:47,237 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 09:57:47,237 INFO L218 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:57:47,237 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 09:57:47,238 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 09:57:47,238 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 09:57:47,238 INFO L85 PathProgramCache]: Analyzing trace with hash -841932364, now seen corresponding path program 1 times [2025-01-09 09:57:47,238 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 09:57:47,238 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1014543257] [2025-01-09 09:57:47,239 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:57:47,239 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 09:57:47,248 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 203 statements into 1 equivalence classes. [2025-01-09 09:57:47,287 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 203 of 203 statements. [2025-01-09 09:57:47,288 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:57:47,288 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:57:50,024 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2025-01-09 09:57:50,024 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 09:57:50,024 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1014543257] [2025-01-09 09:57:50,024 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1014543257] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 09:57:50,024 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 09:57:50,024 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-01-09 09:57:50,024 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [500756026] [2025-01-09 09:57:50,025 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 09:57:50,025 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-01-09 09:57:50,025 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 09:57:50,026 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-01-09 09:57:50,026 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=120, Unknown=0, NotChecked=0, Total=182 [2025-01-09 09:57:50,026 INFO L87 Difference]: Start difference. First operand 480 states and 708 transitions. Second operand has 14 states, 14 states have (on average 3.2857142857142856) internal successors, (46), 14 states have internal predecessors, (46), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2025-01-09 09:57:51,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 09:57:51,682 INFO L93 Difference]: Finished difference Result 568 states and 804 transitions. [2025-01-09 09:57:51,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-01-09 09:57:51,683 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.2857142857142856) internal successors, (46), 14 states have internal predecessors, (46), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) Word has length 203 [2025-01-09 09:57:51,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 09:57:51,687 INFO L225 Difference]: With dead ends: 568 [2025-01-09 09:57:51,688 INFO L226 Difference]: Without dead ends: 566 [2025-01-09 09:57:51,688 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=84, Invalid=156, Unknown=0, NotChecked=0, Total=240 [2025-01-09 09:57:51,689 INFO L435 NwaCegarLoop]: 164 mSDtfsCounter, 250 mSDsluCounter, 682 mSDsCounter, 0 mSdLazyCounter, 624 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 250 SdHoareTripleChecker+Valid, 846 SdHoareTripleChecker+Invalid, 644 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 624 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-01-09 09:57:51,689 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [250 Valid, 846 Invalid, 644 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 624 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-01-09 09:57:51,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 566 states. [2025-01-09 09:57:51,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 566 to 480. [2025-01-09 09:57:51,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 480 states, 320 states have (on average 1.2875) internal successors, (412), 325 states have internal predecessors, (412), 148 states have call successors, (148), 11 states have call predecessors, (148), 11 states have return successors, (148), 143 states have call predecessors, (148), 148 states have call successors, (148) [2025-01-09 09:57:51,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 480 states to 480 states and 708 transitions. [2025-01-09 09:57:51,741 INFO L78 Accepts]: Start accepts. Automaton has 480 states and 708 transitions. Word has length 203 [2025-01-09 09:57:51,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 09:57:51,742 INFO L471 AbstractCegarLoop]: Abstraction has 480 states and 708 transitions. [2025-01-09 09:57:51,742 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.2857142857142856) internal successors, (46), 14 states have internal predecessors, (46), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2025-01-09 09:57:51,742 INFO L276 IsEmpty]: Start isEmpty. Operand 480 states and 708 transitions. [2025-01-09 09:57:51,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2025-01-09 09:57:51,744 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 09:57:51,744 INFO L218 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:57:51,744 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 09:57:51,744 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 09:57:51,745 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 09:57:51,745 INFO L85 PathProgramCache]: Analyzing trace with hash -1559462602, now seen corresponding path program 1 times [2025-01-09 09:57:51,745 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 09:57:51,745 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [46739182] [2025-01-09 09:57:51,745 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:57:51,745 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 09:57:51,761 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 203 statements into 1 equivalence classes. [2025-01-09 09:57:51,786 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 203 of 203 statements. [2025-01-09 09:57:51,786 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:57:51,786 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:57:52,046 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2025-01-09 09:57:52,047 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 09:57:52,047 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [46739182] [2025-01-09 09:57:52,047 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [46739182] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 09:57:52,047 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 09:57:52,047 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 09:57:52,047 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [385054573] [2025-01-09 09:57:52,047 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 09:57:52,048 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 09:57:52,048 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 09:57:52,048 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 09:57:52,048 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-09 09:57:52,048 INFO L87 Difference]: Start difference. First operand 480 states and 708 transitions. Second operand has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 2 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 2 states have call predecessors, (32), 2 states have call successors, (32) [2025-01-09 09:57:52,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 09:57:52,262 INFO L93 Difference]: Finished difference Result 892 states and 1301 transitions. [2025-01-09 09:57:52,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 09:57:52,263 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 2 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 2 states have call predecessors, (32), 2 states have call successors, (32) Word has length 203 [2025-01-09 09:57:52,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 09:57:52,267 INFO L225 Difference]: With dead ends: 892 [2025-01-09 09:57:52,267 INFO L226 Difference]: Without dead ends: 487 [2025-01-09 09:57:52,268 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-01-09 09:57:52,269 INFO L435 NwaCegarLoop]: 140 mSDtfsCounter, 145 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 113 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 145 SdHoareTripleChecker+Valid, 219 SdHoareTripleChecker+Invalid, 126 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 113 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 09:57:52,271 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [145 Valid, 219 Invalid, 126 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 113 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 09:57:52,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 487 states. [2025-01-09 09:57:52,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 487 to 478. [2025-01-09 09:57:52,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 478 states, 312 states have (on average 1.2532051282051282) internal successors, (391), 317 states have internal predecessors, (391), 152 states have call successors, (152), 13 states have call predecessors, (152), 13 states have return successors, (152), 147 states have call predecessors, (152), 152 states have call successors, (152) [2025-01-09 09:57:52,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 478 states to 478 states and 695 transitions. [2025-01-09 09:57:52,331 INFO L78 Accepts]: Start accepts. Automaton has 478 states and 695 transitions. Word has length 203 [2025-01-09 09:57:52,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 09:57:52,332 INFO L471 AbstractCegarLoop]: Abstraction has 478 states and 695 transitions. [2025-01-09 09:57:52,332 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 2 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 2 states have call predecessors, (32), 2 states have call successors, (32) [2025-01-09 09:57:52,333 INFO L276 IsEmpty]: Start isEmpty. Operand 478 states and 695 transitions. [2025-01-09 09:57:52,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2025-01-09 09:57:52,335 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 09:57:52,335 INFO L218 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:57:52,336 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 09:57:52,336 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 09:57:52,336 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 09:57:52,337 INFO L85 PathProgramCache]: Analyzing trace with hash 1533386262, now seen corresponding path program 1 times [2025-01-09 09:57:52,337 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 09:57:52,337 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [466797228] [2025-01-09 09:57:52,337 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:57:52,337 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 09:57:52,349 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 204 statements into 1 equivalence classes. [2025-01-09 09:57:52,387 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 204 of 204 statements. [2025-01-09 09:57:52,388 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:57:52,388 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:58:13,124 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2025-01-09 09:58:13,124 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 09:58:13,124 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [466797228] [2025-01-09 09:58:13,124 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [466797228] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 09:58:13,124 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 09:58:13,124 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2025-01-09 09:58:13,125 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [515289509] [2025-01-09 09:58:13,125 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 09:58:13,125 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-01-09 09:58:13,125 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 09:58:13,125 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-01-09 09:58:13,126 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=169, Unknown=0, NotChecked=0, Total=240 [2025-01-09 09:58:13,126 INFO L87 Difference]: Start difference. First operand 478 states and 695 transitions. Second operand has 16 states, 16 states have (on average 2.9375) internal successors, (47), 16 states have internal predecessors, (47), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2025-01-09 09:58:15,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 09:58:15,120 INFO L93 Difference]: Finished difference Result 909 states and 1304 transitions. [2025-01-09 09:58:15,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-01-09 09:58:15,120 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.9375) internal successors, (47), 16 states have internal predecessors, (47), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) Word has length 204 [2025-01-09 09:58:15,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 09:58:15,127 INFO L225 Difference]: With dead ends: 909 [2025-01-09 09:58:15,127 INFO L226 Difference]: Without dead ends: 907 [2025-01-09 09:58:15,128 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=108, Invalid=234, Unknown=0, NotChecked=0, Total=342 [2025-01-09 09:58:15,129 INFO L435 NwaCegarLoop]: 128 mSDtfsCounter, 265 mSDsluCounter, 599 mSDsCounter, 0 mSdLazyCounter, 656 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 265 SdHoareTripleChecker+Valid, 727 SdHoareTripleChecker+Invalid, 664 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 656 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-01-09 09:58:15,130 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [265 Valid, 727 Invalid, 664 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 656 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-01-09 09:58:15,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 907 states. [2025-01-09 09:58:15,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 907 to 879. [2025-01-09 09:58:15,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 879 states, 582 states have (on average 1.2577319587628866) internal successors, (732), 592 states have internal predecessors, (732), 272 states have call successors, (272), 24 states have call predecessors, (272), 24 states have return successors, (272), 262 states have call predecessors, (272), 272 states have call successors, (272) [2025-01-09 09:58:15,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 879 states to 879 states and 1276 transitions. [2025-01-09 09:58:15,230 INFO L78 Accepts]: Start accepts. Automaton has 879 states and 1276 transitions. Word has length 204 [2025-01-09 09:58:15,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 09:58:15,230 INFO L471 AbstractCegarLoop]: Abstraction has 879 states and 1276 transitions. [2025-01-09 09:58:15,230 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.9375) internal successors, (47), 16 states have internal predecessors, (47), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2025-01-09 09:58:15,230 INFO L276 IsEmpty]: Start isEmpty. Operand 879 states and 1276 transitions. [2025-01-09 09:58:15,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2025-01-09 09:58:15,232 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 09:58:15,232 INFO L218 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:58:15,232 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-09 09:58:15,232 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 09:58:15,232 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 09:58:15,232 INFO L85 PathProgramCache]: Analyzing trace with hash 1535233304, now seen corresponding path program 1 times [2025-01-09 09:58:15,232 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 09:58:15,233 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1262721984] [2025-01-09 09:58:15,233 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:58:15,233 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 09:58:15,242 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 204 statements into 1 equivalence classes. [2025-01-09 09:58:15,285 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 204 of 204 statements. [2025-01-09 09:58:15,286 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:58:15,286 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat