./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-100_file-79.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-100_file-79.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/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 68466dc8851e15d5c55e16cb6abd8cdccbbd4db381e8ec074cd8097ac9916cb7 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 19:29:07,122 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 19:29:07,180 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 19:29:07,186 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 19:29:07,190 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 19:29:07,209 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 19:29:07,210 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 19:29:07,210 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 19:29:07,210 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 19:29:07,211 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 19:29:07,212 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 19:29:07,212 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 19:29:07,212 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 19:29:07,213 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 19:29:07,213 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 19:29:07,213 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 19:29:07,213 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 19:29:07,213 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 19:29:07,214 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 19:29:07,214 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 19:29:07,214 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 19:29:07,214 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 19:29:07,214 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 19:29:07,214 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 19:29:07,214 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 19:29:07,214 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 19:29:07,214 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 19:29:07,214 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 19:29:07,214 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 19:29:07,214 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 19:29:07,215 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 19:29:07,215 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 19:29:07,215 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 19:29:07,215 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 19:29:07,215 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 19:29:07,215 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 19:29:07,215 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 19:29:07,215 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 19:29:07,215 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 19:29:07,215 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 19:29:07,216 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 19:29:07,216 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 19:29:07,216 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 19:29:07,216 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/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 -> 68466dc8851e15d5c55e16cb6abd8cdccbbd4db381e8ec074cd8097ac9916cb7 [2025-03-03 19:29:07,446 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 19:29:07,455 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 19:29:07,457 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 19:29:07,458 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 19:29:07,458 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 19:29:07,459 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-100_file-79.i [2025-03-03 19:29:08,613 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1b6d288be/ff998efdd32e49398ce1f9324e122c27/FLAG4bed4350e [2025-03-03 19:29:08,891 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 19:29:08,893 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-100_file-79.i [2025-03-03 19:29:08,903 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1b6d288be/ff998efdd32e49398ce1f9324e122c27/FLAG4bed4350e [2025-03-03 19:29:09,194 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1b6d288be/ff998efdd32e49398ce1f9324e122c27 [2025-03-03 19:29:09,196 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 19:29:09,197 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 19:29:09,198 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 19:29:09,198 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 19:29:09,201 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 19:29:09,201 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 07:29:09" (1/1) ... [2025-03-03 19:29:09,202 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1c75fcdf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:29:09, skipping insertion in model container [2025-03-03 19:29:09,202 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 07:29:09" (1/1) ... [2025-03-03 19:29:09,217 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 19:29:09,326 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-100_file-79.i[916,929] [2025-03-03 19:29:09,437 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 19:29:09,453 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 19:29:09,462 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-100_file-79.i[916,929] [2025-03-03 19:29:09,505 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 19:29:09,522 INFO L204 MainTranslator]: Completed translation [2025-03-03 19:29:09,522 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:29:09 WrapperNode [2025-03-03 19:29:09,524 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 19:29:09,525 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 19:29:09,525 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 19:29:09,525 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 19:29:09,529 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:29:09" (1/1) ... [2025-03-03 19:29:09,542 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:29:09" (1/1) ... [2025-03-03 19:29:09,580 INFO L138 Inliner]: procedures = 26, calls = 86, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 418 [2025-03-03 19:29:09,580 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 19:29:09,581 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 19:29:09,581 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 19:29:09,581 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 19:29:09,587 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:29:09" (1/1) ... [2025-03-03 19:29:09,587 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:29:09" (1/1) ... [2025-03-03 19:29:09,598 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:29:09" (1/1) ... [2025-03-03 19:29:09,622 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-03-03 19:29:09,622 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:29:09" (1/1) ... [2025-03-03 19:29:09,622 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:29:09" (1/1) ... [2025-03-03 19:29:09,637 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:29:09" (1/1) ... [2025-03-03 19:29:09,641 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:29:09" (1/1) ... [2025-03-03 19:29:09,647 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:29:09" (1/1) ... [2025-03-03 19:29:09,648 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:29:09" (1/1) ... [2025-03-03 19:29:09,655 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 19:29:09,656 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 19:29:09,656 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 19:29:09,656 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 19:29:09,657 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:29:09" (1/1) ... [2025-03-03 19:29:09,661 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 19:29:09,670 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 19:29:09,682 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-03 19:29:09,684 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-03 19:29:09,699 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 19:29:09,700 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-03 19:29:09,700 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-03 19:29:09,700 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 19:29:09,700 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 19:29:09,700 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 19:29:09,777 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 19:29:09,779 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 19:29:10,230 INFO L? ?]: Removed 14 outVars from TransFormulas that were not future-live. [2025-03-03 19:29:10,230 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 19:29:10,245 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 19:29:10,246 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 19:29:10,246 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 07:29:10 BoogieIcfgContainer [2025-03-03 19:29:10,246 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 19:29:10,248 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 19:29:10,248 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 19:29:10,251 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 19:29:10,252 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 07:29:09" (1/3) ... [2025-03-03 19:29:10,252 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7cfed6da and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 07:29:10, skipping insertion in model container [2025-03-03 19:29:10,252 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:29:09" (2/3) ... [2025-03-03 19:29:10,252 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7cfed6da and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 07:29:10, skipping insertion in model container [2025-03-03 19:29:10,253 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 07:29:10" (3/3) ... [2025-03-03 19:29:10,253 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-100_file-79.i [2025-03-03 19:29:10,264 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 19:29:10,270 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodesize_ps-cn-100_file-79.i that has 2 procedures, 176 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 19:29:10,314 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 19:29:10,322 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;@7c71286f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 19:29:10,322 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 19:29:10,326 INFO L276 IsEmpty]: Start isEmpty. Operand has 176 states, 100 states have (on average 1.38) internal successors, (138), 101 states have internal predecessors, (138), 73 states have call successors, (73), 1 states have call predecessors, (73), 1 states have return successors, (73), 73 states have call predecessors, (73), 73 states have call successors, (73) [2025-03-03 19:29:10,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 442 [2025-03-03 19:29:10,359 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 19:29:10,360 INFO L218 NwaCegarLoop]: trace histogram [73, 73, 73, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-03 19:29:10,360 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 19:29:10,364 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 19:29:10,365 INFO L85 PathProgramCache]: Analyzing trace with hash -367379070, now seen corresponding path program 1 times [2025-03-03 19:29:10,370 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 19:29:10,371 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [695580409] [2025-03-03 19:29:10,371 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:29:10,371 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 19:29:10,462 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 441 statements into 1 equivalence classes. [2025-03-03 19:29:10,496 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 441 of 441 statements. [2025-03-03 19:29:10,496 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:29:10,496 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 19:29:10,768 INFO L134 CoverageAnalysis]: Checked inductivity of 10512 backedges. 0 proven. 144 refuted. 0 times theorem prover too weak. 10368 trivial. 0 not checked. [2025-03-03 19:29:10,769 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 19:29:10,770 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [695580409] [2025-03-03 19:29:10,770 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [695580409] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 19:29:10,771 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2081205544] [2025-03-03 19:29:10,771 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:29:10,771 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 19:29:10,771 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 19:29:10,773 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 19:29:10,775 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-03 19:29:10,883 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 441 statements into 1 equivalence classes. [2025-03-03 19:29:10,989 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 441 of 441 statements. [2025-03-03 19:29:10,989 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:29:10,989 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 19:29:10,993 INFO L256 TraceCheckSpWp]: Trace formula consists of 961 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-03 19:29:11,006 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 19:29:11,078 INFO L134 CoverageAnalysis]: Checked inductivity of 10512 backedges. 144 proven. 0 refuted. 0 times theorem prover too weak. 10368 trivial. 0 not checked. [2025-03-03 19:29:11,078 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 19:29:11,078 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2081205544] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 19:29:11,078 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 19:29:11,078 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-03 19:29:11,080 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1790953574] [2025-03-03 19:29:11,080 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 19:29:11,084 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-03 19:29:11,084 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 19:29:11,101 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-03 19:29:11,101 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 19:29:11,103 INFO L87 Difference]: Start difference. First operand has 176 states, 100 states have (on average 1.38) internal successors, (138), 101 states have internal predecessors, (138), 73 states have call successors, (73), 1 states have call predecessors, (73), 1 states have return successors, (73), 73 states have call predecessors, (73), 73 states have call successors, (73) Second operand has 2 states, 2 states have (on average 40.5) internal successors, (81), 2 states have internal predecessors, (81), 2 states have call successors, (73), 2 states have call predecessors, (73), 1 states have return successors, (73), 1 states have call predecessors, (73), 2 states have call successors, (73) [2025-03-03 19:29:11,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 19:29:11,156 INFO L93 Difference]: Finished difference Result 346 states and 636 transitions. [2025-03-03 19:29:11,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-03 19:29:11,158 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 40.5) internal successors, (81), 2 states have internal predecessors, (81), 2 states have call successors, (73), 2 states have call predecessors, (73), 1 states have return successors, (73), 1 states have call predecessors, (73), 2 states have call successors, (73) Word has length 441 [2025-03-03 19:29:11,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 19:29:11,165 INFO L225 Difference]: With dead ends: 346 [2025-03-03 19:29:11,166 INFO L226 Difference]: Without dead ends: 173 [2025-03-03 19:29:11,169 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 442 GetRequests, 442 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-03-03 19:29:11,170 INFO L435 NwaCegarLoop]: 274 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 274 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 19:29:11,171 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 274 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 19:29:11,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2025-03-03 19:29:11,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 173. [2025-03-03 19:29:11,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 173 states, 98 states have (on average 1.346938775510204) internal successors, (132), 98 states have internal predecessors, (132), 73 states have call successors, (73), 1 states have call predecessors, (73), 1 states have return successors, (73), 73 states have call predecessors, (73), 73 states have call successors, (73) [2025-03-03 19:29:11,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 278 transitions. [2025-03-03 19:29:11,227 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 278 transitions. Word has length 441 [2025-03-03 19:29:11,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 19:29:11,227 INFO L471 AbstractCegarLoop]: Abstraction has 173 states and 278 transitions. [2025-03-03 19:29:11,228 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 40.5) internal successors, (81), 2 states have internal predecessors, (81), 2 states have call successors, (73), 2 states have call predecessors, (73), 1 states have return successors, (73), 1 states have call predecessors, (73), 2 states have call successors, (73) [2025-03-03 19:29:11,228 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 278 transitions. [2025-03-03 19:29:11,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 442 [2025-03-03 19:29:11,233 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 19:29:11,233 INFO L218 NwaCegarLoop]: trace histogram [73, 73, 73, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-03 19:29:11,241 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-03 19:29:11,434 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-03-03 19:29:11,434 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 19:29:11,435 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 19:29:11,435 INFO L85 PathProgramCache]: Analyzing trace with hash 1978580879, now seen corresponding path program 1 times [2025-03-03 19:29:11,435 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 19:29:11,435 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1949583893] [2025-03-03 19:29:11,435 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:29:11,435 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 19:29:11,460 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 441 statements into 1 equivalence classes. [2025-03-03 19:29:11,536 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 441 of 441 statements. [2025-03-03 19:29:11,537 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:29:11,537 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 19:29:12,049 INFO L134 CoverageAnalysis]: Checked inductivity of 10512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10512 trivial. 0 not checked. [2025-03-03 19:29:12,050 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 19:29:12,051 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1949583893] [2025-03-03 19:29:12,051 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1949583893] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 19:29:12,051 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 19:29:12,051 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 19:29:12,051 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [272509144] [2025-03-03 19:29:12,051 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 19:29:12,053 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 19:29:12,053 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 19:29:12,053 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 19:29:12,054 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 19:29:12,054 INFO L87 Difference]: Start difference. First operand 173 states and 278 transitions. Second operand has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 1 states have call successors, (73), 1 states have call predecessors, (73), 1 states have return successors, (73), 1 states have call predecessors, (73), 1 states have call successors, (73) [2025-03-03 19:29:12,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 19:29:12,144 INFO L93 Difference]: Finished difference Result 513 states and 828 transitions. [2025-03-03 19:29:12,144 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 19:29:12,145 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 1 states have call successors, (73), 1 states have call predecessors, (73), 1 states have return successors, (73), 1 states have call predecessors, (73), 1 states have call successors, (73) Word has length 441 [2025-03-03 19:29:12,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 19:29:12,151 INFO L225 Difference]: With dead ends: 513 [2025-03-03 19:29:12,152 INFO L226 Difference]: Without dead ends: 343 [2025-03-03 19:29:12,154 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 19:29:12,156 INFO L435 NwaCegarLoop]: 278 mSDtfsCounter, 132 mSDsluCounter, 264 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 132 SdHoareTripleChecker+Valid, 542 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 19:29:12,156 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [132 Valid, 542 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 19:29:12,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 343 states. [2025-03-03 19:29:12,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 343 to 341. [2025-03-03 19:29:12,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 341 states, 192 states have (on average 1.34375) internal successors, (258), 192 states have internal predecessors, (258), 146 states have call successors, (146), 2 states have call predecessors, (146), 2 states have return successors, (146), 146 states have call predecessors, (146), 146 states have call successors, (146) [2025-03-03 19:29:12,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 341 states to 341 states and 550 transitions. [2025-03-03 19:29:12,231 INFO L78 Accepts]: Start accepts. Automaton has 341 states and 550 transitions. Word has length 441 [2025-03-03 19:29:12,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 19:29:12,234 INFO L471 AbstractCegarLoop]: Abstraction has 341 states and 550 transitions. [2025-03-03 19:29:12,234 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 1 states have call successors, (73), 1 states have call predecessors, (73), 1 states have return successors, (73), 1 states have call predecessors, (73), 1 states have call successors, (73) [2025-03-03 19:29:12,234 INFO L276 IsEmpty]: Start isEmpty. Operand 341 states and 550 transitions. [2025-03-03 19:29:12,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 443 [2025-03-03 19:29:12,240 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 19:29:12,240 INFO L218 NwaCegarLoop]: trace histogram [73, 73, 73, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-03 19:29:12,241 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-03 19:29:12,241 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 19:29:12,242 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 19:29:12,242 INFO L85 PathProgramCache]: Analyzing trace with hash 2048163797, now seen corresponding path program 1 times [2025-03-03 19:29:12,242 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 19:29:12,242 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1584470244] [2025-03-03 19:29:12,243 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:29:12,243 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 19:29:12,269 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 442 statements into 1 equivalence classes. [2025-03-03 19:29:12,305 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 442 of 442 statements. [2025-03-03 19:29:12,306 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:29:12,306 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 19:29:12,889 INFO L134 CoverageAnalysis]: Checked inductivity of 10512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10512 trivial. 0 not checked. [2025-03-03 19:29:12,890 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 19:29:12,890 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1584470244] [2025-03-03 19:29:12,891 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1584470244] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 19:29:12,891 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 19:29:12,891 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 19:29:12,891 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [453286064] [2025-03-03 19:29:12,891 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 19:29:12,891 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 19:29:12,892 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 19:29:12,893 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 19:29:12,893 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-03 19:29:12,893 INFO L87 Difference]: Start difference. First operand 341 states and 550 transitions. Second operand has 5 states, 5 states have (on average 16.0) internal successors, (80), 5 states have internal predecessors, (80), 1 states have call successors, (73), 1 states have call predecessors, (73), 1 states have return successors, (73), 1 states have call predecessors, (73), 1 states have call successors, (73) [2025-03-03 19:29:13,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 19:29:13,336 INFO L93 Difference]: Finished difference Result 695 states and 1118 transitions. [2025-03-03 19:29:13,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 19:29:13,336 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.0) internal successors, (80), 5 states have internal predecessors, (80), 1 states have call successors, (73), 1 states have call predecessors, (73), 1 states have return successors, (73), 1 states have call predecessors, (73), 1 states have call successors, (73) Word has length 442 [2025-03-03 19:29:13,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 19:29:13,341 INFO L225 Difference]: With dead ends: 695 [2025-03-03 19:29:13,342 INFO L226 Difference]: Without dead ends: 357 [2025-03-03 19:29:13,343 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-03-03 19:29:13,345 INFO L435 NwaCegarLoop]: 276 mSDtfsCounter, 202 mSDsluCounter, 657 mSDsCounter, 0 mSdLazyCounter, 189 mSolverCounterSat, 220 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 202 SdHoareTripleChecker+Valid, 933 SdHoareTripleChecker+Invalid, 409 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 220 IncrementalHoareTripleChecker+Valid, 189 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 19:29:13,346 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [202 Valid, 933 Invalid, 409 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [220 Valid, 189 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 19:29:13,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 357 states. [2025-03-03 19:29:13,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 357 to 341. [2025-03-03 19:29:13,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 341 states, 192 states have (on average 1.3385416666666667) internal successors, (257), 192 states have internal predecessors, (257), 146 states have call successors, (146), 2 states have call predecessors, (146), 2 states have return successors, (146), 146 states have call predecessors, (146), 146 states have call successors, (146) [2025-03-03 19:29:13,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 341 states to 341 states and 549 transitions. [2025-03-03 19:29:13,389 INFO L78 Accepts]: Start accepts. Automaton has 341 states and 549 transitions. Word has length 442 [2025-03-03 19:29:13,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 19:29:13,390 INFO L471 AbstractCegarLoop]: Abstraction has 341 states and 549 transitions. [2025-03-03 19:29:13,390 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.0) internal successors, (80), 5 states have internal predecessors, (80), 1 states have call successors, (73), 1 states have call predecessors, (73), 1 states have return successors, (73), 1 states have call predecessors, (73), 1 states have call successors, (73) [2025-03-03 19:29:13,390 INFO L276 IsEmpty]: Start isEmpty. Operand 341 states and 549 transitions. [2025-03-03 19:29:13,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 444 [2025-03-03 19:29:13,395 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 19:29:13,395 INFO L218 NwaCegarLoop]: trace histogram [73, 73, 73, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-03 19:29:13,395 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-03 19:29:13,395 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 19:29:13,395 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 19:29:13,396 INFO L85 PathProgramCache]: Analyzing trace with hash -1220857391, now seen corresponding path program 1 times [2025-03-03 19:29:13,396 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 19:29:13,396 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [668224082] [2025-03-03 19:29:13,396 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:29:13,396 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 19:29:13,420 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 443 statements into 1 equivalence classes. [2025-03-03 19:29:13,444 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 443 of 443 statements. [2025-03-03 19:29:13,444 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:29:13,445 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 19:29:13,633 INFO L134 CoverageAnalysis]: Checked inductivity of 10512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10512 trivial. 0 not checked. [2025-03-03 19:29:13,633 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 19:29:13,633 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [668224082] [2025-03-03 19:29:13,634 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [668224082] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 19:29:13,634 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 19:29:13,634 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 19:29:13,634 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [90655903] [2025-03-03 19:29:13,634 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 19:29:13,635 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 19:29:13,635 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 19:29:13,635 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 19:29:13,635 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 19:29:13,636 INFO L87 Difference]: Start difference. First operand 341 states and 549 transitions. Second operand has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 1 states have call successors, (73), 1 states have call predecessors, (73), 1 states have return successors, (73), 1 states have call predecessors, (73), 1 states have call successors, (73) [2025-03-03 19:29:13,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 19:29:13,674 INFO L93 Difference]: Finished difference Result 689 states and 1113 transitions. [2025-03-03 19:29:13,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 19:29:13,675 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 1 states have call successors, (73), 1 states have call predecessors, (73), 1 states have return successors, (73), 1 states have call predecessors, (73), 1 states have call successors, (73) Word has length 443 [2025-03-03 19:29:13,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 19:29:13,678 INFO L225 Difference]: With dead ends: 689 [2025-03-03 19:29:13,678 INFO L226 Difference]: Without dead ends: 351 [2025-03-03 19:29:13,680 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-03-03 19:29:13,680 INFO L435 NwaCegarLoop]: 290 mSDtfsCounter, 18 mSDsluCounter, 265 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 555 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-03-03 19:29:13,680 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 555 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 19:29:13,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 351 states. [2025-03-03 19:29:13,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 351 to 341. [2025-03-03 19:29:13,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 341 states, 192 states have (on average 1.328125) internal successors, (255), 192 states have internal predecessors, (255), 146 states have call successors, (146), 2 states have call predecessors, (146), 2 states have return successors, (146), 146 states have call predecessors, (146), 146 states have call successors, (146) [2025-03-03 19:29:13,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 341 states to 341 states and 547 transitions. [2025-03-03 19:29:13,718 INFO L78 Accepts]: Start accepts. Automaton has 341 states and 547 transitions. Word has length 443 [2025-03-03 19:29:13,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 19:29:13,718 INFO L471 AbstractCegarLoop]: Abstraction has 341 states and 547 transitions. [2025-03-03 19:29:13,719 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 1 states have call successors, (73), 1 states have call predecessors, (73), 1 states have return successors, (73), 1 states have call predecessors, (73), 1 states have call successors, (73) [2025-03-03 19:29:13,719 INFO L276 IsEmpty]: Start isEmpty. Operand 341 states and 547 transitions. [2025-03-03 19:29:13,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 444 [2025-03-03 19:29:13,724 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 19:29:13,725 INFO L218 NwaCegarLoop]: trace histogram [73, 73, 73, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-03 19:29:13,725 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-03 19:29:13,725 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 19:29:13,725 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 19:29:13,726 INFO L85 PathProgramCache]: Analyzing trace with hash -1091774672, now seen corresponding path program 1 times [2025-03-03 19:29:13,726 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 19:29:13,726 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1638140737] [2025-03-03 19:29:13,726 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:29:13,726 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 19:29:13,752 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 443 statements into 1 equivalence classes. [2025-03-03 19:29:13,827 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 443 of 443 statements. [2025-03-03 19:29:13,828 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:29:13,828 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 19:29:14,051 INFO L134 CoverageAnalysis]: Checked inductivity of 10512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10512 trivial. 0 not checked. [2025-03-03 19:29:14,051 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 19:29:14,051 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1638140737] [2025-03-03 19:29:14,051 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1638140737] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 19:29:14,051 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 19:29:14,051 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 19:29:14,052 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1439832946] [2025-03-03 19:29:14,052 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 19:29:14,053 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 19:29:14,053 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 19:29:14,053 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 19:29:14,053 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 19:29:14,053 INFO L87 Difference]: Start difference. First operand 341 states and 547 transitions. Second operand has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 1 states have call successors, (73), 1 states have call predecessors, (73), 1 states have return successors, (73), 1 states have call predecessors, (73), 1 states have call successors, (73) [2025-03-03 19:29:14,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 19:29:14,093 INFO L93 Difference]: Finished difference Result 695 states and 1109 transitions. [2025-03-03 19:29:14,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 19:29:14,094 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 1 states have call successors, (73), 1 states have call predecessors, (73), 1 states have return successors, (73), 1 states have call predecessors, (73), 1 states have call successors, (73) Word has length 443 [2025-03-03 19:29:14,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 19:29:14,097 INFO L225 Difference]: With dead ends: 695 [2025-03-03 19:29:14,097 INFO L226 Difference]: Without dead ends: 357 [2025-03-03 19:29:14,098 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 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-03-03 19:29:14,098 INFO L435 NwaCegarLoop]: 282 mSDtfsCounter, 32 mSDsluCounter, 245 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 527 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 19:29:14,098 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 527 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 19:29:14,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 357 states. [2025-03-03 19:29:14,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 357 to 356. [2025-03-03 19:29:14,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 356 states, 201 states have (on average 1.3034825870646767) internal successors, (262), 202 states have internal predecessors, (262), 150 states have call successors, (150), 4 states have call predecessors, (150), 4 states have return successors, (150), 149 states have call predecessors, (150), 150 states have call successors, (150) [2025-03-03 19:29:14,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 356 states to 356 states and 562 transitions. [2025-03-03 19:29:14,143 INFO L78 Accepts]: Start accepts. Automaton has 356 states and 562 transitions. Word has length 443 [2025-03-03 19:29:14,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 19:29:14,148 INFO L471 AbstractCegarLoop]: Abstraction has 356 states and 562 transitions. [2025-03-03 19:29:14,148 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 1 states have call successors, (73), 1 states have call predecessors, (73), 1 states have return successors, (73), 1 states have call predecessors, (73), 1 states have call successors, (73) [2025-03-03 19:29:14,148 INFO L276 IsEmpty]: Start isEmpty. Operand 356 states and 562 transitions. [2025-03-03 19:29:14,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 445 [2025-03-03 19:29:14,153 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 19:29:14,153 INFO L218 NwaCegarLoop]: trace histogram [73, 73, 73, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-03 19:29:14,153 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-03 19:29:14,153 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 19:29:14,154 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 19:29:14,154 INFO L85 PathProgramCache]: Analyzing trace with hash -146924397, now seen corresponding path program 1 times [2025-03-03 19:29:14,154 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 19:29:14,154 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [75198427] [2025-03-03 19:29:14,154 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:29:14,154 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 19:29:14,183 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 444 statements into 1 equivalence classes. [2025-03-03 19:29:14,275 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 444 of 444 statements. [2025-03-03 19:29:14,276 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:29:14,276 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 19:29:14,729 INFO L134 CoverageAnalysis]: Checked inductivity of 10512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10512 trivial. 0 not checked. [2025-03-03 19:29:14,729 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 19:29:14,729 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [75198427] [2025-03-03 19:29:14,729 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [75198427] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 19:29:14,729 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 19:29:14,729 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 19:29:14,729 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [894809128] [2025-03-03 19:29:14,729 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 19:29:14,734 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 19:29:14,734 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 19:29:14,734 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 19:29:14,735 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-03 19:29:14,735 INFO L87 Difference]: Start difference. First operand 356 states and 562 transitions. Second operand has 6 states, 6 states have (on average 13.666666666666666) internal successors, (82), 6 states have internal predecessors, (82), 2 states have call successors, (73), 1 states have call predecessors, (73), 1 states have return successors, (73), 2 states have call predecessors, (73), 2 states have call successors, (73) [2025-03-03 19:29:15,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 19:29:15,373 INFO L93 Difference]: Finished difference Result 1092 states and 1716 transitions. [2025-03-03 19:29:15,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 19:29:15,374 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.666666666666666) internal successors, (82), 6 states have internal predecessors, (82), 2 states have call successors, (73), 1 states have call predecessors, (73), 1 states have return successors, (73), 2 states have call predecessors, (73), 2 states have call successors, (73) Word has length 444 [2025-03-03 19:29:15,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 19:29:15,379 INFO L225 Difference]: With dead ends: 1092 [2025-03-03 19:29:15,379 INFO L226 Difference]: Without dead ends: 746 [2025-03-03 19:29:15,380 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2025-03-03 19:29:15,381 INFO L435 NwaCegarLoop]: 382 mSDtfsCounter, 543 mSDsluCounter, 562 mSDsCounter, 0 mSdLazyCounter, 311 mSolverCounterSat, 112 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 543 SdHoareTripleChecker+Valid, 944 SdHoareTripleChecker+Invalid, 423 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 112 IncrementalHoareTripleChecker+Valid, 311 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-03 19:29:15,381 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [543 Valid, 944 Invalid, 423 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [112 Valid, 311 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-03 19:29:15,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 746 states. [2025-03-03 19:29:15,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 746 to 649. [2025-03-03 19:29:15,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 649 states, 407 states have (on average 1.366093366093366) internal successors, (556), 411 states have internal predecessors, (556), 231 states have call successors, (231), 10 states have call predecessors, (231), 10 states have return successors, (231), 227 states have call predecessors, (231), 231 states have call successors, (231) [2025-03-03 19:29:15,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 649 states to 649 states and 1018 transitions. [2025-03-03 19:29:15,445 INFO L78 Accepts]: Start accepts. Automaton has 649 states and 1018 transitions. Word has length 444 [2025-03-03 19:29:15,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 19:29:15,446 INFO L471 AbstractCegarLoop]: Abstraction has 649 states and 1018 transitions. [2025-03-03 19:29:15,446 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.666666666666666) internal successors, (82), 6 states have internal predecessors, (82), 2 states have call successors, (73), 1 states have call predecessors, (73), 1 states have return successors, (73), 2 states have call predecessors, (73), 2 states have call successors, (73) [2025-03-03 19:29:15,446 INFO L276 IsEmpty]: Start isEmpty. Operand 649 states and 1018 transitions. [2025-03-03 19:29:15,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 445 [2025-03-03 19:29:15,448 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 19:29:15,448 INFO L218 NwaCegarLoop]: trace histogram [73, 73, 73, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-03 19:29:15,448 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-03 19:29:15,449 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 19:29:15,449 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 19:29:15,449 INFO L85 PathProgramCache]: Analyzing trace with hash -135608270, now seen corresponding path program 1 times [2025-03-03 19:29:15,449 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 19:29:15,449 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1715650638] [2025-03-03 19:29:15,449 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:29:15,449 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 19:29:15,473 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 444 statements into 1 equivalence classes. [2025-03-03 19:29:15,493 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 444 of 444 statements. [2025-03-03 19:29:15,494 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:29:15,494 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 19:29:15,701 INFO L134 CoverageAnalysis]: Checked inductivity of 10512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10512 trivial. 0 not checked. [2025-03-03 19:29:15,702 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 19:29:15,702 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1715650638] [2025-03-03 19:29:15,702 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1715650638] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 19:29:15,702 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 19:29:15,702 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 19:29:15,702 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1531377580] [2025-03-03 19:29:15,702 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 19:29:15,702 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 19:29:15,702 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 19:29:15,703 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 19:29:15,703 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 19:29:15,703 INFO L87 Difference]: Start difference. First operand 649 states and 1018 transitions. Second operand has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 states have internal predecessors, (82), 1 states have call successors, (73), 1 states have call predecessors, (73), 1 states have return successors, (73), 1 states have call predecessors, (73), 1 states have call successors, (73) [2025-03-03 19:29:15,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 19:29:15,824 INFO L93 Difference]: Finished difference Result 1676 states and 2634 transitions. [2025-03-03 19:29:15,826 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 19:29:15,827 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 states have internal predecessors, (82), 1 states have call successors, (73), 1 states have call predecessors, (73), 1 states have return successors, (73), 1 states have call predecessors, (73), 1 states have call successors, (73) Word has length 444 [2025-03-03 19:29:15,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 19:29:15,835 INFO L225 Difference]: With dead ends: 1676 [2025-03-03 19:29:15,835 INFO L226 Difference]: Without dead ends: 1037 [2025-03-03 19:29:15,837 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 19:29:15,838 INFO L435 NwaCegarLoop]: 337 mSDtfsCounter, 149 mSDsluCounter, 261 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 149 SdHoareTripleChecker+Valid, 598 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 19:29:15,838 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [149 Valid, 598 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 19:29:15,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1037 states. [2025-03-03 19:29:16,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1037 to 946. [2025-03-03 19:29:16,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 946 states, 559 states have (on average 1.3273703041144902) internal successors, (742), 562 states have internal predecessors, (742), 373 states have call successors, (373), 13 states have call predecessors, (373), 13 states have return successors, (373), 370 states have call predecessors, (373), 373 states have call successors, (373) [2025-03-03 19:29:16,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 946 states to 946 states and 1488 transitions. [2025-03-03 19:29:16,021 INFO L78 Accepts]: Start accepts. Automaton has 946 states and 1488 transitions. Word has length 444 [2025-03-03 19:29:16,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 19:29:16,022 INFO L471 AbstractCegarLoop]: Abstraction has 946 states and 1488 transitions. [2025-03-03 19:29:16,023 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 states have internal predecessors, (82), 1 states have call successors, (73), 1 states have call predecessors, (73), 1 states have return successors, (73), 1 states have call predecessors, (73), 1 states have call successors, (73) [2025-03-03 19:29:16,023 INFO L276 IsEmpty]: Start isEmpty. Operand 946 states and 1488 transitions. [2025-03-03 19:29:16,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 446 [2025-03-03 19:29:16,026 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 19:29:16,026 INFO L218 NwaCegarLoop]: trace histogram [73, 73, 73, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-03 19:29:16,026 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-03 19:29:16,027 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 19:29:16,027 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 19:29:16,027 INFO L85 PathProgramCache]: Analyzing trace with hash -198895398, now seen corresponding path program 1 times [2025-03-03 19:29:16,027 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 19:29:16,027 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1101776245] [2025-03-03 19:29:16,027 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:29:16,028 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 19:29:16,058 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 445 statements into 1 equivalence classes. [2025-03-03 19:29:16,082 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 445 of 445 statements. [2025-03-03 19:29:16,082 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:29:16,082 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 19:29:16,200 INFO L134 CoverageAnalysis]: Checked inductivity of 10512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10512 trivial. 0 not checked. [2025-03-03 19:29:16,200 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 19:29:16,200 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1101776245] [2025-03-03 19:29:16,200 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1101776245] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 19:29:16,200 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 19:29:16,200 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 19:29:16,200 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [748554335] [2025-03-03 19:29:16,200 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 19:29:16,201 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 19:29:16,201 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 19:29:16,201 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 19:29:16,201 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 19:29:16,202 INFO L87 Difference]: Start difference. First operand 946 states and 1488 transitions. Second operand has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 states have internal predecessors, (83), 1 states have call successors, (73), 1 states have call predecessors, (73), 1 states have return successors, (73), 1 states have call predecessors, (73), 1 states have call successors, (73) [2025-03-03 19:29:20,229 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2025-03-03 19:29:24,232 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2025-03-03 19:29:24,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 19:29:24,358 INFO L93 Difference]: Finished difference Result 2018 states and 3178 transitions. [2025-03-03 19:29:24,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 19:29:24,359 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 states have internal predecessors, (83), 1 states have call successors, (73), 1 states have call predecessors, (73), 1 states have return successors, (73), 1 states have call predecessors, (73), 1 states have call successors, (73) Word has length 445 [2025-03-03 19:29:24,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 19:29:24,369 INFO L225 Difference]: With dead ends: 2018 [2025-03-03 19:29:24,369 INFO L226 Difference]: Without dead ends: 1468 [2025-03-03 19:29:24,370 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-03-03 19:29:24,371 INFO L435 NwaCegarLoop]: 469 mSDtfsCounter, 264 mSDsluCounter, 263 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 1 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 264 SdHoareTripleChecker+Valid, 732 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.0s IncrementalHoareTripleChecker+Time [2025-03-03 19:29:24,372 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [264 Valid, 732 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 21 Invalid, 2 Unknown, 0 Unchecked, 8.0s Time] [2025-03-03 19:29:24,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1468 states. [2025-03-03 19:29:24,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1468 to 1466. [2025-03-03 19:29:24,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1466 states, 871 states have (on average 1.3295063145809414) internal successors, (1158), 876 states have internal predecessors, (1158), 573 states have call successors, (573), 21 states have call predecessors, (573), 21 states have return successors, (573), 568 states have call predecessors, (573), 573 states have call successors, (573) [2025-03-03 19:29:24,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1466 states to 1466 states and 2304 transitions. [2025-03-03 19:29:24,552 INFO L78 Accepts]: Start accepts. Automaton has 1466 states and 2304 transitions. Word has length 445 [2025-03-03 19:29:24,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 19:29:24,554 INFO L471 AbstractCegarLoop]: Abstraction has 1466 states and 2304 transitions. [2025-03-03 19:29:24,554 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 states have internal predecessors, (83), 1 states have call successors, (73), 1 states have call predecessors, (73), 1 states have return successors, (73), 1 states have call predecessors, (73), 1 states have call successors, (73) [2025-03-03 19:29:24,554 INFO L276 IsEmpty]: Start isEmpty. Operand 1466 states and 2304 transitions. [2025-03-03 19:29:24,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 446 [2025-03-03 19:29:24,557 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 19:29:24,557 INFO L218 NwaCegarLoop]: trace histogram [73, 73, 73, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-03 19:29:24,557 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-03 19:29:24,557 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 19:29:24,558 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 19:29:24,558 INFO L85 PathProgramCache]: Analyzing trace with hash -265902151, now seen corresponding path program 1 times [2025-03-03 19:29:24,558 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 19:29:24,558 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1958463254] [2025-03-03 19:29:24,558 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:29:24,558 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 19:29:24,580 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 445 statements into 1 equivalence classes. [2025-03-03 19:29:24,661 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 445 of 445 statements. [2025-03-03 19:29:24,661 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:29:24,661 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 19:29:24,892 INFO L134 CoverageAnalysis]: Checked inductivity of 10512 backedges. 132 proven. 84 refuted. 0 times theorem prover too weak. 10296 trivial. 0 not checked. [2025-03-03 19:29:24,893 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 19:29:24,893 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1958463254] [2025-03-03 19:29:24,893 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1958463254] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 19:29:24,893 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [347997670] [2025-03-03 19:29:24,893 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:29:24,893 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 19:29:24,893 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 19:29:24,895 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 19:29:24,897 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-03 19:29:25,009 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 445 statements into 1 equivalence classes. [2025-03-03 19:29:25,095 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 445 of 445 statements. [2025-03-03 19:29:25,095 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:29:25,096 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 19:29:25,099 INFO L256 TraceCheckSpWp]: Trace formula consists of 969 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-03-03 19:29:25,112 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 19:29:26,435 INFO L134 CoverageAnalysis]: Checked inductivity of 10512 backedges. 3348 proven. 174 refuted. 0 times theorem prover too weak. 6990 trivial. 0 not checked. [2025-03-03 19:29:26,435 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 19:29:27,177 INFO L134 CoverageAnalysis]: Checked inductivity of 10512 backedges. 42 proven. 174 refuted. 0 times theorem prover too weak. 10296 trivial. 0 not checked. [2025-03-03 19:29:27,178 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [347997670] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 19:29:27,178 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 19:29:27,178 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 8, 8] total 17 [2025-03-03 19:29:27,178 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1382680830] [2025-03-03 19:29:27,178 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 19:29:27,180 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-03-03 19:29:27,180 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 19:29:27,181 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-03-03 19:29:27,181 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=212, Unknown=0, NotChecked=0, Total=272 [2025-03-03 19:29:27,181 INFO L87 Difference]: Start difference. First operand 1466 states and 2304 transitions. Second operand has 17 states, 17 states have (on average 13.588235294117647) internal successors, (231), 17 states have internal predecessors, (231), 5 states have call successors, (204), 3 states have call predecessors, (204), 6 states have return successors, (205), 5 states have call predecessors, (205), 5 states have call successors, (205) [2025-03-03 19:29:28,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 19:29:28,030 INFO L93 Difference]: Finished difference Result 3014 states and 4637 transitions. [2025-03-03 19:29:28,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-03 19:29:28,031 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 13.588235294117647) internal successors, (231), 17 states have internal predecessors, (231), 5 states have call successors, (204), 3 states have call predecessors, (204), 6 states have return successors, (205), 5 states have call predecessors, (205), 5 states have call successors, (205) Word has length 445 [2025-03-03 19:29:28,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 19:29:28,043 INFO L225 Difference]: With dead ends: 3014 [2025-03-03 19:29:28,044 INFO L226 Difference]: Without dead ends: 1600 [2025-03-03 19:29:28,049 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 907 GetRequests, 878 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 123 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=254, Invalid=616, Unknown=0, NotChecked=0, Total=870 [2025-03-03 19:29:28,050 INFO L435 NwaCegarLoop]: 182 mSDtfsCounter, 695 mSDsluCounter, 433 mSDsCounter, 0 mSdLazyCounter, 714 mSolverCounterSat, 536 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 695 SdHoareTripleChecker+Valid, 615 SdHoareTripleChecker+Invalid, 1250 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 536 IncrementalHoareTripleChecker+Valid, 714 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-03 19:29:28,050 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [695 Valid, 615 Invalid, 1250 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [536 Valid, 714 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-03 19:29:28,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1600 states. [2025-03-03 19:29:28,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1600 to 791. [2025-03-03 19:29:28,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 791 states, 470 states have (on average 1.2680851063829788) internal successors, (596), 473 states have internal predecessors, (596), 300 states have call successors, (300), 20 states have call predecessors, (300), 20 states have return successors, (300), 297 states have call predecessors, (300), 300 states have call successors, (300) [2025-03-03 19:29:28,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 791 states to 791 states and 1196 transitions. [2025-03-03 19:29:28,183 INFO L78 Accepts]: Start accepts. Automaton has 791 states and 1196 transitions. Word has length 445 [2025-03-03 19:29:28,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 19:29:28,183 INFO L471 AbstractCegarLoop]: Abstraction has 791 states and 1196 transitions. [2025-03-03 19:29:28,184 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 13.588235294117647) internal successors, (231), 17 states have internal predecessors, (231), 5 states have call successors, (204), 3 states have call predecessors, (204), 6 states have return successors, (205), 5 states have call predecessors, (205), 5 states have call successors, (205) [2025-03-03 19:29:28,184 INFO L276 IsEmpty]: Start isEmpty. Operand 791 states and 1196 transitions. [2025-03-03 19:29:28,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 447 [2025-03-03 19:29:28,186 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 19:29:28,186 INFO L218 NwaCegarLoop]: trace histogram [73, 73, 73, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-03 19:29:28,194 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-03 19:29:28,386 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2025-03-03 19:29:28,387 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 19:29:28,387 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 19:29:28,387 INFO L85 PathProgramCache]: Analyzing trace with hash -474848594, now seen corresponding path program 1 times [2025-03-03 19:29:28,387 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 19:29:28,387 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [795689890] [2025-03-03 19:29:28,391 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:29:28,392 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 19:29:28,415 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 446 statements into 1 equivalence classes. [2025-03-03 19:29:28,480 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 446 of 446 statements. [2025-03-03 19:29:28,481 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:29:28,481 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 19:29:28,714 INFO L134 CoverageAnalysis]: Checked inductivity of 10512 backedges. 147 proven. 69 refuted. 0 times theorem prover too weak. 10296 trivial. 0 not checked. [2025-03-03 19:29:28,714 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 19:29:28,714 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [795689890] [2025-03-03 19:29:28,714 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [795689890] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 19:29:28,714 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [736812415] [2025-03-03 19:29:28,714 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:29:28,714 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 19:29:28,715 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 19:29:28,716 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 19:29:28,718 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-03 19:29:28,846 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 446 statements into 1 equivalence classes. [2025-03-03 19:29:28,937 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 446 of 446 statements. [2025-03-03 19:29:28,938 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:29:28,938 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 19:29:28,941 INFO L256 TraceCheckSpWp]: Trace formula consists of 972 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-03 19:29:28,948 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 19:29:29,189 INFO L134 CoverageAnalysis]: Checked inductivity of 10512 backedges. 4678 proven. 69 refuted. 0 times theorem prover too weak. 5765 trivial. 0 not checked. [2025-03-03 19:29:29,189 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 19:29:29,645 INFO L134 CoverageAnalysis]: Checked inductivity of 10512 backedges. 147 proven. 69 refuted. 0 times theorem prover too weak. 10296 trivial. 0 not checked. [2025-03-03 19:29:29,646 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [736812415] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 19:29:29,646 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 19:29:29,646 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 8 [2025-03-03 19:29:29,646 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1942181957] [2025-03-03 19:29:29,646 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 19:29:29,647 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-03 19:29:29,647 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 19:29:29,648 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-03 19:29:29,648 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-03-03 19:29:29,648 INFO L87 Difference]: Start difference. First operand 791 states and 1196 transitions. Second operand has 8 states, 8 states have (on average 14.875) internal successors, (119), 8 states have internal predecessors, (119), 3 states have call successors, (119), 2 states have call predecessors, (119), 4 states have return successors, (120), 3 states have call predecessors, (120), 3 states have call successors, (120) [2025-03-03 19:29:30,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 19:29:30,098 INFO L93 Difference]: Finished difference Result 1578 states and 2360 transitions. [2025-03-03 19:29:30,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-03 19:29:30,099 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 14.875) internal successors, (119), 8 states have internal predecessors, (119), 3 states have call successors, (119), 2 states have call predecessors, (119), 4 states have return successors, (120), 3 states have call predecessors, (120), 3 states have call successors, (120) Word has length 446 [2025-03-03 19:29:30,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 19:29:30,105 INFO L225 Difference]: With dead ends: 1578 [2025-03-03 19:29:30,105 INFO L226 Difference]: Without dead ends: 843 [2025-03-03 19:29:30,108 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 898 GetRequests, 889 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=64, Unknown=0, NotChecked=0, Total=110 [2025-03-03 19:29:30,108 INFO L435 NwaCegarLoop]: 182 mSDtfsCounter, 326 mSDsluCounter, 217 mSDsCounter, 0 mSdLazyCounter, 392 mSolverCounterSat, 215 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 375 SdHoareTripleChecker+Valid, 399 SdHoareTripleChecker+Invalid, 607 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 215 IncrementalHoareTripleChecker+Valid, 392 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 19:29:30,109 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [375 Valid, 399 Invalid, 607 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [215 Valid, 392 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 19:29:30,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 843 states. [2025-03-03 19:29:30,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 843 to 803. [2025-03-03 19:29:30,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 803 states, 479 states have (on average 1.2421711899791232) internal successors, (595), 482 states have internal predecessors, (595), 300 states have call successors, (300), 23 states have call predecessors, (300), 23 states have return successors, (300), 297 states have call predecessors, (300), 300 states have call successors, (300) [2025-03-03 19:29:30,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 803 states to 803 states and 1195 transitions. [2025-03-03 19:29:30,199 INFO L78 Accepts]: Start accepts. Automaton has 803 states and 1195 transitions. Word has length 446 [2025-03-03 19:29:30,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 19:29:30,199 INFO L471 AbstractCegarLoop]: Abstraction has 803 states and 1195 transitions. [2025-03-03 19:29:30,199 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 14.875) internal successors, (119), 8 states have internal predecessors, (119), 3 states have call successors, (119), 2 states have call predecessors, (119), 4 states have return successors, (120), 3 states have call predecessors, (120), 3 states have call successors, (120) [2025-03-03 19:29:30,200 INFO L276 IsEmpty]: Start isEmpty. Operand 803 states and 1195 transitions. [2025-03-03 19:29:30,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 449 [2025-03-03 19:29:30,201 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 19:29:30,202 INFO L218 NwaCegarLoop]: trace histogram [73, 73, 73, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-03 19:29:30,209 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-03 19:29:30,406 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 19:29:30,406 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 19:29:30,406 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 19:29:30,407 INFO L85 PathProgramCache]: Analyzing trace with hash 331296368, now seen corresponding path program 1 times [2025-03-03 19:29:30,407 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 19:29:30,407 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1715473289] [2025-03-03 19:29:30,407 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:29:30,407 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 19:29:30,423 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 448 statements into 1 equivalence classes. [2025-03-03 19:29:30,498 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 448 of 448 statements. [2025-03-03 19:29:30,499 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:29:30,499 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 19:29:31,206 INFO L134 CoverageAnalysis]: Checked inductivity of 10512 backedges. 264 proven. 162 refuted. 0 times theorem prover too weak. 10086 trivial. 0 not checked. [2025-03-03 19:29:31,206 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 19:29:31,207 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1715473289] [2025-03-03 19:29:31,207 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1715473289] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 19:29:31,207 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [792795663] [2025-03-03 19:29:31,207 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:29:31,207 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 19:29:31,207 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 19:29:31,209 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 19:29:31,211 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-03 19:29:31,325 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 448 statements into 1 equivalence classes. [2025-03-03 19:29:31,437 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 448 of 448 statements. [2025-03-03 19:29:31,437 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:29:31,437 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 19:29:31,441 INFO L256 TraceCheckSpWp]: Trace formula consists of 976 conjuncts, 36 conjuncts are in the unsatisfiable core [2025-03-03 19:29:31,449 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 19:29:33,906 INFO L134 CoverageAnalysis]: Checked inductivity of 10512 backedges. 7503 proven. 381 refuted. 0 times theorem prover too weak. 2628 trivial. 0 not checked. [2025-03-03 19:29:33,906 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 19:29:38,497 INFO L134 CoverageAnalysis]: Checked inductivity of 10512 backedges. 381 proven. 258 refuted. 0 times theorem prover too weak. 9873 trivial. 0 not checked. [2025-03-03 19:29:38,497 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [792795663] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 19:29:38,497 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 19:29:38,497 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 21, 19] total 49 [2025-03-03 19:29:38,498 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1392351527] [2025-03-03 19:29:38,498 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 19:29:38,498 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 49 states [2025-03-03 19:29:38,498 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 19:29:38,499 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2025-03-03 19:29:38,500 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=397, Invalid=1955, Unknown=0, NotChecked=0, Total=2352 [2025-03-03 19:29:38,500 INFO L87 Difference]: Start difference. First operand 803 states and 1195 transitions. Second operand has 49 states, 48 states have (on average 4.125) internal successors, (198), 49 states have internal predecessors, (198), 13 states have call successors, (155), 7 states have call predecessors, (155), 13 states have return successors, (155), 12 states have call predecessors, (155), 13 states have call successors, (155) [2025-03-03 19:29:45,211 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2025-03-03 19:29:49,214 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2025-03-03 19:29:53,225 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2025-03-03 19:29:57,244 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2025-03-03 19:30:01,258 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2025-03-03 19:30:05,261 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2025-03-03 19:30:09,269 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2025-03-03 19:30:13,273 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2025-03-03 19:30:17,280 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2025-03-03 19:30:21,283 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2025-03-03 19:30:25,287 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2025-03-03 19:30:29,290 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2025-03-03 19:30:33,311 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2025-03-03 19:30:37,315 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2025-03-03 19:30:41,322 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers []