./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-66.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8fc3dc66 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_floatingpointinfluence_has-floats_file-66.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 647c2d42f3d9d1fd2cb1f6cf3d4c2bf6004a69ab4ab9379121b25a3c16e8049d --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 02:46:25,643 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 02:46:25,695 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-17 02:46:25,700 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 02:46:25,702 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 02:46:25,721 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 02:46:25,722 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 02:46:25,722 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 02:46:25,722 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 02:46:25,722 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 02:46:25,722 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 02:46:25,722 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 02:46:25,723 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 02:46:25,723 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 02:46:25,723 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 02:46:25,723 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 02:46:25,723 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 02:46:25,723 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 02:46:25,723 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 02:46:25,723 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 02:46:25,723 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 02:46:25,723 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 02:46:25,724 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 02:46:25,724 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 02:46:25,724 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 02:46:25,724 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 02:46:25,724 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 02:46:25,724 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 02:46:25,724 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 02:46:25,724 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 02:46:25,724 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 02:46:25,724 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 02:46:25,724 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 02:46:25,725 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 02:46:25,725 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 02:46:25,725 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 02:46:25,725 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 02:46:25,725 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 02:46:25,725 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-17 02:46:25,725 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 02:46:25,725 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 02:46:25,725 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 02:46:25,725 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 02:46:25,725 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 -> 647c2d42f3d9d1fd2cb1f6cf3d4c2bf6004a69ab4ab9379121b25a3c16e8049d [2025-03-17 02:46:25,985 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 02:46:25,995 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 02:46:25,998 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 02:46:25,999 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 02:46:25,999 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 02:46:26,001 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-66.i [2025-03-17 02:46:27,207 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cddd77d38/c6d4a0daf4ee4832a1e1252e55934890/FLAG71ea0ef04 [2025-03-17 02:46:27,470 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 02:46:27,471 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-66.i [2025-03-17 02:46:27,503 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cddd77d38/c6d4a0daf4ee4832a1e1252e55934890/FLAG71ea0ef04 [2025-03-17 02:46:27,793 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cddd77d38/c6d4a0daf4ee4832a1e1252e55934890 [2025-03-17 02:46:27,795 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 02:46:27,796 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 02:46:27,797 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 02:46:27,797 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 02:46:27,801 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 02:46:27,801 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 02:46:27" (1/1) ... [2025-03-17 02:46:27,802 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@df4c827 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:46:27, skipping insertion in model container [2025-03-17 02:46:27,802 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 02:46:27" (1/1) ... [2025-03-17 02:46:27,813 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 02:46:27,904 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_floatingpointinfluence_has-floats_file-66.i[917,930] [2025-03-17 02:46:27,934 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 02:46:27,944 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 02:46:27,953 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_floatingpointinfluence_has-floats_file-66.i[917,930] [2025-03-17 02:46:27,967 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 02:46:27,977 INFO L204 MainTranslator]: Completed translation [2025-03-17 02:46:27,978 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:46:27 WrapperNode [2025-03-17 02:46:27,978 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 02:46:27,979 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 02:46:27,979 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 02:46:27,979 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 02:46:27,983 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:46:27" (1/1) ... [2025-03-17 02:46:27,990 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:46:27" (1/1) ... [2025-03-17 02:46:28,028 INFO L138 Inliner]: procedures = 26, calls = 27, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 98 [2025-03-17 02:46:28,028 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 02:46:28,029 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 02:46:28,029 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 02:46:28,029 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 02:46:28,035 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:46:27" (1/1) ... [2025-03-17 02:46:28,035 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:46:27" (1/1) ... [2025-03-17 02:46:28,038 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:46:27" (1/1) ... [2025-03-17 02:46:28,052 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-17 02:46:28,052 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:46:27" (1/1) ... [2025-03-17 02:46:28,052 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:46:27" (1/1) ... [2025-03-17 02:46:28,057 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:46:27" (1/1) ... [2025-03-17 02:46:28,062 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:46:27" (1/1) ... [2025-03-17 02:46:28,064 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:46:27" (1/1) ... [2025-03-17 02:46:28,064 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:46:27" (1/1) ... [2025-03-17 02:46:28,066 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 02:46:28,067 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 02:46:28,067 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 02:46:28,067 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 02:46:28,068 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:46:27" (1/1) ... [2025-03-17 02:46:28,071 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 02:46:28,087 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 02:46:28,098 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-17 02:46:28,101 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-17 02:46:28,119 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 02:46:28,119 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-17 02:46:28,119 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-17 02:46:28,119 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-17 02:46:28,120 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 02:46:28,120 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 02:46:28,166 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 02:46:28,167 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 02:46:28,362 INFO L? ?]: Removed 10 outVars from TransFormulas that were not future-live. [2025-03-17 02:46:28,362 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 02:46:28,371 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 02:46:28,372 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 02:46:28,372 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 02:46:28 BoogieIcfgContainer [2025-03-17 02:46:28,372 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 02:46:28,374 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 02:46:28,375 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 02:46:28,378 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 02:46:28,378 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 02:46:27" (1/3) ... [2025-03-17 02:46:28,379 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@698cc13d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 02:46:28, skipping insertion in model container [2025-03-17 02:46:28,379 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:46:27" (2/3) ... [2025-03-17 02:46:28,380 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@698cc13d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 02:46:28, skipping insertion in model container [2025-03-17 02:46:28,380 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 02:46:28" (3/3) ... [2025-03-17 02:46:28,381 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_floatingpointinfluence_has-floats_file-66.i [2025-03-17 02:46:28,392 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 02:46:28,394 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_floatingpointinfluence_has-floats_file-66.i that has 2 procedures, 39 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-17 02:46:28,432 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 02:46:28,442 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;@5c6c3c5e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 02:46:28,442 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-17 02:46:28,446 INFO L276 IsEmpty]: Start isEmpty. Operand has 39 states, 22 states have (on average 1.4090909090909092) internal successors, (31), 23 states have internal predecessors, (31), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2025-03-17 02:46:28,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2025-03-17 02:46:28,452 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 02:46:28,453 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 02:46:28,453 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 02:46:28,457 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 02:46:28,457 INFO L85 PathProgramCache]: Analyzing trace with hash -939086153, now seen corresponding path program 1 times [2025-03-17 02:46:28,462 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 02:46:28,463 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [691946041] [2025-03-17 02:46:28,463 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 02:46:28,463 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 02:46:28,534 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 85 statements into 1 equivalence classes. [2025-03-17 02:46:28,555 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 85 of 85 statements. [2025-03-17 02:46:28,555 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 02:46:28,555 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 02:46:28,672 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 338 trivial. 0 not checked. [2025-03-17 02:46:28,673 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 02:46:28,673 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [691946041] [2025-03-17 02:46:28,673 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [691946041] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 02:46:28,673 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [828596247] [2025-03-17 02:46:28,675 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 02:46:28,675 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 02:46:28,675 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 02:46:28,677 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-17 02:46:28,679 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-17 02:46:28,740 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 85 statements into 1 equivalence classes. [2025-03-17 02:46:28,787 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 85 of 85 statements. [2025-03-17 02:46:28,788 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 02:46:28,788 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 02:46:28,790 INFO L256 TraceCheckSpWp]: Trace formula consists of 217 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-17 02:46:28,797 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 02:46:28,818 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 338 trivial. 0 not checked. [2025-03-17 02:46:28,818 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 02:46:28,819 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [828596247] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 02:46:28,819 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 02:46:28,819 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-17 02:46:28,821 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [744922778] [2025-03-17 02:46:28,821 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 02:46:28,824 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-17 02:46:28,824 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 02:46:28,839 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-17 02:46:28,840 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 02:46:28,842 INFO L87 Difference]: Start difference. First operand has 39 states, 22 states have (on average 1.4090909090909092) internal successors, (31), 23 states have internal predecessors, (31), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) Second operand has 2 states, 2 states have (on average 10.0) internal successors, (20), 2 states have internal predecessors, (20), 2 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2025-03-17 02:46:28,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 02:46:28,861 INFO L93 Difference]: Finished difference Result 75 states and 130 transitions. [2025-03-17 02:46:28,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-17 02:46:28,863 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 10.0) internal successors, (20), 2 states have internal predecessors, (20), 2 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) Word has length 85 [2025-03-17 02:46:28,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 02:46:28,866 INFO L225 Difference]: With dead ends: 75 [2025-03-17 02:46:28,867 INFO L226 Difference]: Without dead ends: 37 [2025-03-17 02:46:28,869 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 86 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-17 02:46:28,871 INFO L435 NwaCegarLoop]: 55 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 55 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 02:46:28,871 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 02:46:28,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2025-03-17 02:46:28,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2025-03-17 02:46:28,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 21 states have (on average 1.2857142857142858) internal successors, (27), 21 states have internal predecessors, (27), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2025-03-17 02:46:28,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 55 transitions. [2025-03-17 02:46:28,902 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 55 transitions. Word has length 85 [2025-03-17 02:46:28,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 02:46:28,904 INFO L471 AbstractCegarLoop]: Abstraction has 37 states and 55 transitions. [2025-03-17 02:46:28,904 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 10.0) internal successors, (20), 2 states have internal predecessors, (20), 2 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2025-03-17 02:46:28,904 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 55 transitions. [2025-03-17 02:46:28,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2025-03-17 02:46:28,907 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 02:46:28,907 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 02:46:28,914 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-17 02:46:29,109 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-17 02:46:29,109 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 02:46:29,110 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 02:46:29,110 INFO L85 PathProgramCache]: Analyzing trace with hash -1283219945, now seen corresponding path program 1 times [2025-03-17 02:46:29,110 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 02:46:29,110 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1318855462] [2025-03-17 02:46:29,110 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 02:46:29,111 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 02:46:29,131 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 85 statements into 1 equivalence classes. [2025-03-17 02:46:29,172 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 85 of 85 statements. [2025-03-17 02:46:29,173 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 02:46:29,173 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 02:46:29,521 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-03-17 02:46:29,521 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 02:46:29,521 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1318855462] [2025-03-17 02:46:29,522 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1318855462] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 02:46:29,522 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 02:46:29,522 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 02:46:29,522 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2051492706] [2025-03-17 02:46:29,522 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 02:46:29,522 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 02:46:29,522 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 02:46:29,523 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 02:46:29,523 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-17 02:46:29,523 INFO L87 Difference]: Start difference. First operand 37 states and 55 transitions. Second operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-03-17 02:46:29,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 02:46:29,579 INFO L93 Difference]: Finished difference Result 109 states and 163 transitions. [2025-03-17 02:46:29,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 02:46:29,580 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 85 [2025-03-17 02:46:29,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 02:46:29,581 INFO L225 Difference]: With dead ends: 109 [2025-03-17 02:46:29,582 INFO L226 Difference]: Without dead ends: 73 [2025-03-17 02:46:29,583 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-17 02:46:29,583 INFO L435 NwaCegarLoop]: 50 mSDtfsCounter, 46 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 137 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 02:46:29,584 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 137 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 02:46:29,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2025-03-17 02:46:29,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 70. [2025-03-17 02:46:29,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 39 states have (on average 1.2307692307692308) internal successors, (48), 39 states have internal predecessors, (48), 28 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2025-03-17 02:46:29,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 104 transitions. [2025-03-17 02:46:29,605 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 104 transitions. Word has length 85 [2025-03-17 02:46:29,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 02:46:29,605 INFO L471 AbstractCegarLoop]: Abstraction has 70 states and 104 transitions. [2025-03-17 02:46:29,605 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-03-17 02:46:29,605 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 104 transitions. [2025-03-17 02:46:29,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2025-03-17 02:46:29,608 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 02:46:29,608 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 02:46:29,608 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-17 02:46:29,608 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 02:46:29,609 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 02:46:29,609 INFO L85 PathProgramCache]: Analyzing trace with hash -1122280530, now seen corresponding path program 1 times [2025-03-17 02:46:29,609 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 02:46:29,609 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [408492430] [2025-03-17 02:46:29,609 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 02:46:29,609 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 02:46:29,627 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 86 statements into 1 equivalence classes. [2025-03-17 02:46:29,701 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 86 of 86 statements. [2025-03-17 02:46:29,701 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 02:46:29,701 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 02:46:32,487 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-03-17 02:46:32,488 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 02:46:32,488 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [408492430] [2025-03-17 02:46:32,488 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [408492430] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 02:46:32,489 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 02:46:32,489 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-17 02:46:32,489 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1949424615] [2025-03-17 02:46:32,489 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 02:46:32,490 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-17 02:46:32,490 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 02:46:32,491 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-17 02:46:32,491 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2025-03-17 02:46:32,491 INFO L87 Difference]: Start difference. First operand 70 states and 104 transitions. Second operand has 12 states, 12 states have (on average 1.5833333333333333) internal successors, (19), 11 states have internal predecessors, (19), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 3 states have call predecessors, (14), 2 states have call successors, (14) [2025-03-17 02:46:33,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 02:46:33,113 INFO L93 Difference]: Finished difference Result 122 states and 175 transitions. [2025-03-17 02:46:33,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-17 02:46:33,113 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 1.5833333333333333) internal successors, (19), 11 states have internal predecessors, (19), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 3 states have call predecessors, (14), 2 states have call successors, (14) Word has length 86 [2025-03-17 02:46:33,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 02:46:33,115 INFO L225 Difference]: With dead ends: 122 [2025-03-17 02:46:33,115 INFO L226 Difference]: Without dead ends: 120 [2025-03-17 02:46:33,115 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=93, Invalid=249, Unknown=0, NotChecked=0, Total=342 [2025-03-17 02:46:33,116 INFO L435 NwaCegarLoop]: 44 mSDtfsCounter, 99 mSDsluCounter, 157 mSDsCounter, 0 mSdLazyCounter, 189 mSolverCounterSat, 66 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 201 SdHoareTripleChecker+Invalid, 255 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 66 IncrementalHoareTripleChecker+Valid, 189 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-17 02:46:33,117 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [99 Valid, 201 Invalid, 255 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [66 Valid, 189 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-17 02:46:33,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2025-03-17 02:46:33,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 102. [2025-03-17 02:46:33,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 56 states have (on average 1.1964285714285714) internal successors, (67), 56 states have internal predecessors, (67), 42 states have call successors, (42), 3 states have call predecessors, (42), 3 states have return successors, (42), 42 states have call predecessors, (42), 42 states have call successors, (42) [2025-03-17 02:46:33,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 151 transitions. [2025-03-17 02:46:33,136 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 151 transitions. Word has length 86 [2025-03-17 02:46:33,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 02:46:33,137 INFO L471 AbstractCegarLoop]: Abstraction has 102 states and 151 transitions. [2025-03-17 02:46:33,137 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 1.5833333333333333) internal successors, (19), 11 states have internal predecessors, (19), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 3 states have call predecessors, (14), 2 states have call successors, (14) [2025-03-17 02:46:33,137 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 151 transitions. [2025-03-17 02:46:33,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2025-03-17 02:46:33,138 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 02:46:33,138 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 02:46:33,138 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-17 02:46:33,138 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 02:46:33,138 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 02:46:33,139 INFO L85 PathProgramCache]: Analyzing trace with hash -1122250739, now seen corresponding path program 1 times [2025-03-17 02:46:33,139 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 02:46:33,139 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [124308313] [2025-03-17 02:46:33,139 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 02:46:33,139 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 02:46:33,148 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 86 statements into 1 equivalence classes. [2025-03-17 02:46:33,173 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 86 of 86 statements. [2025-03-17 02:46:33,174 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 02:46:33,174 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 02:46:33,369 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-03-17 02:46:33,369 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 02:46:33,370 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [124308313] [2025-03-17 02:46:33,370 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [124308313] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 02:46:33,370 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 02:46:33,370 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-17 02:46:33,371 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1848263829] [2025-03-17 02:46:33,371 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 02:46:33,371 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 02:46:33,371 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 02:46:33,372 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 02:46:33,372 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-17 02:46:33,372 INFO L87 Difference]: Start difference. First operand 102 states and 151 transitions. Second operand has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-03-17 02:46:33,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 02:46:33,523 INFO L93 Difference]: Finished difference Result 183 states and 270 transitions. [2025-03-17 02:46:33,523 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 02:46:33,523 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 86 [2025-03-17 02:46:33,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 02:46:33,525 INFO L225 Difference]: With dead ends: 183 [2025-03-17 02:46:33,525 INFO L226 Difference]: Without dead ends: 114 [2025-03-17 02:46:33,525 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2025-03-17 02:46:33,527 INFO L435 NwaCegarLoop]: 50 mSDtfsCounter, 50 mSDsluCounter, 163 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 213 SdHoareTripleChecker+Invalid, 109 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 02:46:33,527 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 213 Invalid, 109 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 02:46:33,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2025-03-17 02:46:33,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 106. [2025-03-17 02:46:33,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 60 states have (on average 1.2166666666666666) internal successors, (73), 60 states have internal predecessors, (73), 42 states have call successors, (42), 3 states have call predecessors, (42), 3 states have return successors, (42), 42 states have call predecessors, (42), 42 states have call successors, (42) [2025-03-17 02:46:33,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 157 transitions. [2025-03-17 02:46:33,546 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 157 transitions. Word has length 86 [2025-03-17 02:46:33,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 02:46:33,547 INFO L471 AbstractCegarLoop]: Abstraction has 106 states and 157 transitions. [2025-03-17 02:46:33,547 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-03-17 02:46:33,547 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 157 transitions. [2025-03-17 02:46:33,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2025-03-17 02:46:33,548 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 02:46:33,548 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 02:46:33,548 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-17 02:46:33,548 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 02:46:33,549 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 02:46:33,549 INFO L85 PathProgramCache]: Analyzing trace with hash -1951632179, now seen corresponding path program 1 times [2025-03-17 02:46:33,549 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 02:46:33,549 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [123496554] [2025-03-17 02:46:33,549 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 02:46:33,549 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 02:46:33,554 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 86 statements into 1 equivalence classes. [2025-03-17 02:46:33,586 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 86 of 86 statements. [2025-03-17 02:46:33,586 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 02:46:33,586 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 02:46:35,155 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-03-17 02:46:35,156 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 02:46:35,156 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [123496554] [2025-03-17 02:46:35,156 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [123496554] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 02:46:35,156 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 02:46:35,156 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-17 02:46:35,156 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [779989881] [2025-03-17 02:46:35,156 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 02:46:35,156 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-17 02:46:35,156 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 02:46:35,157 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-17 02:46:35,157 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-03-17 02:46:35,157 INFO L87 Difference]: Start difference. First operand 106 states and 157 transitions. Second operand has 9 states, 9 states have (on average 2.111111111111111) internal successors, (19), 9 states have internal predecessors, (19), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-17 02:46:35,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 02:46:35,645 INFO L93 Difference]: Finished difference Result 146 states and 208 transitions. [2025-03-17 02:46:35,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-17 02:46:35,645 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.111111111111111) internal successors, (19), 9 states have internal predecessors, (19), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 86 [2025-03-17 02:46:35,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 02:46:35,647 INFO L225 Difference]: With dead ends: 146 [2025-03-17 02:46:35,647 INFO L226 Difference]: Without dead ends: 144 [2025-03-17 02:46:35,648 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=55, Invalid=155, Unknown=0, NotChecked=0, Total=210 [2025-03-17 02:46:35,649 INFO L435 NwaCegarLoop]: 48 mSDtfsCounter, 102 mSDsluCounter, 180 mSDsCounter, 0 mSdLazyCounter, 211 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 228 SdHoareTripleChecker+Invalid, 254 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 211 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 02:46:35,650 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [102 Valid, 228 Invalid, 254 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 211 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 02:46:35,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2025-03-17 02:46:35,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 113. [2025-03-17 02:46:35,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 67 states have (on average 1.2686567164179106) internal successors, (85), 67 states have internal predecessors, (85), 42 states have call successors, (42), 3 states have call predecessors, (42), 3 states have return successors, (42), 42 states have call predecessors, (42), 42 states have call successors, (42) [2025-03-17 02:46:35,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 169 transitions. [2025-03-17 02:46:35,673 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 169 transitions. Word has length 86 [2025-03-17 02:46:35,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 02:46:35,674 INFO L471 AbstractCegarLoop]: Abstraction has 113 states and 169 transitions. [2025-03-17 02:46:35,674 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.111111111111111) internal successors, (19), 9 states have internal predecessors, (19), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-17 02:46:35,674 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 169 transitions. [2025-03-17 02:46:35,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2025-03-17 02:46:35,675 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 02:46:35,675 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 02:46:35,675 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-17 02:46:35,675 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 02:46:35,676 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 02:46:35,676 INFO L85 PathProgramCache]: Analyzing trace with hash -1950708658, now seen corresponding path program 1 times [2025-03-17 02:46:35,676 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 02:46:35,676 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1214893120] [2025-03-17 02:46:35,676 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 02:46:35,676 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 02:46:35,681 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 86 statements into 1 equivalence classes. [2025-03-17 02:46:35,691 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 86 of 86 statements. [2025-03-17 02:46:35,691 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 02:46:35,691 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 02:46:35,762 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-03-17 02:46:35,763 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 02:46:35,763 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1214893120] [2025-03-17 02:46:35,763 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1214893120] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 02:46:35,763 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 02:46:35,763 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 02:46:35,763 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [154140706] [2025-03-17 02:46:35,763 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 02:46:35,764 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 02:46:35,764 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 02:46:35,764 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 02:46:35,764 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 02:46:35,765 INFO L87 Difference]: Start difference. First operand 113 states and 169 transitions. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-17 02:46:35,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 02:46:35,860 INFO L93 Difference]: Finished difference Result 186 states and 266 transitions. [2025-03-17 02:46:35,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 02:46:35,860 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 86 [2025-03-17 02:46:35,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 02:46:35,862 INFO L225 Difference]: With dead ends: 186 [2025-03-17 02:46:35,862 INFO L226 Difference]: Without dead ends: 148 [2025-03-17 02:46:35,862 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-17 02:46:35,863 INFO L435 NwaCegarLoop]: 87 mSDtfsCounter, 61 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 142 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 02:46:35,863 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 142 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 02:46:35,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2025-03-17 02:46:35,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 126. [2025-03-17 02:46:35,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 77 states have (on average 1.2077922077922079) internal successors, (93), 77 states have internal predecessors, (93), 42 states have call successors, (42), 6 states have call predecessors, (42), 6 states have return successors, (42), 42 states have call predecessors, (42), 42 states have call successors, (42) [2025-03-17 02:46:35,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 177 transitions. [2025-03-17 02:46:35,885 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 177 transitions. Word has length 86 [2025-03-17 02:46:35,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 02:46:35,886 INFO L471 AbstractCegarLoop]: Abstraction has 126 states and 177 transitions. [2025-03-17 02:46:35,886 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-17 02:46:35,886 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 177 transitions. [2025-03-17 02:46:35,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2025-03-17 02:46:35,890 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 02:46:35,890 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 02:46:35,890 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-17 02:46:35,890 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 02:46:35,890 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 02:46:35,890 INFO L85 PathProgramCache]: Analyzing trace with hash -1923003028, now seen corresponding path program 1 times [2025-03-17 02:46:35,890 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 02:46:35,890 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1294553416] [2025-03-17 02:46:35,890 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 02:46:35,891 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 02:46:35,896 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 86 statements into 1 equivalence classes. [2025-03-17 02:46:35,934 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 86 of 86 statements. [2025-03-17 02:46:35,934 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 02:46:35,934 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 02:46:38,167 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-03-17 02:46:38,167 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 02:46:38,167 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1294553416] [2025-03-17 02:46:38,167 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1294553416] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 02:46:38,167 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 02:46:38,168 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-17 02:46:38,168 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1348014550] [2025-03-17 02:46:38,169 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 02:46:38,169 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-17 02:46:38,169 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 02:46:38,169 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-17 02:46:38,170 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2025-03-17 02:46:38,170 INFO L87 Difference]: Start difference. First operand 126 states and 177 transitions. Second operand has 10 states, 10 states have (on average 1.9) internal successors, (19), 10 states have internal predecessors, (19), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-17 02:46:38,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 02:46:38,772 INFO L93 Difference]: Finished difference Result 200 states and 275 transitions. [2025-03-17 02:46:38,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-17 02:46:38,772 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 1.9) internal successors, (19), 10 states have internal predecessors, (19), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 86 [2025-03-17 02:46:38,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 02:46:38,773 INFO L225 Difference]: With dead ends: 200 [2025-03-17 02:46:38,774 INFO L226 Difference]: Without dead ends: 159 [2025-03-17 02:46:38,774 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=64, Invalid=208, Unknown=0, NotChecked=0, Total=272 [2025-03-17 02:46:38,774 INFO L435 NwaCegarLoop]: 50 mSDtfsCounter, 72 mSDsluCounter, 192 mSDsCounter, 0 mSdLazyCounter, 276 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 242 SdHoareTripleChecker+Invalid, 321 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 276 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-17 02:46:38,775 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 242 Invalid, 321 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 276 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-17 02:46:38,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2025-03-17 02:46:38,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 126. [2025-03-17 02:46:38,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 77 states have (on average 1.2077922077922079) internal successors, (93), 77 states have internal predecessors, (93), 42 states have call successors, (42), 6 states have call predecessors, (42), 6 states have return successors, (42), 42 states have call predecessors, (42), 42 states have call successors, (42) [2025-03-17 02:46:38,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 177 transitions. [2025-03-17 02:46:38,798 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 177 transitions. Word has length 86 [2025-03-17 02:46:38,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 02:46:38,799 INFO L471 AbstractCegarLoop]: Abstraction has 126 states and 177 transitions. [2025-03-17 02:46:38,799 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 1.9) internal successors, (19), 10 states have internal predecessors, (19), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-17 02:46:38,799 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 177 transitions. [2025-03-17 02:46:38,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2025-03-17 02:46:38,800 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 02:46:38,800 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 02:46:38,800 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-17 02:46:38,800 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 02:46:38,800 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 02:46:38,800 INFO L85 PathProgramCache]: Analyzing trace with hash -1922079507, now seen corresponding path program 1 times [2025-03-17 02:46:38,800 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 02:46:38,800 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1638902437] [2025-03-17 02:46:38,800 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 02:46:38,801 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 02:46:38,807 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 86 statements into 1 equivalence classes. [2025-03-17 02:46:38,835 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 86 of 86 statements. [2025-03-17 02:46:38,835 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 02:46:38,836 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 02:46:43,506 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-03-17 02:46:43,506 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 02:46:43,506 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1638902437] [2025-03-17 02:46:43,506 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1638902437] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 02:46:43,506 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 02:46:43,506 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-17 02:46:43,506 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [82531794] [2025-03-17 02:46:43,506 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 02:46:43,507 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-17 02:46:43,507 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 02:46:43,507 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-17 02:46:43,507 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2025-03-17 02:46:43,507 INFO L87 Difference]: Start difference. First operand 126 states and 177 transitions. Second operand has 10 states, 10 states have (on average 1.9) internal successors, (19), 10 states have internal predecessors, (19), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-17 02:46:43,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 02:46:43,920 INFO L93 Difference]: Finished difference Result 158 states and 210 transitions. [2025-03-17 02:46:43,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-17 02:46:43,921 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 1.9) internal successors, (19), 10 states have internal predecessors, (19), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 86 [2025-03-17 02:46:43,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 02:46:43,922 INFO L225 Difference]: With dead ends: 158 [2025-03-17 02:46:43,922 INFO L226 Difference]: Without dead ends: 156 [2025-03-17 02:46:43,922 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 8 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=64, Invalid=208, Unknown=0, NotChecked=0, Total=272 [2025-03-17 02:46:43,923 INFO L435 NwaCegarLoop]: 54 mSDtfsCounter, 67 mSDsluCounter, 207 mSDsCounter, 0 mSdLazyCounter, 259 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 261 SdHoareTripleChecker+Invalid, 302 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 259 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 02:46:43,923 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 261 Invalid, 302 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 259 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 02:46:43,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2025-03-17 02:46:43,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 125. [2025-03-17 02:46:43,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 76 states have (on average 1.1973684210526316) internal successors, (91), 76 states have internal predecessors, (91), 42 states have call successors, (42), 6 states have call predecessors, (42), 6 states have return successors, (42), 42 states have call predecessors, (42), 42 states have call successors, (42) [2025-03-17 02:46:43,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 175 transitions. [2025-03-17 02:46:43,935 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 175 transitions. Word has length 86 [2025-03-17 02:46:43,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 02:46:43,935 INFO L471 AbstractCegarLoop]: Abstraction has 125 states and 175 transitions. [2025-03-17 02:46:43,935 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 1.9) internal successors, (19), 10 states have internal predecessors, (19), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-17 02:46:43,935 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 175 transitions. [2025-03-17 02:46:43,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2025-03-17 02:46:43,936 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 02:46:43,936 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 02:46:43,936 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-17 02:46:43,936 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 02:46:43,937 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 02:46:43,937 INFO L85 PathProgramCache]: Analyzing trace with hash -368223304, now seen corresponding path program 1 times [2025-03-17 02:46:43,937 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 02:46:43,937 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [80261155] [2025-03-17 02:46:43,937 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 02:46:43,937 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 02:46:43,941 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 87 statements into 1 equivalence classes. [2025-03-17 02:46:43,960 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 87 of 87 statements. [2025-03-17 02:46:43,961 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 02:46:43,961 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 02:46:45,114 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-03-17 02:46:45,114 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 02:46:45,114 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [80261155] [2025-03-17 02:46:45,115 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [80261155] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 02:46:45,115 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 02:46:45,115 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-17 02:46:45,115 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2065381036] [2025-03-17 02:46:45,115 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 02:46:45,115 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-17 02:46:45,115 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 02:46:45,116 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-17 02:46:45,116 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2025-03-17 02:46:45,116 INFO L87 Difference]: Start difference. First operand 125 states and 175 transitions. Second operand has 10 states, 10 states have (on average 2.0) internal successors, (20), 10 states have internal predecessors, (20), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-17 02:46:45,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 02:46:45,544 INFO L93 Difference]: Finished difference Result 150 states and 203 transitions. [2025-03-17 02:46:45,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-17 02:46:45,544 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.0) internal successors, (20), 10 states have internal predecessors, (20), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 87 [2025-03-17 02:46:45,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 02:46:45,545 INFO L225 Difference]: With dead ends: 150 [2025-03-17 02:46:45,545 INFO L226 Difference]: Without dead ends: 148 [2025-03-17 02:46:45,546 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=78, Invalid=228, Unknown=0, NotChecked=0, Total=306 [2025-03-17 02:46:45,546 INFO L435 NwaCegarLoop]: 48 mSDtfsCounter, 60 mSDsluCounter, 172 mSDsCounter, 0 mSdLazyCounter, 213 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 220 SdHoareTripleChecker+Invalid, 256 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 213 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 02:46:45,546 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 220 Invalid, 256 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 213 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 02:46:45,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2025-03-17 02:46:45,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 127. [2025-03-17 02:46:45,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 78 states have (on average 1.205128205128205) internal successors, (94), 78 states have internal predecessors, (94), 42 states have call successors, (42), 6 states have call predecessors, (42), 6 states have return successors, (42), 42 states have call predecessors, (42), 42 states have call successors, (42) [2025-03-17 02:46:45,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 178 transitions. [2025-03-17 02:46:45,559 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 178 transitions. Word has length 87 [2025-03-17 02:46:45,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 02:46:45,559 INFO L471 AbstractCegarLoop]: Abstraction has 127 states and 178 transitions. [2025-03-17 02:46:45,559 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.0) internal successors, (20), 10 states have internal predecessors, (20), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-17 02:46:45,560 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 178 transitions. [2025-03-17 02:46:45,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2025-03-17 02:46:45,561 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 02:46:45,561 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 02:46:45,562 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-17 02:46:45,562 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 02:46:45,562 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 02:46:45,562 INFO L85 PathProgramCache]: Analyzing trace with hash 519280377, now seen corresponding path program 1 times [2025-03-17 02:46:45,562 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 02:46:45,562 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1321434963] [2025-03-17 02:46:45,562 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 02:46:45,562 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 02:46:45,566 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 87 statements into 1 equivalence classes. [2025-03-17 02:46:45,589 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 87 of 87 statements. [2025-03-17 02:46:45,589 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 02:46:45,589 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 02:46:47,069 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-03-17 02:46:47,069 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 02:46:47,069 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1321434963] [2025-03-17 02:46:47,069 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1321434963] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 02:46:47,069 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 02:46:47,069 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-17 02:46:47,069 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1237538205] [2025-03-17 02:46:47,070 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 02:46:47,070 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-17 02:46:47,070 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 02:46:47,070 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-17 02:46:47,070 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2025-03-17 02:46:47,070 INFO L87 Difference]: Start difference. First operand 127 states and 178 transitions. Second operand has 11 states, 11 states have (on average 1.8181818181818181) internal successors, (20), 11 states have internal predecessors, (20), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-17 02:46:47,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 02:46:47,593 INFO L93 Difference]: Finished difference Result 156 states and 208 transitions. [2025-03-17 02:46:47,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-17 02:46:47,593 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 1.8181818181818181) internal successors, (20), 11 states have internal predecessors, (20), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 87 [2025-03-17 02:46:47,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 02:46:47,595 INFO L225 Difference]: With dead ends: 156 [2025-03-17 02:46:47,595 INFO L226 Difference]: Without dead ends: 154 [2025-03-17 02:46:47,595 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=81, Invalid=261, Unknown=0, NotChecked=0, Total=342 [2025-03-17 02:46:47,595 INFO L435 NwaCegarLoop]: 50 mSDtfsCounter, 71 mSDsluCounter, 193 mSDsCounter, 0 mSdLazyCounter, 282 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 243 SdHoareTripleChecker+Invalid, 325 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 282 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 02:46:47,595 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 243 Invalid, 325 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 282 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 02:46:47,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2025-03-17 02:46:47,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 127. [2025-03-17 02:46:47,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 78 states have (on average 1.205128205128205) internal successors, (94), 78 states have internal predecessors, (94), 42 states have call successors, (42), 6 states have call predecessors, (42), 6 states have return successors, (42), 42 states have call predecessors, (42), 42 states have call successors, (42) [2025-03-17 02:46:47,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 178 transitions. [2025-03-17 02:46:47,610 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 178 transitions. Word has length 87 [2025-03-17 02:46:47,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 02:46:47,611 INFO L471 AbstractCegarLoop]: Abstraction has 127 states and 178 transitions. [2025-03-17 02:46:47,611 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 1.8181818181818181) internal successors, (20), 11 states have internal predecessors, (20), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-17 02:46:47,611 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 178 transitions. [2025-03-17 02:46:47,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2025-03-17 02:46:47,611 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 02:46:47,611 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 02:46:47,611 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-17 02:46:47,612 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 02:46:47,612 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 02:46:47,612 INFO L85 PathProgramCache]: Analyzing trace with hash 547909528, now seen corresponding path program 1 times [2025-03-17 02:46:47,612 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 02:46:47,612 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [49157934] [2025-03-17 02:46:47,612 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 02:46:47,612 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 02:46:47,619 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 87 statements into 1 equivalence classes. [2025-03-17 02:46:47,647 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 87 of 87 statements. [2025-03-17 02:46:47,647 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 02:46:47,648 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 02:47:01,790 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-03-17 02:47:01,790 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 02:47:01,790 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [49157934] [2025-03-17 02:47:01,790 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [49157934] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 02:47:01,790 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 02:47:01,791 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-17 02:47:01,791 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [443156661] [2025-03-17 02:47:01,791 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 02:47:01,791 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-17 02:47:01,791 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 02:47:01,791 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-17 02:47:01,791 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2025-03-17 02:47:01,791 INFO L87 Difference]: Start difference. First operand 127 states and 178 transitions. Second operand has 11 states, 11 states have (on average 1.8181818181818181) internal successors, (20), 11 states have internal predecessors, (20), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-17 02:47:02,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 02:47:02,258 INFO L93 Difference]: Finished difference Result 152 states and 204 transitions. [2025-03-17 02:47:02,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-17 02:47:02,258 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 1.8181818181818181) internal successors, (20), 11 states have internal predecessors, (20), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 87 [2025-03-17 02:47:02,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 02:47:02,259 INFO L225 Difference]: With dead ends: 152 [2025-03-17 02:47:02,259 INFO L226 Difference]: Without dead ends: 150 [2025-03-17 02:47:02,259 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=82, Invalid=260, Unknown=0, NotChecked=0, Total=342 [2025-03-17 02:47:02,260 INFO L435 NwaCegarLoop]: 50 mSDtfsCounter, 66 mSDsluCounter, 191 mSDsCounter, 0 mSdLazyCounter, 316 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 241 SdHoareTripleChecker+Invalid, 359 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 316 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-17 02:47:02,260 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 241 Invalid, 359 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 316 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-17 02:47:02,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2025-03-17 02:47:02,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 125. [2025-03-17 02:47:02,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 76 states have (on average 1.1973684210526316) internal successors, (91), 76 states have internal predecessors, (91), 42 states have call successors, (42), 6 states have call predecessors, (42), 6 states have return successors, (42), 42 states have call predecessors, (42), 42 states have call successors, (42) [2025-03-17 02:47:02,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 175 transitions. [2025-03-17 02:47:02,276 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 175 transitions. Word has length 87 [2025-03-17 02:47:02,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 02:47:02,276 INFO L471 AbstractCegarLoop]: Abstraction has 125 states and 175 transitions. [2025-03-17 02:47:02,276 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 1.8181818181818181) internal successors, (20), 11 states have internal predecessors, (20), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-17 02:47:02,277 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 175 transitions. [2025-03-17 02:47:02,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2025-03-17 02:47:02,278 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 02:47:02,278 INFO L218 NwaCegarLoop]: trace histogram [28, 28, 28, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 02:47:02,278 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-17 02:47:02,278 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 02:47:02,278 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 02:47:02,278 INFO L85 PathProgramCache]: Analyzing trace with hash 1178876091, now seen corresponding path program 1 times [2025-03-17 02:47:02,279 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 02:47:02,279 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2105132632] [2025-03-17 02:47:02,279 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 02:47:02,279 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 02:47:02,285 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 170 statements into 1 equivalence classes. [2025-03-17 02:47:02,328 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 170 of 170 statements. [2025-03-17 02:47:02,328 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 02:47:02,328 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 02:47:09,708 INFO L134 CoverageAnalysis]: Checked inductivity of 1539 backedges. 25 proven. 2 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2025-03-17 02:47:09,708 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 02:47:09,708 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2105132632] [2025-03-17 02:47:09,708 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2105132632] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 02:47:09,708 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [682016278] [2025-03-17 02:47:09,708 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 02:47:09,709 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 02:47:09,709 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 02:47:09,710 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-17 02:47:09,711 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-17 02:47:09,744 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 170 statements into 1 equivalence classes. [2025-03-17 02:47:09,773 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 170 of 170 statements. [2025-03-17 02:47:09,773 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 02:47:09,773 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 02:47:09,774 INFO L256 TraceCheckSpWp]: Trace formula consists of 384 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-17 02:47:09,782 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 02:47:09,922 INFO L134 CoverageAnalysis]: Checked inductivity of 1539 backedges. 785 proven. 33 refuted. 0 times theorem prover too weak. 721 trivial. 0 not checked. [2025-03-17 02:47:09,923 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 02:47:10,101 INFO L134 CoverageAnalysis]: Checked inductivity of 1539 backedges. 70 proven. 33 refuted. 0 times theorem prover too weak. 1436 trivial. 0 not checked. [2025-03-17 02:47:10,101 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [682016278] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 02:47:10,101 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 02:47:10,102 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 5, 5] total 15 [2025-03-17 02:47:10,102 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [564172928] [2025-03-17 02:47:10,102 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 02:47:10,103 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-17 02:47:10,103 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 02:47:10,103 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-17 02:47:10,104 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=164, Unknown=0, NotChecked=0, Total=210 [2025-03-17 02:47:10,104 INFO L87 Difference]: Start difference. First operand 125 states and 175 transitions. Second operand has 15 states, 15 states have (on average 4.4) internal successors, (66), 15 states have internal predecessors, (66), 4 states have call successors, (50), 2 states have call predecessors, (50), 4 states have return successors, (52), 4 states have call predecessors, (52), 4 states have call successors, (52) [2025-03-17 02:47:11,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 02:47:11,918 INFO L93 Difference]: Finished difference Result 257 states and 345 transitions. [2025-03-17 02:47:11,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2025-03-17 02:47:11,918 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 4.4) internal successors, (66), 15 states have internal predecessors, (66), 4 states have call successors, (50), 2 states have call predecessors, (50), 4 states have return successors, (52), 4 states have call predecessors, (52), 4 states have call successors, (52) Word has length 170 [2025-03-17 02:47:11,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 02:47:11,920 INFO L225 Difference]: With dead ends: 257 [2025-03-17 02:47:11,920 INFO L226 Difference]: Without dead ends: 214 [2025-03-17 02:47:11,921 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 381 GetRequests, 344 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 283 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=357, Invalid=1125, Unknown=0, NotChecked=0, Total=1482 [2025-03-17 02:47:11,921 INFO L435 NwaCegarLoop]: 55 mSDtfsCounter, 115 mSDsluCounter, 123 mSDsCounter, 0 mSdLazyCounter, 462 mSolverCounterSat, 68 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 178 SdHoareTripleChecker+Invalid, 530 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 462 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-17 02:47:11,921 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [115 Valid, 178 Invalid, 530 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 462 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-17 02:47:11,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2025-03-17 02:47:11,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 136. [2025-03-17 02:47:11,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136 states, 84 states have (on average 1.1547619047619047) internal successors, (97), 84 states have internal predecessors, (97), 42 states have call successors, (42), 9 states have call predecessors, (42), 9 states have return successors, (42), 42 states have call predecessors, (42), 42 states have call successors, (42) [2025-03-17 02:47:11,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 181 transitions. [2025-03-17 02:47:11,935 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 181 transitions. Word has length 170 [2025-03-17 02:47:11,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 02:47:11,936 INFO L471 AbstractCegarLoop]: Abstraction has 136 states and 181 transitions. [2025-03-17 02:47:11,936 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 4.4) internal successors, (66), 15 states have internal predecessors, (66), 4 states have call successors, (50), 2 states have call predecessors, (50), 4 states have return successors, (52), 4 states have call predecessors, (52), 4 states have call successors, (52) [2025-03-17 02:47:11,936 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 181 transitions. [2025-03-17 02:47:11,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2025-03-17 02:47:11,937 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 02:47:11,937 INFO L218 NwaCegarLoop]: trace histogram [28, 28, 28, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 02:47:11,944 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-17 02:47:12,137 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,SelfDestructingSolverStorable11 [2025-03-17 02:47:12,138 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 02:47:12,138 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 02:47:12,138 INFO L85 PathProgramCache]: Analyzing trace with hash 674655613, now seen corresponding path program 1 times [2025-03-17 02:47:12,138 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 02:47:12,138 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1625061624] [2025-03-17 02:47:12,139 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 02:47:12,139 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 02:47:12,144 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 172 statements into 1 equivalence classes. [2025-03-17 02:47:12,192 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 172 of 172 statements. [2025-03-17 02:47:12,192 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 02:47:12,192 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 02:47:13,959 INFO L134 CoverageAnalysis]: Checked inductivity of 1540 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 1513 trivial. 0 not checked. [2025-03-17 02:47:13,959 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 02:47:13,959 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1625061624] [2025-03-17 02:47:13,959 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1625061624] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 02:47:13,959 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [507476392] [2025-03-17 02:47:13,959 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 02:47:13,960 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 02:47:13,960 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 02:47:13,961 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-17 02:47:13,963 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-17 02:47:13,999 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 172 statements into 1 equivalence classes. [2025-03-17 02:47:14,042 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 172 of 172 statements. [2025-03-17 02:47:14,042 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 02:47:14,042 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 02:47:14,044 INFO L256 TraceCheckSpWp]: Trace formula consists of 386 conjuncts, 45 conjuncts are in the unsatisfiable core [2025-03-17 02:47:14,049 INFO L279 TraceCheckSpWp]: Computing forward predicates...