./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-co_file-86.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-co_file-86.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 59727828023891546cc5a25cf7f297a1b2c37fd03b88eda6114da55f7e3ce778 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 12:11:36,720 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 12:11:36,776 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-09 12:11:36,785 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 12:11:36,785 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 12:11:36,809 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 12:11:36,810 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 12:11:36,810 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 12:11:36,811 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 12:11:36,811 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 12:11:36,812 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 12:11:36,812 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 12:11:36,812 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 12:11:36,813 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 12:11:36,813 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 12:11:36,813 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 12:11:36,813 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 12:11:36,813 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 12:11:36,814 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 12:11:36,814 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 12:11:36,814 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 12:11:36,814 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 12:11:36,814 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 12:11:36,814 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 12:11:36,814 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 12:11:36,814 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 12:11:36,814 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 12:11:36,814 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 12:11:36,814 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 12:11:36,814 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 12:11:36,815 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 12:11:36,815 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 12:11:36,815 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 12:11:36,815 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 12:11:36,815 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 12:11:36,815 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 12:11:36,815 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 12:11:36,816 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 12:11:36,816 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 12:11:36,816 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 12:11:36,816 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 12:11:36,816 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 12:11:36,816 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 12:11:36,816 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 12:11:36,816 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 12:11:36,816 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 12:11:36,816 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 12:11:36,816 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 12:11:36,816 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 -> 59727828023891546cc5a25cf7f297a1b2c37fd03b88eda6114da55f7e3ce778 [2025-01-09 12:11:37,062 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 12:11:37,072 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 12:11:37,074 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 12:11:37,075 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 12:11:37,076 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 12:11:37,077 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-co_file-86.i [2025-01-09 12:11:38,318 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/089188894/7d4e904af7954679b5f1263d5ee5f596/FLAGd66baedf9 [2025-01-09 12:11:38,542 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 12:11:38,543 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-co_file-86.i [2025-01-09 12:11:38,565 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/089188894/7d4e904af7954679b5f1263d5ee5f596/FLAGd66baedf9 [2025-01-09 12:11:38,878 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/089188894/7d4e904af7954679b5f1263d5ee5f596 [2025-01-09 12:11:38,879 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 12:11:38,880 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 12:11:38,881 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 12:11:38,881 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 12:11:38,884 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 12:11:38,884 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 12:11:38" (1/1) ... [2025-01-09 12:11:38,885 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3e1515f0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:11:38, skipping insertion in model container [2025-01-09 12:11:38,885 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 12:11:38" (1/1) ... [2025-01-09 12:11:38,897 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 12:11:38,974 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_fillercodestructure_filler-ps-co_file-86.i[919,932] [2025-01-09 12:11:39,012 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 12:11:39,021 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 12:11:39,028 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_fillercodestructure_filler-ps-co_file-86.i[919,932] [2025-01-09 12:11:39,054 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 12:11:39,065 INFO L204 MainTranslator]: Completed translation [2025-01-09 12:11:39,065 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:11:39 WrapperNode [2025-01-09 12:11:39,066 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 12:11:39,067 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 12:11:39,067 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 12:11:39,067 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 12:11:39,071 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:11:39" (1/1) ... [2025-01-09 12:11:39,078 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:11:39" (1/1) ... [2025-01-09 12:11:39,106 INFO L138 Inliner]: procedures = 26, calls = 40, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 233 [2025-01-09 12:11:39,107 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 12:11:39,107 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 12:11:39,107 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 12:11:39,107 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 12:11:39,114 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:11:39" (1/1) ... [2025-01-09 12:11:39,114 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:11:39" (1/1) ... [2025-01-09 12:11:39,117 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:11:39" (1/1) ... [2025-01-09 12:11:39,130 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 12:11:39,130 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:11:39" (1/1) ... [2025-01-09 12:11:39,130 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:11:39" (1/1) ... [2025-01-09 12:11:39,136 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:11:39" (1/1) ... [2025-01-09 12:11:39,138 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:11:39" (1/1) ... [2025-01-09 12:11:39,141 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:11:39" (1/1) ... [2025-01-09 12:11:39,142 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:11:39" (1/1) ... [2025-01-09 12:11:39,143 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:11:39" (1/1) ... [2025-01-09 12:11:39,149 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 12:11:39,150 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 12:11:39,150 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 12:11:39,150 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 12:11:39,151 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:11:39" (1/1) ... [2025-01-09 12:11:39,154 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 12:11:39,167 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 12:11:39,177 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 12:11:39,182 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 12:11:39,197 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 12:11:39,197 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 12:11:39,197 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 12:11:39,197 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 12:11:39,197 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 12:11:39,197 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 12:11:39,269 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 12:11:39,274 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 12:11:39,715 INFO L? ?]: Removed 23 outVars from TransFormulas that were not future-live. [2025-01-09 12:11:39,716 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 12:11:39,727 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 12:11:39,728 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 12:11:39,728 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 12:11:39 BoogieIcfgContainer [2025-01-09 12:11:39,728 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 12:11:39,730 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 12:11:39,730 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 12:11:39,733 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 12:11:39,734 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 12:11:38" (1/3) ... [2025-01-09 12:11:39,734 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3b4c84bd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 12:11:39, skipping insertion in model container [2025-01-09 12:11:39,734 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:11:39" (2/3) ... [2025-01-09 12:11:39,734 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3b4c84bd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 12:11:39, skipping insertion in model container [2025-01-09 12:11:39,735 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 12:11:39" (3/3) ... [2025-01-09 12:11:39,736 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-ps-co_file-86.i [2025-01-09 12:11:39,747 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 12:11:39,749 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodestructure_filler-ps-co_file-86.i that has 2 procedures, 97 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 12:11:39,799 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 12:11:39,809 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;@140d2380, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 12:11:39,810 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 12:11:39,813 INFO L276 IsEmpty]: Start isEmpty. Operand has 97 states, 67 states have (on average 1.4776119402985075) internal successors, (99), 68 states have internal predecessors, (99), 27 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2025-01-09 12:11:39,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2025-01-09 12:11:39,822 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 12:11:39,823 INFO L218 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:11:39,823 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 12:11:39,828 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 12:11:39,828 INFO L85 PathProgramCache]: Analyzing trace with hash 2067938277, now seen corresponding path program 1 times [2025-01-09 12:11:39,834 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 12:11:39,834 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1628507197] [2025-01-09 12:11:39,835 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:11:39,837 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 12:11:39,912 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 175 statements into 1 equivalence classes. [2025-01-09 12:11:39,928 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 175 of 175 statements. [2025-01-09 12:11:39,928 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:11:39,928 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 12:11:40,052 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 0 proven. 52 refuted. 0 times theorem prover too weak. 1352 trivial. 0 not checked. [2025-01-09 12:11:40,053 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 12:11:40,053 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1628507197] [2025-01-09 12:11:40,053 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1628507197] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 12:11:40,053 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [595521763] [2025-01-09 12:11:40,053 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:11:40,053 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 12:11:40,053 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 12:11:40,061 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 12:11:40,062 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 12:11:40,114 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 175 statements into 1 equivalence classes. [2025-01-09 12:11:40,166 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 175 of 175 statements. [2025-01-09 12:11:40,166 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:11:40,167 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 12:11:40,169 INFO L256 TraceCheckSpWp]: Trace formula consists of 430 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-01-09 12:11:40,174 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 12:11:40,193 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 1352 trivial. 0 not checked. [2025-01-09 12:11:40,194 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 12:11:40,194 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [595521763] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 12:11:40,194 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 12:11:40,194 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-01-09 12:11:40,196 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1823088654] [2025-01-09 12:11:40,196 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 12:11:40,198 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 12:11:40,198 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 12:11:40,209 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 12:11:40,209 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 12:11:40,211 INFO L87 Difference]: Start difference. First operand has 97 states, 67 states have (on average 1.4776119402985075) internal successors, (99), 68 states have internal predecessors, (99), 27 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) Second operand has 2 states, 2 states have (on average 22.5) internal successors, (45), 2 states have internal predecessors, (45), 2 states have call successors, (27), 2 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 2 states have call successors, (27) [2025-01-09 12:11:40,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 12:11:40,228 INFO L93 Difference]: Finished difference Result 188 states and 328 transitions. [2025-01-09 12:11:40,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 12:11:40,229 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 22.5) internal successors, (45), 2 states have internal predecessors, (45), 2 states have call successors, (27), 2 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 2 states have call successors, (27) Word has length 175 [2025-01-09 12:11:40,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 12:11:40,233 INFO L225 Difference]: With dead ends: 188 [2025-01-09 12:11:40,233 INFO L226 Difference]: Without dead ends: 94 [2025-01-09 12:11:40,235 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 176 GetRequests, 176 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 12:11:40,237 INFO L435 NwaCegarLoop]: 147 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, 147 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 12:11:40,237 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 147 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 12:11:40,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2025-01-09 12:11:40,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94. [2025-01-09 12:11:40,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 65 states have (on average 1.4307692307692308) internal successors, (93), 65 states have internal predecessors, (93), 27 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2025-01-09 12:11:40,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 147 transitions. [2025-01-09 12:11:40,278 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 147 transitions. Word has length 175 [2025-01-09 12:11:40,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 12:11:40,278 INFO L471 AbstractCegarLoop]: Abstraction has 94 states and 147 transitions. [2025-01-09 12:11:40,279 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 22.5) internal successors, (45), 2 states have internal predecessors, (45), 2 states have call successors, (27), 2 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 2 states have call successors, (27) [2025-01-09 12:11:40,279 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 147 transitions. [2025-01-09 12:11:40,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2025-01-09 12:11:40,281 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 12:11:40,281 INFO L218 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:11:40,287 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-01-09 12:11:40,481 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 12:11:40,483 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 12:11:40,483 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 12:11:40,483 INFO L85 PathProgramCache]: Analyzing trace with hash 265703719, now seen corresponding path program 1 times [2025-01-09 12:11:40,484 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 12:11:40,484 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1478880202] [2025-01-09 12:11:40,484 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:11:40,484 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 12:11:40,510 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 175 statements into 1 equivalence classes. [2025-01-09 12:11:40,565 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 175 of 175 statements. [2025-01-09 12:11:40,568 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:11:40,568 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 12:11:40,825 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1404 trivial. 0 not checked. [2025-01-09 12:11:40,827 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 12:11:40,827 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1478880202] [2025-01-09 12:11:40,827 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1478880202] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 12:11:40,828 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 12:11:40,828 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 12:11:40,828 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1604803090] [2025-01-09 12:11:40,828 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 12:11:40,828 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 12:11:40,829 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 12:11:40,829 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 12:11:40,830 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 12:11:40,830 INFO L87 Difference]: Start difference. First operand 94 states and 147 transitions. Second operand has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2025-01-09 12:11:40,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 12:11:40,850 INFO L93 Difference]: Finished difference Result 186 states and 293 transitions. [2025-01-09 12:11:40,851 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 12:11:40,851 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) Word has length 175 [2025-01-09 12:11:40,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 12:11:40,852 INFO L225 Difference]: With dead ends: 186 [2025-01-09 12:11:40,852 INFO L226 Difference]: Without dead ends: 95 [2025-01-09 12:11:40,853 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 12:11:40,853 INFO L435 NwaCegarLoop]: 146 mSDtfsCounter, 0 mSDsluCounter, 140 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 286 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 12:11:40,854 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 286 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 12:11:40,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2025-01-09 12:11:40,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2025-01-09 12:11:40,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 66 states have (on average 1.4242424242424243) internal successors, (94), 66 states have internal predecessors, (94), 27 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2025-01-09 12:11:40,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 148 transitions. [2025-01-09 12:11:40,863 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 148 transitions. Word has length 175 [2025-01-09 12:11:40,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 12:11:40,866 INFO L471 AbstractCegarLoop]: Abstraction has 95 states and 148 transitions. [2025-01-09 12:11:40,866 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2025-01-09 12:11:40,866 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 148 transitions. [2025-01-09 12:11:40,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2025-01-09 12:11:40,869 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 12:11:40,869 INFO L218 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:11:40,870 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 12:11:40,870 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 12:11:40,871 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 12:11:40,871 INFO L85 PathProgramCache]: Analyzing trace with hash -1728440987, now seen corresponding path program 1 times [2025-01-09 12:11:40,871 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 12:11:40,872 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2040266493] [2025-01-09 12:11:40,872 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:11:40,872 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 12:11:40,889 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 175 statements into 1 equivalence classes. [2025-01-09 12:11:40,934 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 175 of 175 statements. [2025-01-09 12:11:40,934 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:11:40,934 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 12:11:41,180 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1404 trivial. 0 not checked. [2025-01-09 12:11:41,181 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 12:11:41,182 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2040266493] [2025-01-09 12:11:41,182 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2040266493] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 12:11:41,182 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 12:11:41,182 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 12:11:41,182 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1797948778] [2025-01-09 12:11:41,183 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 12:11:41,183 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 12:11:41,183 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 12:11:41,183 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 12:11:41,184 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 12:11:41,184 INFO L87 Difference]: Start difference. First operand 95 states and 148 transitions. Second operand has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2025-01-09 12:11:41,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 12:11:41,407 INFO L93 Difference]: Finished difference Result 280 states and 439 transitions. [2025-01-09 12:11:41,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 12:11:41,407 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) Word has length 175 [2025-01-09 12:11:41,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 12:11:41,412 INFO L225 Difference]: With dead ends: 280 [2025-01-09 12:11:41,412 INFO L226 Difference]: Without dead ends: 188 [2025-01-09 12:11:41,412 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-01-09 12:11:41,413 INFO L435 NwaCegarLoop]: 133 mSDtfsCounter, 147 mSDsluCounter, 342 mSDsCounter, 0 mSdLazyCounter, 107 mSolverCounterSat, 83 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 147 SdHoareTripleChecker+Valid, 475 SdHoareTripleChecker+Invalid, 190 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 83 IncrementalHoareTripleChecker+Valid, 107 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 12:11:41,414 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [147 Valid, 475 Invalid, 190 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [83 Valid, 107 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 12:11:41,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2025-01-09 12:11:41,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 168. [2025-01-09 12:11:41,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 168 states, 111 states have (on average 1.3963963963963963) internal successors, (155), 111 states have internal predecessors, (155), 54 states have call successors, (54), 2 states have call predecessors, (54), 2 states have return successors, (54), 54 states have call predecessors, (54), 54 states have call successors, (54) [2025-01-09 12:11:41,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 263 transitions. [2025-01-09 12:11:41,442 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 263 transitions. Word has length 175 [2025-01-09 12:11:41,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 12:11:41,442 INFO L471 AbstractCegarLoop]: Abstraction has 168 states and 263 transitions. [2025-01-09 12:11:41,442 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2025-01-09 12:11:41,443 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 263 transitions. [2025-01-09 12:11:41,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2025-01-09 12:11:41,444 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 12:11:41,444 INFO L218 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:11:41,444 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 12:11:41,445 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 12:11:41,445 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 12:11:41,445 INFO L85 PathProgramCache]: Analyzing trace with hash 1555409059, now seen corresponding path program 1 times [2025-01-09 12:11:41,445 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 12:11:41,445 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [218333298] [2025-01-09 12:11:41,445 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:11:41,446 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 12:11:41,462 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 175 statements into 1 equivalence classes. [2025-01-09 12:11:41,485 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 175 of 175 statements. [2025-01-09 12:11:41,485 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:11:41,485 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 12:11:41,663 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1404 trivial. 0 not checked. [2025-01-09 12:11:41,663 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 12:11:41,664 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [218333298] [2025-01-09 12:11:41,664 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [218333298] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 12:11:41,664 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 12:11:41,664 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 12:11:41,664 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1564379310] [2025-01-09 12:11:41,664 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 12:11:41,665 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 12:11:41,665 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 12:11:41,665 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 12:11:41,665 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 12:11:41,665 INFO L87 Difference]: Start difference. First operand 168 states and 263 transitions. Second operand has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2025-01-09 12:11:41,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 12:11:41,699 INFO L93 Difference]: Finished difference Result 378 states and 594 transitions. [2025-01-09 12:11:41,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 12:11:41,700 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) Word has length 175 [2025-01-09 12:11:41,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 12:11:41,701 INFO L225 Difference]: With dead ends: 378 [2025-01-09 12:11:41,701 INFO L226 Difference]: Without dead ends: 260 [2025-01-09 12:11:41,702 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 12:11:41,702 INFO L435 NwaCegarLoop]: 167 mSDtfsCounter, 100 mSDsluCounter, 139 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 306 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 12:11:41,705 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [100 Valid, 306 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 12:11:41,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 260 states. [2025-01-09 12:11:41,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 260 to 258. [2025-01-09 12:11:41,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 258 states, 173 states have (on average 1.4046242774566473) internal successors, (243), 173 states have internal predecessors, (243), 81 states have call successors, (81), 3 states have call predecessors, (81), 3 states have return successors, (81), 81 states have call predecessors, (81), 81 states have call successors, (81) [2025-01-09 12:11:41,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 258 states to 258 states and 405 transitions. [2025-01-09 12:11:41,739 INFO L78 Accepts]: Start accepts. Automaton has 258 states and 405 transitions. Word has length 175 [2025-01-09 12:11:41,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 12:11:41,739 INFO L471 AbstractCegarLoop]: Abstraction has 258 states and 405 transitions. [2025-01-09 12:11:41,739 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2025-01-09 12:11:41,739 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 405 transitions. [2025-01-09 12:11:41,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2025-01-09 12:11:41,743 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 12:11:41,743 INFO L218 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:11:41,743 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 12:11:41,743 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 12:11:41,744 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 12:11:41,744 INFO L85 PathProgramCache]: Analyzing trace with hash 1774263777, now seen corresponding path program 1 times [2025-01-09 12:11:41,744 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 12:11:41,744 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2138052246] [2025-01-09 12:11:41,744 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:11:41,744 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 12:11:41,753 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 175 statements into 1 equivalence classes. [2025-01-09 12:11:41,922 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 175 of 175 statements. [2025-01-09 12:11:41,922 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:11:41,923 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 12:11:49,242 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1404 trivial. 0 not checked. [2025-01-09 12:11:49,242 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 12:11:49,242 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2138052246] [2025-01-09 12:11:49,242 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2138052246] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 12:11:49,242 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 12:11:49,242 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2025-01-09 12:11:49,242 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1847481358] [2025-01-09 12:11:49,243 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 12:11:49,243 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-01-09 12:11:49,243 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 12:11:49,244 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-01-09 12:11:49,244 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=165, Unknown=0, NotChecked=0, Total=210 [2025-01-09 12:11:49,245 INFO L87 Difference]: Start difference. First operand 258 states and 405 transitions. Second operand has 15 states, 15 states have (on average 2.8666666666666667) internal successors, (43), 15 states have internal predecessors, (43), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2025-01-09 12:11:52,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 12:11:52,152 INFO L93 Difference]: Finished difference Result 431 states and 662 transitions. [2025-01-09 12:11:52,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-01-09 12:11:52,152 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.8666666666666667) internal successors, (43), 15 states have internal predecessors, (43), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) Word has length 175 [2025-01-09 12:11:52,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 12:11:52,155 INFO L225 Difference]: With dead ends: 431 [2025-01-09 12:11:52,155 INFO L226 Difference]: Without dead ends: 339 [2025-01-09 12:11:52,156 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 157 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=220, Invalid=650, Unknown=0, NotChecked=0, Total=870 [2025-01-09 12:11:52,156 INFO L435 NwaCegarLoop]: 119 mSDtfsCounter, 419 mSDsluCounter, 708 mSDsCounter, 0 mSdLazyCounter, 455 mSolverCounterSat, 113 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 419 SdHoareTripleChecker+Valid, 827 SdHoareTripleChecker+Invalid, 568 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 113 IncrementalHoareTripleChecker+Valid, 455 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-01-09 12:11:52,156 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [419 Valid, 827 Invalid, 568 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [113 Valid, 455 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-01-09 12:11:52,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 339 states. [2025-01-09 12:11:52,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 339 to 274. [2025-01-09 12:11:52,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 274 states, 189 states have (on average 1.402116402116402) internal successors, (265), 189 states have internal predecessors, (265), 81 states have call successors, (81), 3 states have call predecessors, (81), 3 states have return successors, (81), 81 states have call predecessors, (81), 81 states have call successors, (81) [2025-01-09 12:11:52,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 274 states to 274 states and 427 transitions. [2025-01-09 12:11:52,180 INFO L78 Accepts]: Start accepts. Automaton has 274 states and 427 transitions. Word has length 175 [2025-01-09 12:11:52,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 12:11:52,181 INFO L471 AbstractCegarLoop]: Abstraction has 274 states and 427 transitions. [2025-01-09 12:11:52,181 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.8666666666666667) internal successors, (43), 15 states have internal predecessors, (43), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2025-01-09 12:11:52,181 INFO L276 IsEmpty]: Start isEmpty. Operand 274 states and 427 transitions. [2025-01-09 12:11:52,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2025-01-09 12:11:52,184 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 12:11:52,184 INFO L218 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:11:52,184 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 12:11:52,185 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 12:11:52,185 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 12:11:52,186 INFO L85 PathProgramCache]: Analyzing trace with hash -1819638941, now seen corresponding path program 1 times [2025-01-09 12:11:52,186 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 12:11:52,186 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [789902825] [2025-01-09 12:11:52,186 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:11:52,186 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 12:11:52,196 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 175 statements into 1 equivalence classes. [2025-01-09 12:11:52,205 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 175 of 175 statements. [2025-01-09 12:11:52,205 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:11:52,205 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 12:11:52,247 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1404 trivial. 0 not checked. [2025-01-09 12:11:52,247 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 12:11:52,248 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [789902825] [2025-01-09 12:11:52,248 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [789902825] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 12:11:52,248 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 12:11:52,248 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 12:11:52,248 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1922418128] [2025-01-09 12:11:52,248 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 12:11:52,249 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 12:11:52,249 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 12:11:52,249 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 12:11:52,250 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 12:11:52,250 INFO L87 Difference]: Start difference. First operand 274 states and 427 transitions. Second operand has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2025-01-09 12:11:52,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 12:11:52,285 INFO L93 Difference]: Finished difference Result 548 states and 860 transitions. [2025-01-09 12:11:52,286 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 12:11:52,286 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) Word has length 175 [2025-01-09 12:11:52,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 12:11:52,288 INFO L225 Difference]: With dead ends: 548 [2025-01-09 12:11:52,289 INFO L226 Difference]: Without dead ends: 366 [2025-01-09 12:11:52,289 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 12:11:52,290 INFO L435 NwaCegarLoop]: 161 mSDtfsCounter, 139 mSDsluCounter, 132 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 139 SdHoareTripleChecker+Valid, 293 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 12:11:52,291 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [139 Valid, 293 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 12:11:52,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 366 states. [2025-01-09 12:11:52,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 366 to 364. [2025-01-09 12:11:52,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 364 states, 251 states have (on average 1.3904382470119523) internal successors, (349), 251 states have internal predecessors, (349), 108 states have call successors, (108), 4 states have call predecessors, (108), 4 states have return successors, (108), 108 states have call predecessors, (108), 108 states have call successors, (108) [2025-01-09 12:11:52,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 364 states to 364 states and 565 transitions. [2025-01-09 12:11:52,315 INFO L78 Accepts]: Start accepts. Automaton has 364 states and 565 transitions. Word has length 175 [2025-01-09 12:11:52,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 12:11:52,316 INFO L471 AbstractCegarLoop]: Abstraction has 364 states and 565 transitions. [2025-01-09 12:11:52,316 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2025-01-09 12:11:52,316 INFO L276 IsEmpty]: Start isEmpty. Operand 364 states and 565 transitions. [2025-01-09 12:11:52,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2025-01-09 12:11:52,317 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 12:11:52,317 INFO L218 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:11:52,317 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 12:11:52,317 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 12:11:52,318 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 12:11:52,318 INFO L85 PathProgramCache]: Analyzing trace with hash -778895840, now seen corresponding path program 1 times [2025-01-09 12:11:52,318 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 12:11:52,318 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [222025690] [2025-01-09 12:11:52,318 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:11:52,318 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 12:11:52,324 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 176 statements into 1 equivalence classes. [2025-01-09 12:11:52,402 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 176 of 176 statements. [2025-01-09 12:11:52,402 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:11:52,402 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 12:11:57,279 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1404 trivial. 0 not checked. [2025-01-09 12:11:57,279 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 12:11:57,279 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [222025690] [2025-01-09 12:11:57,279 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [222025690] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 12:11:57,279 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 12:11:57,279 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2025-01-09 12:11:57,279 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1142105196] [2025-01-09 12:11:57,279 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 12:11:57,279 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-01-09 12:11:57,281 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 12:11:57,282 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-01-09 12:11:57,282 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=188, Unknown=0, NotChecked=0, Total=240 [2025-01-09 12:11:57,282 INFO L87 Difference]: Start difference. First operand 364 states and 565 transitions. Second operand has 16 states, 16 states have (on average 2.75) internal successors, (44), 16 states have internal predecessors, (44), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2025-01-09 12:12:00,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 12:12:00,212 INFO L93 Difference]: Finished difference Result 441 states and 663 transitions. [2025-01-09 12:12:00,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-01-09 12:12:00,213 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.75) internal successors, (44), 16 states have internal predecessors, (44), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) Word has length 176 [2025-01-09 12:12:00,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 12:12:00,216 INFO L225 Difference]: With dead ends: 441 [2025-01-09 12:12:00,216 INFO L226 Difference]: Without dead ends: 439 [2025-01-09 12:12:00,216 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 181 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=249, Invalid=743, Unknown=0, NotChecked=0, Total=992 [2025-01-09 12:12:00,217 INFO L435 NwaCegarLoop]: 120 mSDtfsCounter, 405 mSDsluCounter, 754 mSDsCounter, 0 mSdLazyCounter, 552 mSolverCounterSat, 110 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 405 SdHoareTripleChecker+Valid, 874 SdHoareTripleChecker+Invalid, 662 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 110 IncrementalHoareTripleChecker+Valid, 552 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2025-01-09 12:12:00,217 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [405 Valid, 874 Invalid, 662 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [110 Valid, 552 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2025-01-09 12:12:00,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 439 states. [2025-01-09 12:12:00,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 439 to 365. [2025-01-09 12:12:00,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 365 states, 252 states have (on average 1.3888888888888888) internal successors, (350), 252 states have internal predecessors, (350), 108 states have call successors, (108), 4 states have call predecessors, (108), 4 states have return successors, (108), 108 states have call predecessors, (108), 108 states have call successors, (108) [2025-01-09 12:12:00,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 365 states to 365 states and 566 transitions. [2025-01-09 12:12:00,239 INFO L78 Accepts]: Start accepts. Automaton has 365 states and 566 transitions. Word has length 176 [2025-01-09 12:12:00,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 12:12:00,239 INFO L471 AbstractCegarLoop]: Abstraction has 365 states and 566 transitions. [2025-01-09 12:12:00,239 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.75) internal successors, (44), 16 states have internal predecessors, (44), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2025-01-09 12:12:00,239 INFO L276 IsEmpty]: Start isEmpty. Operand 365 states and 566 transitions. [2025-01-09 12:12:00,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2025-01-09 12:12:00,241 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 12:12:00,241 INFO L218 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:12:00,241 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 12:12:00,241 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 12:12:00,241 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 12:12:00,241 INFO L85 PathProgramCache]: Analyzing trace with hash 783954108, now seen corresponding path program 1 times [2025-01-09 12:12:00,241 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 12:12:00,242 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2057275883] [2025-01-09 12:12:00,242 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:12:00,242 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 12:12:00,248 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 176 statements into 1 equivalence classes. [2025-01-09 12:12:00,295 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 176 of 176 statements. [2025-01-09 12:12:00,295 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:12:00,295 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 12:12:04,631 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1404 trivial. 0 not checked. [2025-01-09 12:12:04,632 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 12:12:04,632 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2057275883] [2025-01-09 12:12:04,632 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2057275883] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 12:12:04,632 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 12:12:04,632 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2025-01-09 12:12:04,632 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [122029463] [2025-01-09 12:12:04,632 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 12:12:04,633 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-01-09 12:12:04,633 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 12:12:04,633 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-01-09 12:12:04,634 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=201, Unknown=0, NotChecked=0, Total=240 [2025-01-09 12:12:04,634 INFO L87 Difference]: Start difference. First operand 365 states and 566 transitions. Second operand has 16 states, 16 states have (on average 2.75) internal successors, (44), 16 states have internal predecessors, (44), 2 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 2 states have call predecessors, (27), 2 states have call successors, (27) [2025-01-09 12:12:08,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 12:12:08,897 INFO L93 Difference]: Finished difference Result 700 states and 1066 transitions. [2025-01-09 12:12:08,897 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-01-09 12:12:08,898 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.75) internal successors, (44), 16 states have internal predecessors, (44), 2 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 2 states have call predecessors, (27), 2 states have call successors, (27) Word has length 176 [2025-01-09 12:12:08,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 12:12:08,903 INFO L225 Difference]: With dead ends: 700 [2025-01-09 12:12:08,904 INFO L226 Difference]: Without dead ends: 428 [2025-01-09 12:12:08,906 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 204 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=279, Invalid=843, Unknown=0, NotChecked=0, Total=1122 [2025-01-09 12:12:08,907 INFO L435 NwaCegarLoop]: 115 mSDtfsCounter, 489 mSDsluCounter, 771 mSDsCounter, 0 mSdLazyCounter, 668 mSolverCounterSat, 117 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 489 SdHoareTripleChecker+Valid, 886 SdHoareTripleChecker+Invalid, 785 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 117 IncrementalHoareTripleChecker+Valid, 668 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-01-09 12:12:08,908 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [489 Valid, 886 Invalid, 785 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [117 Valid, 668 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-01-09 12:12:08,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 428 states. [2025-01-09 12:12:08,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 428 to 368. [2025-01-09 12:12:08,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 368 states, 255 states have (on average 1.388235294117647) internal successors, (354), 255 states have internal predecessors, (354), 108 states have call successors, (108), 4 states have call predecessors, (108), 4 states have return successors, (108), 108 states have call predecessors, (108), 108 states have call successors, (108) [2025-01-09 12:12:08,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 368 states to 368 states and 570 transitions. [2025-01-09 12:12:08,955 INFO L78 Accepts]: Start accepts. Automaton has 368 states and 570 transitions. Word has length 176 [2025-01-09 12:12:08,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 12:12:08,955 INFO L471 AbstractCegarLoop]: Abstraction has 368 states and 570 transitions. [2025-01-09 12:12:08,956 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.75) internal successors, (44), 16 states have internal predecessors, (44), 2 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 2 states have call predecessors, (27), 2 states have call successors, (27) [2025-01-09 12:12:08,956 INFO L276 IsEmpty]: Start isEmpty. Operand 368 states and 570 transitions. [2025-01-09 12:12:08,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2025-01-09 12:12:08,962 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 12:12:08,962 INFO L218 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:12:08,962 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 12:12:08,962 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 12:12:08,962 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 12:12:08,963 INFO L85 PathProgramCache]: Analyzing trace with hash -991053254, now seen corresponding path program 1 times [2025-01-09 12:12:08,963 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 12:12:08,964 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1316979271] [2025-01-09 12:12:08,964 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:12:08,964 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 12:12:08,976 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 176 statements into 1 equivalence classes. [2025-01-09 12:12:09,017 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 176 of 176 statements. [2025-01-09 12:12:09,017 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:12:09,017 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 12:12:09,153 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1404 trivial. 0 not checked. [2025-01-09 12:12:09,153 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 12:12:09,153 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1316979271] [2025-01-09 12:12:09,153 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1316979271] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 12:12:09,153 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 12:12:09,153 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 12:12:09,153 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [883405935] [2025-01-09 12:12:09,153 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 12:12:09,154 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 12:12:09,154 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 12:12:09,154 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 12:12:09,154 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 12:12:09,155 INFO L87 Difference]: Start difference. First operand 368 states and 570 transitions. Second operand has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2025-01-09 12:12:09,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 12:12:09,195 INFO L93 Difference]: Finished difference Result 654 states and 1014 transitions. [2025-01-09 12:12:09,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 12:12:09,195 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) Word has length 176 [2025-01-09 12:12:09,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 12:12:09,197 INFO L225 Difference]: With dead ends: 654 [2025-01-09 12:12:09,197 INFO L226 Difference]: Without dead ends: 379 [2025-01-09 12:12:09,198 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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 12:12:09,198 INFO L435 NwaCegarLoop]: 144 mSDtfsCounter, 6 mSDsluCounter, 130 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 274 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 12:12:09,198 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 274 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 12:12:09,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 379 states. [2025-01-09 12:12:09,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 379 to 366. [2025-01-09 12:12:09,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 366 states, 253 states have (on average 1.3715415019762847) internal successors, (347), 253 states have internal predecessors, (347), 108 states have call successors, (108), 4 states have call predecessors, (108), 4 states have return successors, (108), 108 states have call predecessors, (108), 108 states have call successors, (108) [2025-01-09 12:12:09,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 366 states to 366 states and 563 transitions. [2025-01-09 12:12:09,220 INFO L78 Accepts]: Start accepts. Automaton has 366 states and 563 transitions. Word has length 176 [2025-01-09 12:12:09,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 12:12:09,220 INFO L471 AbstractCegarLoop]: Abstraction has 366 states and 563 transitions. [2025-01-09 12:12:09,220 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2025-01-09 12:12:09,220 INFO L276 IsEmpty]: Start isEmpty. Operand 366 states and 563 transitions. [2025-01-09 12:12:09,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2025-01-09 12:12:09,222 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 12:12:09,222 INFO L218 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:12:09,222 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 12:12:09,222 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 12:12:09,222 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 12:12:09,222 INFO L85 PathProgramCache]: Analyzing trace with hash 339831385, now seen corresponding path program 1 times [2025-01-09 12:12:09,223 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 12:12:09,223 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [540825322] [2025-01-09 12:12:09,223 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:12:09,223 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 12:12:09,231 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 176 statements into 1 equivalence classes. [2025-01-09 12:12:09,271 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 176 of 176 statements. [2025-01-09 12:12:09,271 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:12:09,271 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 12:12:16,155 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1404 trivial. 0 not checked. [2025-01-09 12:12:16,155 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 12:12:16,155 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [540825322] [2025-01-09 12:12:16,155 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [540825322] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 12:12:16,155 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 12:12:16,156 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2025-01-09 12:12:16,156 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2006757171] [2025-01-09 12:12:16,156 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 12:12:16,156 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-01-09 12:12:16,156 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 12:12:16,156 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-01-09 12:12:16,157 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=158, Unknown=0, NotChecked=0, Total=210 [2025-01-09 12:12:16,157 INFO L87 Difference]: Start difference. First operand 366 states and 563 transitions. Second operand has 15 states, 15 states have (on average 2.933333333333333) internal successors, (44), 15 states have internal predecessors, (44), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2025-01-09 12:12:22,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 12:12:22,082 INFO L93 Difference]: Finished difference Result 436 states and 642 transitions. [2025-01-09 12:12:22,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-01-09 12:12:22,083 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.933333333333333) internal successors, (44), 15 states have internal predecessors, (44), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) Word has length 176 [2025-01-09 12:12:22,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 12:12:22,085 INFO L225 Difference]: With dead ends: 436 [2025-01-09 12:12:22,085 INFO L226 Difference]: Without dead ends: 434 [2025-01-09 12:12:22,085 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 172 ImplicationChecksByTransitivity, 7.8s TimeCoverageRelationStatistics Valid=262, Invalid=668, Unknown=0, NotChecked=0, Total=930 [2025-01-09 12:12:22,086 INFO L435 NwaCegarLoop]: 123 mSDtfsCounter, 277 mSDsluCounter, 758 mSDsCounter, 0 mSdLazyCounter, 410 mSolverCounterSat, 82 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 277 SdHoareTripleChecker+Valid, 881 SdHoareTripleChecker+Invalid, 492 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 82 IncrementalHoareTripleChecker+Valid, 410 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-01-09 12:12:22,086 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [277 Valid, 881 Invalid, 492 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [82 Valid, 410 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-01-09 12:12:22,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 434 states. [2025-01-09 12:12:22,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 434 to 376. [2025-01-09 12:12:22,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 376 states, 263 states have (on average 1.3688212927756653) internal successors, (360), 263 states have internal predecessors, (360), 108 states have call successors, (108), 4 states have call predecessors, (108), 4 states have return successors, (108), 108 states have call predecessors, (108), 108 states have call successors, (108) [2025-01-09 12:12:22,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 376 states to 376 states and 576 transitions. [2025-01-09 12:12:22,103 INFO L78 Accepts]: Start accepts. Automaton has 376 states and 576 transitions. Word has length 176 [2025-01-09 12:12:22,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 12:12:22,103 INFO L471 AbstractCegarLoop]: Abstraction has 376 states and 576 transitions. [2025-01-09 12:12:22,103 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.933333333333333) internal successors, (44), 15 states have internal predecessors, (44), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2025-01-09 12:12:22,103 INFO L276 IsEmpty]: Start isEmpty. Operand 376 states and 576 transitions. [2025-01-09 12:12:22,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2025-01-09 12:12:22,104 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 12:12:22,105 INFO L218 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:12:22,105 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 12:12:22,105 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 12:12:22,105 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 12:12:22,105 INFO L85 PathProgramCache]: Analyzing trace with hash 1019889755, now seen corresponding path program 1 times [2025-01-09 12:12:22,105 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 12:12:22,105 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [138565327] [2025-01-09 12:12:22,105 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:12:22,106 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 12:12:22,111 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 176 statements into 1 equivalence classes. [2025-01-09 12:12:22,137 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 176 of 176 statements. [2025-01-09 12:12:22,137 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:12:22,137 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 12:12:27,036 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1404 trivial. 0 not checked. [2025-01-09 12:12:27,036 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 12:12:27,036 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [138565327] [2025-01-09 12:12:27,036 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [138565327] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 12:12:27,036 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 12:12:27,036 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2025-01-09 12:12:27,037 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [270076853] [2025-01-09 12:12:27,037 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 12:12:27,037 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-01-09 12:12:27,037 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 12:12:27,037 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-01-09 12:12:27,037 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=169, Unknown=0, NotChecked=0, Total=240 [2025-01-09 12:12:27,037 INFO L87 Difference]: Start difference. First operand 376 states and 576 transitions. Second operand has 16 states, 16 states have (on average 2.75) internal successors, (44), 16 states have internal predecessors, (44), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2025-01-09 12:12:34,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 12:12:34,209 INFO L93 Difference]: Finished difference Result 430 states and 636 transitions. [2025-01-09 12:12:34,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-01-09 12:12:34,213 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.75) internal successors, (44), 16 states have internal predecessors, (44), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) Word has length 176 [2025-01-09 12:12:34,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 12:12:34,215 INFO L225 Difference]: With dead ends: 430 [2025-01-09 12:12:34,215 INFO L226 Difference]: Without dead ends: 428 [2025-01-09 12:12:34,216 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 174 ImplicationChecksByTransitivity, 7.5s TimeCoverageRelationStatistics Valid=290, Invalid=702, Unknown=0, NotChecked=0, Total=992 [2025-01-09 12:12:34,216 INFO L435 NwaCegarLoop]: 123 mSDtfsCounter, 267 mSDsluCounter, 819 mSDsCounter, 0 mSdLazyCounter, 544 mSolverCounterSat, 84 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 267 SdHoareTripleChecker+Valid, 942 SdHoareTripleChecker+Invalid, 628 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 84 IncrementalHoareTripleChecker+Valid, 544 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2025-01-09 12:12:34,216 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [267 Valid, 942 Invalid, 628 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [84 Valid, 544 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2025-01-09 12:12:34,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 428 states. [2025-01-09 12:12:34,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 428 to 376. [2025-01-09 12:12:34,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 376 states, 263 states have (on average 1.3688212927756653) internal successors, (360), 263 states have internal predecessors, (360), 108 states have call successors, (108), 4 states have call predecessors, (108), 4 states have return successors, (108), 108 states have call predecessors, (108), 108 states have call successors, (108) [2025-01-09 12:12:34,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 376 states to 376 states and 576 transitions. [2025-01-09 12:12:34,239 INFO L78 Accepts]: Start accepts. Automaton has 376 states and 576 transitions. Word has length 176 [2025-01-09 12:12:34,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 12:12:34,240 INFO L471 AbstractCegarLoop]: Abstraction has 376 states and 576 transitions. [2025-01-09 12:12:34,240 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.75) internal successors, (44), 16 states have internal predecessors, (44), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2025-01-09 12:12:34,240 INFO L276 IsEmpty]: Start isEmpty. Operand 376 states and 576 transitions. [2025-01-09 12:12:34,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2025-01-09 12:12:34,243 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 12:12:34,243 INFO L218 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:12:34,243 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-09 12:12:34,243 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 12:12:34,243 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 12:12:34,244 INFO L85 PathProgramCache]: Analyzing trace with hash -1413724507, now seen corresponding path program 1 times [2025-01-09 12:12:34,244 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 12:12:34,244 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [106014907] [2025-01-09 12:12:34,244 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:12:34,244 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 12:12:34,252 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 177 statements into 1 equivalence classes. [2025-01-09 12:12:34,291 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 177 of 177 statements. [2025-01-09 12:12:34,291 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:12:34,291 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 12:12:37,155 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1404 trivial. 0 not checked. [2025-01-09 12:12:37,155 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 12:12:37,155 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [106014907] [2025-01-09 12:12:37,156 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [106014907] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 12:12:37,156 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 12:12:37,156 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2025-01-09 12:12:37,156 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1247593355] [2025-01-09 12:12:37,156 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 12:12:37,156 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-01-09 12:12:37,156 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 12:12:37,157 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-01-09 12:12:37,157 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=265, Unknown=0, NotChecked=0, Total=306 [2025-01-09 12:12:37,157 INFO L87 Difference]: Start difference. First operand 376 states and 576 transitions. Second operand has 18 states, 18 states have (on average 2.5) internal successors, (45), 18 states have internal predecessors, (45), 3 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 3 states have call predecessors, (27), 3 states have call successors, (27) [2025-01-09 12:12:38,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 12:12:38,943 INFO L93 Difference]: Finished difference Result 423 states and 627 transitions. [2025-01-09 12:12:38,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-01-09 12:12:38,943 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 2.5) internal successors, (45), 18 states have internal predecessors, (45), 3 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 3 states have call predecessors, (27), 3 states have call successors, (27) Word has length 177 [2025-01-09 12:12:38,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 12:12:38,946 INFO L225 Difference]: With dead ends: 423 [2025-01-09 12:12:38,946 INFO L226 Difference]: Without dead ends: 421 [2025-01-09 12:12:38,946 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 130 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=325, Invalid=935, Unknown=0, NotChecked=0, Total=1260 [2025-01-09 12:12:38,947 INFO L435 NwaCegarLoop]: 114 mSDtfsCounter, 568 mSDsluCounter, 1014 mSDsCounter, 0 mSdLazyCounter, 1218 mSolverCounterSat, 215 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 568 SdHoareTripleChecker+Valid, 1128 SdHoareTripleChecker+Invalid, 1433 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 215 IncrementalHoareTripleChecker+Valid, 1218 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-01-09 12:12:38,947 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [568 Valid, 1128 Invalid, 1433 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [215 Valid, 1218 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-01-09 12:12:38,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 421 states. [2025-01-09 12:12:38,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 421 to 373. [2025-01-09 12:12:38,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 373 states, 260 states have (on average 1.3692307692307693) internal successors, (356), 260 states have internal predecessors, (356), 108 states have call successors, (108), 4 states have call predecessors, (108), 4 states have return successors, (108), 108 states have call predecessors, (108), 108 states have call successors, (108) [2025-01-09 12:12:38,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 373 states to 373 states and 572 transitions. [2025-01-09 12:12:38,963 INFO L78 Accepts]: Start accepts. Automaton has 373 states and 572 transitions. Word has length 177 [2025-01-09 12:12:38,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 12:12:38,963 INFO L471 AbstractCegarLoop]: Abstraction has 373 states and 572 transitions. [2025-01-09 12:12:38,963 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 2.5) internal successors, (45), 18 states have internal predecessors, (45), 3 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 3 states have call predecessors, (27), 3 states have call successors, (27) [2025-01-09 12:12:38,963 INFO L276 IsEmpty]: Start isEmpty. Operand 373 states and 572 transitions. [2025-01-09 12:12:38,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2025-01-09 12:12:38,964 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 12:12:38,964 INFO L218 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:12:38,964 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-09 12:12:38,964 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 12:12:38,965 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 12:12:38,965 INFO L85 PathProgramCache]: Analyzing trace with hash 2000187306, now seen corresponding path program 1 times [2025-01-09 12:12:38,965 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 12:12:38,965 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [948990658] [2025-01-09 12:12:38,965 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:12:38,965 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 12:12:38,970 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 177 statements into 1 equivalence classes. [2025-01-09 12:12:38,989 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 177 of 177 statements. [2025-01-09 12:12:38,990 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:12:38,990 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 12:12:43,386 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1404 trivial. 0 not checked. [2025-01-09 12:12:43,386 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 12:12:43,386 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [948990658] [2025-01-09 12:12:43,386 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [948990658] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 12:12:43,386 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 12:12:43,386 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2025-01-09 12:12:43,386 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [766227953] [2025-01-09 12:12:43,387 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 12:12:43,387 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-01-09 12:12:43,387 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 12:12:43,387 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-01-09 12:12:43,387 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=209, Unknown=0, NotChecked=0, Total=272 [2025-01-09 12:12:43,387 INFO L87 Difference]: Start difference. First operand 373 states and 572 transitions. Second operand has 17 states, 17 states have (on average 2.6470588235294117) internal successors, (45), 17 states have internal predecessors, (45), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2025-01-09 12:12:45,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 12:12:45,822 INFO L93 Difference]: Finished difference Result 431 states and 637 transitions. [2025-01-09 12:12:45,822 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-01-09 12:12:45,822 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 2.6470588235294117) internal successors, (45), 17 states have internal predecessors, (45), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) Word has length 177 [2025-01-09 12:12:45,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 12:12:45,825 INFO L225 Difference]: With dead ends: 431 [2025-01-09 12:12:45,825 INFO L226 Difference]: Without dead ends: 429 [2025-01-09 12:12:45,826 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 219 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=314, Invalid=876, Unknown=0, NotChecked=0, Total=1190 [2025-01-09 12:12:45,827 INFO L435 NwaCegarLoop]: 125 mSDtfsCounter, 372 mSDsluCounter, 683 mSDsCounter, 0 mSdLazyCounter, 475 mSolverCounterSat, 110 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 372 SdHoareTripleChecker+Valid, 808 SdHoareTripleChecker+Invalid, 585 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 110 IncrementalHoareTripleChecker+Valid, 475 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-01-09 12:12:45,827 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [372 Valid, 808 Invalid, 585 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [110 Valid, 475 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-01-09 12:12:45,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 429 states. [2025-01-09 12:12:45,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 429 to 378. [2025-01-09 12:12:45,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 378 states, 265 states have (on average 1.369811320754717) internal successors, (363), 265 states have internal predecessors, (363), 108 states have call successors, (108), 4 states have call predecessors, (108), 4 states have return successors, (108), 108 states have call predecessors, (108), 108 states have call successors, (108) [2025-01-09 12:12:45,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 378 states to 378 states and 579 transitions. [2025-01-09 12:12:45,843 INFO L78 Accepts]: Start accepts. Automaton has 378 states and 579 transitions. Word has length 177 [2025-01-09 12:12:45,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 12:12:45,843 INFO L471 AbstractCegarLoop]: Abstraction has 378 states and 579 transitions. [2025-01-09 12:12:45,843 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 2.6470588235294117) internal successors, (45), 17 states have internal predecessors, (45), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2025-01-09 12:12:45,843 INFO L276 IsEmpty]: Start isEmpty. Operand 378 states and 579 transitions. [2025-01-09 12:12:45,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2025-01-09 12:12:45,844 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 12:12:45,845 INFO L218 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:12:45,845 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-09 12:12:45,845 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 12:12:45,845 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 12:12:45,845 INFO L85 PathProgramCache]: Analyzing trace with hash -733777084, now seen corresponding path program 1 times [2025-01-09 12:12:45,845 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 12:12:45,846 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2005181446] [2025-01-09 12:12:45,846 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:12:45,846 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 12:12:45,852 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 177 statements into 1 equivalence classes. [2025-01-09 12:12:45,882 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 177 of 177 statements. [2025-01-09 12:12:45,882 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:12:45,882 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 12:12:47,844 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1404 trivial. 0 not checked. [2025-01-09 12:12:47,845 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 12:12:47,845 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2005181446] [2025-01-09 12:12:47,845 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2005181446] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 12:12:47,845 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 12:12:47,845 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2025-01-09 12:12:47,845 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1707880261] [2025-01-09 12:12:47,845 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 12:12:47,845 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-01-09 12:12:47,846 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 12:12:47,846 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-01-09 12:12:47,846 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=182, Unknown=0, NotChecked=0, Total=240 [2025-01-09 12:12:47,846 INFO L87 Difference]: Start difference. First operand 378 states and 579 transitions. Second operand has 16 states, 16 states have (on average 2.8125) internal successors, (45), 16 states have internal predecessors, (45), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2025-01-09 12:12:50,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 12:12:50,455 INFO L93 Difference]: Finished difference Result 436 states and 642 transitions. [2025-01-09 12:12:50,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-01-09 12:12:50,456 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.8125) internal successors, (45), 16 states have internal predecessors, (45), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) Word has length 177 [2025-01-09 12:12:50,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 12:12:50,458 INFO L225 Difference]: With dead ends: 436 [2025-01-09 12:12:50,458 INFO L226 Difference]: Without dead ends: 434 [2025-01-09 12:12:50,459 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 267 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=387, Invalid=1019, Unknown=0, NotChecked=0, Total=1406 [2025-01-09 12:12:50,459 INFO L435 NwaCegarLoop]: 124 mSDtfsCounter, 365 mSDsluCounter, 658 mSDsCounter, 0 mSdLazyCounter, 523 mSolverCounterSat, 111 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 365 SdHoareTripleChecker+Valid, 782 SdHoareTripleChecker+Invalid, 634 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 111 IncrementalHoareTripleChecker+Valid, 523 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-01-09 12:12:50,459 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [365 Valid, 782 Invalid, 634 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [111 Valid, 523 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-01-09 12:12:50,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 434 states. [2025-01-09 12:12:50,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 434 to 379. [2025-01-09 12:12:50,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 379 states, 266 states have (on average 1.368421052631579) internal successors, (364), 266 states have internal predecessors, (364), 108 states have call successors, (108), 4 states have call predecessors, (108), 4 states have return successors, (108), 108 states have call predecessors, (108), 108 states have call successors, (108) [2025-01-09 12:12:50,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 379 states to 379 states and 580 transitions. [2025-01-09 12:12:50,476 INFO L78 Accepts]: Start accepts. Automaton has 379 states and 580 transitions. Word has length 177 [2025-01-09 12:12:50,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 12:12:50,476 INFO L471 AbstractCegarLoop]: Abstraction has 379 states and 580 transitions. [2025-01-09 12:12:50,476 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.8125) internal successors, (45), 16 states have internal predecessors, (45), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2025-01-09 12:12:50,476 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states and 580 transitions. [2025-01-09 12:12:50,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2025-01-09 12:12:50,477 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 12:12:50,477 INFO L218 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:12:50,477 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-09 12:12:50,477 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 12:12:50,477 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 12:12:50,478 INFO L85 PathProgramCache]: Analyzing trace with hash 1607160296, now seen corresponding path program 1 times [2025-01-09 12:12:50,478 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 12:12:50,478 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [54432247] [2025-01-09 12:12:50,478 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:12:50,478 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 12:12:50,484 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 177 statements into 1 equivalence classes. [2025-01-09 12:12:50,507 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 177 of 177 statements. [2025-01-09 12:12:50,508 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:12:50,508 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 12:12:58,081 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1404 trivial. 0 not checked. [2025-01-09 12:12:58,082 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 12:12:58,082 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [54432247] [2025-01-09 12:12:58,082 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [54432247] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 12:12:58,082 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 12:12:58,082 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2025-01-09 12:12:58,082 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [734589132] [2025-01-09 12:12:58,082 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 12:12:58,083 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-01-09 12:12:58,083 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 12:12:58,083 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-01-09 12:12:58,083 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=192, Unknown=0, NotChecked=0, Total=272 [2025-01-09 12:12:58,084 INFO L87 Difference]: Start difference. First operand 379 states and 580 transitions. Second operand has 17 states, 17 states have (on average 2.6470588235294117) internal successors, (45), 17 states have internal predecessors, (45), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2025-01-09 12:13:05,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 12:13:05,386 INFO L93 Difference]: Finished difference Result 427 states and 633 transitions. [2025-01-09 12:13:05,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-01-09 12:13:05,387 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 2.6470588235294117) internal successors, (45), 17 states have internal predecessors, (45), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) Word has length 177 [2025-01-09 12:13:05,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 12:13:05,389 INFO L225 Difference]: With dead ends: 427 [2025-01-09 12:13:05,389 INFO L226 Difference]: Without dead ends: 425 [2025-01-09 12:13:05,390 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 193 ImplicationChecksByTransitivity, 8.2s TimeCoverageRelationStatistics Valid=325, Invalid=797, Unknown=0, NotChecked=0, Total=1122 [2025-01-09 12:13:05,390 INFO L435 NwaCegarLoop]: 124 mSDtfsCounter, 338 mSDsluCounter, 657 mSDsCounter, 0 mSdLazyCounter, 491 mSolverCounterSat, 111 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 338 SdHoareTripleChecker+Valid, 781 SdHoareTripleChecker+Invalid, 602 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 111 IncrementalHoareTripleChecker+Valid, 491 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2025-01-09 12:13:05,390 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [338 Valid, 781 Invalid, 602 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [111 Valid, 491 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2025-01-09 12:13:05,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 425 states. [2025-01-09 12:13:05,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 425 to 379. [2025-01-09 12:13:05,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 379 states, 266 states have (on average 1.368421052631579) internal successors, (364), 266 states have internal predecessors, (364), 108 states have call successors, (108), 4 states have call predecessors, (108), 4 states have return successors, (108), 108 states have call predecessors, (108), 108 states have call successors, (108) [2025-01-09 12:13:05,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 379 states to 379 states and 580 transitions. [2025-01-09 12:13:05,407 INFO L78 Accepts]: Start accepts. Automaton has 379 states and 580 transitions. Word has length 177 [2025-01-09 12:13:05,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 12:13:05,407 INFO L471 AbstractCegarLoop]: Abstraction has 379 states and 580 transitions. [2025-01-09 12:13:05,407 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 2.6470588235294117) internal successors, (45), 17 states have internal predecessors, (45), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2025-01-09 12:13:05,408 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states and 580 transitions. [2025-01-09 12:13:05,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2025-01-09 12:13:05,408 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 12:13:05,408 INFO L218 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:13:05,409 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-01-09 12:13:05,409 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 12:13:05,409 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 12:13:05,409 INFO L85 PathProgramCache]: Analyzing trace with hash -1126804094, now seen corresponding path program 1 times [2025-01-09 12:13:05,409 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 12:13:05,409 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [598335804] [2025-01-09 12:13:05,409 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:13:05,409 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 12:13:05,415 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 177 statements into 1 equivalence classes. [2025-01-09 12:13:05,438 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 177 of 177 statements. [2025-01-09 12:13:05,438 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:13:05,438 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat