./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-100_file-34.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-100_file-34.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 2b329d9832ec99d9ffbb7796b225f0eac74b08ac18938b07d93f1b80cf8ae2f9 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 09:17:44,587 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 09:17:44,644 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:17:44,647 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 09:17:44,648 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 09:17:44,662 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 09:17:44,663 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 09:17:44,663 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 09:17:44,663 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 09:17:44,663 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 09:17:44,663 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 09:17:44,663 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 09:17:44,663 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 09:17:44,663 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 09:17:44,663 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 09:17:44,663 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 09:17:44,664 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 09:17:44,664 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 09:17:44,664 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 09:17:44,664 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 09:17:44,664 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 09:17:44,664 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 09:17:44,664 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 09:17:44,664 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 09:17:44,664 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 09:17:44,664 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 09:17:44,664 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 09:17:44,664 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 09:17:44,664 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 09:17:44,664 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 09:17:44,664 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 09:17:44,664 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 09:17:44,664 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 09:17:44,664 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 09:17:44,664 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 09:17:44,665 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 09:17:44,665 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 09:17:44,665 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 09:17:44,665 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 09:17:44,665 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 09:17:44,665 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 09:17:44,665 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 09:17:44,665 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 09:17:44,665 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 09:17:44,665 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 09:17:44,665 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 09:17:44,665 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 09:17:44,665 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 09:17:44,665 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 -> 2b329d9832ec99d9ffbb7796b225f0eac74b08ac18938b07d93f1b80cf8ae2f9 [2025-01-09 09:17:44,855 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 09:17:44,863 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 09:17:44,864 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 09:17:44,866 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 09:17:44,866 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 09:17:44,866 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-100_file-34.i [2025-01-09 09:17:46,115 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/a35de86b1/88f9a2c4354042b5b0ecb8e8c887fad3/FLAG917ef7b9c [2025-01-09 09:17:46,426 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 09:17:46,427 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-100_file-34.i [2025-01-09 09:17:46,434 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/a35de86b1/88f9a2c4354042b5b0ecb8e8c887fad3/FLAG917ef7b9c [2025-01-09 09:17:46,700 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/a35de86b1/88f9a2c4354042b5b0ecb8e8c887fad3 [2025-01-09 09:17:46,703 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 09:17:46,705 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 09:17:46,709 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 09:17:46,709 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 09:17:46,712 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 09:17:46,713 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 09:17:46" (1/1) ... [2025-01-09 09:17:46,714 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@89515ed and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:17:46, skipping insertion in model container [2025-01-09 09:17:46,714 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 09:17:46" (1/1) ... [2025-01-09 09:17:46,728 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 09:17:46,816 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-100_file-34.i[916,929] [2025-01-09 09:17:46,897 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 09:17:46,910 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 09:17:46,917 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-100_file-34.i[916,929] [2025-01-09 09:17:46,960 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 09:17:46,976 INFO L204 MainTranslator]: Completed translation [2025-01-09 09:17:46,977 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:17:46 WrapperNode [2025-01-09 09:17:46,977 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 09:17:46,978 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 09:17:46,978 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 09:17:46,978 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 09:17:46,982 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:17:46" (1/1) ... [2025-01-09 09:17:46,993 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:17:46" (1/1) ... [2025-01-09 09:17:47,035 INFO L138 Inliner]: procedures = 26, calls = 57, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 315 [2025-01-09 09:17:47,040 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 09:17:47,040 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 09:17:47,040 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 09:17:47,040 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 09:17:47,050 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:17:46" (1/1) ... [2025-01-09 09:17:47,050 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:17:46" (1/1) ... [2025-01-09 09:17:47,054 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:17:46" (1/1) ... [2025-01-09 09:17:47,075 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:17:47,078 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:17:46" (1/1) ... [2025-01-09 09:17:47,079 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:17:46" (1/1) ... [2025-01-09 09:17:47,089 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:17:46" (1/1) ... [2025-01-09 09:17:47,093 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:17:46" (1/1) ... [2025-01-09 09:17:47,095 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:17:46" (1/1) ... [2025-01-09 09:17:47,099 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:17:46" (1/1) ... [2025-01-09 09:17:47,102 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:17:46" (1/1) ... [2025-01-09 09:17:47,105 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 09:17:47,107 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 09:17:47,107 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 09:17:47,107 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 09:17:47,109 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:17:46" (1/1) ... [2025-01-09 09:17:47,113 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 09:17:47,123 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 09:17:47,141 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:17:47,151 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:17:47,170 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 09:17:47,170 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 09:17:47,170 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 09:17:47,171 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 09:17:47,172 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 09:17:47,172 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 09:17:47,252 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 09:17:47,254 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 09:17:47,665 INFO L? ?]: Removed 30 outVars from TransFormulas that were not future-live. [2025-01-09 09:17:47,666 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 09:17:47,678 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 09:17:47,679 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 09:17:47,680 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 09:17:47 BoogieIcfgContainer [2025-01-09 09:17:47,680 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 09:17:47,681 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 09:17:47,682 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 09:17:47,685 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 09:17:47,686 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 09:17:46" (1/3) ... [2025-01-09 09:17:47,687 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4c1726a4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 09:17:47, skipping insertion in model container [2025-01-09 09:17:47,687 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:17:46" (2/3) ... [2025-01-09 09:17:47,687 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4c1726a4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 09:17:47, skipping insertion in model container [2025-01-09 09:17:47,687 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 09:17:47" (3/3) ... [2025-01-09 09:17:47,688 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-100_file-34.i [2025-01-09 09:17:47,698 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 09:17:47,703 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodesize_ps-cn-100_file-34.i that has 2 procedures, 136 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 09:17:47,747 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 09:17:47,755 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;@366943d8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 09:17:47,755 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 09:17:47,758 INFO L276 IsEmpty]: Start isEmpty. Operand has 136 states, 89 states have (on average 1.4719101123595506) internal successors, (131), 90 states have internal predecessors, (131), 44 states have call successors, (44), 1 states have call predecessors, (44), 1 states have return successors, (44), 44 states have call predecessors, (44), 44 states have call successors, (44) [2025-01-09 09:17:47,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 277 [2025-01-09 09:17:47,772 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 09:17:47,773 INFO L218 NwaCegarLoop]: trace histogram [44, 44, 44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:17:47,773 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 09:17:47,777 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 09:17:47,777 INFO L85 PathProgramCache]: Analyzing trace with hash 1094980592, now seen corresponding path program 1 times [2025-01-09 09:17:47,782 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 09:17:47,782 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [632881374] [2025-01-09 09:17:47,782 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:17:47,782 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 09:17:47,862 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 276 statements into 1 equivalence classes. [2025-01-09 09:17:47,891 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 276 of 276 statements. [2025-01-09 09:17:47,891 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:17:47,891 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:17:48,115 INFO L134 CoverageAnalysis]: Checked inductivity of 3784 backedges. 0 proven. 86 refuted. 0 times theorem prover too weak. 3698 trivial. 0 not checked. [2025-01-09 09:17:48,115 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 09:17:48,115 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [632881374] [2025-01-09 09:17:48,116 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [632881374] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 09:17:48,116 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [269250823] [2025-01-09 09:17:48,116 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:17:48,116 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 09:17:48,116 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 09:17:48,118 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:17:48,120 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:17:48,208 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 276 statements into 1 equivalence classes. [2025-01-09 09:17:48,295 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 276 of 276 statements. [2025-01-09 09:17:48,295 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:17:48,295 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:17:48,300 INFO L256 TraceCheckSpWp]: Trace formula consists of 624 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-01-09 09:17:48,311 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 09:17:48,351 INFO L134 CoverageAnalysis]: Checked inductivity of 3784 backedges. 86 proven. 0 refuted. 0 times theorem prover too weak. 3698 trivial. 0 not checked. [2025-01-09 09:17:48,351 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 09:17:48,351 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [269250823] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 09:17:48,351 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 09:17:48,352 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-01-09 09:17:48,354 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [337695689] [2025-01-09 09:17:48,354 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 09:17:48,357 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 09:17:48,358 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 09:17:48,374 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 09:17:48,374 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 09:17:48,376 INFO L87 Difference]: Start difference. First operand has 136 states, 89 states have (on average 1.4719101123595506) internal successors, (131), 90 states have internal predecessors, (131), 44 states have call successors, (44), 1 states have call predecessors, (44), 1 states have return successors, (44), 44 states have call predecessors, (44), 44 states have call successors, (44) Second operand has 2 states, 2 states have (on average 30.5) internal successors, (61), 2 states have internal predecessors, (61), 2 states have call successors, (44), 2 states have call predecessors, (44), 1 states have return successors, (44), 1 states have call predecessors, (44), 2 states have call successors, (44) [2025-01-09 09:17:48,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 09:17:48,417 INFO L93 Difference]: Finished difference Result 266 states and 477 transitions. [2025-01-09 09:17:48,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 09:17:48,419 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 30.5) internal successors, (61), 2 states have internal predecessors, (61), 2 states have call successors, (44), 2 states have call predecessors, (44), 1 states have return successors, (44), 1 states have call predecessors, (44), 2 states have call successors, (44) Word has length 276 [2025-01-09 09:17:48,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 09:17:48,426 INFO L225 Difference]: With dead ends: 266 [2025-01-09 09:17:48,426 INFO L226 Difference]: Without dead ends: 133 [2025-01-09 09:17:48,429 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 277 GetRequests, 277 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:17:48,433 INFO L435 NwaCegarLoop]: 214 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, 214 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:17:48,435 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 214 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 09:17:48,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2025-01-09 09:17:48,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 133. [2025-01-09 09:17:48,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 87 states have (on average 1.4482758620689655) internal successors, (126), 87 states have internal predecessors, (126), 44 states have call successors, (44), 1 states have call predecessors, (44), 1 states have return successors, (44), 44 states have call predecessors, (44), 44 states have call successors, (44) [2025-01-09 09:17:48,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 214 transitions. [2025-01-09 09:17:48,469 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 214 transitions. Word has length 276 [2025-01-09 09:17:48,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 09:17:48,469 INFO L471 AbstractCegarLoop]: Abstraction has 133 states and 214 transitions. [2025-01-09 09:17:48,469 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 30.5) internal successors, (61), 2 states have internal predecessors, (61), 2 states have call successors, (44), 2 states have call predecessors, (44), 1 states have return successors, (44), 1 states have call predecessors, (44), 2 states have call successors, (44) [2025-01-09 09:17:48,469 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 214 transitions. [2025-01-09 09:17:48,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 277 [2025-01-09 09:17:48,473 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 09:17:48,473 INFO L218 NwaCegarLoop]: trace histogram [44, 44, 44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:17:48,480 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:17:48,677 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:17:48,677 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 09:17:48,678 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 09:17:48,678 INFO L85 PathProgramCache]: Analyzing trace with hash -631336856, now seen corresponding path program 1 times [2025-01-09 09:17:48,678 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 09:17:48,678 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [238517397] [2025-01-09 09:17:48,678 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:17:48,678 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 09:17:48,693 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 276 statements into 1 equivalence classes. [2025-01-09 09:17:48,756 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 276 of 276 statements. [2025-01-09 09:17:48,756 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:17:48,757 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:17:49,198 INFO L134 CoverageAnalysis]: Checked inductivity of 3784 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3784 trivial. 0 not checked. [2025-01-09 09:17:49,199 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 09:17:49,199 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [238517397] [2025-01-09 09:17:49,199 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [238517397] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 09:17:49,200 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 09:17:49,200 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 09:17:49,200 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [989548874] [2025-01-09 09:17:49,200 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 09:17:49,201 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 09:17:49,202 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 09:17:49,203 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 09:17:49,203 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 09:17:49,203 INFO L87 Difference]: Start difference. First operand 133 states and 214 transitions. Second operand has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 1 states have call successors, (44), 1 states have call predecessors, (44), 1 states have return successors, (44), 1 states have call predecessors, (44), 1 states have call successors, (44) [2025-01-09 09:17:49,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 09:17:49,433 INFO L93 Difference]: Finished difference Result 423 states and 681 transitions. [2025-01-09 09:17:49,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 09:17:49,434 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 1 states have call successors, (44), 1 states have call predecessors, (44), 1 states have return successors, (44), 1 states have call predecessors, (44), 1 states have call successors, (44) Word has length 276 [2025-01-09 09:17:49,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 09:17:49,438 INFO L225 Difference]: With dead ends: 423 [2025-01-09 09:17:49,439 INFO L226 Difference]: Without dead ends: 293 [2025-01-09 09:17:49,441 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 09:17:49,442 INFO L435 NwaCegarLoop]: 249 mSDtfsCounter, 204 mSDsluCounter, 411 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 134 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 204 SdHoareTripleChecker+Valid, 660 SdHoareTripleChecker+Invalid, 152 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 134 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 09:17:49,442 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [204 Valid, 660 Invalid, 152 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [134 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 09:17:49,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 293 states. [2025-01-09 09:17:49,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 293 to 263. [2025-01-09 09:17:49,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 263 states, 172 states have (on average 1.447674418604651) internal successors, (249), 172 states have internal predecessors, (249), 88 states have call successors, (88), 2 states have call predecessors, (88), 2 states have return successors, (88), 88 states have call predecessors, (88), 88 states have call successors, (88) [2025-01-09 09:17:49,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 425 transitions. [2025-01-09 09:17:49,487 INFO L78 Accepts]: Start accepts. Automaton has 263 states and 425 transitions. Word has length 276 [2025-01-09 09:17:49,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 09:17:49,489 INFO L471 AbstractCegarLoop]: Abstraction has 263 states and 425 transitions. [2025-01-09 09:17:49,489 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 1 states have call successors, (44), 1 states have call predecessors, (44), 1 states have return successors, (44), 1 states have call predecessors, (44), 1 states have call successors, (44) [2025-01-09 09:17:49,489 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 425 transitions. [2025-01-09 09:17:49,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 278 [2025-01-09 09:17:49,493 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 09:17:49,494 INFO L218 NwaCegarLoop]: trace histogram [44, 44, 44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:17:49,494 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 09:17:49,494 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 09:17:49,494 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 09:17:49,495 INFO L85 PathProgramCache]: Analyzing trace with hash -667476199, now seen corresponding path program 1 times [2025-01-09 09:17:49,495 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 09:17:49,495 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1871940606] [2025-01-09 09:17:49,495 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:17:49,496 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 09:17:49,513 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 277 statements into 1 equivalence classes. [2025-01-09 09:17:49,551 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 277 of 277 statements. [2025-01-09 09:17:49,552 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:17:49,552 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:17:49,896 INFO L134 CoverageAnalysis]: Checked inductivity of 3784 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3784 trivial. 0 not checked. [2025-01-09 09:17:49,896 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 09:17:49,896 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1871940606] [2025-01-09 09:17:49,896 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1871940606] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 09:17:49,896 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 09:17:49,897 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 09:17:49,897 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2040945161] [2025-01-09 09:17:49,897 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 09:17:49,897 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 09:17:49,897 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 09:17:49,898 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 09:17:49,898 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 09:17:49,898 INFO L87 Difference]: Start difference. First operand 263 states and 425 transitions. Second operand has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 1 states have call successors, (44), 1 states have call predecessors, (44), 1 states have return successors, (44), 1 states have call predecessors, (44), 1 states have call successors, (44) [2025-01-09 09:17:50,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 09:17:50,364 INFO L93 Difference]: Finished difference Result 778 states and 1258 transitions. [2025-01-09 09:17:50,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 09:17:50,365 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 1 states have call successors, (44), 1 states have call predecessors, (44), 1 states have return successors, (44), 1 states have call predecessors, (44), 1 states have call successors, (44) Word has length 277 [2025-01-09 09:17:50,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 09:17:50,374 INFO L225 Difference]: With dead ends: 778 [2025-01-09 09:17:50,374 INFO L226 Difference]: Without dead ends: 518 [2025-01-09 09:17:50,376 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-01-09 09:17:50,377 INFO L435 NwaCegarLoop]: 375 mSDtfsCounter, 241 mSDsluCounter, 421 mSDsCounter, 0 mSdLazyCounter, 222 mSolverCounterSat, 89 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 241 SdHoareTripleChecker+Valid, 796 SdHoareTripleChecker+Invalid, 311 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 89 IncrementalHoareTripleChecker+Valid, 222 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 09:17:50,378 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [241 Valid, 796 Invalid, 311 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [89 Valid, 222 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 09:17:50,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 518 states. [2025-01-09 09:17:50,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 518 to 267. [2025-01-09 09:17:50,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 267 states, 176 states have (on average 1.4375) internal successors, (253), 176 states have internal predecessors, (253), 88 states have call successors, (88), 2 states have call predecessors, (88), 2 states have return successors, (88), 88 states have call predecessors, (88), 88 states have call successors, (88) [2025-01-09 09:17:50,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 267 states to 267 states and 429 transitions. [2025-01-09 09:17:50,441 INFO L78 Accepts]: Start accepts. Automaton has 267 states and 429 transitions. Word has length 277 [2025-01-09 09:17:50,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 09:17:50,442 INFO L471 AbstractCegarLoop]: Abstraction has 267 states and 429 transitions. [2025-01-09 09:17:50,442 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 1 states have call successors, (44), 1 states have call predecessors, (44), 1 states have return successors, (44), 1 states have call predecessors, (44), 1 states have call successors, (44) [2025-01-09 09:17:50,442 INFO L276 IsEmpty]: Start isEmpty. Operand 267 states and 429 transitions. [2025-01-09 09:17:50,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 279 [2025-01-09 09:17:50,445 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 09:17:50,445 INFO L218 NwaCegarLoop]: trace histogram [44, 44, 44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:17:50,445 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 09:17:50,446 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 09:17:50,446 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 09:17:50,446 INFO L85 PathProgramCache]: Analyzing trace with hash -837850576, now seen corresponding path program 1 times [2025-01-09 09:17:50,446 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 09:17:50,446 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1756760665] [2025-01-09 09:17:50,446 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:17:50,447 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 09:17:50,463 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 278 statements into 1 equivalence classes. [2025-01-09 09:17:50,562 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 278 of 278 statements. [2025-01-09 09:17:50,562 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:17:50,562 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:17:53,304 INFO L134 CoverageAnalysis]: Checked inductivity of 3784 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3784 trivial. 0 not checked. [2025-01-09 09:17:53,304 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 09:17:53,304 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1756760665] [2025-01-09 09:17:53,305 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1756760665] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 09:17:53,305 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 09:17:53,305 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-01-09 09:17:53,305 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1740326503] [2025-01-09 09:17:53,305 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 09:17:53,305 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 09:17:53,305 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 09:17:53,306 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 09:17:53,306 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2025-01-09 09:17:53,306 INFO L87 Difference]: Start difference. First operand 267 states and 429 transitions. Second operand has 9 states, 9 states have (on average 6.777777777777778) internal successors, (61), 9 states have internal predecessors, (61), 1 states have call successors, (44), 1 states have call predecessors, (44), 1 states have return successors, (44), 1 states have call predecessors, (44), 1 states have call successors, (44) [2025-01-09 09:17:54,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 09:17:54,597 INFO L93 Difference]: Finished difference Result 819 states and 1295 transitions. [2025-01-09 09:17:54,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 09:17:54,598 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.777777777777778) internal successors, (61), 9 states have internal predecessors, (61), 1 states have call successors, (44), 1 states have call predecessors, (44), 1 states have return successors, (44), 1 states have call predecessors, (44), 1 states have call successors, (44) Word has length 278 [2025-01-09 09:17:54,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 09:17:54,601 INFO L225 Difference]: With dead ends: 819 [2025-01-09 09:17:54,601 INFO L226 Difference]: Without dead ends: 555 [2025-01-09 09:17:54,602 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=58, Invalid=152, Unknown=0, NotChecked=0, Total=210 [2025-01-09 09:17:54,603 INFO L435 NwaCegarLoop]: 175 mSDtfsCounter, 438 mSDsluCounter, 795 mSDsCounter, 0 mSdLazyCounter, 742 mSolverCounterSat, 141 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 438 SdHoareTripleChecker+Valid, 970 SdHoareTripleChecker+Invalid, 883 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 141 IncrementalHoareTripleChecker+Valid, 742 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-01-09 09:17:54,603 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [438 Valid, 970 Invalid, 883 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [141 Valid, 742 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-01-09 09:17:54,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 555 states. [2025-01-09 09:17:54,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 555 to 399. [2025-01-09 09:17:54,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 399 states, 263 states have (on average 1.44106463878327) internal successors, (379), 263 states have internal predecessors, (379), 132 states have call successors, (132), 3 states have call predecessors, (132), 3 states have return successors, (132), 132 states have call predecessors, (132), 132 states have call successors, (132) [2025-01-09 09:17:54,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 399 states to 399 states and 643 transitions. [2025-01-09 09:17:54,649 INFO L78 Accepts]: Start accepts. Automaton has 399 states and 643 transitions. Word has length 278 [2025-01-09 09:17:54,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 09:17:54,650 INFO L471 AbstractCegarLoop]: Abstraction has 399 states and 643 transitions. [2025-01-09 09:17:54,650 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.777777777777778) internal successors, (61), 9 states have internal predecessors, (61), 1 states have call successors, (44), 1 states have call predecessors, (44), 1 states have return successors, (44), 1 states have call predecessors, (44), 1 states have call successors, (44) [2025-01-09 09:17:54,650 INFO L276 IsEmpty]: Start isEmpty. Operand 399 states and 643 transitions. [2025-01-09 09:17:54,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 279 [2025-01-09 09:17:54,652 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 09:17:54,652 INFO L218 NwaCegarLoop]: trace histogram [44, 44, 44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:17:54,652 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 09:17:54,653 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 09:17:54,653 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 09:17:54,653 INFO L85 PathProgramCache]: Analyzing trace with hash 1682109358, now seen corresponding path program 1 times [2025-01-09 09:17:54,653 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 09:17:54,653 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [775678735] [2025-01-09 09:17:54,653 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:17:54,653 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 09:17:54,665 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 278 statements into 1 equivalence classes. [2025-01-09 09:17:54,769 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 278 of 278 statements. [2025-01-09 09:17:54,773 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:17:54,774 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:18:03,478 INFO L134 CoverageAnalysis]: Checked inductivity of 3784 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3784 trivial. 0 not checked. [2025-01-09 09:18:03,479 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 09:18:03,479 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [775678735] [2025-01-09 09:18:03,479 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [775678735] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 09:18:03,479 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 09:18:03,479 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-01-09 09:18:03,479 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1592236656] [2025-01-09 09:18:03,480 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 09:18:03,480 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-01-09 09:18:03,480 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 09:18:03,481 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-01-09 09:18:03,481 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=152, Unknown=0, NotChecked=0, Total=182 [2025-01-09 09:18:03,481 INFO L87 Difference]: Start difference. First operand 399 states and 643 transitions. Second operand has 14 states, 14 states have (on average 4.357142857142857) internal successors, (61), 14 states have internal predecessors, (61), 1 states have call successors, (44), 1 states have call predecessors, (44), 1 states have return successors, (44), 1 states have call predecessors, (44), 1 states have call successors, (44) [2025-01-09 09:18:05,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 09:18:05,889 INFO L93 Difference]: Finished difference Result 913 states and 1422 transitions. [2025-01-09 09:18:05,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-01-09 09:18:05,890 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 4.357142857142857) internal successors, (61), 14 states have internal predecessors, (61), 1 states have call successors, (44), 1 states have call predecessors, (44), 1 states have return successors, (44), 1 states have call predecessors, (44), 1 states have call successors, (44) Word has length 278 [2025-01-09 09:18:05,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 09:18:05,897 INFO L225 Difference]: With dead ends: 913 [2025-01-09 09:18:05,898 INFO L226 Difference]: Without dead ends: 616 [2025-01-09 09:18:05,899 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 96 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=156, Invalid=494, Unknown=0, NotChecked=0, Total=650 [2025-01-09 09:18:05,901 INFO L435 NwaCegarLoop]: 191 mSDtfsCounter, 500 mSDsluCounter, 1109 mSDsCounter, 0 mSdLazyCounter, 1065 mSolverCounterSat, 146 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 500 SdHoareTripleChecker+Valid, 1300 SdHoareTripleChecker+Invalid, 1211 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 146 IncrementalHoareTripleChecker+Valid, 1065 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-01-09 09:18:05,901 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [500 Valid, 1300 Invalid, 1211 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [146 Valid, 1065 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-01-09 09:18:05,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 616 states. [2025-01-09 09:18:05,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 616 to 492. [2025-01-09 09:18:05,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 492 states, 356 states have (on average 1.4297752808988764) internal successors, (509), 356 states have internal predecessors, (509), 132 states have call successors, (132), 3 states have call predecessors, (132), 3 states have return successors, (132), 132 states have call predecessors, (132), 132 states have call successors, (132) [2025-01-09 09:18:05,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 492 states to 492 states and 773 transitions. [2025-01-09 09:18:05,952 INFO L78 Accepts]: Start accepts. Automaton has 492 states and 773 transitions. Word has length 278 [2025-01-09 09:18:05,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 09:18:05,953 INFO L471 AbstractCegarLoop]: Abstraction has 492 states and 773 transitions. [2025-01-09 09:18:05,953 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 4.357142857142857) internal successors, (61), 14 states have internal predecessors, (61), 1 states have call successors, (44), 1 states have call predecessors, (44), 1 states have return successors, (44), 1 states have call predecessors, (44), 1 states have call successors, (44) [2025-01-09 09:18:05,953 INFO L276 IsEmpty]: Start isEmpty. Operand 492 states and 773 transitions. [2025-01-09 09:18:05,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 279 [2025-01-09 09:18:05,956 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 09:18:05,956 INFO L218 NwaCegarLoop]: trace histogram [44, 44, 44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:18:05,956 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 09:18:05,956 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 09:18:05,957 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 09:18:05,957 INFO L85 PathProgramCache]: Analyzing trace with hash -1932799568, now seen corresponding path program 1 times [2025-01-09 09:18:05,957 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 09:18:05,957 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1016802398] [2025-01-09 09:18:05,957 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:18:05,957 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 09:18:05,970 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 278 statements into 1 equivalence classes. [2025-01-09 09:18:06,029 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 278 of 278 statements. [2025-01-09 09:18:06,030 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:18:06,030 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:18:07,202 INFO L134 CoverageAnalysis]: Checked inductivity of 3784 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3784 trivial. 0 not checked. [2025-01-09 09:18:07,203 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 09:18:07,203 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1016802398] [2025-01-09 09:18:07,203 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1016802398] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 09:18:07,203 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 09:18:07,204 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-01-09 09:18:07,204 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [479097628] [2025-01-09 09:18:07,204 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 09:18:07,204 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 09:18:07,204 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 09:18:07,205 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 09:18:07,205 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2025-01-09 09:18:07,205 INFO L87 Difference]: Start difference. First operand 492 states and 773 transitions. Second operand has 9 states, 9 states have (on average 6.777777777777778) internal successors, (61), 9 states have internal predecessors, (61), 1 states have call successors, (44), 1 states have call predecessors, (44), 1 states have return successors, (44), 1 states have call predecessors, (44), 1 states have call successors, (44) [2025-01-09 09:18:08,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 09:18:08,050 INFO L93 Difference]: Finished difference Result 910 states and 1418 transitions. [2025-01-09 09:18:08,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 09:18:08,051 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.777777777777778) internal successors, (61), 9 states have internal predecessors, (61), 1 states have call successors, (44), 1 states have call predecessors, (44), 1 states have return successors, (44), 1 states have call predecessors, (44), 1 states have call successors, (44) Word has length 278 [2025-01-09 09:18:08,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 09:18:08,062 INFO L225 Difference]: With dead ends: 910 [2025-01-09 09:18:08,062 INFO L226 Difference]: Without dead ends: 628 [2025-01-09 09:18:08,063 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=58, Invalid=152, Unknown=0, NotChecked=0, Total=210 [2025-01-09 09:18:08,064 INFO L435 NwaCegarLoop]: 178 mSDtfsCounter, 406 mSDsluCounter, 712 mSDsCounter, 0 mSdLazyCounter, 614 mSolverCounterSat, 141 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 406 SdHoareTripleChecker+Valid, 890 SdHoareTripleChecker+Invalid, 755 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 141 IncrementalHoareTripleChecker+Valid, 614 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-09 09:18:08,064 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [406 Valid, 890 Invalid, 755 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [141 Valid, 614 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-09 09:18:08,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 628 states. [2025-01-09 09:18:08,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 628 to 512. [2025-01-09 09:18:08,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 512 states, 376 states have (on average 1.4441489361702127) internal successors, (543), 376 states have internal predecessors, (543), 132 states have call successors, (132), 3 states have call predecessors, (132), 3 states have return successors, (132), 132 states have call predecessors, (132), 132 states have call successors, (132) [2025-01-09 09:18:08,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 512 states to 512 states and 807 transitions. [2025-01-09 09:18:08,124 INFO L78 Accepts]: Start accepts. Automaton has 512 states and 807 transitions. Word has length 278 [2025-01-09 09:18:08,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 09:18:08,124 INFO L471 AbstractCegarLoop]: Abstraction has 512 states and 807 transitions. [2025-01-09 09:18:08,125 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.777777777777778) internal successors, (61), 9 states have internal predecessors, (61), 1 states have call successors, (44), 1 states have call predecessors, (44), 1 states have return successors, (44), 1 states have call predecessors, (44), 1 states have call successors, (44) [2025-01-09 09:18:08,125 INFO L276 IsEmpty]: Start isEmpty. Operand 512 states and 807 transitions. [2025-01-09 09:18:08,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 279 [2025-01-09 09:18:08,130 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 09:18:08,130 INFO L218 NwaCegarLoop]: trace histogram [44, 44, 44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:18:08,130 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 09:18:08,131 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 09:18:08,132 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 09:18:08,132 INFO L85 PathProgramCache]: Analyzing trace with hash 411976287, now seen corresponding path program 1 times [2025-01-09 09:18:08,132 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 09:18:08,132 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1785959287] [2025-01-09 09:18:08,132 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:18:08,132 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 09:18:08,152 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 278 statements into 1 equivalence classes. [2025-01-09 09:18:08,236 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 278 of 278 statements. [2025-01-09 09:18:08,236 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:18:08,236 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:18:09,190 INFO L134 CoverageAnalysis]: Checked inductivity of 3784 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3784 trivial. 0 not checked. [2025-01-09 09:18:09,193 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 09:18:09,193 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1785959287] [2025-01-09 09:18:09,194 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1785959287] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 09:18:09,194 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 09:18:09,194 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 09:18:09,194 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2012532777] [2025-01-09 09:18:09,194 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 09:18:09,194 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 09:18:09,194 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 09:18:09,195 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 09:18:09,195 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 09:18:09,196 INFO L87 Difference]: Start difference. First operand 512 states and 807 transitions. Second operand has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 6 states have internal predecessors, (61), 1 states have call successors, (44), 1 states have call predecessors, (44), 1 states have return successors, (44), 1 states have call predecessors, (44), 1 states have call successors, (44) [2025-01-09 09:18:09,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 09:18:09,622 INFO L93 Difference]: Finished difference Result 930 states and 1451 transitions. [2025-01-09 09:18:09,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 09:18:09,623 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 6 states have internal predecessors, (61), 1 states have call successors, (44), 1 states have call predecessors, (44), 1 states have return successors, (44), 1 states have call predecessors, (44), 1 states have call successors, (44) Word has length 278 [2025-01-09 09:18:09,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 09:18:09,627 INFO L225 Difference]: With dead ends: 930 [2025-01-09 09:18:09,627 INFO L226 Difference]: Without dead ends: 620 [2025-01-09 09:18:09,628 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-01-09 09:18:09,629 INFO L435 NwaCegarLoop]: 195 mSDtfsCounter, 247 mSDsluCounter, 585 mSDsCounter, 0 mSdLazyCounter, 324 mSolverCounterSat, 133 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 247 SdHoareTripleChecker+Valid, 780 SdHoareTripleChecker+Invalid, 457 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 133 IncrementalHoareTripleChecker+Valid, 324 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 09:18:09,629 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [247 Valid, 780 Invalid, 457 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [133 Valid, 324 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 09:18:09,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 620 states. [2025-01-09 09:18:09,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 620 to 518. [2025-01-09 09:18:09,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 518 states, 382 states have (on average 1.431937172774869) internal successors, (547), 382 states have internal predecessors, (547), 132 states have call successors, (132), 3 states have call predecessors, (132), 3 states have return successors, (132), 132 states have call predecessors, (132), 132 states have call successors, (132) [2025-01-09 09:18:09,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 518 states to 518 states and 811 transitions. [2025-01-09 09:18:09,668 INFO L78 Accepts]: Start accepts. Automaton has 518 states and 811 transitions. Word has length 278 [2025-01-09 09:18:09,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 09:18:09,668 INFO L471 AbstractCegarLoop]: Abstraction has 518 states and 811 transitions. [2025-01-09 09:18:09,669 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 6 states have internal predecessors, (61), 1 states have call successors, (44), 1 states have call predecessors, (44), 1 states have return successors, (44), 1 states have call predecessors, (44), 1 states have call successors, (44) [2025-01-09 09:18:09,669 INFO L276 IsEmpty]: Start isEmpty. Operand 518 states and 811 transitions. [2025-01-09 09:18:09,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 279 [2025-01-09 09:18:09,671 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 09:18:09,671 INFO L218 NwaCegarLoop]: trace histogram [44, 44, 44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:18:09,671 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 09:18:09,672 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 09:18:09,672 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 09:18:09,672 INFO L85 PathProgramCache]: Analyzing trace with hash -1848967826, now seen corresponding path program 1 times [2025-01-09 09:18:09,672 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 09:18:09,672 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1171238306] [2025-01-09 09:18:09,672 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:18:09,672 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 09:18:09,683 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 278 statements into 1 equivalence classes. [2025-01-09 09:18:09,712 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 278 of 278 statements. [2025-01-09 09:18:09,712 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:18:09,712 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:18:10,127 INFO L134 CoverageAnalysis]: Checked inductivity of 3784 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3784 trivial. 0 not checked. [2025-01-09 09:18:10,128 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 09:18:10,128 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1171238306] [2025-01-09 09:18:10,128 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1171238306] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 09:18:10,128 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 09:18:10,128 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 09:18:10,128 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [555359448] [2025-01-09 09:18:10,129 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 09:18:10,129 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 09:18:10,130 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 09:18:10,130 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 09:18:10,132 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-01-09 09:18:10,132 INFO L87 Difference]: Start difference. First operand 518 states and 811 transitions. Second operand has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 7 states have internal predecessors, (61), 1 states have call successors, (44), 1 states have call predecessors, (44), 1 states have return successors, (44), 1 states have call predecessors, (44), 1 states have call successors, (44) [2025-01-09 09:18:10,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 09:18:10,747 INFO L93 Difference]: Finished difference Result 942 states and 1464 transitions. [2025-01-09 09:18:10,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 09:18:10,747 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 7 states have internal predecessors, (61), 1 states have call successors, (44), 1 states have call predecessors, (44), 1 states have return successors, (44), 1 states have call predecessors, (44), 1 states have call successors, (44) Word has length 278 [2025-01-09 09:18:10,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 09:18:10,751 INFO L225 Difference]: With dead ends: 942 [2025-01-09 09:18:10,752 INFO L226 Difference]: Without dead ends: 662 [2025-01-09 09:18:10,753 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2025-01-09 09:18:10,753 INFO L435 NwaCegarLoop]: 204 mSDtfsCounter, 343 mSDsluCounter, 677 mSDsCounter, 0 mSdLazyCounter, 561 mSolverCounterSat, 140 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 343 SdHoareTripleChecker+Valid, 881 SdHoareTripleChecker+Invalid, 701 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 140 IncrementalHoareTripleChecker+Valid, 561 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-09 09:18:10,753 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [343 Valid, 881 Invalid, 701 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [140 Valid, 561 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-09 09:18:10,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 662 states. [2025-01-09 09:18:10,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 662 to 520. [2025-01-09 09:18:10,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 520 states, 384 states have (on average 1.4348958333333333) internal successors, (551), 384 states have internal predecessors, (551), 132 states have call successors, (132), 3 states have call predecessors, (132), 3 states have return successors, (132), 132 states have call predecessors, (132), 132 states have call successors, (132) [2025-01-09 09:18:10,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 520 states to 520 states and 815 transitions. [2025-01-09 09:18:10,788 INFO L78 Accepts]: Start accepts. Automaton has 520 states and 815 transitions. Word has length 278 [2025-01-09 09:18:10,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 09:18:10,789 INFO L471 AbstractCegarLoop]: Abstraction has 520 states and 815 transitions. [2025-01-09 09:18:10,789 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 7 states have internal predecessors, (61), 1 states have call successors, (44), 1 states have call predecessors, (44), 1 states have return successors, (44), 1 states have call predecessors, (44), 1 states have call successors, (44) [2025-01-09 09:18:10,789 INFO L276 IsEmpty]: Start isEmpty. Operand 520 states and 815 transitions. [2025-01-09 09:18:10,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 279 [2025-01-09 09:18:10,792 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 09:18:10,792 INFO L218 NwaCegarLoop]: trace histogram [44, 44, 44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:18:10,792 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 09:18:10,792 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 09:18:10,792 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 09:18:10,793 INFO L85 PathProgramCache]: Analyzing trace with hash 670992108, now seen corresponding path program 1 times [2025-01-09 09:18:10,794 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 09:18:10,794 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2053376437] [2025-01-09 09:18:10,794 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:18:10,794 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 09:18:10,803 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 278 statements into 1 equivalence classes. [2025-01-09 09:18:10,843 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 278 of 278 statements. [2025-01-09 09:18:10,843 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:18:10,843 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:18:11,039 INFO L134 CoverageAnalysis]: Checked inductivity of 3784 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3784 trivial. 0 not checked. [2025-01-09 09:18:11,039 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 09:18:11,039 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2053376437] [2025-01-09 09:18:11,039 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2053376437] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 09:18:11,039 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 09:18:11,039 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 09:18:11,039 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [667909877] [2025-01-09 09:18:11,039 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 09:18:11,040 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 09:18:11,040 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 09:18:11,040 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 09:18:11,040 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 09:18:11,041 INFO L87 Difference]: Start difference. First operand 520 states and 815 transitions. Second operand has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 1 states have call successors, (44), 1 states have call predecessors, (44), 1 states have return successors, (44), 1 states have call predecessors, (44), 1 states have call successors, (44) [2025-01-09 09:18:11,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 09:18:11,337 INFO L93 Difference]: Finished difference Result 864 states and 1352 transitions. [2025-01-09 09:18:11,337 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 09:18:11,337 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 1 states have call successors, (44), 1 states have call predecessors, (44), 1 states have return successors, (44), 1 states have call predecessors, (44), 1 states have call successors, (44) Word has length 278 [2025-01-09 09:18:11,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 09:18:11,345 INFO L225 Difference]: With dead ends: 864 [2025-01-09 09:18:11,345 INFO L226 Difference]: Without dead ends: 518 [2025-01-09 09:18:11,346 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 09:18:11,351 INFO L435 NwaCegarLoop]: 193 mSDtfsCounter, 156 mSDsluCounter, 376 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 133 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 156 SdHoareTripleChecker+Valid, 569 SdHoareTripleChecker+Invalid, 200 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 133 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 09:18:11,351 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [156 Valid, 569 Invalid, 200 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [133 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 09:18:11,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 518 states. [2025-01-09 09:18:11,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 518 to 490. [2025-01-09 09:18:11,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 490 states, 354 states have (on average 1.4039548022598871) internal successors, (497), 354 states have internal predecessors, (497), 132 states have call successors, (132), 3 states have call predecessors, (132), 3 states have return successors, (132), 132 states have call predecessors, (132), 132 states have call successors, (132) [2025-01-09 09:18:11,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 490 states to 490 states and 761 transitions. [2025-01-09 09:18:11,433 INFO L78 Accepts]: Start accepts. Automaton has 490 states and 761 transitions. Word has length 278 [2025-01-09 09:18:11,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 09:18:11,437 INFO L471 AbstractCegarLoop]: Abstraction has 490 states and 761 transitions. [2025-01-09 09:18:11,438 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 1 states have call successors, (44), 1 states have call predecessors, (44), 1 states have return successors, (44), 1 states have call predecessors, (44), 1 states have call successors, (44) [2025-01-09 09:18:11,438 INFO L276 IsEmpty]: Start isEmpty. Operand 490 states and 761 transitions. [2025-01-09 09:18:11,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 280 [2025-01-09 09:18:11,439 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 09:18:11,439 INFO L218 NwaCegarLoop]: trace histogram [44, 44, 44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:18:11,439 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 09:18:11,439 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 09:18:11,439 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 09:18:11,440 INFO L85 PathProgramCache]: Analyzing trace with hash -124763124, now seen corresponding path program 1 times [2025-01-09 09:18:11,440 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 09:18:11,440 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2126430504] [2025-01-09 09:18:11,440 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:18:11,440 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 09:18:11,456 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 279 statements into 1 equivalence classes. [2025-01-09 09:18:11,532 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 279 of 279 statements. [2025-01-09 09:18:11,536 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:18:11,536 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:18:13,647 INFO L134 CoverageAnalysis]: Checked inductivity of 3784 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3784 trivial. 0 not checked. [2025-01-09 09:18:13,647 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 09:18:13,647 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2126430504] [2025-01-09 09:18:13,647 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2126430504] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 09:18:13,647 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 09:18:13,647 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-01-09 09:18:13,647 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1818254281] [2025-01-09 09:18:13,647 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 09:18:13,647 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 09:18:13,647 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 09:18:13,648 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 09:18:13,648 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2025-01-09 09:18:13,648 INFO L87 Difference]: Start difference. First operand 490 states and 761 transitions. Second operand has 9 states, 9 states have (on average 6.888888888888889) internal successors, (62), 9 states have internal predecessors, (62), 1 states have call successors, (44), 1 states have call predecessors, (44), 1 states have return successors, (44), 1 states have call predecessors, (44), 1 states have call successors, (44) [2025-01-09 09:18:15,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 09:18:15,288 INFO L93 Difference]: Finished difference Result 939 states and 1439 transitions. [2025-01-09 09:18:15,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-01-09 09:18:15,289 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.888888888888889) internal successors, (62), 9 states have internal predecessors, (62), 1 states have call successors, (44), 1 states have call predecessors, (44), 1 states have return successors, (44), 1 states have call predecessors, (44), 1 states have call successors, (44) Word has length 279 [2025-01-09 09:18:15,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 09:18:15,292 INFO L225 Difference]: With dead ends: 939 [2025-01-09 09:18:15,292 INFO L226 Difference]: Without dead ends: 675 [2025-01-09 09:18:15,293 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=80, Invalid=130, Unknown=0, NotChecked=0, Total=210 [2025-01-09 09:18:15,293 INFO L435 NwaCegarLoop]: 225 mSDtfsCounter, 228 mSDsluCounter, 1084 mSDsCounter, 0 mSdLazyCounter, 355 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 228 SdHoareTripleChecker+Valid, 1309 SdHoareTripleChecker+Invalid, 358 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 355 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-01-09 09:18:15,294 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [228 Valid, 1309 Invalid, 358 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 355 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-01-09 09:18:15,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 675 states. [2025-01-09 09:18:15,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 675 to 518. [2025-01-09 09:18:15,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 518 states, 380 states have (on average 1.3868421052631579) internal successors, (527), 380 states have internal predecessors, (527), 132 states have call successors, (132), 5 states have call predecessors, (132), 5 states have return successors, (132), 132 states have call predecessors, (132), 132 states have call successors, (132) [2025-01-09 09:18:15,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 518 states to 518 states and 791 transitions. [2025-01-09 09:18:15,331 INFO L78 Accepts]: Start accepts. Automaton has 518 states and 791 transitions. Word has length 279 [2025-01-09 09:18:15,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 09:18:15,331 INFO L471 AbstractCegarLoop]: Abstraction has 518 states and 791 transitions. [2025-01-09 09:18:15,331 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.888888888888889) internal successors, (62), 9 states have internal predecessors, (62), 1 states have call successors, (44), 1 states have call predecessors, (44), 1 states have return successors, (44), 1 states have call predecessors, (44), 1 states have call successors, (44) [2025-01-09 09:18:15,331 INFO L276 IsEmpty]: Start isEmpty. Operand 518 states and 791 transitions. [2025-01-09 09:18:15,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 280 [2025-01-09 09:18:15,332 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 09:18:15,333 INFO L218 NwaCegarLoop]: trace histogram [44, 44, 44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:18:15,333 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 09:18:15,333 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 09:18:15,333 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 09:18:15,333 INFO L85 PathProgramCache]: Analyzing trace with hash -959854976, now seen corresponding path program 1 times [2025-01-09 09:18:15,333 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 09:18:15,333 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [212673150] [2025-01-09 09:18:15,334 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:18:15,334 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 09:18:15,342 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 279 statements into 1 equivalence classes. [2025-01-09 09:18:15,385 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 279 of 279 statements. [2025-01-09 09:18:15,385 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:18:15,385 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:18:17,738 INFO L134 CoverageAnalysis]: Checked inductivity of 3784 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3784 trivial. 0 not checked. [2025-01-09 09:18:17,738 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 09:18:17,738 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [212673150] [2025-01-09 09:18:17,738 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [212673150] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 09:18:17,738 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 09:18:17,738 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-01-09 09:18:17,739 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1953602416] [2025-01-09 09:18:17,739 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 09:18:17,739 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-01-09 09:18:17,739 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 09:18:17,739 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-01-09 09:18:17,740 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2025-01-09 09:18:17,740 INFO L87 Difference]: Start difference. First operand 518 states and 791 transitions. Second operand has 12 states, 12 states have (on average 5.166666666666667) internal successors, (62), 12 states have internal predecessors, (62), 1 states have call successors, (44), 1 states have call predecessors, (44), 1 states have return successors, (44), 1 states have call predecessors, (44), 1 states have call successors, (44) [2025-01-09 09:18:20,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 09:18:20,323 INFO L93 Difference]: Finished difference Result 1147 states and 1725 transitions. [2025-01-09 09:18:20,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-01-09 09:18:20,324 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 5.166666666666667) internal successors, (62), 12 states have internal predecessors, (62), 1 states have call successors, (44), 1 states have call predecessors, (44), 1 states have return successors, (44), 1 states have call predecessors, (44), 1 states have call successors, (44) Word has length 279 [2025-01-09 09:18:20,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 09:18:20,328 INFO L225 Difference]: With dead ends: 1147 [2025-01-09 09:18:20,328 INFO L226 Difference]: Without dead ends: 817 [2025-01-09 09:18:20,329 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=159, Invalid=347, Unknown=0, NotChecked=0, Total=506 [2025-01-09 09:18:20,330 INFO L435 NwaCegarLoop]: 229 mSDtfsCounter, 560 mSDsluCounter, 643 mSDsCounter, 0 mSdLazyCounter, 771 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 560 SdHoareTripleChecker+Valid, 872 SdHoareTripleChecker+Invalid, 792 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 771 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-01-09 09:18:20,330 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [560 Valid, 872 Invalid, 792 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 771 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-01-09 09:18:20,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 817 states. [2025-01-09 09:18:20,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 817 to 619. [2025-01-09 09:18:20,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 619 states, 481 states have (on average 1.4054054054054055) internal successors, (676), 481 states have internal predecessors, (676), 132 states have call successors, (132), 5 states have call predecessors, (132), 5 states have return successors, (132), 132 states have call predecessors, (132), 132 states have call successors, (132) [2025-01-09 09:18:20,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 619 states to 619 states and 940 transitions. [2025-01-09 09:18:20,372 INFO L78 Accepts]: Start accepts. Automaton has 619 states and 940 transitions. Word has length 279 [2025-01-09 09:18:20,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 09:18:20,373 INFO L471 AbstractCegarLoop]: Abstraction has 619 states and 940 transitions. [2025-01-09 09:18:20,373 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 5.166666666666667) internal successors, (62), 12 states have internal predecessors, (62), 1 states have call successors, (44), 1 states have call predecessors, (44), 1 states have return successors, (44), 1 states have call predecessors, (44), 1 states have call successors, (44) [2025-01-09 09:18:20,373 INFO L276 IsEmpty]: Start isEmpty. Operand 619 states and 940 transitions. [2025-01-09 09:18:20,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 280 [2025-01-09 09:18:20,374 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 09:18:20,374 INFO L218 NwaCegarLoop]: trace histogram [44, 44, 44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:18:20,375 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-09 09:18:20,375 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 09:18:20,375 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 09:18:20,375 INFO L85 PathProgramCache]: Analyzing trace with hash -279796606, now seen corresponding path program 1 times [2025-01-09 09:18:20,375 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 09:18:20,375 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1986241417] [2025-01-09 09:18:20,376 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:18:20,376 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 09:18:20,385 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 279 statements into 1 equivalence classes. [2025-01-09 09:18:20,460 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 279 of 279 statements. [2025-01-09 09:18:20,460 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:18:20,460 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:18:26,151 INFO L134 CoverageAnalysis]: Checked inductivity of 3784 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3784 trivial. 0 not checked. [2025-01-09 09:18:26,151 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 09:18:26,152 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1986241417] [2025-01-09 09:18:26,152 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1986241417] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 09:18:26,152 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 09:18:26,152 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-01-09 09:18:26,152 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1162502322] [2025-01-09 09:18:26,152 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 09:18:26,156 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-01-09 09:18:26,157 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 09:18:26,157 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-01-09 09:18:26,157 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2025-01-09 09:18:26,157 INFO L87 Difference]: Start difference. First operand 619 states and 940 transitions. Second operand has 13 states, 13 states have (on average 4.769230769230769) internal successors, (62), 13 states have internal predecessors, (62), 1 states have call successors, (44), 1 states have call predecessors, (44), 1 states have return successors, (44), 1 states have call predecessors, (44), 1 states have call successors, (44) [2025-01-09 09:18:28,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 09:18:28,004 INFO L93 Difference]: Finished difference Result 1136 states and 1695 transitions. [2025-01-09 09:18:28,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-01-09 09:18:28,004 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 4.769230769230769) internal successors, (62), 13 states have internal predecessors, (62), 1 states have call successors, (44), 1 states have call predecessors, (44), 1 states have return successors, (44), 1 states have call predecessors, (44), 1 states have call successors, (44) Word has length 279 [2025-01-09 09:18:28,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 09:18:28,008 INFO L225 Difference]: With dead ends: 1136 [2025-01-09 09:18:28,008 INFO L226 Difference]: Without dead ends: 735 [2025-01-09 09:18:28,013 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=131, Invalid=421, Unknown=0, NotChecked=0, Total=552 [2025-01-09 09:18:28,013 INFO L435 NwaCegarLoop]: 226 mSDtfsCounter, 293 mSDsluCounter, 1308 mSDsCounter, 0 mSdLazyCounter, 1325 mSolverCounterSat, 145 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 293 SdHoareTripleChecker+Valid, 1534 SdHoareTripleChecker+Invalid, 1470 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 145 IncrementalHoareTripleChecker+Valid, 1325 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-01-09 09:18:28,013 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [293 Valid, 1534 Invalid, 1470 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [145 Valid, 1325 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-01-09 09:18:28,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 735 states. [2025-01-09 09:18:28,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 735 to 619. [2025-01-09 09:18:28,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 619 states, 481 states have (on average 1.4033264033264032) internal successors, (675), 481 states have internal predecessors, (675), 132 states have call successors, (132), 5 states have call predecessors, (132), 5 states have return successors, (132), 132 states have call predecessors, (132), 132 states have call successors, (132) [2025-01-09 09:18:28,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 619 states to 619 states and 939 transitions. [2025-01-09 09:18:28,093 INFO L78 Accepts]: Start accepts. Automaton has 619 states and 939 transitions. Word has length 279 [2025-01-09 09:18:28,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 09:18:28,093 INFO L471 AbstractCegarLoop]: Abstraction has 619 states and 939 transitions. [2025-01-09 09:18:28,093 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 4.769230769230769) internal successors, (62), 13 states have internal predecessors, (62), 1 states have call successors, (44), 1 states have call predecessors, (44), 1 states have return successors, (44), 1 states have call predecessors, (44), 1 states have call successors, (44) [2025-01-09 09:18:28,093 INFO L276 IsEmpty]: Start isEmpty. Operand 619 states and 939 transitions. [2025-01-09 09:18:28,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 281 [2025-01-09 09:18:28,098 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 09:18:28,099 INFO L218 NwaCegarLoop]: trace histogram [44, 44, 44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:18:28,099 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-09 09:18:28,099 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 09:18:28,099 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 09:18:28,099 INFO L85 PathProgramCache]: Analyzing trace with hash 516998873, now seen corresponding path program 1 times [2025-01-09 09:18:28,099 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 09:18:28,099 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [125054949] [2025-01-09 09:18:28,099 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:18:28,099 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 09:18:28,109 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 280 statements into 1 equivalence classes. [2025-01-09 09:18:28,164 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 280 of 280 statements. [2025-01-09 09:18:28,164 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:18:28,164 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:18:32,219 INFO L134 CoverageAnalysis]: Checked inductivity of 3784 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3784 trivial. 0 not checked. [2025-01-09 09:18:32,219 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 09:18:32,219 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [125054949] [2025-01-09 09:18:32,219 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [125054949] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 09:18:32,219 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 09:18:32,219 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-01-09 09:18:32,219 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [611892193] [2025-01-09 09:18:32,219 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 09:18:32,219 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-01-09 09:18:32,219 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 09:18:32,220 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-01-09 09:18:32,220 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2025-01-09 09:18:32,220 INFO L87 Difference]: Start difference. First operand 619 states and 939 transitions. Second operand has 14 states, 14 states have (on average 4.5) internal successors, (63), 14 states have internal predecessors, (63), 1 states have call successors, (44), 1 states have call predecessors, (44), 1 states have return successors, (44), 1 states have call predecessors, (44), 1 states have call successors, (44) [2025-01-09 09:18:35,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 09:18:35,198 INFO L93 Difference]: Finished difference Result 1137 states and 1713 transitions. [2025-01-09 09:18:35,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-01-09 09:18:35,199 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 4.5) internal successors, (63), 14 states have internal predecessors, (63), 1 states have call successors, (44), 1 states have call predecessors, (44), 1 states have return successors, (44), 1 states have call predecessors, (44), 1 states have call successors, (44) Word has length 280 [2025-01-09 09:18:35,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 09:18:35,206 INFO L225 Difference]: With dead ends: 1137 [2025-01-09 09:18:35,207 INFO L226 Difference]: Without dead ends: 787 [2025-01-09 09:18:35,208 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=138, Invalid=462, Unknown=0, NotChecked=0, Total=600 [2025-01-09 09:18:35,212 INFO L435 NwaCegarLoop]: 182 mSDtfsCounter, 404 mSDsluCounter, 1221 mSDsCounter, 0 mSdLazyCounter, 1260 mSolverCounterSat, 135 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 404 SdHoareTripleChecker+Valid, 1403 SdHoareTripleChecker+Invalid, 1395 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 135 IncrementalHoareTripleChecker+Valid, 1260 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2025-01-09 09:18:35,212 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [404 Valid, 1403 Invalid, 1395 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [135 Valid, 1260 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2025-01-09 09:18:35,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 787 states. [2025-01-09 09:18:35,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 787 to 617. [2025-01-09 09:18:35,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 617 states, 479 states have (on average 1.4050104384133613) internal successors, (673), 479 states have internal predecessors, (673), 132 states have call successors, (132), 5 states have call predecessors, (132), 5 states have return successors, (132), 132 states have call predecessors, (132), 132 states have call successors, (132) [2025-01-09 09:18:35,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 617 states to 617 states and 937 transitions. [2025-01-09 09:18:35,259 INFO L78 Accepts]: Start accepts. Automaton has 617 states and 937 transitions. Word has length 280 [2025-01-09 09:18:35,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 09:18:35,261 INFO L471 AbstractCegarLoop]: Abstraction has 617 states and 937 transitions. [2025-01-09 09:18:35,261 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 4.5) internal successors, (63), 14 states have internal predecessors, (63), 1 states have call successors, (44), 1 states have call predecessors, (44), 1 states have return successors, (44), 1 states have call predecessors, (44), 1 states have call successors, (44) [2025-01-09 09:18:35,261 INFO L276 IsEmpty]: Start isEmpty. Operand 617 states and 937 transitions. [2025-01-09 09:18:35,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 281 [2025-01-09 09:18:35,262 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 09:18:35,263 INFO L218 NwaCegarLoop]: trace histogram [44, 44, 44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:18:35,263 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-09 09:18:35,263 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 09:18:35,263 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 09:18:35,263 INFO L85 PathProgramCache]: Analyzing trace with hash -707836019, now seen corresponding path program 1 times [2025-01-09 09:18:35,264 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 09:18:35,264 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1716058059] [2025-01-09 09:18:35,264 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:18:35,264 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 09:18:35,277 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 280 statements into 1 equivalence classes. [2025-01-09 09:18:35,327 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 280 of 280 statements. [2025-01-09 09:18:35,327 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:18:35,327 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:18:40,530 INFO L134 CoverageAnalysis]: Checked inductivity of 3784 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3784 trivial. 0 not checked. [2025-01-09 09:18:40,530 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 09:18:40,530 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1716058059] [2025-01-09 09:18:40,531 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1716058059] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 09:18:40,531 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 09:18:40,531 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-01-09 09:18:40,531 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [252395834] [2025-01-09 09:18:40,531 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 09:18:40,531 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-01-09 09:18:40,531 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 09:18:40,532 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-01-09 09:18:40,532 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2025-01-09 09:18:40,532 INFO L87 Difference]: Start difference. First operand 617 states and 937 transitions. Second operand has 14 states, 14 states have (on average 4.5) internal successors, (63), 14 states have internal predecessors, (63), 1 states have call successors, (44), 1 states have call predecessors, (44), 1 states have return successors, (44), 1 states have call predecessors, (44), 1 states have call successors, (44) [2025-01-09 09:18:45,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 09:18:45,145 INFO L93 Difference]: Finished difference Result 1067 states and 1610 transitions. [2025-01-09 09:18:45,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-01-09 09:18:45,145 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 4.5) internal successors, (63), 14 states have internal predecessors, (63), 1 states have call successors, (44), 1 states have call predecessors, (44), 1 states have return successors, (44), 1 states have call predecessors, (44), 1 states have call successors, (44) Word has length 280 [2025-01-09 09:18:45,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 09:18:45,149 INFO L225 Difference]: With dead ends: 1067 [2025-01-09 09:18:45,149 INFO L226 Difference]: Without dead ends: 717 [2025-01-09 09:18:45,150 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=144, Invalid=456, Unknown=0, NotChecked=0, Total=600 [2025-01-09 09:18:45,151 INFO L435 NwaCegarLoop]: 186 mSDtfsCounter, 398 mSDsluCounter, 1050 mSDsCounter, 0 mSdLazyCounter, 1013 mSolverCounterSat, 139 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 398 SdHoareTripleChecker+Valid, 1236 SdHoareTripleChecker+Invalid, 1152 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 139 IncrementalHoareTripleChecker+Valid, 1013 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2025-01-09 09:18:45,151 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [398 Valid, 1236 Invalid, 1152 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [139 Valid, 1013 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2025-01-09 09:18:45,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 717 states. [2025-01-09 09:18:45,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 717 to 617. [2025-01-09 09:18:45,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 617 states, 479 states have (on average 1.4050104384133613) internal successors, (673), 479 states have internal predecessors, (673), 132 states have call successors, (132), 5 states have call predecessors, (132), 5 states have return successors, (132), 132 states have call predecessors, (132), 132 states have call successors, (132) [2025-01-09 09:18:45,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 617 states to 617 states and 937 transitions. [2025-01-09 09:18:45,199 INFO L78 Accepts]: Start accepts. Automaton has 617 states and 937 transitions. Word has length 280 [2025-01-09 09:18:45,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 09:18:45,199 INFO L471 AbstractCegarLoop]: Abstraction has 617 states and 937 transitions. [2025-01-09 09:18:45,199 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 4.5) internal successors, (63), 14 states have internal predecessors, (63), 1 states have call successors, (44), 1 states have call predecessors, (44), 1 states have return successors, (44), 1 states have call predecessors, (44), 1 states have call successors, (44) [2025-01-09 09:18:45,200 INFO L276 IsEmpty]: Start isEmpty. Operand 617 states and 937 transitions. [2025-01-09 09:18:45,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 281 [2025-01-09 09:18:45,201 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 09:18:45,201 INFO L218 NwaCegarLoop]: trace histogram [44, 44, 44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:18:45,201 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-09 09:18:45,201 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 09:18:45,201 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 09:18:45,202 INFO L85 PathProgramCache]: Analyzing trace with hash -27777649, now seen corresponding path program 1 times [2025-01-09 09:18:45,202 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 09:18:45,202 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [24384955] [2025-01-09 09:18:45,202 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:18:45,202 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 09:18:45,215 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 280 statements into 1 equivalence classes. [2025-01-09 09:18:45,281 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 280 of 280 statements. [2025-01-09 09:18:45,282 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:18:45,282 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:18:49,758 INFO L134 CoverageAnalysis]: Checked inductivity of 3784 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3784 trivial. 0 not checked. [2025-01-09 09:18:49,758 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 09:18:49,758 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [24384955] [2025-01-09 09:18:49,758 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [24384955] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 09:18:49,758 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 09:18:49,758 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2025-01-09 09:18:49,759 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [141469927] [2025-01-09 09:18:49,759 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 09:18:49,759 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-01-09 09:18:49,759 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 09:18:49,759 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-01-09 09:18:49,760 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2025-01-09 09:18:49,760 INFO L87 Difference]: Start difference. First operand 617 states and 937 transitions. Second operand has 15 states, 15 states have (on average 4.2) internal successors, (63), 15 states have internal predecessors, (63), 1 states have call successors, (44), 1 states have call predecessors, (44), 1 states have return successors, (44), 1 states have call predecessors, (44), 1 states have call successors, (44) [2025-01-09 09:18:51,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 09:18:51,645 INFO L93 Difference]: Finished difference Result 1063 states and 1604 transitions. [2025-01-09 09:18:51,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-01-09 09:18:51,646 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 4.2) internal successors, (63), 15 states have internal predecessors, (63), 1 states have call successors, (44), 1 states have call predecessors, (44), 1 states have return successors, (44), 1 states have call predecessors, (44), 1 states have call successors, (44) Word has length 280 [2025-01-09 09:18:51,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 09:18:51,649 INFO L225 Difference]: With dead ends: 1063 [2025-01-09 09:18:51,649 INFO L226 Difference]: Without dead ends: 713 [2025-01-09 09:18:51,650 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=137, Invalid=415, Unknown=0, NotChecked=0, Total=552 [2025-01-09 09:18:51,650 INFO L435 NwaCegarLoop]: 193 mSDtfsCounter, 312 mSDsluCounter, 1156 mSDsCounter, 0 mSdLazyCounter, 1205 mSolverCounterSat, 180 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 312 SdHoareTripleChecker+Valid, 1349 SdHoareTripleChecker+Invalid, 1385 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 180 IncrementalHoareTripleChecker+Valid, 1205 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-01-09 09:18:51,651 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [312 Valid, 1349 Invalid, 1385 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [180 Valid, 1205 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-01-09 09:18:51,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 713 states. [2025-01-09 09:18:51,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 713 to 609. [2025-01-09 09:18:51,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 609 states, 471 states have (on average 1.4033970276008492) internal successors, (661), 471 states have internal predecessors, (661), 132 states have call successors, (132), 5 states have call predecessors, (132), 5 states have return successors, (132), 132 states have call predecessors, (132), 132 states have call successors, (132) [2025-01-09 09:18:51,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 609 states to 609 states and 925 transitions. [2025-01-09 09:18:51,695 INFO L78 Accepts]: Start accepts. Automaton has 609 states and 925 transitions. Word has length 280 [2025-01-09 09:18:51,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 09:18:51,695 INFO L471 AbstractCegarLoop]: Abstraction has 609 states and 925 transitions. [2025-01-09 09:18:51,695 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 4.2) internal successors, (63), 15 states have internal predecessors, (63), 1 states have call successors, (44), 1 states have call predecessors, (44), 1 states have return successors, (44), 1 states have call predecessors, (44), 1 states have call successors, (44) [2025-01-09 09:18:51,695 INFO L276 IsEmpty]: Start isEmpty. Operand 609 states and 925 transitions. [2025-01-09 09:18:51,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 282 [2025-01-09 09:18:51,696 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 09:18:51,697 INFO L218 NwaCegarLoop]: trace histogram [44, 44, 44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:18:51,697 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-01-09 09:18:51,697 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 09:18:51,697 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 09:18:51,697 INFO L85 PathProgramCache]: Analyzing trace with hash -974062010, now seen corresponding path program 1 times [2025-01-09 09:18:51,697 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 09:18:51,698 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [442093492] [2025-01-09 09:18:51,698 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:18:51,698 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 09:18:51,706 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 281 statements into 1 equivalence classes. [2025-01-09 09:18:51,805 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 281 of 281 statements. [2025-01-09 09:18:51,805 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:18:51,805 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat