./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-100_file-10.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-10.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 1a0ae75f5f463a17182a89879ce4658fe5861ec9a86c60f6d3e9ad481b43e0d3 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 09:14:24,703 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 09:14:24,762 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:14:24,770 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 09:14:24,771 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 09:14:24,793 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 09:14:24,794 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 09:14:24,794 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 09:14:24,795 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 09:14:24,795 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 09:14:24,796 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 09:14:24,796 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 09:14:24,796 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 09:14:24,796 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 09:14:24,796 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 09:14:24,797 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 09:14:24,797 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 09:14:24,797 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 09:14:24,797 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 09:14:24,797 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 09:14:24,797 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 09:14:24,797 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 09:14:24,797 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 09:14:24,798 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 09:14:24,798 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 09:14:24,798 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 09:14:24,798 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 09:14:24,798 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 09:14:24,798 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 09:14:24,798 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 09:14:24,798 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 09:14:24,798 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 09:14:24,798 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 09:14:24,799 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 09:14:24,799 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 09:14:24,799 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 09:14:24,799 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 09:14:24,799 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 09:14:24,799 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 09:14:24,799 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 09:14:24,800 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 09:14:24,800 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 09:14:24,800 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 09:14:24,800 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 09:14:24,800 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 09:14:24,800 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 09:14:24,800 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 09:14:24,800 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 09:14:24,800 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 -> 1a0ae75f5f463a17182a89879ce4658fe5861ec9a86c60f6d3e9ad481b43e0d3 [2025-01-09 09:14:25,060 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 09:14:25,069 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 09:14:25,072 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 09:14:25,073 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 09:14:25,073 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 09:14:25,074 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-10.i [2025-01-09 09:14:26,226 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/38d80c303/b3499e0056244625bb7a9462895c808a/FLAG4966dfd60 [2025-01-09 09:14:26,507 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 09:14:26,507 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-100_file-10.i [2025-01-09 09:14:26,518 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/38d80c303/b3499e0056244625bb7a9462895c808a/FLAG4966dfd60 [2025-01-09 09:14:26,801 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/38d80c303/b3499e0056244625bb7a9462895c808a [2025-01-09 09:14:26,803 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 09:14:26,804 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 09:14:26,805 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 09:14:26,805 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 09:14:26,808 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 09:14:26,808 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 09:14:26" (1/1) ... [2025-01-09 09:14:26,809 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3249ac8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:14:26, skipping insertion in model container [2025-01-09 09:14:26,809 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 09:14:26" (1/1) ... [2025-01-09 09:14:26,823 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 09:14:26,902 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-10.i[916,929] [2025-01-09 09:14:26,960 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 09:14:26,973 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 09:14:26,980 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-10.i[916,929] [2025-01-09 09:14:27,012 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 09:14:27,023 INFO L204 MainTranslator]: Completed translation [2025-01-09 09:14:27,024 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:14:27 WrapperNode [2025-01-09 09:14:27,024 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 09:14:27,025 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 09:14:27,025 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 09:14:27,025 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 09:14:27,029 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:14:27" (1/1) ... [2025-01-09 09:14:27,038 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:14:27" (1/1) ... [2025-01-09 09:14:27,068 INFO L138 Inliner]: procedures = 26, calls = 62, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 340 [2025-01-09 09:14:27,068 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 09:14:27,069 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 09:14:27,069 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 09:14:27,069 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 09:14:27,075 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:14:27" (1/1) ... [2025-01-09 09:14:27,075 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:14:27" (1/1) ... [2025-01-09 09:14:27,079 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:14:27" (1/1) ... [2025-01-09 09:14:27,093 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:14:27,093 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:14:27" (1/1) ... [2025-01-09 09:14:27,093 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:14:27" (1/1) ... [2025-01-09 09:14:27,101 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:14:27" (1/1) ... [2025-01-09 09:14:27,102 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:14:27" (1/1) ... [2025-01-09 09:14:27,105 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:14:27" (1/1) ... [2025-01-09 09:14:27,107 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:14:27" (1/1) ... [2025-01-09 09:14:27,109 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:14:27" (1/1) ... [2025-01-09 09:14:27,116 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 09:14:27,117 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 09:14:27,117 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 09:14:27,117 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 09:14:27,117 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:14:27" (1/1) ... [2025-01-09 09:14:27,122 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 09:14:27,132 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 09:14:27,143 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:14:27,148 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:14:27,164 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 09:14:27,164 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 09:14:27,164 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 09:14:27,165 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 09:14:27,165 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 09:14:27,165 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 09:14:27,227 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 09:14:27,229 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 09:14:27,706 INFO L? ?]: Removed 28 outVars from TransFormulas that were not future-live. [2025-01-09 09:14:27,706 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 09:14:27,714 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 09:14:27,715 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 09:14:27,715 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 09:14:27 BoogieIcfgContainer [2025-01-09 09:14:27,715 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 09:14:27,717 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 09:14:27,717 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 09:14:27,721 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 09:14:27,721 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 09:14:26" (1/3) ... [2025-01-09 09:14:27,722 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@299ac887 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 09:14:27, skipping insertion in model container [2025-01-09 09:14:27,722 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:14:27" (2/3) ... [2025-01-09 09:14:27,722 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@299ac887 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 09:14:27, skipping insertion in model container [2025-01-09 09:14:27,722 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 09:14:27" (3/3) ... [2025-01-09 09:14:27,723 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-100_file-10.i [2025-01-09 09:14:27,735 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 09:14:27,737 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodesize_ps-cn-100_file-10.i that has 2 procedures, 149 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 09:14:27,794 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 09:14:27,806 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;@5abd73d7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 09:14:27,806 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 09:14:27,809 INFO L276 IsEmpty]: Start isEmpty. Operand has 149 states, 97 states have (on average 1.4536082474226804) internal successors, (141), 98 states have internal predecessors, (141), 49 states have call successors, (49), 1 states have call predecessors, (49), 1 states have return successors, (49), 49 states have call predecessors, (49), 49 states have call successors, (49) [2025-01-09 09:14:27,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 310 [2025-01-09 09:14:27,825 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 09:14:27,826 INFO L218 NwaCegarLoop]: trace histogram [49, 49, 49, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:14:27,827 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 09:14:27,831 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 09:14:27,831 INFO L85 PathProgramCache]: Analyzing trace with hash -2067540749, now seen corresponding path program 1 times [2025-01-09 09:14:27,837 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 09:14:27,838 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [408525223] [2025-01-09 09:14:27,838 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:14:27,841 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 09:14:27,926 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 309 statements into 1 equivalence classes. [2025-01-09 09:14:27,947 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 309 of 309 statements. [2025-01-09 09:14:27,947 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:14:27,947 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:14:28,268 INFO L134 CoverageAnalysis]: Checked inductivity of 4704 backedges. 0 proven. 96 refuted. 0 times theorem prover too weak. 4608 trivial. 0 not checked. [2025-01-09 09:14:28,270 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 09:14:28,270 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [408525223] [2025-01-09 09:14:28,271 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [408525223] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 09:14:28,272 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1666992925] [2025-01-09 09:14:28,272 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:14:28,272 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 09:14:28,273 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 09:14:28,274 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:14:28,276 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:14:28,408 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 309 statements into 1 equivalence classes. [2025-01-09 09:14:28,513 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 309 of 309 statements. [2025-01-09 09:14:28,513 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:14:28,513 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:14:28,516 INFO L256 TraceCheckSpWp]: Trace formula consists of 685 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-01-09 09:14:28,524 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 09:14:28,562 INFO L134 CoverageAnalysis]: Checked inductivity of 4704 backedges. 96 proven. 0 refuted. 0 times theorem prover too weak. 4608 trivial. 0 not checked. [2025-01-09 09:14:28,566 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 09:14:28,567 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1666992925] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 09:14:28,567 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 09:14:28,567 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-01-09 09:14:28,569 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1408782932] [2025-01-09 09:14:28,571 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 09:14:28,575 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 09:14:28,576 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 09:14:28,590 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 09:14:28,590 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 09:14:28,592 INFO L87 Difference]: Start difference. First operand has 149 states, 97 states have (on average 1.4536082474226804) internal successors, (141), 98 states have internal predecessors, (141), 49 states have call successors, (49), 1 states have call predecessors, (49), 1 states have return successors, (49), 49 states have call predecessors, (49), 49 states have call successors, (49) Second operand has 2 states, 2 states have (on average 34.5) internal successors, (69), 2 states have internal predecessors, (69), 2 states have call successors, (49), 2 states have call predecessors, (49), 1 states have return successors, (49), 1 states have call predecessors, (49), 2 states have call successors, (49) [2025-01-09 09:14:28,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 09:14:28,627 INFO L93 Difference]: Finished difference Result 292 states and 522 transitions. [2025-01-09 09:14:28,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 09:14:28,630 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 34.5) internal successors, (69), 2 states have internal predecessors, (69), 2 states have call successors, (49), 2 states have call predecessors, (49), 1 states have return successors, (49), 1 states have call predecessors, (49), 2 states have call successors, (49) Word has length 309 [2025-01-09 09:14:28,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 09:14:28,635 INFO L225 Difference]: With dead ends: 292 [2025-01-09 09:14:28,635 INFO L226 Difference]: Without dead ends: 146 [2025-01-09 09:14:28,641 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 310 GetRequests, 310 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:14:28,645 INFO L435 NwaCegarLoop]: 234 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, 234 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:14:28,647 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 234 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 09:14:28,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2025-01-09 09:14:28,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 146. [2025-01-09 09:14:28,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 146 states, 95 states have (on average 1.431578947368421) internal successors, (136), 95 states have internal predecessors, (136), 49 states have call successors, (49), 1 states have call predecessors, (49), 1 states have return successors, (49), 49 states have call predecessors, (49), 49 states have call successors, (49) [2025-01-09 09:14:28,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 234 transitions. [2025-01-09 09:14:28,696 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 234 transitions. Word has length 309 [2025-01-09 09:14:28,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 09:14:28,696 INFO L471 AbstractCegarLoop]: Abstraction has 146 states and 234 transitions. [2025-01-09 09:14:28,701 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 34.5) internal successors, (69), 2 states have internal predecessors, (69), 2 states have call successors, (49), 2 states have call predecessors, (49), 1 states have return successors, (49), 1 states have call predecessors, (49), 2 states have call successors, (49) [2025-01-09 09:14:28,701 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 234 transitions. [2025-01-09 09:14:28,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 310 [2025-01-09 09:14:28,708 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 09:14:28,709 INFO L218 NwaCegarLoop]: trace histogram [49, 49, 49, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:14:28,717 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-01-09 09:14:28,909 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:14:28,910 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 09:14:28,911 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 09:14:28,911 INFO L85 PathProgramCache]: Analyzing trace with hash 843278393, now seen corresponding path program 1 times [2025-01-09 09:14:28,911 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 09:14:28,911 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1086443332] [2025-01-09 09:14:28,911 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:14:28,911 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 09:14:28,934 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 309 statements into 1 equivalence classes. [2025-01-09 09:14:29,012 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 309 of 309 statements. [2025-01-09 09:14:29,012 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:14:29,012 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:14:29,209 INFO L134 CoverageAnalysis]: Checked inductivity of 4704 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4704 trivial. 0 not checked. [2025-01-09 09:14:29,213 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 09:14:29,213 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1086443332] [2025-01-09 09:14:29,213 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1086443332] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 09:14:29,213 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 09:14:29,213 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 09:14:29,213 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [587515740] [2025-01-09 09:14:29,213 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 09:14:29,214 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 09:14:29,214 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 09:14:29,215 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 09:14:29,217 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 09:14:29,217 INFO L87 Difference]: Start difference. First operand 146 states and 234 transitions. Second operand has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 1 states have call successors, (49), 1 states have call predecessors, (49), 1 states have return successors, (49), 1 states have call predecessors, (49), 1 states have call successors, (49) [2025-01-09 09:14:29,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 09:14:29,274 INFO L93 Difference]: Finished difference Result 390 states and 625 transitions. [2025-01-09 09:14:29,274 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 09:14:29,275 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 1 states have call successors, (49), 1 states have call predecessors, (49), 1 states have return successors, (49), 1 states have call predecessors, (49), 1 states have call successors, (49) Word has length 309 [2025-01-09 09:14:29,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 09:14:29,277 INFO L225 Difference]: With dead ends: 390 [2025-01-09 09:14:29,280 INFO L226 Difference]: Without dead ends: 247 [2025-01-09 09:14:29,281 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 09:14:29,282 INFO L435 NwaCegarLoop]: 313 mSDtfsCounter, 160 mSDsluCounter, 221 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 160 SdHoareTripleChecker+Valid, 534 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 09:14:29,283 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [160 Valid, 534 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 09:14:29,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247 states. [2025-01-09 09:14:29,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247 to 244. [2025-01-09 09:14:29,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 244 states, 166 states have (on average 1.4518072289156627) internal successors, (241), 167 states have internal predecessors, (241), 75 states have call successors, (75), 2 states have call predecessors, (75), 2 states have return successors, (75), 74 states have call predecessors, (75), 75 states have call successors, (75) [2025-01-09 09:14:29,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 244 states to 244 states and 391 transitions. [2025-01-09 09:14:29,318 INFO L78 Accepts]: Start accepts. Automaton has 244 states and 391 transitions. Word has length 309 [2025-01-09 09:14:29,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 09:14:29,321 INFO L471 AbstractCegarLoop]: Abstraction has 244 states and 391 transitions. [2025-01-09 09:14:29,321 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 1 states have call successors, (49), 1 states have call predecessors, (49), 1 states have return successors, (49), 1 states have call predecessors, (49), 1 states have call successors, (49) [2025-01-09 09:14:29,321 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states and 391 transitions. [2025-01-09 09:14:29,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 310 [2025-01-09 09:14:29,325 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 09:14:29,326 INFO L218 NwaCegarLoop]: trace histogram [49, 49, 49, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:14:29,326 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 09:14:29,326 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 09:14:29,326 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 09:14:29,327 INFO L85 PathProgramCache]: Analyzing trace with hash -2042853255, now seen corresponding path program 1 times [2025-01-09 09:14:29,328 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 09:14:29,328 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1376720183] [2025-01-09 09:14:29,328 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:14:29,328 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 09:14:29,349 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 309 statements into 1 equivalence classes. [2025-01-09 09:14:29,400 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 309 of 309 statements. [2025-01-09 09:14:29,401 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:14:29,401 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:14:29,740 INFO L134 CoverageAnalysis]: Checked inductivity of 4704 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4704 trivial. 0 not checked. [2025-01-09 09:14:29,741 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 09:14:29,741 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1376720183] [2025-01-09 09:14:29,741 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1376720183] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 09:14:29,742 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 09:14:29,742 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 09:14:29,742 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1228997524] [2025-01-09 09:14:29,742 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 09:14:29,742 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 09:14:29,742 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 09:14:29,743 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 09:14:29,743 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 09:14:29,744 INFO L87 Difference]: Start difference. First operand 244 states and 391 transitions. Second operand has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 1 states have call successors, (49), 1 states have call predecessors, (49), 1 states have return successors, (49), 1 states have call predecessors, (49), 1 states have call successors, (49) [2025-01-09 09:14:29,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 09:14:29,800 INFO L93 Difference]: Finished difference Result 726 states and 1167 transitions. [2025-01-09 09:14:29,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 09:14:29,801 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 1 states have call successors, (49), 1 states have call predecessors, (49), 1 states have return successors, (49), 1 states have call predecessors, (49), 1 states have call successors, (49) Word has length 309 [2025-01-09 09:14:29,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 09:14:29,809 INFO L225 Difference]: With dead ends: 726 [2025-01-09 09:14:29,809 INFO L226 Difference]: Without dead ends: 485 [2025-01-09 09:14:29,810 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 09:14:29,811 INFO L435 NwaCegarLoop]: 299 mSDtfsCounter, 141 mSDsluCounter, 223 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 141 SdHoareTripleChecker+Valid, 522 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 09:14:29,811 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [141 Valid, 522 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 09:14:29,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 485 states. [2025-01-09 09:14:29,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 485 to 481. [2025-01-09 09:14:29,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 481 states, 326 states have (on average 1.4478527607361964) internal successors, (472), 328 states have internal predecessors, (472), 150 states have call successors, (150), 4 states have call predecessors, (150), 4 states have return successors, (150), 148 states have call predecessors, (150), 150 states have call successors, (150) [2025-01-09 09:14:29,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 481 states to 481 states and 772 transitions. [2025-01-09 09:14:29,863 INFO L78 Accepts]: Start accepts. Automaton has 481 states and 772 transitions. Word has length 309 [2025-01-09 09:14:29,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 09:14:29,864 INFO L471 AbstractCegarLoop]: Abstraction has 481 states and 772 transitions. [2025-01-09 09:14:29,864 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 1 states have call successors, (49), 1 states have call predecessors, (49), 1 states have return successors, (49), 1 states have call predecessors, (49), 1 states have call successors, (49) [2025-01-09 09:14:29,864 INFO L276 IsEmpty]: Start isEmpty. Operand 481 states and 772 transitions. [2025-01-09 09:14:29,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 312 [2025-01-09 09:14:29,867 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 09:14:29,868 INFO L218 NwaCegarLoop]: trace histogram [49, 49, 49, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:14:29,868 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 09:14:29,868 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 09:14:29,869 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 09:14:29,869 INFO L85 PathProgramCache]: Analyzing trace with hash 675375145, now seen corresponding path program 1 times [2025-01-09 09:14:29,869 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 09:14:29,869 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [523093920] [2025-01-09 09:14:29,869 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:14:29,870 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 09:14:29,894 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 311 statements into 1 equivalence classes. [2025-01-09 09:14:29,932 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 311 of 311 statements. [2025-01-09 09:14:29,934 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:14:29,934 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:14:30,285 INFO L134 CoverageAnalysis]: Checked inductivity of 4704 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4704 trivial. 0 not checked. [2025-01-09 09:14:30,286 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 09:14:30,286 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [523093920] [2025-01-09 09:14:30,286 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [523093920] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 09:14:30,286 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 09:14:30,286 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 09:14:30,286 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1741194072] [2025-01-09 09:14:30,286 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 09:14:30,287 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 09:14:30,287 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 09:14:30,288 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 09:14:30,288 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 09:14:30,288 INFO L87 Difference]: Start difference. First operand 481 states and 772 transitions. Second operand has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 1 states have call successors, (49), 1 states have call predecessors, (49), 1 states have return successors, (49), 1 states have call predecessors, (49), 1 states have call successors, (49) [2025-01-09 09:14:30,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 09:14:30,612 INFO L93 Difference]: Finished difference Result 1268 states and 2040 transitions. [2025-01-09 09:14:30,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 09:14:30,613 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 1 states have call successors, (49), 1 states have call predecessors, (49), 1 states have return successors, (49), 1 states have call predecessors, (49), 1 states have call successors, (49) Word has length 311 [2025-01-09 09:14:30,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 09:14:30,618 INFO L225 Difference]: With dead ends: 1268 [2025-01-09 09:14:30,619 INFO L226 Difference]: Without dead ends: 790 [2025-01-09 09:14:30,620 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:14:30,621 INFO L435 NwaCegarLoop]: 230 mSDtfsCounter, 175 mSDsluCounter, 449 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 148 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 175 SdHoareTripleChecker+Valid, 679 SdHoareTripleChecker+Invalid, 165 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 148 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 09:14:30,621 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [175 Valid, 679 Invalid, 165 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [148 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 09:14:30,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 790 states. [2025-01-09 09:14:30,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 790 to 660. [2025-01-09 09:14:30,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 660 states, 454 states have (on average 1.4889867841409692) internal successors, (676), 456 states have internal predecessors, (676), 199 states have call successors, (199), 6 states have call predecessors, (199), 6 states have return successors, (199), 197 states have call predecessors, (199), 199 states have call successors, (199) [2025-01-09 09:14:30,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 660 states to 660 states and 1074 transitions. [2025-01-09 09:14:30,706 INFO L78 Accepts]: Start accepts. Automaton has 660 states and 1074 transitions. Word has length 311 [2025-01-09 09:14:30,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 09:14:30,706 INFO L471 AbstractCegarLoop]: Abstraction has 660 states and 1074 transitions. [2025-01-09 09:14:30,707 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 1 states have call successors, (49), 1 states have call predecessors, (49), 1 states have return successors, (49), 1 states have call predecessors, (49), 1 states have call successors, (49) [2025-01-09 09:14:30,707 INFO L276 IsEmpty]: Start isEmpty. Operand 660 states and 1074 transitions. [2025-01-09 09:14:30,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 313 [2025-01-09 09:14:30,710 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 09:14:30,710 INFO L218 NwaCegarLoop]: trace histogram [49, 49, 49, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:14:30,710 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 09:14:30,711 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 09:14:30,711 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 09:14:30,711 INFO L85 PathProgramCache]: Analyzing trace with hash 512994899, now seen corresponding path program 1 times [2025-01-09 09:14:30,711 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 09:14:30,711 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1294245760] [2025-01-09 09:14:30,711 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:14:30,712 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 09:14:30,732 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 312 statements into 1 equivalence classes. [2025-01-09 09:14:30,896 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 312 of 312 statements. [2025-01-09 09:14:30,896 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:14:30,896 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:14:38,484 INFO L134 CoverageAnalysis]: Checked inductivity of 4704 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4704 trivial. 0 not checked. [2025-01-09 09:14:38,484 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 09:14:38,484 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1294245760] [2025-01-09 09:14:38,484 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1294245760] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 09:14:38,484 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 09:14:38,484 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-01-09 09:14:38,484 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [764601729] [2025-01-09 09:14:38,484 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 09:14:38,484 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-01-09 09:14:38,485 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 09:14:38,485 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-01-09 09:14:38,485 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2025-01-09 09:14:38,486 INFO L87 Difference]: Start difference. First operand 660 states and 1074 transitions. Second operand has 14 states, 14 states have (on average 5.0) internal successors, (70), 14 states have internal predecessors, (70), 2 states have call successors, (49), 1 states have call predecessors, (49), 1 states have return successors, (49), 2 states have call predecessors, (49), 2 states have call successors, (49) [2025-01-09 09:14:39,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 09:14:39,955 INFO L93 Difference]: Finished difference Result 1518 states and 2386 transitions. [2025-01-09 09:14:39,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-01-09 09:14:39,955 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 5.0) internal successors, (70), 14 states have internal predecessors, (70), 2 states have call successors, (49), 1 states have call predecessors, (49), 1 states have return successors, (49), 2 states have call predecessors, (49), 2 states have call successors, (49) Word has length 312 [2025-01-09 09:14:39,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 09:14:39,960 INFO L225 Difference]: With dead ends: 1518 [2025-01-09 09:14:39,961 INFO L226 Difference]: Without dead ends: 1040 [2025-01-09 09:14:39,962 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=156, Invalid=444, Unknown=0, NotChecked=0, Total=600 [2025-01-09 09:14:39,963 INFO L435 NwaCegarLoop]: 203 mSDtfsCounter, 676 mSDsluCounter, 1161 mSDsCounter, 0 mSdLazyCounter, 937 mSolverCounterSat, 200 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 676 SdHoareTripleChecker+Valid, 1364 SdHoareTripleChecker+Invalid, 1137 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 200 IncrementalHoareTripleChecker+Valid, 937 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-01-09 09:14:39,963 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [676 Valid, 1364 Invalid, 1137 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [200 Valid, 937 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-01-09 09:14:39,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1040 states. [2025-01-09 09:14:40,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1040 to 740. [2025-01-09 09:14:40,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 740 states, 533 states have (on average 1.4840525328330207) internal successors, (791), 535 states have internal predecessors, (791), 199 states have call successors, (199), 7 states have call predecessors, (199), 7 states have return successors, (199), 197 states have call predecessors, (199), 199 states have call successors, (199) [2025-01-09 09:14:40,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 740 states to 740 states and 1189 transitions. [2025-01-09 09:14:40,024 INFO L78 Accepts]: Start accepts. Automaton has 740 states and 1189 transitions. Word has length 312 [2025-01-09 09:14:40,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 09:14:40,025 INFO L471 AbstractCegarLoop]: Abstraction has 740 states and 1189 transitions. [2025-01-09 09:14:40,025 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 5.0) internal successors, (70), 14 states have internal predecessors, (70), 2 states have call successors, (49), 1 states have call predecessors, (49), 1 states have return successors, (49), 2 states have call predecessors, (49), 2 states have call successors, (49) [2025-01-09 09:14:40,025 INFO L276 IsEmpty]: Start isEmpty. Operand 740 states and 1189 transitions. [2025-01-09 09:14:40,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 313 [2025-01-09 09:14:40,028 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 09:14:40,028 INFO L218 NwaCegarLoop]: trace histogram [49, 49, 49, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:14:40,028 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 09:14:40,028 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 09:14:40,028 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 09:14:40,029 INFO L85 PathProgramCache]: Analyzing trace with hash 1193053269, now seen corresponding path program 1 times [2025-01-09 09:14:40,029 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 09:14:40,029 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [190790229] [2025-01-09 09:14:40,029 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:14:40,029 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 09:14:40,046 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 312 statements into 1 equivalence classes. [2025-01-09 09:14:40,130 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 312 of 312 statements. [2025-01-09 09:14:40,130 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:14:40,130 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:14:53,681 INFO L134 CoverageAnalysis]: Checked inductivity of 4704 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4704 trivial. 0 not checked. [2025-01-09 09:14:53,681 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 09:14:53,681 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [190790229] [2025-01-09 09:14:53,682 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [190790229] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 09:14:53,682 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 09:14:53,682 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-01-09 09:14:53,682 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [753137150] [2025-01-09 09:14:53,682 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 09:14:53,682 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-01-09 09:14:53,682 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 09:14:53,683 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-01-09 09:14:53,683 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=133, Unknown=0, NotChecked=0, Total=182 [2025-01-09 09:14:53,683 INFO L87 Difference]: Start difference. First operand 740 states and 1189 transitions. Second operand has 14 states, 14 states have (on average 5.0) internal successors, (70), 14 states have internal predecessors, (70), 2 states have call successors, (49), 1 states have call predecessors, (49), 1 states have return successors, (49), 2 states have call predecessors, (49), 2 states have call successors, (49) [2025-01-09 09:14:54,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 09:14:54,851 INFO L93 Difference]: Finished difference Result 1974 states and 3098 transitions. [2025-01-09 09:14:54,851 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-01-09 09:14:54,852 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 5.0) internal successors, (70), 14 states have internal predecessors, (70), 2 states have call successors, (49), 1 states have call predecessors, (49), 1 states have return successors, (49), 2 states have call predecessors, (49), 2 states have call successors, (49) Word has length 312 [2025-01-09 09:14:54,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 09:14:54,860 INFO L225 Difference]: With dead ends: 1974 [2025-01-09 09:14:54,860 INFO L226 Difference]: Without dead ends: 1496 [2025-01-09 09:14:54,863 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=150, Invalid=402, Unknown=0, NotChecked=0, Total=552 [2025-01-09 09:14:54,864 INFO L435 NwaCegarLoop]: 236 mSDtfsCounter, 575 mSDsluCounter, 1006 mSDsCounter, 0 mSdLazyCounter, 760 mSolverCounterSat, 172 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 575 SdHoareTripleChecker+Valid, 1242 SdHoareTripleChecker+Invalid, 932 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 172 IncrementalHoareTripleChecker+Valid, 760 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-01-09 09:14:54,865 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [575 Valid, 1242 Invalid, 932 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [172 Valid, 760 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-01-09 09:14:54,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1496 states. [2025-01-09 09:14:54,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1496 to 1292. [2025-01-09 09:14:54,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1292 states, 923 states have (on average 1.4507042253521127) internal successors, (1339), 927 states have internal predecessors, (1339), 349 states have call successors, (349), 19 states have call predecessors, (349), 19 states have return successors, (349), 345 states have call predecessors, (349), 349 states have call successors, (349) [2025-01-09 09:14:54,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1292 states to 1292 states and 2037 transitions. [2025-01-09 09:14:54,952 INFO L78 Accepts]: Start accepts. Automaton has 1292 states and 2037 transitions. Word has length 312 [2025-01-09 09:14:54,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 09:14:54,958 INFO L471 AbstractCegarLoop]: Abstraction has 1292 states and 2037 transitions. [2025-01-09 09:14:54,959 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 5.0) internal successors, (70), 14 states have internal predecessors, (70), 2 states have call successors, (49), 1 states have call predecessors, (49), 1 states have return successors, (49), 2 states have call predecessors, (49), 2 states have call successors, (49) [2025-01-09 09:14:54,959 INFO L276 IsEmpty]: Start isEmpty. Operand 1292 states and 2037 transitions. [2025-01-09 09:14:54,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 313 [2025-01-09 09:14:54,961 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 09:14:54,962 INFO L218 NwaCegarLoop]: trace histogram [49, 49, 49, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:14:54,962 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 09:14:54,962 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 09:14:54,962 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 09:14:54,963 INFO L85 PathProgramCache]: Analyzing trace with hash -635130541, now seen corresponding path program 1 times [2025-01-09 09:14:54,963 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 09:14:54,963 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [300224173] [2025-01-09 09:14:54,963 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:14:54,963 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 09:14:54,980 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 312 statements into 1 equivalence classes. [2025-01-09 09:14:55,132 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 312 of 312 statements. [2025-01-09 09:14:55,133 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:14:55,133 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:15:10,171 INFO L134 CoverageAnalysis]: Checked inductivity of 4704 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4704 trivial. 0 not checked. [2025-01-09 09:15:10,171 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 09:15:10,171 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [300224173] [2025-01-09 09:15:10,171 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [300224173] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 09:15:10,171 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 09:15:10,172 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2025-01-09 09:15:10,172 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1017694947] [2025-01-09 09:15:10,172 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 09:15:10,173 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-01-09 09:15:10,173 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 09:15:10,176 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-01-09 09:15:10,176 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=191, Unknown=0, NotChecked=0, Total=240 [2025-01-09 09:15:10,176 INFO L87 Difference]: Start difference. First operand 1292 states and 2037 transitions. Second operand has 16 states, 16 states have (on average 4.375) internal successors, (70), 16 states have internal predecessors, (70), 3 states have call successors, (49), 1 states have call predecessors, (49), 1 states have return successors, (49), 3 states have call predecessors, (49), 3 states have call successors, (49) [2025-01-09 09:15:12,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 09:15:12,370 INFO L93 Difference]: Finished difference Result 2088 states and 3242 transitions. [2025-01-09 09:15:12,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-01-09 09:15:12,371 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 4.375) internal successors, (70), 16 states have internal predecessors, (70), 3 states have call successors, (49), 1 states have call predecessors, (49), 1 states have return successors, (49), 3 states have call predecessors, (49), 3 states have call successors, (49) Word has length 312 [2025-01-09 09:15:12,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 09:15:12,381 INFO L225 Difference]: With dead ends: 2088 [2025-01-09 09:15:12,381 INFO L226 Difference]: Without dead ends: 1610 [2025-01-09 09:15:12,384 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 105 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=210, Invalid=602, Unknown=0, NotChecked=0, Total=812 [2025-01-09 09:15:12,385 INFO L435 NwaCegarLoop]: 228 mSDtfsCounter, 735 mSDsluCounter, 1352 mSDsCounter, 0 mSdLazyCounter, 1408 mSolverCounterSat, 246 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 735 SdHoareTripleChecker+Valid, 1580 SdHoareTripleChecker+Invalid, 1654 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 246 IncrementalHoareTripleChecker+Valid, 1408 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-01-09 09:15:12,386 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [735 Valid, 1580 Invalid, 1654 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [246 Valid, 1408 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-01-09 09:15:12,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1610 states. [2025-01-09 09:15:12,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1610 to 1316. [2025-01-09 09:15:12,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1316 states, 946 states have (on average 1.4482029598308668) internal successors, (1370), 950 states have internal predecessors, (1370), 349 states have call successors, (349), 20 states have call predecessors, (349), 20 states have return successors, (349), 345 states have call predecessors, (349), 349 states have call successors, (349) [2025-01-09 09:15:12,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1316 states to 1316 states and 2068 transitions. [2025-01-09 09:15:12,471 INFO L78 Accepts]: Start accepts. Automaton has 1316 states and 2068 transitions. Word has length 312 [2025-01-09 09:15:12,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 09:15:12,472 INFO L471 AbstractCegarLoop]: Abstraction has 1316 states and 2068 transitions. [2025-01-09 09:15:12,472 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 4.375) internal successors, (70), 16 states have internal predecessors, (70), 3 states have call successors, (49), 1 states have call predecessors, (49), 1 states have return successors, (49), 3 states have call predecessors, (49), 3 states have call successors, (49) [2025-01-09 09:15:12,473 INFO L276 IsEmpty]: Start isEmpty. Operand 1316 states and 2068 transitions. [2025-01-09 09:15:12,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 313 [2025-01-09 09:15:12,476 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 09:15:12,476 INFO L218 NwaCegarLoop]: trace histogram [49, 49, 49, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:15:12,476 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 09:15:12,476 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 09:15:12,477 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 09:15:12,477 INFO L85 PathProgramCache]: Analyzing trace with hash -376965103, now seen corresponding path program 1 times [2025-01-09 09:15:12,477 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 09:15:12,477 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [797463081] [2025-01-09 09:15:12,477 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:15:12,477 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 09:15:12,494 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 312 statements into 1 equivalence classes. [2025-01-09 09:15:12,568 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 312 of 312 statements. [2025-01-09 09:15:12,568 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:15:12,568 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:15:26,283 INFO L134 CoverageAnalysis]: Checked inductivity of 4704 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4704 trivial. 0 not checked. [2025-01-09 09:15:26,283 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 09:15:26,283 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [797463081] [2025-01-09 09:15:26,283 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [797463081] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 09:15:26,283 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 09:15:26,283 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2025-01-09 09:15:26,284 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [94122015] [2025-01-09 09:15:26,284 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 09:15:26,284 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-01-09 09:15:26,287 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 09:15:26,287 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-01-09 09:15:26,287 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=196, Unknown=0, NotChecked=0, Total=240 [2025-01-09 09:15:26,288 INFO L87 Difference]: Start difference. First operand 1316 states and 2068 transitions. Second operand has 16 states, 16 states have (on average 4.375) internal successors, (70), 16 states have internal predecessors, (70), 2 states have call successors, (49), 1 states have call predecessors, (49), 1 states have return successors, (49), 2 states have call predecessors, (49), 2 states have call successors, (49) [2025-01-09 09:15:29,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 09:15:29,739 INFO L93 Difference]: Finished difference Result 2996 states and 4589 transitions. [2025-01-09 09:15:29,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-01-09 09:15:29,740 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 4.375) internal successors, (70), 16 states have internal predecessors, (70), 2 states have call successors, (49), 1 states have call predecessors, (49), 1 states have return successors, (49), 2 states have call predecessors, (49), 2 states have call successors, (49) Word has length 312 [2025-01-09 09:15:29,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 09:15:29,750 INFO L225 Difference]: With dead ends: 2996 [2025-01-09 09:15:29,751 INFO L226 Difference]: Without dead ends: 2518 [2025-01-09 09:15:29,753 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 99 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=189, Invalid=681, Unknown=0, NotChecked=0, Total=870 [2025-01-09 09:15:29,753 INFO L435 NwaCegarLoop]: 229 mSDtfsCounter, 582 mSDsluCounter, 1648 mSDsCounter, 0 mSdLazyCounter, 1790 mSolverCounterSat, 154 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 582 SdHoareTripleChecker+Valid, 1877 SdHoareTripleChecker+Invalid, 1944 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 154 IncrementalHoareTripleChecker+Valid, 1790 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2025-01-09 09:15:29,754 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [582 Valid, 1877 Invalid, 1944 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [154 Valid, 1790 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2025-01-09 09:15:29,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2518 states. [2025-01-09 09:15:29,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2518 to 1884. [2025-01-09 09:15:29,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1884 states, 1347 states have (on average 1.435040831477357) internal successors, (1933), 1353 states have internal predecessors, (1933), 499 states have call successors, (499), 37 states have call predecessors, (499), 37 states have return successors, (499), 493 states have call predecessors, (499), 499 states have call successors, (499) [2025-01-09 09:15:29,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1884 states to 1884 states and 2931 transitions. [2025-01-09 09:15:29,864 INFO L78 Accepts]: Start accepts. Automaton has 1884 states and 2931 transitions. Word has length 312 [2025-01-09 09:15:29,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 09:15:29,865 INFO L471 AbstractCegarLoop]: Abstraction has 1884 states and 2931 transitions. [2025-01-09 09:15:29,865 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 4.375) internal successors, (70), 16 states have internal predecessors, (70), 2 states have call successors, (49), 1 states have call predecessors, (49), 1 states have return successors, (49), 2 states have call predecessors, (49), 2 states have call successors, (49) [2025-01-09 09:15:29,865 INFO L276 IsEmpty]: Start isEmpty. Operand 1884 states and 2931 transitions. [2025-01-09 09:15:29,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 313 [2025-01-09 09:15:29,868 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 09:15:29,868 INFO L218 NwaCegarLoop]: trace histogram [49, 49, 49, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:15:29,868 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 09:15:29,868 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 09:15:29,869 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 09:15:29,869 INFO L85 PathProgramCache]: Analyzing trace with hash 171984915, now seen corresponding path program 1 times [2025-01-09 09:15:29,869 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 09:15:29,869 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [591929973] [2025-01-09 09:15:29,869 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:15:29,869 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 09:15:29,879 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 312 statements into 1 equivalence classes. [2025-01-09 09:15:29,926 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 312 of 312 statements. [2025-01-09 09:15:29,926 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:15:29,926 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:15:39,272 INFO L134 CoverageAnalysis]: Checked inductivity of 4704 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4704 trivial. 0 not checked. [2025-01-09 09:15:39,273 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 09:15:39,273 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [591929973] [2025-01-09 09:15:39,273 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [591929973] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 09:15:39,274 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 09:15:39,274 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-01-09 09:15:39,274 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1431994530] [2025-01-09 09:15:39,274 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 09:15:39,274 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-01-09 09:15:39,274 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 09:15:39,275 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-01-09 09:15:39,275 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=68, Unknown=0, NotChecked=0, Total=110 [2025-01-09 09:15:39,275 INFO L87 Difference]: Start difference. First operand 1884 states and 2931 transitions. Second operand has 11 states, 11 states have (on average 6.363636363636363) internal successors, (70), 11 states have internal predecessors, (70), 1 states have call successors, (49), 1 states have call predecessors, (49), 1 states have return successors, (49), 1 states have call predecessors, (49), 1 states have call successors, (49) [2025-01-09 09:15:39,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 09:15:39,926 INFO L93 Difference]: Finished difference Result 3692 states and 5687 transitions. [2025-01-09 09:15:39,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-09 09:15:39,927 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 6.363636363636363) internal successors, (70), 11 states have internal predecessors, (70), 1 states have call successors, (49), 1 states have call predecessors, (49), 1 states have return successors, (49), 1 states have call predecessors, (49), 1 states have call successors, (49) Word has length 312 [2025-01-09 09:15:39,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 09:15:39,936 INFO L225 Difference]: With dead ends: 3692 [2025-01-09 09:15:39,936 INFO L226 Difference]: Without dead ends: 2078 [2025-01-09 09:15:39,940 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=82, Invalid=128, Unknown=0, NotChecked=0, Total=210 [2025-01-09 09:15:39,940 INFO L435 NwaCegarLoop]: 237 mSDtfsCounter, 314 mSDsluCounter, 928 mSDsCounter, 0 mSdLazyCounter, 523 mSolverCounterSat, 161 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 314 SdHoareTripleChecker+Valid, 1165 SdHoareTripleChecker+Invalid, 684 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 161 IncrementalHoareTripleChecker+Valid, 523 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-09 09:15:39,940 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [314 Valid, 1165 Invalid, 684 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [161 Valid, 523 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-09 09:15:39,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2078 states. [2025-01-09 09:15:40,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2078 to 1900. [2025-01-09 09:15:40,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1900 states, 1363 states have (on average 1.4299339691856199) internal successors, (1949), 1369 states have internal predecessors, (1949), 499 states have call successors, (499), 37 states have call predecessors, (499), 37 states have return successors, (499), 493 states have call predecessors, (499), 499 states have call successors, (499) [2025-01-09 09:15:40,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1900 states to 1900 states and 2947 transitions. [2025-01-09 09:15:40,043 INFO L78 Accepts]: Start accepts. Automaton has 1900 states and 2947 transitions. Word has length 312 [2025-01-09 09:15:40,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 09:15:40,043 INFO L471 AbstractCegarLoop]: Abstraction has 1900 states and 2947 transitions. [2025-01-09 09:15:40,043 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.363636363636363) internal successors, (70), 11 states have internal predecessors, (70), 1 states have call successors, (49), 1 states have call predecessors, (49), 1 states have return successors, (49), 1 states have call predecessors, (49), 1 states have call successors, (49) [2025-01-09 09:15:40,043 INFO L276 IsEmpty]: Start isEmpty. Operand 1900 states and 2947 transitions. [2025-01-09 09:15:40,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 313 [2025-01-09 09:15:40,045 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 09:15:40,045 INFO L218 NwaCegarLoop]: trace histogram [49, 49, 49, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:15:40,045 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 09:15:40,045 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 09:15:40,046 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 09:15:40,046 INFO L85 PathProgramCache]: Analyzing trace with hash 1617179603, now seen corresponding path program 1 times [2025-01-09 09:15:40,046 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 09:15:40,046 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1276983630] [2025-01-09 09:15:40,046 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:15:40,046 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 09:15:40,060 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 312 statements into 1 equivalence classes. [2025-01-09 09:15:40,120 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 312 of 312 statements. [2025-01-09 09:15:40,121 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:15:40,121 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat