./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-56.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_no-floats_file-56.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 97d791cbaec134197a8e3d1f03f35ec97aa0c52c94b35e8b29d7fd873617c9b5 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 02:56:14,894 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 02:56:14,948 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-17 02:56:14,951 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 02:56:14,953 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 02:56:14,971 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 02:56:14,972 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 02:56:14,972 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 02:56:14,972 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 02:56:14,972 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 02:56:14,973 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 02:56:14,973 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 02:56:14,973 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 02:56:14,973 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 02:56:14,973 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 02:56:14,973 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 02:56:14,973 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 02:56:14,973 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 02:56:14,973 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 02:56:14,974 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 02:56:14,974 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 02:56:14,974 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 02:56:14,974 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 02:56:14,974 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 02:56:14,974 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 02:56:14,974 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 02:56:14,974 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 02:56:14,974 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 02:56:14,974 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 02:56:14,974 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 02:56:14,975 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 02:56:14,975 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 02:56:14,975 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 02:56:14,975 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 02:56:14,975 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 02:56:14,975 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 02:56:14,975 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 02:56:14,975 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 02:56:14,975 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-17 02:56:14,975 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 02:56:14,975 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 02:56:14,975 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 02:56:14,975 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 02:56:14,976 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 -> 97d791cbaec134197a8e3d1f03f35ec97aa0c52c94b35e8b29d7fd873617c9b5 [2025-03-17 02:56:15,228 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 02:56:15,237 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 02:56:15,239 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 02:56:15,240 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 02:56:15,241 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 02:56:15,242 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-56.i [2025-03-17 02:56:16,485 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/03137acbc/d4c168dd78a1417c84ae7d1888009937/FLAGfaeb43d5a [2025-03-17 02:56:16,723 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 02:56:16,723 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-56.i [2025-03-17 02:56:16,731 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/03137acbc/d4c168dd78a1417c84ae7d1888009937/FLAGfaeb43d5a [2025-03-17 02:56:17,054 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/03137acbc/d4c168dd78a1417c84ae7d1888009937 [2025-03-17 02:56:17,056 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 02:56:17,057 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 02:56:17,058 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 02:56:17,058 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 02:56:17,061 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 02:56:17,062 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 02:56:17" (1/1) ... [2025-03-17 02:56:17,062 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@33211a5a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:56:17, skipping insertion in model container [2025-03-17 02:56:17,062 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 02:56:17" (1/1) ... [2025-03-17 02:56:17,079 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 02:56:17,178 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_no-floats_file-56.i[916,929] [2025-03-17 02:56:17,222 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 02:56:17,230 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 02:56:17,242 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_no-floats_file-56.i[916,929] [2025-03-17 02:56:17,270 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 02:56:17,287 INFO L204 MainTranslator]: Completed translation [2025-03-17 02:56:17,287 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:56:17 WrapperNode [2025-03-17 02:56:17,287 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 02:56:17,289 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 02:56:17,289 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 02:56:17,290 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 02:56:17,294 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:56:17" (1/1) ... [2025-03-17 02:56:17,300 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:56:17" (1/1) ... [2025-03-17 02:56:17,320 INFO L138 Inliner]: procedures = 26, calls = 33, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 155 [2025-03-17 02:56:17,320 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 02:56:17,321 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 02:56:17,321 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 02:56:17,321 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 02:56:17,328 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:56:17" (1/1) ... [2025-03-17 02:56:17,328 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:56:17" (1/1) ... [2025-03-17 02:56:17,331 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:56:17" (1/1) ... [2025-03-17 02:56:17,347 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:56:17,347 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:56:17" (1/1) ... [2025-03-17 02:56:17,347 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:56:17" (1/1) ... [2025-03-17 02:56:17,356 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:56:17" (1/1) ... [2025-03-17 02:56:17,357 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:56:17" (1/1) ... [2025-03-17 02:56:17,358 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:56:17" (1/1) ... [2025-03-17 02:56:17,363 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:56:17" (1/1) ... [2025-03-17 02:56:17,365 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 02:56:17,366 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 02:56:17,366 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 02:56:17,366 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 02:56:17,368 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:56:17" (1/1) ... [2025-03-17 02:56:17,375 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 02:56:17,389 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 02:56:17,409 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:56:17,417 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:56:17,442 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 02:56:17,443 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-17 02:56:17,443 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-17 02:56:17,443 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-17 02:56:17,443 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 02:56:17,443 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 02:56:17,508 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 02:56:17,510 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 02:56:17,826 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L107: havoc property_#t~bitwise16#1;havoc property_#t~ite18#1;havoc property_#t~bitwise17#1;havoc property_#t~short19#1; [2025-03-17 02:56:17,853 INFO L? ?]: Removed 14 outVars from TransFormulas that were not future-live. [2025-03-17 02:56:17,853 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 02:56:17,871 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 02:56:17,873 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 02:56:17,873 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 02:56:17 BoogieIcfgContainer [2025-03-17 02:56:17,873 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 02:56:17,875 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 02:56:17,875 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 02:56:17,878 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 02:56:17,879 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 02:56:17" (1/3) ... [2025-03-17 02:56:17,879 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2819ab59 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 02:56:17, skipping insertion in model container [2025-03-17 02:56:17,880 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:56:17" (2/3) ... [2025-03-17 02:56:17,880 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2819ab59 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 02:56:17, skipping insertion in model container [2025-03-17 02:56:17,880 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 02:56:17" (3/3) ... [2025-03-17 02:56:17,881 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_floatingpointinfluence_no-floats_file-56.i [2025-03-17 02:56:17,893 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 02:56:17,894 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_floatingpointinfluence_no-floats_file-56.i that has 2 procedures, 67 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-17 02:56:17,941 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 02:56:17,949 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;@c714731, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 02:56:17,950 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-17 02:56:17,954 INFO L276 IsEmpty]: Start isEmpty. Operand has 67 states, 44 states have (on average 1.4090909090909092) internal successors, (62), 45 states have internal predecessors, (62), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2025-03-17 02:56:17,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2025-03-17 02:56:17,962 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 02:56:17,962 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:56:17,963 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 02:56:17,967 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 02:56:17,968 INFO L85 PathProgramCache]: Analyzing trace with hash -1005961693, now seen corresponding path program 1 times [2025-03-17 02:56:17,973 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 02:56:17,975 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [217733311] [2025-03-17 02:56:17,976 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 02:56:17,976 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 02:56:18,051 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 126 statements into 1 equivalence classes. [2025-03-17 02:56:18,073 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 126 of 126 statements. [2025-03-17 02:56:18,073 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 02:56:18,073 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 02:56:18,164 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 722 trivial. 0 not checked. [2025-03-17 02:56:18,164 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 02:56:18,164 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [217733311] [2025-03-17 02:56:18,165 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [217733311] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 02:56:18,165 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1092060853] [2025-03-17 02:56:18,165 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 02:56:18,165 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 02:56:18,165 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 02:56:18,167 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:56:18,169 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:56:18,242 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 126 statements into 1 equivalence classes. [2025-03-17 02:56:18,310 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 126 of 126 statements. [2025-03-17 02:56:18,310 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 02:56:18,310 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 02:56:18,314 INFO L256 TraceCheckSpWp]: Trace formula consists of 288 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-17 02:56:18,321 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 02:56:18,348 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 722 trivial. 0 not checked. [2025-03-17 02:56:18,348 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 02:56:18,349 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1092060853] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 02:56:18,349 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 02:56:18,349 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-17 02:56:18,350 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [863644656] [2025-03-17 02:56:18,351 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 02:56:18,354 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-17 02:56:18,354 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 02:56:18,369 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-17 02:56:18,370 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 02:56:18,371 INFO L87 Difference]: Start difference. First operand has 67 states, 44 states have (on average 1.4090909090909092) internal successors, (62), 45 states have internal predecessors, (62), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) Second operand has 2 states, 2 states have (on average 15.5) internal successors, (31), 2 states have internal predecessors, (31), 2 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) [2025-03-17 02:56:18,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 02:56:18,399 INFO L93 Difference]: Finished difference Result 131 states and 222 transitions. [2025-03-17 02:56:18,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-17 02:56:18,401 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 15.5) internal successors, (31), 2 states have internal predecessors, (31), 2 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) Word has length 126 [2025-03-17 02:56:18,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 02:56:18,408 INFO L225 Difference]: With dead ends: 131 [2025-03-17 02:56:18,408 INFO L226 Difference]: Without dead ends: 65 [2025-03-17 02:56:18,411 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 127 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:56:18,413 INFO L435 NwaCegarLoop]: 94 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 94 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 02:56:18,413 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 94 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 02:56:18,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2025-03-17 02:56:18,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2025-03-17 02:56:18,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 43 states have (on average 1.3488372093023255) internal successors, (58), 43 states have internal predecessors, (58), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2025-03-17 02:56:18,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 98 transitions. [2025-03-17 02:56:18,441 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 98 transitions. Word has length 126 [2025-03-17 02:56:18,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 02:56:18,441 INFO L471 AbstractCegarLoop]: Abstraction has 65 states and 98 transitions. [2025-03-17 02:56:18,441 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 15.5) internal successors, (31), 2 states have internal predecessors, (31), 2 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) [2025-03-17 02:56:18,442 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 98 transitions. [2025-03-17 02:56:18,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2025-03-17 02:56:18,444 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 02:56:18,445 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:56:18,451 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-17 02:56:18,649 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:56:18,649 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 02:56:18,650 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 02:56:18,650 INFO L85 PathProgramCache]: Analyzing trace with hash -1651772893, now seen corresponding path program 1 times [2025-03-17 02:56:18,650 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 02:56:18,650 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [572901462] [2025-03-17 02:56:18,650 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 02:56:18,651 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 02:56:18,673 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 126 statements into 1 equivalence classes. [2025-03-17 02:56:18,800 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 126 of 126 statements. [2025-03-17 02:56:18,800 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 02:56:18,801 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 02:56:30,121 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-03-17 02:56:30,121 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 02:56:30,121 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [572901462] [2025-03-17 02:56:30,121 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [572901462] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 02:56:30,121 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 02:56:30,122 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-17 02:56:30,122 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [401665922] [2025-03-17 02:56:30,122 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 02:56:30,123 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-17 02:56:30,123 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 02:56:30,123 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-17 02:56:30,124 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2025-03-17 02:56:30,124 INFO L87 Difference]: Start difference. First operand 65 states and 98 transitions. Second operand has 10 states, 10 states have (on average 2.9) internal successors, (29), 10 states have internal predecessors, (29), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-17 02:56:31,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 02:56:31,261 INFO L93 Difference]: Finished difference Result 344 states and 509 transitions. [2025-03-17 02:56:31,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-17 02:56:31,261 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.9) internal successors, (29), 10 states have internal predecessors, (29), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 126 [2025-03-17 02:56:31,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 02:56:31,263 INFO L225 Difference]: With dead ends: 344 [2025-03-17 02:56:31,264 INFO L226 Difference]: Without dead ends: 280 [2025-03-17 02:56:31,264 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=148, Invalid=314, Unknown=0, NotChecked=0, Total=462 [2025-03-17 02:56:31,268 INFO L435 NwaCegarLoop]: 116 mSDtfsCounter, 377 mSDsluCounter, 491 mSDsCounter, 0 mSdLazyCounter, 300 mSolverCounterSat, 74 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 377 SdHoareTripleChecker+Valid, 607 SdHoareTripleChecker+Invalid, 374 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 74 IncrementalHoareTripleChecker+Valid, 300 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-17 02:56:31,268 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [377 Valid, 607 Invalid, 374 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [74 Valid, 300 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-17 02:56:31,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 280 states. [2025-03-17 02:56:31,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 280 to 193. [2025-03-17 02:56:31,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 193 states, 150 states have (on average 1.46) internal successors, (219), 150 states have internal predecessors, (219), 40 states have call successors, (40), 2 states have call predecessors, (40), 2 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2025-03-17 02:56:31,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 299 transitions. [2025-03-17 02:56:31,297 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 299 transitions. Word has length 126 [2025-03-17 02:56:31,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 02:56:31,297 INFO L471 AbstractCegarLoop]: Abstraction has 193 states and 299 transitions. [2025-03-17 02:56:31,298 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.9) internal successors, (29), 10 states have internal predecessors, (29), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-17 02:56:31,298 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 299 transitions. [2025-03-17 02:56:31,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2025-03-17 02:56:31,299 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 02:56:31,299 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:56:31,299 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-17 02:56:31,300 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 02:56:31,300 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 02:56:31,300 INFO L85 PathProgramCache]: Analyzing trace with hash -1945175900, now seen corresponding path program 1 times [2025-03-17 02:56:31,300 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 02:56:31,300 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1880537198] [2025-03-17 02:56:31,300 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 02:56:31,301 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 02:56:31,309 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 126 statements into 1 equivalence classes. [2025-03-17 02:56:31,321 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 126 of 126 statements. [2025-03-17 02:56:31,322 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 02:56:31,322 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 02:56:31,374 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-03-17 02:56:31,375 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 02:56:31,375 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1880537198] [2025-03-17 02:56:31,376 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1880537198] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 02:56:31,376 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 02:56:31,376 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 02:56:31,376 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1536658709] [2025-03-17 02:56:31,376 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 02:56:31,377 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 02:56:31,377 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 02:56:31,377 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 02:56:31,377 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 02:56:31,378 INFO L87 Difference]: Start difference. First operand 193 states and 299 transitions. Second operand has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-17 02:56:31,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 02:56:31,403 INFO L93 Difference]: Finished difference Result 369 states and 569 transitions. [2025-03-17 02:56:31,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 02:56:31,403 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 126 [2025-03-17 02:56:31,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 02:56:31,405 INFO L225 Difference]: With dead ends: 369 [2025-03-17 02:56:31,405 INFO L226 Difference]: Without dead ends: 177 [2025-03-17 02:56:31,406 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 02:56:31,406 INFO L435 NwaCegarLoop]: 93 mSDtfsCounter, 0 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 176 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 02:56:31,406 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 176 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 02:56:31,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2025-03-17 02:56:31,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 177. [2025-03-17 02:56:31,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 177 states, 134 states have (on average 1.4104477611940298) internal successors, (189), 134 states have internal predecessors, (189), 40 states have call successors, (40), 2 states have call predecessors, (40), 2 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2025-03-17 02:56:31,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 269 transitions. [2025-03-17 02:56:31,431 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 269 transitions. Word has length 126 [2025-03-17 02:56:31,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 02:56:31,433 INFO L471 AbstractCegarLoop]: Abstraction has 177 states and 269 transitions. [2025-03-17 02:56:31,433 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-17 02:56:31,433 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 269 transitions. [2025-03-17 02:56:31,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2025-03-17 02:56:31,435 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 02:56:31,436 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:56:31,437 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-17 02:56:31,437 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 02:56:31,437 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 02:56:31,438 INFO L85 PathProgramCache]: Analyzing trace with hash -915230110, now seen corresponding path program 1 times [2025-03-17 02:56:31,438 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 02:56:31,438 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [310333608] [2025-03-17 02:56:31,438 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 02:56:31,438 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 02:56:31,445 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 127 statements into 1 equivalence classes. [2025-03-17 02:56:31,454 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 127 of 127 statements. [2025-03-17 02:56:31,454 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 02:56:31,454 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 02:56:31,477 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-03-17 02:56:31,477 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 02:56:31,478 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [310333608] [2025-03-17 02:56:31,478 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [310333608] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 02:56:31,478 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 02:56:31,478 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 02:56:31,478 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1377595769] [2025-03-17 02:56:31,478 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 02:56:31,478 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 02:56:31,478 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 02:56:31,479 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 02:56:31,479 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 02:56:31,479 INFO L87 Difference]: Start difference. First operand 177 states and 269 transitions. Second operand has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-17 02:56:31,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 02:56:31,506 INFO L93 Difference]: Finished difference Result 353 states and 537 transitions. [2025-03-17 02:56:31,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 02:56:31,508 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 127 [2025-03-17 02:56:31,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 02:56:31,509 INFO L225 Difference]: With dead ends: 353 [2025-03-17 02:56:31,509 INFO L226 Difference]: Without dead ends: 177 [2025-03-17 02:56:31,510 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 02:56:31,510 INFO L435 NwaCegarLoop]: 93 mSDtfsCounter, 0 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 176 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 02:56:31,511 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 176 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 02:56:31,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2025-03-17 02:56:31,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 177. [2025-03-17 02:56:31,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 177 states, 134 states have (on average 1.3955223880597014) internal successors, (187), 134 states have internal predecessors, (187), 40 states have call successors, (40), 2 states have call predecessors, (40), 2 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2025-03-17 02:56:31,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 267 transitions. [2025-03-17 02:56:31,528 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 267 transitions. Word has length 127 [2025-03-17 02:56:31,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 02:56:31,529 INFO L471 AbstractCegarLoop]: Abstraction has 177 states and 267 transitions. [2025-03-17 02:56:31,529 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-17 02:56:31,529 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 267 transitions. [2025-03-17 02:56:31,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2025-03-17 02:56:31,532 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 02:56:31,532 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:56:31,532 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-17 02:56:31,532 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 02:56:31,532 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 02:56:31,533 INFO L85 PathProgramCache]: Analyzing trace with hash -1208633117, now seen corresponding path program 1 times [2025-03-17 02:56:31,533 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 02:56:31,533 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1629893058] [2025-03-17 02:56:31,533 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 02:56:31,533 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 02:56:31,540 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 127 statements into 1 equivalence classes. [2025-03-17 02:56:31,549 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 127 of 127 statements. [2025-03-17 02:56:31,549 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 02:56:31,549 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 02:56:31,591 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-03-17 02:56:31,591 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 02:56:31,592 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1629893058] [2025-03-17 02:56:31,592 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1629893058] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 02:56:31,592 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 02:56:31,592 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 02:56:31,592 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [804254504] [2025-03-17 02:56:31,592 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 02:56:31,593 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 02:56:31,593 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 02:56:31,593 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 02:56:31,593 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 02:56:31,594 INFO L87 Difference]: Start difference. First operand 177 states and 267 transitions. Second operand has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-17 02:56:31,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 02:56:31,634 INFO L93 Difference]: Finished difference Result 386 states and 579 transitions. [2025-03-17 02:56:31,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 02:56:31,634 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 127 [2025-03-17 02:56:31,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 02:56:31,636 INFO L225 Difference]: With dead ends: 386 [2025-03-17 02:56:31,636 INFO L226 Difference]: Without dead ends: 210 [2025-03-17 02:56:31,637 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 02:56:31,637 INFO L435 NwaCegarLoop]: 112 mSDtfsCounter, 32 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 191 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:56:31,637 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 191 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 02:56:31,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2025-03-17 02:56:31,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 178. [2025-03-17 02:56:31,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 178 states, 135 states have (on average 1.385185185185185) internal successors, (187), 135 states have internal predecessors, (187), 40 states have call successors, (40), 2 states have call predecessors, (40), 2 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2025-03-17 02:56:31,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 267 transitions. [2025-03-17 02:56:31,647 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 267 transitions. Word has length 127 [2025-03-17 02:56:31,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 02:56:31,648 INFO L471 AbstractCegarLoop]: Abstraction has 178 states and 267 transitions. [2025-03-17 02:56:31,648 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-17 02:56:31,648 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 267 transitions. [2025-03-17 02:56:31,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2025-03-17 02:56:31,650 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 02:56:31,650 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:56:31,651 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-17 02:56:31,651 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 02:56:31,651 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 02:56:31,651 INFO L85 PathProgramCache]: Analyzing trace with hash 1887159219, now seen corresponding path program 1 times [2025-03-17 02:56:31,652 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 02:56:31,652 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [149744827] [2025-03-17 02:56:31,652 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 02:56:31,652 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 02:56:31,659 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 128 statements into 1 equivalence classes. [2025-03-17 02:56:31,683 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 128 of 128 statements. [2025-03-17 02:56:31,685 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 02:56:31,686 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 02:56:48,725 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-03-17 02:56:48,725 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 02:56:48,725 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [149744827] [2025-03-17 02:56:48,726 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [149744827] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 02:56:48,726 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 02:56:48,726 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-17 02:56:48,726 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1844434862] [2025-03-17 02:56:48,726 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 02:56:48,727 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 02:56:48,727 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 02:56:48,728 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 02:56:48,728 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-17 02:56:48,728 INFO L87 Difference]: Start difference. First operand 178 states and 267 transitions. Second operand has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 6 states have internal predecessors, (31), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-17 02:56:49,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 02:56:49,704 INFO L93 Difference]: Finished difference Result 303 states and 446 transitions. [2025-03-17 02:56:49,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 02:56:49,705 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 6 states have internal predecessors, (31), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 128 [2025-03-17 02:56:49,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 02:56:49,707 INFO L225 Difference]: With dead ends: 303 [2025-03-17 02:56:49,707 INFO L226 Difference]: Without dead ends: 226 [2025-03-17 02:56:49,708 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2025-03-17 02:56:49,708 INFO L435 NwaCegarLoop]: 108 mSDtfsCounter, 88 mSDsluCounter, 249 mSDsCounter, 0 mSdLazyCounter, 169 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 357 SdHoareTripleChecker+Invalid, 169 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 169 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-17 02:56:49,708 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [88 Valid, 357 Invalid, 169 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 169 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-17 02:56:49,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2025-03-17 02:56:49,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 192. [2025-03-17 02:56:49,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 192 states, 149 states have (on average 1.395973154362416) internal successors, (208), 149 states have internal predecessors, (208), 40 states have call successors, (40), 2 states have call predecessors, (40), 2 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2025-03-17 02:56:49,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 288 transitions. [2025-03-17 02:56:49,722 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 288 transitions. Word has length 128 [2025-03-17 02:56:49,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 02:56:49,723 INFO L471 AbstractCegarLoop]: Abstraction has 192 states and 288 transitions. [2025-03-17 02:56:49,723 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 6 states have internal predecessors, (31), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-17 02:56:49,723 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 288 transitions. [2025-03-17 02:56:49,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2025-03-17 02:56:49,724 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 02:56:49,724 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:56:49,725 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-17 02:56:49,725 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 02:56:49,725 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 02:56:49,726 INFO L85 PathProgramCache]: Analyzing trace with hash 1593756212, now seen corresponding path program 1 times [2025-03-17 02:56:49,726 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 02:56:49,726 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [988200090] [2025-03-17 02:56:49,726 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 02:56:49,726 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 02:56:49,732 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 128 statements into 1 equivalence classes. [2025-03-17 02:56:49,751 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 128 of 128 statements. [2025-03-17 02:56:49,751 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 02:56:49,752 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 02:56:54,972 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-03-17 02:56:54,973 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 02:56:54,973 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [988200090] [2025-03-17 02:56:54,973 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [988200090] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 02:56:54,973 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 02:56:54,973 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-17 02:56:54,974 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2080577626] [2025-03-17 02:56:54,974 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 02:56:54,974 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-17 02:56:54,974 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 02:56:54,975 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-17 02:56:54,975 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-17 02:56:54,975 INFO L87 Difference]: Start difference. First operand 192 states and 288 transitions. Second operand has 7 states, 7 states have (on average 4.428571428571429) internal successors, (31), 7 states have internal predecessors, (31), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-17 02:56:55,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 02:56:55,308 INFO L93 Difference]: Finished difference Result 442 states and 645 transitions. [2025-03-17 02:56:55,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-17 02:56:55,309 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.428571428571429) internal successors, (31), 7 states have internal predecessors, (31), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 128 [2025-03-17 02:56:55,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 02:56:55,310 INFO L225 Difference]: With dead ends: 442 [2025-03-17 02:56:55,310 INFO L226 Difference]: Without dead ends: 251 [2025-03-17 02:56:55,311 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2025-03-17 02:56:55,311 INFO L435 NwaCegarLoop]: 107 mSDtfsCounter, 131 mSDsluCounter, 179 mSDsCounter, 0 mSdLazyCounter, 144 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 131 SdHoareTripleChecker+Valid, 286 SdHoareTripleChecker+Invalid, 148 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 144 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 02:56:55,311 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [131 Valid, 286 Invalid, 148 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 144 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 02:56:55,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251 states. [2025-03-17 02:56:55,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251 to 197. [2025-03-17 02:56:55,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 197 states, 154 states have (on average 1.3831168831168832) internal successors, (213), 154 states have internal predecessors, (213), 40 states have call successors, (40), 2 states have call predecessors, (40), 2 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2025-03-17 02:56:55,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 293 transitions. [2025-03-17 02:56:55,321 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 293 transitions. Word has length 128 [2025-03-17 02:56:55,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 02:56:55,322 INFO L471 AbstractCegarLoop]: Abstraction has 197 states and 293 transitions. [2025-03-17 02:56:55,322 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.428571428571429) internal successors, (31), 7 states have internal predecessors, (31), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-17 02:56:55,322 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 293 transitions. [2025-03-17 02:56:55,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2025-03-17 02:56:55,323 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 02:56:55,323 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:56:55,323 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-17 02:56:55,323 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 02:56:55,323 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 02:56:55,324 INFO L85 PathProgramCache]: Analyzing trace with hash -1331996447, now seen corresponding path program 1 times [2025-03-17 02:56:55,324 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 02:56:55,324 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1655900916] [2025-03-17 02:56:55,324 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 02:56:55,324 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 02:56:55,328 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 128 statements into 1 equivalence classes. [2025-03-17 02:56:55,342 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 128 of 128 statements. [2025-03-17 02:56:55,342 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 02:56:55,342 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 02:57:03,452 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-03-17 02:57:03,452 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 02:57:03,452 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1655900916] [2025-03-17 02:57:03,452 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1655900916] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 02:57:03,452 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 02:57:03,456 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-17 02:57:03,456 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [426044136] [2025-03-17 02:57:03,456 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 02:57:03,456 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-17 02:57:03,456 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 02:57:03,457 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-17 02:57:03,457 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2025-03-17 02:57:03,457 INFO L87 Difference]: Start difference. First operand 197 states and 293 transitions. Second operand has 7 states, 7 states have (on average 4.428571428571429) internal successors, (31), 7 states have internal predecessors, (31), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-17 02:57:03,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 02:57:03,791 INFO L93 Difference]: Finished difference Result 338 states and 497 transitions. [2025-03-17 02:57:03,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 02:57:03,794 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.428571428571429) internal successors, (31), 7 states have internal predecessors, (31), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 128 [2025-03-17 02:57:03,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 02:57:03,796 INFO L225 Difference]: With dead ends: 338 [2025-03-17 02:57:03,796 INFO L226 Difference]: Without dead ends: 247 [2025-03-17 02:57:03,797 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2025-03-17 02:57:03,798 INFO L435 NwaCegarLoop]: 80 mSDtfsCounter, 106 mSDsluCounter, 236 mSDsCounter, 0 mSdLazyCounter, 205 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 316 SdHoareTripleChecker+Invalid, 205 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 205 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 02:57:03,798 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [106 Valid, 316 Invalid, 205 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 205 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 02:57:03,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247 states. [2025-03-17 02:57:03,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247 to 204. [2025-03-17 02:57:03,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 204 states, 161 states have (on average 1.4099378881987579) internal successors, (227), 161 states have internal predecessors, (227), 40 states have call successors, (40), 2 states have call predecessors, (40), 2 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2025-03-17 02:57:03,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 307 transitions. [2025-03-17 02:57:03,812 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 307 transitions. Word has length 128 [2025-03-17 02:57:03,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 02:57:03,812 INFO L471 AbstractCegarLoop]: Abstraction has 204 states and 307 transitions. [2025-03-17 02:57:03,812 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.428571428571429) internal successors, (31), 7 states have internal predecessors, (31), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-17 02:57:03,812 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 307 transitions. [2025-03-17 02:57:03,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2025-03-17 02:57:03,813 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 02:57:03,814 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:57:03,814 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-17 02:57:03,814 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 02:57:03,814 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 02:57:03,814 INFO L85 PathProgramCache]: Analyzing trace with hash 1100895772, now seen corresponding path program 1 times [2025-03-17 02:57:03,814 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 02:57:03,814 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [969084297] [2025-03-17 02:57:03,815 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 02:57:03,815 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 02:57:03,820 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 128 statements into 1 equivalence classes. [2025-03-17 02:57:03,832 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 128 of 128 statements. [2025-03-17 02:57:03,832 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 02:57:03,832 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 02:57:04,050 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-03-17 02:57:04,051 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 02:57:04,051 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [969084297] [2025-03-17 02:57:04,051 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [969084297] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 02:57:04,051 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 02:57:04,051 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-17 02:57:04,051 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [906713173] [2025-03-17 02:57:04,051 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 02:57:04,051 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-17 02:57:04,051 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 02:57:04,052 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-17 02:57:04,052 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-17 02:57:04,052 INFO L87 Difference]: Start difference. First operand 204 states and 307 transitions. Second operand has 8 states, 8 states have (on average 3.875) internal successors, (31), 8 states have internal predecessors, (31), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-17 02:57:04,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 02:57:04,267 INFO L93 Difference]: Finished difference Result 467 states and 674 transitions. [2025-03-17 02:57:04,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-17 02:57:04,267 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.875) internal successors, (31), 8 states have internal predecessors, (31), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 128 [2025-03-17 02:57:04,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 02:57:04,270 INFO L225 Difference]: With dead ends: 467 [2025-03-17 02:57:04,270 INFO L226 Difference]: Without dead ends: 465 [2025-03-17 02:57:04,271 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2025-03-17 02:57:04,271 INFO L435 NwaCegarLoop]: 85 mSDtfsCounter, 155 mSDsluCounter, 438 mSDsCounter, 0 mSdLazyCounter, 150 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 155 SdHoareTripleChecker+Valid, 523 SdHoareTripleChecker+Invalid, 186 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 150 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 02:57:04,271 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [155 Valid, 523 Invalid, 186 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 150 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 02:57:04,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 465 states. [2025-03-17 02:57:04,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 465 to 383. [2025-03-17 02:57:04,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 383 states, 306 states have (on average 1.3496732026143792) internal successors, (413), 308 states have internal predecessors, (413), 72 states have call successors, (72), 4 states have call predecessors, (72), 4 states have return successors, (72), 70 states have call predecessors, (72), 72 states have call successors, (72) [2025-03-17 02:57:04,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 383 states and 557 transitions. [2025-03-17 02:57:04,307 INFO L78 Accepts]: Start accepts. Automaton has 383 states and 557 transitions. Word has length 128 [2025-03-17 02:57:04,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 02:57:04,308 INFO L471 AbstractCegarLoop]: Abstraction has 383 states and 557 transitions. [2025-03-17 02:57:04,309 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.875) internal successors, (31), 8 states have internal predecessors, (31), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-17 02:57:04,310 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 557 transitions. [2025-03-17 02:57:04,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2025-03-17 02:57:04,311 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 02:57:04,311 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:57:04,311 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-17 02:57:04,311 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 02:57:04,312 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 02:57:04,312 INFO L85 PathProgramCache]: Analyzing trace with hash -1837555072, now seen corresponding path program 1 times [2025-03-17 02:57:04,312 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 02:57:04,313 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1093860489] [2025-03-17 02:57:04,313 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 02:57:04,313 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 02:57:04,318 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 128 statements into 1 equivalence classes. [2025-03-17 02:57:04,335 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 128 of 128 statements. [2025-03-17 02:57:04,336 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 02:57:04,336 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 02:57:12,139 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-03-17 02:57:12,139 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 02:57:12,139 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1093860489] [2025-03-17 02:57:12,139 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1093860489] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 02:57:12,139 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 02:57:12,139 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-17 02:57:12,139 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [834949029] [2025-03-17 02:57:12,139 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 02:57:12,139 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-17 02:57:12,139 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 02:57:12,140 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-17 02:57:12,140 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2025-03-17 02:57:12,140 INFO L87 Difference]: Start difference. First operand 383 states and 557 transitions. Second operand has 10 states, 10 states have (on average 3.1) internal successors, (31), 10 states have internal predecessors, (31), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-17 02:57:12,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 02:57:12,897 INFO L93 Difference]: Finished difference Result 787 states and 1135 transitions. [2025-03-17 02:57:12,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-17 02:57:12,898 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.1) internal successors, (31), 10 states have internal predecessors, (31), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 128 [2025-03-17 02:57:12,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 02:57:12,902 INFO L225 Difference]: With dead ends: 787 [2025-03-17 02:57:12,902 INFO L226 Difference]: Without dead ends: 405 [2025-03-17 02:57:12,905 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=64, Invalid=118, Unknown=0, NotChecked=0, Total=182 [2025-03-17 02:57:12,906 INFO L435 NwaCegarLoop]: 100 mSDtfsCounter, 145 mSDsluCounter, 305 mSDsCounter, 0 mSdLazyCounter, 500 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 145 SdHoareTripleChecker+Valid, 405 SdHoareTripleChecker+Invalid, 504 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 500 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-17 02:57:12,906 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [145 Valid, 405 Invalid, 504 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 500 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-17 02:57:12,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 405 states. [2025-03-17 02:57:12,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 405 to 375. [2025-03-17 02:57:12,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 375 states, 298 states have (on average 1.3523489932885906) internal successors, (403), 300 states have internal predecessors, (403), 72 states have call successors, (72), 4 states have call predecessors, (72), 4 states have return successors, (72), 70 states have call predecessors, (72), 72 states have call successors, (72) [2025-03-17 02:57:12,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 375 states to 375 states and 547 transitions. [2025-03-17 02:57:12,936 INFO L78 Accepts]: Start accepts. Automaton has 375 states and 547 transitions. Word has length 128 [2025-03-17 02:57:12,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 02:57:12,936 INFO L471 AbstractCegarLoop]: Abstraction has 375 states and 547 transitions. [2025-03-17 02:57:12,936 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.1) internal successors, (31), 10 states have internal predecessors, (31), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-17 02:57:12,936 INFO L276 IsEmpty]: Start isEmpty. Operand 375 states and 547 transitions. [2025-03-17 02:57:12,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2025-03-17 02:57:12,937 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 02:57:12,938 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:57:12,938 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-17 02:57:12,938 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 02:57:12,938 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 02:57:12,938 INFO L85 PathProgramCache]: Analyzing trace with hash -1581953290, now seen corresponding path program 1 times [2025-03-17 02:57:12,938 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 02:57:12,939 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1291505244] [2025-03-17 02:57:12,939 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 02:57:12,939 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 02:57:12,947 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 130 statements into 1 equivalence classes. [2025-03-17 02:57:12,962 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 130 of 130 statements. [2025-03-17 02:57:12,962 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 02:57:12,962 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 02:57:27,673 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-03-17 02:57:27,673 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 02:57:27,673 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1291505244] [2025-03-17 02:57:27,673 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1291505244] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 02:57:27,674 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 02:57:27,674 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-17 02:57:27,674 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [151065988] [2025-03-17 02:57:27,674 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 02:57:27,674 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-17 02:57:27,674 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 02:57:27,675 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-17 02:57:27,675 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2025-03-17 02:57:27,675 INFO L87 Difference]: Start difference. First operand 375 states and 547 transitions. Second operand has 10 states, 10 states have (on average 3.3) internal successors, (33), 10 states have internal predecessors, (33), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-17 02:57:29,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 02:57:29,770 INFO L93 Difference]: Finished difference Result 772 states and 1116 transitions. [2025-03-17 02:57:29,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-17 02:57:29,770 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.3) internal successors, (33), 10 states have internal predecessors, (33), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 130 [2025-03-17 02:57:29,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 02:57:29,775 INFO L225 Difference]: With dead ends: 772 [2025-03-17 02:57:29,775 INFO L226 Difference]: Without dead ends: 398 [2025-03-17 02:57:29,776 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=69, Invalid=141, Unknown=0, NotChecked=0, Total=210 [2025-03-17 02:57:29,777 INFO L435 NwaCegarLoop]: 131 mSDtfsCounter, 151 mSDsluCounter, 376 mSDsCounter, 0 mSdLazyCounter, 619 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 151 SdHoareTripleChecker+Valid, 507 SdHoareTripleChecker+Invalid, 623 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 619 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-17 02:57:29,777 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [151 Valid, 507 Invalid, 623 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 619 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-17 02:57:29,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 398 states. [2025-03-17 02:57:29,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 398 to 365. [2025-03-17 02:57:29,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 365 states, 288 states have (on average 1.3576388888888888) internal successors, (391), 290 states have internal predecessors, (391), 72 states have call successors, (72), 4 states have call predecessors, (72), 4 states have return successors, (72), 70 states have call predecessors, (72), 72 states have call successors, (72) [2025-03-17 02:57:29,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 365 states to 365 states and 535 transitions. [2025-03-17 02:57:29,801 INFO L78 Accepts]: Start accepts. Automaton has 365 states and 535 transitions. Word has length 130 [2025-03-17 02:57:29,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 02:57:29,801 INFO L471 AbstractCegarLoop]: Abstraction has 365 states and 535 transitions. [2025-03-17 02:57:29,801 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.3) internal successors, (33), 10 states have internal predecessors, (33), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-17 02:57:29,801 INFO L276 IsEmpty]: Start isEmpty. Operand 365 states and 535 transitions. [2025-03-17 02:57:29,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2025-03-17 02:57:29,804 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 02:57:29,804 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:57:29,804 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-17 02:57:29,804 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 02:57:29,804 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 02:57:29,804 INFO L85 PathProgramCache]: Analyzing trace with hash 965366425, now seen corresponding path program 1 times [2025-03-17 02:57:29,805 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 02:57:29,805 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [753475426] [2025-03-17 02:57:29,805 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 02:57:29,805 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 02:57:29,810 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 130 statements into 1 equivalence classes. [2025-03-17 02:57:29,824 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 130 of 130 statements. [2025-03-17 02:57:29,825 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 02:57:29,825 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 02:57:29,886 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-03-17 02:57:29,887 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 02:57:29,887 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [753475426] [2025-03-17 02:57:29,887 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [753475426] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 02:57:29,887 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 02:57:29,887 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 02:57:29,887 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1490064041] [2025-03-17 02:57:29,887 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 02:57:29,888 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 02:57:29,888 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 02:57:29,888 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 02:57:29,888 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 02:57:29,889 INFO L87 Difference]: Start difference. First operand 365 states and 535 transitions. Second operand has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-17 02:57:29,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 02:57:29,957 INFO L93 Difference]: Finished difference Result 637 states and 916 transitions. [2025-03-17 02:57:29,958 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 02:57:29,958 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 130 [2025-03-17 02:57:29,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 02:57:29,960 INFO L225 Difference]: With dead ends: 637 [2025-03-17 02:57:29,960 INFO L226 Difference]: Without dead ends: 439 [2025-03-17 02:57:29,961 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 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:57:29,961 INFO L435 NwaCegarLoop]: 102 mSDtfsCounter, 50 mSDsluCounter, 164 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 266 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 02:57:29,961 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 266 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 02:57:29,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 439 states. [2025-03-17 02:57:29,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 439 to 432. [2025-03-17 02:57:29,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 432 states, 345 states have (on average 1.3101449275362318) internal successors, (452), 349 states have internal predecessors, (452), 80 states have call successors, (80), 6 states have call predecessors, (80), 6 states have return successors, (80), 76 states have call predecessors, (80), 80 states have call successors, (80) [2025-03-17 02:57:29,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 432 states to 432 states and 612 transitions. [2025-03-17 02:57:29,982 INFO L78 Accepts]: Start accepts. Automaton has 432 states and 612 transitions. Word has length 130 [2025-03-17 02:57:29,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 02:57:29,982 INFO L471 AbstractCegarLoop]: Abstraction has 432 states and 612 transitions. [2025-03-17 02:57:29,982 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-17 02:57:29,982 INFO L276 IsEmpty]: Start isEmpty. Operand 432 states and 612 transitions. [2025-03-17 02:57:29,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2025-03-17 02:57:29,984 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 02:57:29,985 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:57:29,985 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-17 02:57:29,985 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 02:57:29,985 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 02:57:29,985 INFO L85 PathProgramCache]: Analyzing trace with hash -831584934, now seen corresponding path program 1 times [2025-03-17 02:57:29,985 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 02:57:29,985 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1661297997] [2025-03-17 02:57:29,985 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 02:57:29,985 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 02:57:29,993 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 130 statements into 1 equivalence classes. [2025-03-17 02:57:30,008 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 130 of 130 statements. [2025-03-17 02:57:30,009 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 02:57:30,009 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 02:57:30,215 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-03-17 02:57:30,215 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 02:57:30,215 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1661297997] [2025-03-17 02:57:30,216 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1661297997] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 02:57:30,216 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 02:57:30,216 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-17 02:57:30,216 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1559230029] [2025-03-17 02:57:30,216 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 02:57:30,216 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-17 02:57:30,216 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 02:57:30,217 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-17 02:57:30,217 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-17 02:57:30,217 INFO L87 Difference]: Start difference. First operand 432 states and 612 transitions. Second operand has 7 states, 7 states have (on average 4.714285714285714) internal successors, (33), 7 states have internal predecessors, (33), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-17 02:57:30,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 02:57:30,352 INFO L93 Difference]: Finished difference Result 450 states and 631 transitions. [2025-03-17 02:57:30,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-17 02:57:30,353 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.714285714285714) internal successors, (33), 7 states have internal predecessors, (33), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 130 [2025-03-17 02:57:30,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 02:57:30,356 INFO L225 Difference]: With dead ends: 450 [2025-03-17 02:57:30,356 INFO L226 Difference]: Without dead ends: 448 [2025-03-17 02:57:30,356 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2025-03-17 02:57:30,357 INFO L435 NwaCegarLoop]: 82 mSDtfsCounter, 66 mSDsluCounter, 400 mSDsCounter, 0 mSdLazyCounter, 103 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 482 SdHoareTripleChecker+Invalid, 105 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 02:57:30,357 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 482 Invalid, 105 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 103 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 02:57:30,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 448 states. [2025-03-17 02:57:30,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 448 to 394. [2025-03-17 02:57:30,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 394 states, 307 states have (on average 1.3192182410423452) internal successors, (405), 311 states have internal predecessors, (405), 80 states have call successors, (80), 6 states have call predecessors, (80), 6 states have return successors, (80), 76 states have call predecessors, (80), 80 states have call successors, (80) [2025-03-17 02:57:30,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 394 states and 565 transitions. [2025-03-17 02:57:30,386 INFO L78 Accepts]: Start accepts. Automaton has 394 states and 565 transitions. Word has length 130 [2025-03-17 02:57:30,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 02:57:30,387 INFO L471 AbstractCegarLoop]: Abstraction has 394 states and 565 transitions. [2025-03-17 02:57:30,387 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.714285714285714) internal successors, (33), 7 states have internal predecessors, (33), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-17 02:57:30,387 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states and 565 transitions. [2025-03-17 02:57:30,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2025-03-17 02:57:30,389 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 02:57:30,389 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:57:30,389 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-17 02:57:30,389 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 02:57:30,390 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 02:57:30,390 INFO L85 PathProgramCache]: Analyzing trace with hash 682836828, now seen corresponding path program 1 times [2025-03-17 02:57:30,390 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 02:57:30,390 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1648260872] [2025-03-17 02:57:30,390 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 02:57:30,390 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 02:57:30,400 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 130 statements into 1 equivalence classes. [2025-03-17 02:57:30,406 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 130 of 130 statements. [2025-03-17 02:57:30,406 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 02:57:30,406 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 02:57:30,455 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-03-17 02:57:30,455 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 02:57:30,455 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1648260872] [2025-03-17 02:57:30,455 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1648260872] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 02:57:30,455 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 02:57:30,455 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 02:57:30,455 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1124605270] [2025-03-17 02:57:30,455 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 02:57:30,456 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 02:57:30,456 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 02:57:30,456 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 02:57:30,456 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 02:57:30,456 INFO L87 Difference]: Start difference. First operand 394 states and 565 transitions. Second operand has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-17 02:57:30,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 02:57:30,516 INFO L93 Difference]: Finished difference Result 981 states and 1396 transitions. [2025-03-17 02:57:30,516 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 02:57:30,517 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 130 [2025-03-17 02:57:30,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 02:57:30,520 INFO L225 Difference]: With dead ends: 981 [2025-03-17 02:57:30,520 INFO L226 Difference]: Without dead ends: 588 [2025-03-17 02:57:30,521 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 02:57:30,522 INFO L435 NwaCegarLoop]: 93 mSDtfsCounter, 44 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 178 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 02:57:30,522 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 178 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 02:57:30,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 588 states. [2025-03-17 02:57:30,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 588 to 576. [2025-03-17 02:57:30,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 576 states, 435 states have (on average 1.2873563218390804) internal successors, (560), 445 states have internal predecessors, (560), 128 states have call successors, (128), 12 states have call predecessors, (128), 12 states have return successors, (128), 118 states have call predecessors, (128), 128 states have call successors, (128) [2025-03-17 02:57:30,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 576 states to 576 states and 816 transitions. [2025-03-17 02:57:30,577 INFO L78 Accepts]: Start accepts. Automaton has 576 states and 816 transitions. Word has length 130 [2025-03-17 02:57:30,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 02:57:30,578 INFO L471 AbstractCegarLoop]: Abstraction has 576 states and 816 transitions. [2025-03-17 02:57:30,578 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-17 02:57:30,578 INFO L276 IsEmpty]: Start isEmpty. Operand 576 states and 816 transitions. [2025-03-17 02:57:30,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2025-03-17 02:57:30,579 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 02:57:30,579 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:57:30,579 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-17 02:57:30,579 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 02:57:30,580 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 02:57:30,580 INFO L85 PathProgramCache]: Analyzing trace with hash -1693784260, now seen corresponding path program 1 times [2025-03-17 02:57:30,580 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 02:57:30,580 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [914532595] [2025-03-17 02:57:30,580 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 02:57:30,580 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 02:57:30,585 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 130 statements into 1 equivalence classes. [2025-03-17 02:57:30,589 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 130 of 130 statements. [2025-03-17 02:57:30,590 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 02:57:30,590 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 02:57:30,637 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-03-17 02:57:30,638 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 02:57:30,638 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [914532595] [2025-03-17 02:57:30,638 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [914532595] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 02:57:30,638 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 02:57:30,638 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 02:57:30,640 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1151355383] [2025-03-17 02:57:30,640 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 02:57:30,640 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 02:57:30,640 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 02:57:30,640 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 02:57:30,641 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 02:57:30,641 INFO L87 Difference]: Start difference. First operand 576 states and 816 transitions. Second operand has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-17 02:57:30,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 02:57:30,699 INFO L93 Difference]: Finished difference Result 1108 states and 1559 transitions. [2025-03-17 02:57:30,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 02:57:30,700 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 130 [2025-03-17 02:57:30,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 02:57:30,707 INFO L225 Difference]: With dead ends: 1108 [2025-03-17 02:57:30,707 INFO L226 Difference]: Without dead ends: 533 [2025-03-17 02:57:30,711 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 02:57:30,711 INFO L435 NwaCegarLoop]: 140 mSDtfsCounter, 53 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 216 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 02:57:30,712 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 216 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 02:57:30,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 533 states. [2025-03-17 02:57:30,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 533 to 472. [2025-03-17 02:57:30,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 472 states, 381 states have (on average 1.288713910761155) internal successors, (491), 385 states have internal predecessors, (491), 80 states have call successors, (80), 10 states have call predecessors, (80), 10 states have return successors, (80), 76 states have call predecessors, (80), 80 states have call successors, (80) [2025-03-17 02:57:30,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 472 states to 472 states and 651 transitions. [2025-03-17 02:57:30,750 INFO L78 Accepts]: Start accepts. Automaton has 472 states and 651 transitions. Word has length 130 [2025-03-17 02:57:30,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 02:57:30,750 INFO L471 AbstractCegarLoop]: Abstraction has 472 states and 651 transitions. [2025-03-17 02:57:30,750 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-17 02:57:30,750 INFO L276 IsEmpty]: Start isEmpty. Operand 472 states and 651 transitions. [2025-03-17 02:57:30,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2025-03-17 02:57:30,752 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 02:57:30,753 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:57:30,753 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-17 02:57:30,753 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 02:57:30,754 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 02:57:30,754 INFO L85 PathProgramCache]: Analyzing trace with hash -650113924, now seen corresponding path program 1 times [2025-03-17 02:57:30,754 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 02:57:30,754 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [476705121] [2025-03-17 02:57:30,754 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 02:57:30,754 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 02:57:30,762 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 132 statements into 1 equivalence classes. [2025-03-17 02:57:30,788 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 132 of 132 statements. [2025-03-17 02:57:30,788 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 02:57:30,788 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 02:57:31,049 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-03-17 02:57:31,049 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 02:57:31,049 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [476705121] [2025-03-17 02:57:31,049 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [476705121] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 02:57:31,050 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 02:57:31,050 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-17 02:57:31,050 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [375773161] [2025-03-17 02:57:31,050 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 02:57:31,050 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-17 02:57:31,050 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 02:57:31,050 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-17 02:57:31,050 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2025-03-17 02:57:31,051 INFO L87 Difference]: Start difference. First operand 472 states and 651 transitions. Second operand has 10 states, 10 states have (on average 3.5) internal successors, (35), 10 states have internal predecessors, (35), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-17 02:57:31,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 02:57:31,311 INFO L93 Difference]: Finished difference Result 625 states and 854 transitions. [2025-03-17 02:57:31,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-17 02:57:31,312 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.5) internal successors, (35), 10 states have internal predecessors, (35), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 132 [2025-03-17 02:57:31,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 02:57:31,315 INFO L225 Difference]: With dead ends: 625 [2025-03-17 02:57:31,316 INFO L226 Difference]: Without dead ends: 623 [2025-03-17 02:57:31,316 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=167, Unknown=0, NotChecked=0, Total=210 [2025-03-17 02:57:31,317 INFO L435 NwaCegarLoop]: 123 mSDtfsCounter, 46 mSDsluCounter, 779 mSDsCounter, 0 mSdLazyCounter, 295 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 902 SdHoareTripleChecker+Invalid, 297 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 295 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 02:57:31,317 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 902 Invalid, 297 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 295 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 02:57:31,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 623 states. [2025-03-17 02:57:31,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 623 to 619. [2025-03-17 02:57:31,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 619 states, 505 states have (on average 1.2811881188118812) internal successors, (647), 512 states have internal predecessors, (647), 100 states have call successors, (100), 13 states have call predecessors, (100), 13 states have return successors, (100), 93 states have call predecessors, (100), 100 states have call successors, (100) [2025-03-17 02:57:31,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 619 states to 619 states and 847 transitions. [2025-03-17 02:57:31,351 INFO L78 Accepts]: Start accepts. Automaton has 619 states and 847 transitions. Word has length 132 [2025-03-17 02:57:31,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 02:57:31,351 INFO L471 AbstractCegarLoop]: Abstraction has 619 states and 847 transitions. [2025-03-17 02:57:31,351 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.5) internal successors, (35), 10 states have internal predecessors, (35), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-17 02:57:31,351 INFO L276 IsEmpty]: Start isEmpty. Operand 619 states and 847 transitions. [2025-03-17 02:57:31,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2025-03-17 02:57:31,352 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 02:57:31,353 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:57:31,353 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-17 02:57:31,353 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 02:57:31,353 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 02:57:31,353 INFO L85 PathProgramCache]: Analyzing trace with hash -1366423036, now seen corresponding path program 1 times [2025-03-17 02:57:31,353 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 02:57:31,353 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [554393665] [2025-03-17 02:57:31,354 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 02:57:31,354 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 02:57:31,361 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 133 statements into 1 equivalence classes. [2025-03-17 02:57:31,372 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 133 of 133 statements. [2025-03-17 02:57:31,373 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 02:57:31,373 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 02:57:31,692 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-03-17 02:57:31,692 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 02:57:31,693 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [554393665] [2025-03-17 02:57:31,693 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [554393665] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 02:57:31,693 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 02:57:31,693 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-17 02:57:31,693 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1850750418] [2025-03-17 02:57:31,693 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 02:57:31,693 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-17 02:57:31,694 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 02:57:31,694 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-17 02:57:31,694 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2025-03-17 02:57:31,695 INFO L87 Difference]: Start difference. First operand 619 states and 847 transitions. Second operand has 11 states, 11 states have (on average 3.272727272727273) internal successors, (36), 11 states have internal predecessors, (36), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-17 02:57:32,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 02:57:32,106 INFO L93 Difference]: Finished difference Result 917 states and 1220 transitions. [2025-03-17 02:57:32,106 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-17 02:57:32,106 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.272727272727273) internal successors, (36), 11 states have internal predecessors, (36), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 133 [2025-03-17 02:57:32,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 02:57:32,113 INFO L225 Difference]: With dead ends: 917 [2025-03-17 02:57:32,113 INFO L226 Difference]: Without dead ends: 915 [2025-03-17 02:57:32,114 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=52, Invalid=188, Unknown=0, NotChecked=0, Total=240 [2025-03-17 02:57:32,114 INFO L435 NwaCegarLoop]: 127 mSDtfsCounter, 119 mSDsluCounter, 907 mSDsCounter, 0 mSdLazyCounter, 442 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 1034 SdHoareTripleChecker+Invalid, 444 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 442 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-17 02:57:32,114 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [119 Valid, 1034 Invalid, 444 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 442 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-17 02:57:32,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 915 states. [2025-03-17 02:57:32,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 915 to 759. [2025-03-17 02:57:32,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 759 states, 625 states have (on average 1.2672) internal successors, (792), 634 states have internal predecessors, (792), 116 states have call successors, (116), 17 states have call predecessors, (116), 17 states have return successors, (116), 107 states have call predecessors, (116), 116 states have call successors, (116) [2025-03-17 02:57:32,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 759 states to 759 states and 1024 transitions. [2025-03-17 02:57:32,158 INFO L78 Accepts]: Start accepts. Automaton has 759 states and 1024 transitions. Word has length 133 [2025-03-17 02:57:32,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 02:57:32,158 INFO L471 AbstractCegarLoop]: Abstraction has 759 states and 1024 transitions. [2025-03-17 02:57:32,158 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.272727272727273) internal successors, (36), 11 states have internal predecessors, (36), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-17 02:57:32,158 INFO L276 IsEmpty]: Start isEmpty. Operand 759 states and 1024 transitions. [2025-03-17 02:57:32,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2025-03-17 02:57:32,161 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 02:57:32,161 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:57:32,161 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-17 02:57:32,161 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 02:57:32,161 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 02:57:32,161 INFO L85 PathProgramCache]: Analyzing trace with hash 141128773, now seen corresponding path program 1 times [2025-03-17 02:57:32,161 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 02:57:32,162 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [963773859] [2025-03-17 02:57:32,162 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 02:57:32,162 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 02:57:32,168 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 133 statements into 1 equivalence classes. [2025-03-17 02:57:32,173 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 133 of 133 statements. [2025-03-17 02:57:32,174 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 02:57:32,174 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 02:57:32,219 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-03-17 02:57:32,220 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 02:57:32,220 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [963773859] [2025-03-17 02:57:32,220 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [963773859] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 02:57:32,220 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 02:57:32,220 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 02:57:32,220 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [707140239] [2025-03-17 02:57:32,220 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 02:57:32,220 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 02:57:32,220 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 02:57:32,221 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 02:57:32,221 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 02:57:32,221 INFO L87 Difference]: Start difference. First operand 759 states and 1024 transitions. Second operand has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-17 02:57:32,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 02:57:32,294 INFO L93 Difference]: Finished difference Result 1674 states and 2279 transitions. [2025-03-17 02:57:32,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 02:57:32,295 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 133 [2025-03-17 02:57:32,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 02:57:32,300 INFO L225 Difference]: With dead ends: 1674 [2025-03-17 02:57:32,300 INFO L226 Difference]: Without dead ends: 916 [2025-03-17 02:57:32,302 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 02:57:32,303 INFO L435 NwaCegarLoop]: 179 mSDtfsCounter, 89 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 260 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 02:57:32,303 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [89 Valid, 260 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 02:57:32,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 916 states. [2025-03-17 02:57:32,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 916 to 824. [2025-03-17 02:57:32,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 824 states, 661 states have (on average 1.2344931921331317) internal successors, (816), 673 states have internal predecessors, (816), 140 states have call successors, (140), 22 states have call predecessors, (140), 22 states have return successors, (140), 128 states have call predecessors, (140), 140 states have call successors, (140) [2025-03-17 02:57:32,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 824 states to 824 states and 1096 transitions. [2025-03-17 02:57:32,360 INFO L78 Accepts]: Start accepts. Automaton has 824 states and 1096 transitions. Word has length 133 [2025-03-17 02:57:32,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 02:57:32,361 INFO L471 AbstractCegarLoop]: Abstraction has 824 states and 1096 transitions. [2025-03-17 02:57:32,361 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-17 02:57:32,361 INFO L276 IsEmpty]: Start isEmpty. Operand 824 states and 1096 transitions. [2025-03-17 02:57:32,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2025-03-17 02:57:32,363 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 02:57:32,363 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:57:32,363 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-17 02:57:32,363 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 02:57:32,363 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 02:57:32,363 INFO L85 PathProgramCache]: Analyzing trace with hash -675597028, now seen corresponding path program 1 times [2025-03-17 02:57:32,364 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 02:57:32,364 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2043854582] [2025-03-17 02:57:32,364 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 02:57:32,364 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 02:57:32,384 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 135 statements into 1 equivalence classes. [2025-03-17 02:57:32,390 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 135 of 135 statements. [2025-03-17 02:57:32,391 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 02:57:32,391 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 02:57:32,438 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-03-17 02:57:32,439 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 02:57:32,439 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2043854582] [2025-03-17 02:57:32,439 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2043854582] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 02:57:32,439 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 02:57:32,439 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 02:57:32,439 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1167217616] [2025-03-17 02:57:32,440 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 02:57:32,441 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 02:57:32,441 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 02:57:32,441 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 02:57:32,441 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-17 02:57:32,442 INFO L87 Difference]: Start difference. First operand 824 states and 1096 transitions. Second operand has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-17 02:57:32,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 02:57:32,576 INFO L93 Difference]: Finished difference Result 1956 states and 2559 transitions. [2025-03-17 02:57:32,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 02:57:32,577 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 135 [2025-03-17 02:57:32,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 02:57:32,584 INFO L225 Difference]: With dead ends: 1956 [2025-03-17 02:57:32,584 INFO L226 Difference]: Without dead ends: 1133 [2025-03-17 02:57:32,587 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 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:57:32,588 INFO L435 NwaCegarLoop]: 141 mSDtfsCounter, 50 mSDsluCounter, 180 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 321 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 02:57:32,588 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 321 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 02:57:32,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1133 states. [2025-03-17 02:57:32,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1133 to 925. [2025-03-17 02:57:32,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 925 states, 762 states have (on average 1.236220472440945) internal successors, (942), 774 states have internal predecessors, (942), 140 states have call successors, (140), 22 states have call predecessors, (140), 22 states have return successors, (140), 128 states have call predecessors, (140), 140 states have call successors, (140) [2025-03-17 02:57:32,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 925 states to 925 states and 1222 transitions. [2025-03-17 02:57:32,666 INFO L78 Accepts]: Start accepts. Automaton has 925 states and 1222 transitions. Word has length 135 [2025-03-17 02:57:32,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 02:57:32,667 INFO L471 AbstractCegarLoop]: Abstraction has 925 states and 1222 transitions. [2025-03-17 02:57:32,667 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-17 02:57:32,668 INFO L276 IsEmpty]: Start isEmpty. Operand 925 states and 1222 transitions. [2025-03-17 02:57:32,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2025-03-17 02:57:32,670 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 02:57:32,670 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:57:32,670 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-17 02:57:32,670 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 02:57:32,670 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 02:57:32,671 INFO L85 PathProgramCache]: Analyzing trace with hash 1046009794, now seen corresponding path program 1 times [2025-03-17 02:57:32,671 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 02:57:32,671 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [661349184] [2025-03-17 02:57:32,671 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 02:57:32,671 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 02:57:32,678 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 135 statements into 1 equivalence classes. [2025-03-17 02:57:32,697 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 135 of 135 statements. [2025-03-17 02:57:32,698 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 02:57:32,698 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 02:57:32,958 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-03-17 02:57:32,958 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 02:57:32,959 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [661349184] [2025-03-17 02:57:32,959 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [661349184] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 02:57:32,959 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 02:57:32,959 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-17 02:57:32,959 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1527651990] [2025-03-17 02:57:32,959 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 02:57:32,959 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-17 02:57:32,959 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 02:57:32,960 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-17 02:57:32,960 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2025-03-17 02:57:32,960 INFO L87 Difference]: Start difference. First operand 925 states and 1222 transitions. Second operand has 10 states, 10 states have (on average 3.8) internal successors, (38), 10 states have internal predecessors, (38), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-17 02:57:33,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 02:57:33,234 INFO L93 Difference]: Finished difference Result 943 states and 1239 transitions. [2025-03-17 02:57:33,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-17 02:57:33,234 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.8) internal successors, (38), 10 states have internal predecessors, (38), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 135 [2025-03-17 02:57:33,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 02:57:33,238 INFO L225 Difference]: With dead ends: 943 [2025-03-17 02:57:33,238 INFO L226 Difference]: Without dead ends: 941 [2025-03-17 02:57:33,239 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=167, Unknown=0, NotChecked=0, Total=210 [2025-03-17 02:57:33,239 INFO L435 NwaCegarLoop]: 125 mSDtfsCounter, 104 mSDsluCounter, 740 mSDsCounter, 0 mSdLazyCounter, 318 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 104 SdHoareTripleChecker+Valid, 865 SdHoareTripleChecker+Invalid, 327 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 318 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 02:57:33,239 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [104 Valid, 865 Invalid, 327 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 318 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 02:57:33,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 941 states. [2025-03-17 02:57:33,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 941 to 892. [2025-03-17 02:57:33,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 892 states, 729 states have (on average 1.2400548696844993) internal successors, (904), 741 states have internal predecessors, (904), 140 states have call successors, (140), 22 states have call predecessors, (140), 22 states have return successors, (140), 128 states have call predecessors, (140), 140 states have call successors, (140) [2025-03-17 02:57:33,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 892 states to 892 states and 1184 transitions. [2025-03-17 02:57:33,288 INFO L78 Accepts]: Start accepts. Automaton has 892 states and 1184 transitions. Word has length 135 [2025-03-17 02:57:33,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 02:57:33,288 INFO L471 AbstractCegarLoop]: Abstraction has 892 states and 1184 transitions. [2025-03-17 02:57:33,289 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.8) internal successors, (38), 10 states have internal predecessors, (38), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-17 02:57:33,289 INFO L276 IsEmpty]: Start isEmpty. Operand 892 states and 1184 transitions. [2025-03-17 02:57:33,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2025-03-17 02:57:33,290 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 02:57:33,290 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:57:33,290 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-17 02:57:33,290 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 02:57:33,290 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 02:57:33,291 INFO L85 PathProgramCache]: Analyzing trace with hash -1895647805, now seen corresponding path program 1 times [2025-03-17 02:57:33,291 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 02:57:33,291 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [413763831] [2025-03-17 02:57:33,291 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 02:57:33,291 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 02:57:33,295 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 135 statements into 1 equivalence classes. [2025-03-17 02:57:33,301 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 135 of 135 statements. [2025-03-17 02:57:33,302 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 02:57:33,302 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 02:57:33,502 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-03-17 02:57:33,502 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 02:57:33,502 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [413763831] [2025-03-17 02:57:33,502 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [413763831] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 02:57:33,502 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 02:57:33,502 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-17 02:57:33,502 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [733639707] [2025-03-17 02:57:33,502 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 02:57:33,504 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-17 02:57:33,504 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 02:57:33,504 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-17 02:57:33,504 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2025-03-17 02:57:33,504 INFO L87 Difference]: Start difference. First operand 892 states and 1184 transitions. Second operand has 10 states, 10 states have (on average 3.8) internal successors, (38), 10 states have internal predecessors, (38), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-17 02:57:33,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 02:57:33,818 INFO L93 Difference]: Finished difference Result 923 states and 1213 transitions. [2025-03-17 02:57:33,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-17 02:57:33,819 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.8) internal successors, (38), 10 states have internal predecessors, (38), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 135 [2025-03-17 02:57:33,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 02:57:33,824 INFO L225 Difference]: With dead ends: 923 [2025-03-17 02:57:33,824 INFO L226 Difference]: Without dead ends: 921 [2025-03-17 02:57:33,825 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=167, Unknown=0, NotChecked=0, Total=210 [2025-03-17 02:57:33,826 INFO L435 NwaCegarLoop]: 157 mSDtfsCounter, 83 mSDsluCounter, 890 mSDsCounter, 0 mSdLazyCounter, 386 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 1047 SdHoareTripleChecker+Invalid, 387 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 386 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 02:57:33,826 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 1047 Invalid, 387 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 386 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 02:57:33,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 921 states. [2025-03-17 02:57:33,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 921 to 873. [2025-03-17 02:57:33,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 873 states, 713 states have (on average 1.2398316970546985) internal successors, (884), 724 states have internal predecessors, (884), 136 states have call successors, (136), 23 states have call predecessors, (136), 23 states have return successors, (136), 125 states have call predecessors, (136), 136 states have call successors, (136) [2025-03-17 02:57:33,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 873 states to 873 states and 1156 transitions. [2025-03-17 02:57:33,877 INFO L78 Accepts]: Start accepts. Automaton has 873 states and 1156 transitions. Word has length 135 [2025-03-17 02:57:33,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 02:57:33,878 INFO L471 AbstractCegarLoop]: Abstraction has 873 states and 1156 transitions. [2025-03-17 02:57:33,878 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.8) internal successors, (38), 10 states have internal predecessors, (38), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-17 02:57:33,878 INFO L276 IsEmpty]: Start isEmpty. Operand 873 states and 1156 transitions. [2025-03-17 02:57:33,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2025-03-17 02:57:33,879 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 02:57:33,879 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:57:33,879 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-17 02:57:33,879 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 02:57:33,879 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 02:57:33,880 INFO L85 PathProgramCache]: Analyzing trace with hash 1737166449, now seen corresponding path program 1 times [2025-03-17 02:57:33,880 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 02:57:33,880 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1548306115] [2025-03-17 02:57:33,880 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 02:57:33,880 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 02:57:33,886 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 136 statements into 1 equivalence classes. [2025-03-17 02:57:33,890 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 136 of 136 statements. [2025-03-17 02:57:33,890 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 02:57:33,891 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 02:57:33,941 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-03-17 02:57:33,941 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 02:57:33,942 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1548306115] [2025-03-17 02:57:33,942 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1548306115] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 02:57:33,942 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 02:57:33,942 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 02:57:33,943 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1172370731] [2025-03-17 02:57:33,943 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 02:57:33,943 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 02:57:33,943 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 02:57:33,944 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 02:57:33,944 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 02:57:33,944 INFO L87 Difference]: Start difference. First operand 873 states and 1156 transitions. Second operand has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-17 02:57:34,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 02:57:34,050 INFO L93 Difference]: Finished difference Result 2025 states and 2652 transitions. [2025-03-17 02:57:34,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 02:57:34,051 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 136 [2025-03-17 02:57:34,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 02:57:34,056 INFO L225 Difference]: With dead ends: 2025 [2025-03-17 02:57:34,056 INFO L226 Difference]: Without dead ends: 1153 [2025-03-17 02:57:34,059 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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:57:34,060 INFO L435 NwaCegarLoop]: 158 mSDtfsCounter, 83 mSDsluCounter, 207 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 365 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 02:57:34,062 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 365 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 02:57:34,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1153 states. [2025-03-17 02:57:34,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1153 to 871. [2025-03-17 02:57:34,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 871 states, 711 states have (on average 1.240506329113924) internal successors, (882), 722 states have internal predecessors, (882), 136 states have call successors, (136), 23 states have call predecessors, (136), 23 states have return successors, (136), 125 states have call predecessors, (136), 136 states have call successors, (136) [2025-03-17 02:57:34,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 871 states to 871 states and 1154 transitions. [2025-03-17 02:57:34,115 INFO L78 Accepts]: Start accepts. Automaton has 871 states and 1154 transitions. Word has length 136 [2025-03-17 02:57:34,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 02:57:34,116 INFO L471 AbstractCegarLoop]: Abstraction has 871 states and 1154 transitions. [2025-03-17 02:57:34,116 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-17 02:57:34,116 INFO L276 IsEmpty]: Start isEmpty. Operand 871 states and 1154 transitions. [2025-03-17 02:57:34,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2025-03-17 02:57:34,117 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 02:57:34,117 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:57:34,117 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-17 02:57:34,118 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 02:57:34,118 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 02:57:34,118 INFO L85 PathProgramCache]: Analyzing trace with hash -266808039, now seen corresponding path program 1 times [2025-03-17 02:57:34,118 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 02:57:34,118 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1239613624] [2025-03-17 02:57:34,118 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 02:57:34,118 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 02:57:34,125 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 136 statements into 1 equivalence classes. [2025-03-17 02:57:34,136 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 136 of 136 statements. [2025-03-17 02:57:34,137 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 02:57:34,137 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 02:57:34,262 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 54 proven. 3 refuted. 0 times theorem prover too weak. 703 trivial. 0 not checked. [2025-03-17 02:57:34,262 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 02:57:34,262 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1239613624] [2025-03-17 02:57:34,262 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1239613624] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 02:57:34,262 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [559765854] [2025-03-17 02:57:34,262 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 02:57:34,263 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 02:57:34,263 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 02:57:34,266 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:57:34,269 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:57:34,302 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 136 statements into 1 equivalence classes. [2025-03-17 02:57:34,334 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 136 of 136 statements. [2025-03-17 02:57:34,334 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 02:57:34,334 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 02:57:34,335 INFO L256 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-03-17 02:57:34,339 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 02:57:34,447 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 130 proven. 0 refuted. 0 times theorem prover too weak. 630 trivial. 0 not checked. [2025-03-17 02:57:34,448 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 02:57:34,448 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [559765854] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 02:57:34,448 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 02:57:34,448 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [6] total 10 [2025-03-17 02:57:34,448 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [692325405] [2025-03-17 02:57:34,448 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 02:57:34,448 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-17 02:57:34,449 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 02:57:34,449 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-17 02:57:34,449 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2025-03-17 02:57:34,449 INFO L87 Difference]: Start difference. First operand 871 states and 1154 transitions. Second operand has 9 states, 9 states have (on average 5.0) internal successors, (45), 8 states have internal predecessors, (45), 2 states have call successors, (20), 2 states have call predecessors, (20), 3 states have return successors, (20), 3 states have call predecessors, (20), 2 states have call successors, (20) [2025-03-17 02:57:34,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 02:57:34,930 INFO L93 Difference]: Finished difference Result 1888 states and 2493 transitions. [2025-03-17 02:57:34,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-03-17 02:57:34,931 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.0) internal successors, (45), 8 states have internal predecessors, (45), 2 states have call successors, (20), 2 states have call predecessors, (20), 3 states have return successors, (20), 3 states have call predecessors, (20), 2 states have call successors, (20) Word has length 136 [2025-03-17 02:57:34,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 02:57:34,937 INFO L225 Difference]: With dead ends: 1888 [2025-03-17 02:57:34,937 INFO L226 Difference]: Without dead ends: 1018 [2025-03-17 02:57:34,939 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 135 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=126, Invalid=336, Unknown=0, NotChecked=0, Total=462 [2025-03-17 02:57:34,940 INFO L435 NwaCegarLoop]: 134 mSDtfsCounter, 120 mSDsluCounter, 342 mSDsCounter, 0 mSdLazyCounter, 400 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 139 SdHoareTripleChecker+Valid, 476 SdHoareTripleChecker+Invalid, 447 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 400 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-17 02:57:34,940 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [139 Valid, 476 Invalid, 447 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 400 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-17 02:57:34,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1018 states. [2025-03-17 02:57:35,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1018 to 901. [2025-03-17 02:57:35,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 901 states, 731 states have (on average 1.20109439124487) internal successors, (878), 742 states have internal predecessors, (878), 140 states have call successors, (140), 29 states have call predecessors, (140), 29 states have return successors, (140), 129 states have call predecessors, (140), 140 states have call successors, (140) [2025-03-17 02:57:35,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 901 states to 901 states and 1158 transitions. [2025-03-17 02:57:35,013 INFO L78 Accepts]: Start accepts. Automaton has 901 states and 1158 transitions. Word has length 136 [2025-03-17 02:57:35,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 02:57:35,014 INFO L471 AbstractCegarLoop]: Abstraction has 901 states and 1158 transitions. [2025-03-17 02:57:35,014 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.0) internal successors, (45), 8 states have internal predecessors, (45), 2 states have call successors, (20), 2 states have call predecessors, (20), 3 states have return successors, (20), 3 states have call predecessors, (20), 2 states have call successors, (20) [2025-03-17 02:57:35,014 INFO L276 IsEmpty]: Start isEmpty. Operand 901 states and 1158 transitions. [2025-03-17 02:57:35,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2025-03-17 02:57:35,015 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 02:57:35,015 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:57:35,024 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:57:35,220 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,SelfDestructingSolverStorable22 [2025-03-17 02:57:35,221 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 02:57:35,221 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 02:57:35,221 INFO L85 PathProgramCache]: Analyzing trace with hash 1479497665, now seen corresponding path program 1 times [2025-03-17 02:57:35,221 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 02:57:35,221 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [909966517] [2025-03-17 02:57:35,221 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 02:57:35,222 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 02:57:35,229 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 137 statements into 1 equivalence classes. [2025-03-17 02:57:35,247 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 137 of 137 statements. [2025-03-17 02:57:35,247 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 02:57:35,247 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 02:57:35,247 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 02:57:35,252 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 137 statements into 1 equivalence classes. [2025-03-17 02:57:35,268 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 137 of 137 statements. [2025-03-17 02:57:35,269 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 02:57:35,269 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 02:57:35,304 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 02:57:35,305 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-17 02:57:35,306 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-17 02:57:35,307 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-03-17 02:57:35,309 INFO L422 BasicCegarLoop]: Path program histogram: [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:57:35,386 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-17 02:57:35,391 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.03 02:57:35 BoogieIcfgContainer [2025-03-17 02:57:35,391 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-17 02:57:35,392 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-17 02:57:35,392 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-17 02:57:35,392 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-17 02:57:35,396 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 02:56:17" (3/4) ... [2025-03-17 02:57:35,398 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-17 02:57:35,398 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-17 02:57:35,399 INFO L158 Benchmark]: Toolchain (without parser) took 78342.36ms. Allocated memory was 142.6MB in the beginning and 1.3GB in the end (delta: 1.1GB). Free memory was 109.2MB in the beginning and 738.3MB in the end (delta: -629.1MB). Peak memory consumption was 491.1MB. Max. memory is 16.1GB. [2025-03-17 02:57:35,399 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 201.3MB. Free memory is still 125.8MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 02:57:35,399 INFO L158 Benchmark]: CACSL2BoogieTranslator took 231.40ms. Allocated memory is still 142.6MB. Free memory was 109.2MB in the beginning and 95.4MB in the end (delta: 13.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-17 02:57:35,399 INFO L158 Benchmark]: Boogie Procedure Inliner took 30.75ms. Allocated memory is still 142.6MB. Free memory was 95.4MB in the beginning and 92.5MB in the end (delta: 2.9MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 02:57:35,399 INFO L158 Benchmark]: Boogie Preprocessor took 45.01ms. Allocated memory is still 142.6MB. Free memory was 92.5MB in the beginning and 87.9MB in the end (delta: 4.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-17 02:57:35,400 INFO L158 Benchmark]: IcfgBuilder took 507.21ms. Allocated memory is still 142.6MB. Free memory was 87.9MB in the beginning and 64.4MB in the end (delta: 23.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-17 02:57:35,400 INFO L158 Benchmark]: TraceAbstraction took 77516.14ms. Allocated memory was 142.6MB in the beginning and 1.3GB in the end (delta: 1.1GB). Free memory was 64.4MB in the beginning and 738.7MB in the end (delta: -674.3MB). Peak memory consumption was 440.7MB. Max. memory is 16.1GB. [2025-03-17 02:57:35,400 INFO L158 Benchmark]: Witness Printer took 6.57ms. Allocated memory is still 1.3GB. Free memory was 738.7MB in the beginning and 738.3MB in the end (delta: 410.9kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-17 02:57:35,401 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.21ms. Allocated memory is still 201.3MB. Free memory is still 125.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 231.40ms. Allocated memory is still 142.6MB. Free memory was 109.2MB in the beginning and 95.4MB in the end (delta: 13.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 30.75ms. Allocated memory is still 142.6MB. Free memory was 95.4MB in the beginning and 92.5MB in the end (delta: 2.9MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 45.01ms. Allocated memory is still 142.6MB. Free memory was 92.5MB in the beginning and 87.9MB in the end (delta: 4.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 507.21ms. Allocated memory is still 142.6MB. Free memory was 87.9MB in the beginning and 64.4MB in the end (delta: 23.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 77516.14ms. Allocated memory was 142.6MB in the beginning and 1.3GB in the end (delta: 1.1GB). Free memory was 64.4MB in the beginning and 738.7MB in the end (delta: -674.3MB). Peak memory consumption was 440.7MB. Max. memory is 16.1GB. * Witness Printer took 6.57ms. Allocated memory is still 1.3GB. Free memory was 738.7MB in the beginning and 738.3MB in the end (delta: 410.9kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of shiftRight at line 40, overapproximation of shiftRight at line 107, overapproximation of shiftLeft at line 49, overapproximation of shiftLeft at line 107. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned char var_1_1 = 1; [L23] signed char var_1_3 = 0; [L24] unsigned char var_1_5 = 128; [L25] unsigned char var_1_6 = 16; [L26] unsigned char var_1_7 = 2; [L27] unsigned char var_1_8 = 8; [L28] signed long int var_1_9 = 10; [L29] unsigned char var_1_10 = 0; [L30] unsigned char var_1_12 = 0; [L31] signed long int var_1_13 = 99; [L32] unsigned char var_1_14 = 64; [L33] unsigned char var_1_16 = 0; [L34] unsigned char var_1_17 = 0; [L35] unsigned char var_1_18 = 1; [L36] unsigned char last_1_var_1_14 = 64; [L111] isInitial = 1 [L112] FCALL initially() [L113] COND TRUE 1 [L114] CALL updateLastVariables() [L104] last_1_var_1_14 = var_1_14 [L114] RET updateLastVariables() [L115] CALL updateVariables() [L72] var_1_3 = __VERIFIER_nondet_char() [L73] CALL assume_abort_if_not(var_1_3 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=64, var_1_10=0, var_1_12=0, var_1_13=99, var_1_14=64, var_1_16=0, var_1_17=0, var_1_18=1, var_1_1=1, var_1_3=16, var_1_5=128, var_1_6=16, var_1_7=2, var_1_8=8, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=64, var_1_10=0, var_1_12=0, var_1_13=99, var_1_14=64, var_1_16=0, var_1_17=0, var_1_18=1, var_1_1=1, var_1_3=16, var_1_5=128, var_1_6=16, var_1_7=2, var_1_8=8, var_1_9=10] [L73] RET assume_abort_if_not(var_1_3 >= 0) VAL [isInitial=1, last_1_var_1_14=64, var_1_10=0, var_1_12=0, var_1_13=99, var_1_14=64, var_1_16=0, var_1_17=0, var_1_18=1, var_1_1=1, var_1_3=16, var_1_5=128, var_1_6=16, var_1_7=2, var_1_8=8, var_1_9=10] [L74] CALL assume_abort_if_not(var_1_3 <= 16) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=64, var_1_10=0, var_1_12=0, var_1_13=99, var_1_14=64, var_1_16=0, var_1_17=0, var_1_18=1, var_1_1=1, var_1_3=16, var_1_5=128, var_1_6=16, var_1_7=2, var_1_8=8, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=64, var_1_10=0, var_1_12=0, var_1_13=99, var_1_14=64, var_1_16=0, var_1_17=0, var_1_18=1, var_1_1=1, var_1_3=16, var_1_5=128, var_1_6=16, var_1_7=2, var_1_8=8, var_1_9=10] [L74] RET assume_abort_if_not(var_1_3 <= 16) VAL [isInitial=1, last_1_var_1_14=64, var_1_10=0, var_1_12=0, var_1_13=99, var_1_14=64, var_1_16=0, var_1_17=0, var_1_18=1, var_1_1=1, var_1_3=16, var_1_5=128, var_1_6=16, var_1_7=2, var_1_8=8, var_1_9=10] [L75] var_1_5 = __VERIFIER_nondet_uchar() [L76] CALL assume_abort_if_not(var_1_5 >= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=64, var_1_10=0, var_1_12=0, var_1_13=99, var_1_14=64, var_1_16=0, var_1_17=0, var_1_18=1, var_1_1=1, var_1_3=16, var_1_5=254, var_1_6=16, var_1_7=2, var_1_8=8, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=64, var_1_10=0, var_1_12=0, var_1_13=99, var_1_14=64, var_1_16=0, var_1_17=0, var_1_18=1, var_1_1=1, var_1_3=16, var_1_5=254, var_1_6=16, var_1_7=2, var_1_8=8, var_1_9=10] [L76] RET assume_abort_if_not(var_1_5 >= 127) VAL [isInitial=1, last_1_var_1_14=64, var_1_10=0, var_1_12=0, var_1_13=99, var_1_14=64, var_1_16=0, var_1_17=0, var_1_18=1, var_1_1=1, var_1_3=16, var_1_5=254, var_1_6=16, var_1_7=2, var_1_8=8, var_1_9=10] [L77] CALL assume_abort_if_not(var_1_5 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=64, var_1_10=0, var_1_12=0, var_1_13=99, var_1_14=64, var_1_16=0, var_1_17=0, var_1_18=1, var_1_1=1, var_1_3=16, var_1_5=254, var_1_6=16, var_1_7=2, var_1_8=8, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=64, var_1_10=0, var_1_12=0, var_1_13=99, var_1_14=64, var_1_16=0, var_1_17=0, var_1_18=1, var_1_1=1, var_1_3=16, var_1_5=254, var_1_6=16, var_1_7=2, var_1_8=8, var_1_9=10] [L77] RET assume_abort_if_not(var_1_5 <= 254) VAL [isInitial=1, last_1_var_1_14=64, var_1_10=0, var_1_12=0, var_1_13=99, var_1_14=64, var_1_16=0, var_1_17=0, var_1_18=1, var_1_1=1, var_1_3=16, var_1_5=254, var_1_6=16, var_1_7=2, var_1_8=8, var_1_9=10] [L78] var_1_6 = __VERIFIER_nondet_uchar() [L79] CALL assume_abort_if_not(var_1_6 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=64, var_1_10=0, var_1_12=0, var_1_13=99, var_1_14=64, var_1_16=0, var_1_17=0, var_1_18=1, var_1_1=1, var_1_3=16, var_1_5=254, var_1_7=2, var_1_8=8, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=64, var_1_10=0, var_1_12=0, var_1_13=99, var_1_14=64, var_1_16=0, var_1_17=0, var_1_18=1, var_1_1=1, var_1_3=16, var_1_5=254, var_1_7=2, var_1_8=8, var_1_9=10] [L79] RET assume_abort_if_not(var_1_6 >= 0) VAL [isInitial=1, last_1_var_1_14=64, var_1_10=0, var_1_12=0, var_1_13=99, var_1_14=64, var_1_16=0, var_1_17=0, var_1_18=1, var_1_1=1, var_1_3=16, var_1_5=254, var_1_7=2, var_1_8=8, var_1_9=10] [L80] CALL assume_abort_if_not(var_1_6 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=64, var_1_10=0, var_1_12=0, var_1_13=99, var_1_14=64, var_1_16=0, var_1_17=0, var_1_18=1, var_1_1=1, var_1_3=16, var_1_5=254, var_1_6=15, var_1_7=2, var_1_8=8, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=64, var_1_10=0, var_1_12=0, var_1_13=99, var_1_14=64, var_1_16=0, var_1_17=0, var_1_18=1, var_1_1=1, var_1_3=16, var_1_5=254, var_1_6=15, var_1_7=2, var_1_8=8, var_1_9=10] [L80] RET assume_abort_if_not(var_1_6 <= 127) VAL [isInitial=1, last_1_var_1_14=64, var_1_10=0, var_1_12=0, var_1_13=99, var_1_14=64, var_1_16=0, var_1_17=0, var_1_18=1, var_1_1=1, var_1_3=16, var_1_5=254, var_1_6=15, var_1_7=2, var_1_8=8, var_1_9=10] [L81] var_1_7 = __VERIFIER_nondet_uchar() [L82] CALL assume_abort_if_not(var_1_7 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=64, var_1_10=0, var_1_12=0, var_1_13=99, var_1_14=64, var_1_16=0, var_1_17=0, var_1_18=1, var_1_1=1, var_1_3=16, var_1_5=254, var_1_6=15, var_1_8=8, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=64, var_1_10=0, var_1_12=0, var_1_13=99, var_1_14=64, var_1_16=0, var_1_17=0, var_1_18=1, var_1_1=1, var_1_3=16, var_1_5=254, var_1_6=15, var_1_8=8, var_1_9=10] [L82] RET assume_abort_if_not(var_1_7 >= 0) VAL [isInitial=1, last_1_var_1_14=64, var_1_10=0, var_1_12=0, var_1_13=99, var_1_14=64, var_1_16=0, var_1_17=0, var_1_18=1, var_1_1=1, var_1_3=16, var_1_5=254, var_1_6=15, var_1_8=8, var_1_9=10] [L83] CALL assume_abort_if_not(var_1_7 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=64, var_1_10=0, var_1_12=0, var_1_13=99, var_1_14=64, var_1_16=0, var_1_17=0, var_1_18=1, var_1_1=1, var_1_3=16, var_1_5=254, var_1_6=15, var_1_7=14, var_1_8=8, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=64, var_1_10=0, var_1_12=0, var_1_13=99, var_1_14=64, var_1_16=0, var_1_17=0, var_1_18=1, var_1_1=1, var_1_3=16, var_1_5=254, var_1_6=15, var_1_7=14, var_1_8=8, var_1_9=10] [L83] RET assume_abort_if_not(var_1_7 <= 127) VAL [isInitial=1, last_1_var_1_14=64, var_1_10=0, var_1_12=0, var_1_13=99, var_1_14=64, var_1_16=0, var_1_17=0, var_1_18=1, var_1_1=1, var_1_3=16, var_1_5=254, var_1_6=15, var_1_7=14, var_1_8=8, var_1_9=10] [L84] var_1_8 = __VERIFIER_nondet_uchar() [L85] CALL assume_abort_if_not(var_1_8 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=64, var_1_10=0, var_1_12=0, var_1_13=99, var_1_14=64, var_1_16=0, var_1_17=0, var_1_18=1, var_1_1=1, var_1_3=16, var_1_5=254, var_1_6=15, var_1_7=14, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=64, var_1_10=0, var_1_12=0, var_1_13=99, var_1_14=64, var_1_16=0, var_1_17=0, var_1_18=1, var_1_1=1, var_1_3=16, var_1_5=254, var_1_6=15, var_1_7=14, var_1_9=10] [L85] RET assume_abort_if_not(var_1_8 >= 0) VAL [isInitial=1, last_1_var_1_14=64, var_1_10=0, var_1_12=0, var_1_13=99, var_1_14=64, var_1_16=0, var_1_17=0, var_1_18=1, var_1_1=1, var_1_3=16, var_1_5=254, var_1_6=15, var_1_7=14, var_1_9=10] [L86] CALL assume_abort_if_not(var_1_8 <= 64) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=64, var_1_10=0, var_1_12=0, var_1_13=99, var_1_14=64, var_1_16=0, var_1_17=0, var_1_18=1, var_1_1=1, var_1_3=16, var_1_5=254, var_1_6=15, var_1_7=14, var_1_8=12, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=64, var_1_10=0, var_1_12=0, var_1_13=99, var_1_14=64, var_1_16=0, var_1_17=0, var_1_18=1, var_1_1=1, var_1_3=16, var_1_5=254, var_1_6=15, var_1_7=14, var_1_8=12, var_1_9=10] [L86] RET assume_abort_if_not(var_1_8 <= 64) VAL [isInitial=1, last_1_var_1_14=64, var_1_10=0, var_1_12=0, var_1_13=99, var_1_14=64, var_1_16=0, var_1_17=0, var_1_18=1, var_1_1=1, var_1_3=16, var_1_5=254, var_1_6=15, var_1_7=14, var_1_8=12, var_1_9=10] [L87] var_1_10 = __VERIFIER_nondet_uchar() [L88] CALL assume_abort_if_not(var_1_10 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=64, var_1_12=0, var_1_13=99, var_1_14=64, var_1_16=0, var_1_17=0, var_1_18=1, var_1_1=1, var_1_3=16, var_1_5=254, var_1_6=15, var_1_7=14, var_1_8=12, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=64, var_1_12=0, var_1_13=99, var_1_14=64, var_1_16=0, var_1_17=0, var_1_18=1, var_1_1=1, var_1_3=16, var_1_5=254, var_1_6=15, var_1_7=14, var_1_8=12, var_1_9=10] [L88] RET assume_abort_if_not(var_1_10 >= 0) VAL [isInitial=1, last_1_var_1_14=64, var_1_12=0, var_1_13=99, var_1_14=64, var_1_16=0, var_1_17=0, var_1_18=1, var_1_1=1, var_1_3=16, var_1_5=254, var_1_6=15, var_1_7=14, var_1_8=12, var_1_9=10] [L89] CALL assume_abort_if_not(var_1_10 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=64, var_1_10=1, var_1_12=0, var_1_13=99, var_1_14=64, var_1_16=0, var_1_17=0, var_1_18=1, var_1_1=1, var_1_3=16, var_1_5=254, var_1_6=15, var_1_7=14, var_1_8=12, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=64, var_1_10=1, var_1_12=0, var_1_13=99, var_1_14=64, var_1_16=0, var_1_17=0, var_1_18=1, var_1_1=1, var_1_3=16, var_1_5=254, var_1_6=15, var_1_7=14, var_1_8=12, var_1_9=10] [L89] RET assume_abort_if_not(var_1_10 <= 1) VAL [isInitial=1, last_1_var_1_14=64, var_1_10=1, var_1_12=0, var_1_13=99, var_1_14=64, var_1_16=0, var_1_17=0, var_1_18=1, var_1_1=1, var_1_3=16, var_1_5=254, var_1_6=15, var_1_7=14, var_1_8=12, var_1_9=10] [L90] var_1_12 = __VERIFIER_nondet_uchar() [L91] CALL assume_abort_if_not(var_1_12 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=64, var_1_10=1, var_1_13=99, var_1_14=64, var_1_16=0, var_1_17=0, var_1_18=1, var_1_1=1, var_1_3=16, var_1_5=254, var_1_6=15, var_1_7=14, var_1_8=12, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=64, var_1_10=1, var_1_13=99, var_1_14=64, var_1_16=0, var_1_17=0, var_1_18=1, var_1_1=1, var_1_3=16, var_1_5=254, var_1_6=15, var_1_7=14, var_1_8=12, var_1_9=10] [L91] RET assume_abort_if_not(var_1_12 >= 0) VAL [isInitial=1, last_1_var_1_14=64, var_1_10=1, var_1_13=99, var_1_14=64, var_1_16=0, var_1_17=0, var_1_18=1, var_1_1=1, var_1_3=16, var_1_5=254, var_1_6=15, var_1_7=14, var_1_8=12, var_1_9=10] [L92] CALL assume_abort_if_not(var_1_12 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=64, var_1_10=1, var_1_12=1, var_1_13=99, var_1_14=64, var_1_16=0, var_1_17=0, var_1_18=1, var_1_1=1, var_1_3=16, var_1_5=254, var_1_6=15, var_1_7=14, var_1_8=12, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=64, var_1_10=1, var_1_12=1, var_1_13=99, var_1_14=64, var_1_16=0, var_1_17=0, var_1_18=1, var_1_1=1, var_1_3=16, var_1_5=254, var_1_6=15, var_1_7=14, var_1_8=12, var_1_9=10] [L92] RET assume_abort_if_not(var_1_12 <= 1) VAL [isInitial=1, last_1_var_1_14=64, var_1_10=1, var_1_12=1, var_1_13=99, var_1_14=64, var_1_16=0, var_1_17=0, var_1_18=1, var_1_1=1, var_1_3=16, var_1_5=254, var_1_6=15, var_1_7=14, var_1_8=12, var_1_9=10] [L93] var_1_13 = __VERIFIER_nondet_long() [L94] CALL assume_abort_if_not(var_1_13 >= -2147483648) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=64, var_1_10=1, var_1_12=1, var_1_13=0, var_1_14=64, var_1_16=0, var_1_17=0, var_1_18=1, var_1_1=1, var_1_3=16, var_1_5=254, var_1_6=15, var_1_7=14, var_1_8=12, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=64, var_1_10=1, var_1_12=1, var_1_13=0, var_1_14=64, var_1_16=0, var_1_17=0, var_1_18=1, var_1_1=1, var_1_3=16, var_1_5=254, var_1_6=15, var_1_7=14, var_1_8=12, var_1_9=10] [L94] RET assume_abort_if_not(var_1_13 >= -2147483648) VAL [isInitial=1, last_1_var_1_14=64, var_1_10=1, var_1_12=1, var_1_13=0, var_1_14=64, var_1_16=0, var_1_17=0, var_1_18=1, var_1_1=1, var_1_3=16, var_1_5=254, var_1_6=15, var_1_7=14, var_1_8=12, var_1_9=10] [L95] CALL assume_abort_if_not(var_1_13 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=64, var_1_10=1, var_1_12=1, var_1_13=0, var_1_14=64, var_1_16=0, var_1_17=0, var_1_18=1, var_1_1=1, var_1_3=16, var_1_5=254, var_1_6=15, var_1_7=14, var_1_8=12, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=64, var_1_10=1, var_1_12=1, var_1_13=0, var_1_14=64, var_1_16=0, var_1_17=0, var_1_18=1, var_1_1=1, var_1_3=16, var_1_5=254, var_1_6=15, var_1_7=14, var_1_8=12, var_1_9=10] [L95] RET assume_abort_if_not(var_1_13 <= 2147483647) VAL [isInitial=1, last_1_var_1_14=64, var_1_10=1, var_1_12=1, var_1_13=0, var_1_14=64, var_1_16=0, var_1_17=0, var_1_18=1, var_1_1=1, var_1_3=16, var_1_5=254, var_1_6=15, var_1_7=14, var_1_8=12, var_1_9=10] [L96] var_1_17 = __VERIFIER_nondet_uchar() [L97] CALL assume_abort_if_not(var_1_17 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=64, var_1_10=1, var_1_12=1, var_1_13=0, var_1_14=64, var_1_16=0, var_1_18=1, var_1_1=1, var_1_3=16, var_1_5=254, var_1_6=15, var_1_7=14, var_1_8=12, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=64, var_1_10=1, var_1_12=1, var_1_13=0, var_1_14=64, var_1_16=0, var_1_18=1, var_1_1=1, var_1_3=16, var_1_5=254, var_1_6=15, var_1_7=14, var_1_8=12, var_1_9=10] [L97] RET assume_abort_if_not(var_1_17 >= 0) VAL [isInitial=1, last_1_var_1_14=64, var_1_10=1, var_1_12=1, var_1_13=0, var_1_14=64, var_1_16=0, var_1_18=1, var_1_1=1, var_1_3=16, var_1_5=254, var_1_6=15, var_1_7=14, var_1_8=12, var_1_9=10] [L98] CALL assume_abort_if_not(var_1_17 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=64, var_1_10=1, var_1_12=1, var_1_13=0, var_1_14=64, var_1_16=0, var_1_17=0, var_1_18=1, var_1_1=1, var_1_3=16, var_1_5=254, var_1_6=15, var_1_7=14, var_1_8=12, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=64, var_1_10=1, var_1_12=1, var_1_13=0, var_1_14=64, var_1_16=0, var_1_17=0, var_1_18=1, var_1_1=1, var_1_3=16, var_1_5=254, var_1_6=15, var_1_7=14, var_1_8=12, var_1_9=10] [L98] RET assume_abort_if_not(var_1_17 <= 0) VAL [isInitial=1, last_1_var_1_14=64, var_1_10=1, var_1_12=1, var_1_13=0, var_1_14=64, var_1_16=0, var_1_17=0, var_1_18=1, var_1_1=1, var_1_3=16, var_1_5=254, var_1_6=15, var_1_7=14, var_1_8=12, var_1_9=10] [L99] var_1_18 = __VERIFIER_nondet_uchar() [L100] CALL assume_abort_if_not(var_1_18 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=64, var_1_10=1, var_1_12=1, var_1_13=0, var_1_14=64, var_1_16=0, var_1_17=0, var_1_18=1, var_1_1=1, var_1_3=16, var_1_5=254, var_1_6=15, var_1_7=14, var_1_8=12, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=64, var_1_10=1, var_1_12=1, var_1_13=0, var_1_14=64, var_1_16=0, var_1_17=0, var_1_18=1, var_1_1=1, var_1_3=16, var_1_5=254, var_1_6=15, var_1_7=14, var_1_8=12, var_1_9=10] [L100] RET assume_abort_if_not(var_1_18 >= 1) VAL [isInitial=1, last_1_var_1_14=64, var_1_10=1, var_1_12=1, var_1_13=0, var_1_14=64, var_1_16=0, var_1_17=0, var_1_18=1, var_1_1=1, var_1_3=16, var_1_5=254, var_1_6=15, var_1_7=14, var_1_8=12, var_1_9=10] [L101] CALL assume_abort_if_not(var_1_18 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=64, var_1_10=1, var_1_12=1, var_1_13=0, var_1_14=64, var_1_16=0, var_1_17=0, var_1_18=1, var_1_1=1, var_1_3=16, var_1_5=254, var_1_6=15, var_1_7=14, var_1_8=12, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=64, var_1_10=1, var_1_12=1, var_1_13=0, var_1_14=64, var_1_16=0, var_1_17=0, var_1_18=1, var_1_1=1, var_1_3=16, var_1_5=254, var_1_6=15, var_1_7=14, var_1_8=12, var_1_9=10] [L101] RET assume_abort_if_not(var_1_18 <= 1) VAL [isInitial=1, last_1_var_1_14=64, var_1_10=1, var_1_12=1, var_1_13=0, var_1_14=64, var_1_16=0, var_1_17=0, var_1_18=1, var_1_1=1, var_1_3=16, var_1_5=254, var_1_6=15, var_1_7=14, var_1_8=12, var_1_9=10] [L115] RET updateVariables() [L116] CALL step() [L40] EXPR last_1_var_1_14 >> var_1_3 VAL [isInitial=1, last_1_var_1_14=64, var_1_10=1, var_1_12=1, var_1_13=0, var_1_14=64, var_1_16=0, var_1_17=0, var_1_18=1, var_1_1=1, var_1_3=16, var_1_5=254, var_1_6=15, var_1_7=14, var_1_8=12, var_1_9=10] [L40] COND FALSE !((last_1_var_1_14 >> var_1_3) >= last_1_var_1_14) [L43] var_1_1 = (((((var_1_6) < (var_1_3)) ? (var_1_6) : (var_1_3))) + (((((var_1_8 + 1)) < (var_1_7)) ? ((var_1_8 + 1)) : (var_1_7)))) VAL [isInitial=1, last_1_var_1_14=64, var_1_10=1, var_1_12=1, var_1_13=0, var_1_14=64, var_1_16=0, var_1_17=0, var_1_18=1, var_1_1=28, var_1_3=16, var_1_5=254, var_1_6=15, var_1_7=14, var_1_8=12, var_1_9=10] [L45] COND TRUE (var_1_8 + var_1_1) >= var_1_7 [L46] var_1_14 = var_1_6 VAL [isInitial=1, last_1_var_1_14=64, var_1_10=1, var_1_12=1, var_1_13=0, var_1_14=15, var_1_16=0, var_1_17=0, var_1_18=1, var_1_1=28, var_1_3=16, var_1_5=254, var_1_6=15, var_1_7=14, var_1_8=12, var_1_9=10] [L48] COND TRUE var_1_12 || var_1_10 VAL [isInitial=1, last_1_var_1_14=64, var_1_10=1, var_1_12=1, var_1_13=0, var_1_14=15, var_1_16=0, var_1_17=0, var_1_18=1, var_1_1=28, var_1_3=16, var_1_5=254, var_1_6=15, var_1_7=14, var_1_8=12, var_1_9=10] [L49] EXPR var_1_8 << var_1_3 VAL [isInitial=1, last_1_var_1_14=64, var_1_10=1, var_1_12=1, var_1_13=0, var_1_14=15, var_1_16=0, var_1_17=0, var_1_18=1, var_1_1=28, var_1_3=16, var_1_5=254, var_1_6=15, var_1_7=14, var_1_8=12, var_1_9=10] [L49] COND TRUE var_1_1 >= (var_1_8 << var_1_3) [L50] COND TRUE var_1_6 > var_1_7 [L51] var_1_16 = var_1_17 VAL [isInitial=1, last_1_var_1_14=64, var_1_10=1, var_1_12=1, var_1_13=0, var_1_14=15, var_1_16=0, var_1_17=0, var_1_18=1, var_1_1=28, var_1_3=16, var_1_5=254, var_1_6=15, var_1_7=14, var_1_8=12, var_1_9=10] [L61] unsigned char stepLocal_1 = var_1_14; [L62] unsigned char stepLocal_0 = var_1_16; VAL [isInitial=1, last_1_var_1_14=64, stepLocal_0=0, stepLocal_1=15, var_1_10=1, var_1_12=1, var_1_13=0, var_1_14=15, var_1_16=0, var_1_17=0, var_1_18=1, var_1_1=28, var_1_3=16, var_1_5=254, var_1_6=15, var_1_7=14, var_1_8=12, var_1_9=10] [L63] COND FALSE !(\read(var_1_16)) VAL [isInitial=1, last_1_var_1_14=64, stepLocal_0=0, stepLocal_1=15, var_1_10=1, var_1_12=1, var_1_13=0, var_1_14=15, var_1_16=0, var_1_17=0, var_1_18=1, var_1_1=28, var_1_3=16, var_1_5=254, var_1_6=15, var_1_7=14, var_1_8=12, var_1_9=10] [L116] RET step() [L117] CALL, EXPR property() [L107] EXPR last_1_var_1_14 >> var_1_3 VAL [isInitial=1, last_1_var_1_14=64, var_1_10=1, var_1_12=1, var_1_13=0, var_1_14=15, var_1_16=0, var_1_17=0, var_1_18=1, var_1_1=28, var_1_3=16, var_1_5=254, var_1_6=15, var_1_7=14, var_1_8=12, var_1_9=10] [L107] EXPR (((((last_1_var_1_14 >> var_1_3) >= last_1_var_1_14) ? (var_1_1 == ((unsigned char) ((((var_1_3) < ((var_1_5 - ((((var_1_6) > (var_1_7)) ? (var_1_6) : (var_1_7)))))) ? (var_1_3) : ((var_1_5 - ((((var_1_6) > (var_1_7)) ? (var_1_6) : (var_1_7))))))))) : (var_1_1 == ((unsigned char) (((((var_1_6) < (var_1_3)) ? (var_1_6) : (var_1_3))) + (((((var_1_8 + 1)) < (var_1_7)) ? ((var_1_8 + 1)) : (var_1_7))))))) && (var_1_16 ? ((var_1_16 || var_1_16) ? ((var_1_14 > var_1_6) ? (var_1_9 == ((signed long int) var_1_13)) : 1) : 1) : 1)) && (((var_1_8 + var_1_1) >= var_1_7) ? (var_1_14 == ((unsigned char) var_1_6)) : 1)) && ((var_1_12 || var_1_10) ? ((var_1_1 >= (var_1_8 << var_1_3)) ? ((var_1_6 > var_1_7) ? (var_1_16 == ((unsigned char) var_1_17)) : (var_1_16 == ((unsigned char) 1))) : (var_1_16 == ((unsigned char) var_1_18))) : (var_1_16 == ((unsigned char) var_1_17))) VAL [isInitial=1, last_1_var_1_14=64, var_1_10=1, var_1_12=1, var_1_13=0, var_1_14=15, var_1_16=0, var_1_17=0, var_1_18=1, var_1_1=28, var_1_3=16, var_1_5=254, var_1_6=15, var_1_7=14, var_1_8=12, var_1_9=10] [L107] EXPR (var_1_12 || var_1_10) ? ((var_1_1 >= (var_1_8 << var_1_3)) ? ((var_1_6 > var_1_7) ? (var_1_16 == ((unsigned char) var_1_17)) : (var_1_16 == ((unsigned char) 1))) : (var_1_16 == ((unsigned char) var_1_18))) : (var_1_16 == ((unsigned char) var_1_17)) VAL [isInitial=1, last_1_var_1_14=64, var_1_10=1, var_1_12=1, var_1_13=0, var_1_14=15, var_1_16=0, var_1_17=0, var_1_18=1, var_1_1=28, var_1_3=16, var_1_5=254, var_1_6=15, var_1_7=14, var_1_8=12, var_1_9=10] [L107] EXPR var_1_8 << var_1_3 VAL [isInitial=1, last_1_var_1_14=64, var_1_10=1, var_1_12=1, var_1_13=0, var_1_14=15, var_1_16=0, var_1_17=0, var_1_18=1, var_1_1=28, var_1_3=16, var_1_5=254, var_1_6=15, var_1_7=14, var_1_8=12, var_1_9=10] [L107] EXPR (var_1_12 || var_1_10) ? ((var_1_1 >= (var_1_8 << var_1_3)) ? ((var_1_6 > var_1_7) ? (var_1_16 == ((unsigned char) var_1_17)) : (var_1_16 == ((unsigned char) 1))) : (var_1_16 == ((unsigned char) var_1_18))) : (var_1_16 == ((unsigned char) var_1_17)) VAL [isInitial=1, last_1_var_1_14=64, var_1_10=1, var_1_12=1, var_1_13=0, var_1_14=15, var_1_16=0, var_1_17=0, var_1_18=1, var_1_1=28, var_1_3=16, var_1_5=254, var_1_6=15, var_1_7=14, var_1_8=12, var_1_9=10] [L107] EXPR (((((last_1_var_1_14 >> var_1_3) >= last_1_var_1_14) ? (var_1_1 == ((unsigned char) ((((var_1_3) < ((var_1_5 - ((((var_1_6) > (var_1_7)) ? (var_1_6) : (var_1_7)))))) ? (var_1_3) : ((var_1_5 - ((((var_1_6) > (var_1_7)) ? (var_1_6) : (var_1_7))))))))) : (var_1_1 == ((unsigned char) (((((var_1_6) < (var_1_3)) ? (var_1_6) : (var_1_3))) + (((((var_1_8 + 1)) < (var_1_7)) ? ((var_1_8 + 1)) : (var_1_7))))))) && (var_1_16 ? ((var_1_16 || var_1_16) ? ((var_1_14 > var_1_6) ? (var_1_9 == ((signed long int) var_1_13)) : 1) : 1) : 1)) && (((var_1_8 + var_1_1) >= var_1_7) ? (var_1_14 == ((unsigned char) var_1_6)) : 1)) && ((var_1_12 || var_1_10) ? ((var_1_1 >= (var_1_8 << var_1_3)) ? ((var_1_6 > var_1_7) ? (var_1_16 == ((unsigned char) var_1_17)) : (var_1_16 == ((unsigned char) 1))) : (var_1_16 == ((unsigned char) var_1_18))) : (var_1_16 == ((unsigned char) var_1_17))) VAL [isInitial=1, last_1_var_1_14=64, var_1_10=1, var_1_12=1, var_1_13=0, var_1_14=15, var_1_16=0, var_1_17=0, var_1_18=1, var_1_1=28, var_1_3=16, var_1_5=254, var_1_6=15, var_1_7=14, var_1_8=12, var_1_9=10] [L107-L108] return (((((last_1_var_1_14 >> var_1_3) >= last_1_var_1_14) ? (var_1_1 == ((unsigned char) ((((var_1_3) < ((var_1_5 - ((((var_1_6) > (var_1_7)) ? (var_1_6) : (var_1_7)))))) ? (var_1_3) : ((var_1_5 - ((((var_1_6) > (var_1_7)) ? (var_1_6) : (var_1_7))))))))) : (var_1_1 == ((unsigned char) (((((var_1_6) < (var_1_3)) ? (var_1_6) : (var_1_3))) + (((((var_1_8 + 1)) < (var_1_7)) ? ((var_1_8 + 1)) : (var_1_7))))))) && (var_1_16 ? ((var_1_16 || var_1_16) ? ((var_1_14 > var_1_6) ? (var_1_9 == ((signed long int) var_1_13)) : 1) : 1) : 1)) && (((var_1_8 + var_1_1) >= var_1_7) ? (var_1_14 == ((unsigned char) var_1_6)) : 1)) && ((var_1_12 || var_1_10) ? ((var_1_1 >= (var_1_8 << var_1_3)) ? ((var_1_6 > var_1_7) ? (var_1_16 == ((unsigned char) var_1_17)) : (var_1_16 == ((unsigned char) 1))) : (var_1_16 == ((unsigned char) var_1_18))) : (var_1_16 == ((unsigned char) var_1_17))) ; [L117] RET, EXPR property() [L117] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_14=64, var_1_10=1, var_1_12=1, var_1_13=0, var_1_14=15, var_1_16=0, var_1_17=0, var_1_18=1, var_1_1=28, var_1_3=16, var_1_5=254, var_1_6=15, var_1_7=14, var_1_8=12, var_1_9=10] [L19] reach_error() VAL [isInitial=1, last_1_var_1_14=64, var_1_10=1, var_1_12=1, var_1_13=0, var_1_14=15, var_1_16=0, var_1_17=0, var_1_18=1, var_1_1=28, var_1_3=16, var_1_5=254, var_1_6=15, var_1_7=14, var_1_8=12, var_1_9=10] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 67 locations, 122 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 77.4s, OverallIterations: 24, TraceHistogramMax: 20, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 8.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2111 SdHoareTripleChecker+Valid, 4.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2092 mSDsluCounter, 10050 SdHoareTripleChecker+Invalid, 3.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 7370 mSDsCounter, 197 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4324 IncrementalHoareTripleChecker+Invalid, 4521 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 197 mSolverCounterUnsat, 2680 mSDtfsCounter, 4324 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 494 GetRequests, 324 SyntacticMatches, 0 SemanticMatches, 170 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 265 ImplicationChecksByTransitivity, 6.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=925occurred in iteration=19, InterpolantAutomatonStates: 162, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.8s AutomataMinimizationTime, 23 MinimizatonAttempts, 1485 StatesRemovedByMinimization, 20 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 66.4s InterpolantComputationTime, 3396 NumberOfCodeBlocks, 3396 NumberOfCodeBlocksAsserted, 26 NumberOfCheckSat, 3234 ConstructedInterpolants, 0 QuantifiedInterpolants, 16785 SizeOfPredicates, 1 NumberOfNonLiveVariables, 584 ConjunctsInSsa, 14 ConjunctsInUnsatCore, 25 InterpolantComputations, 23 PerfectInterpolantSequences, 18959/19000 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2025-03-17 02:57:35,482 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### 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_no-floats_file-56.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.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 97d791cbaec134197a8e3d1f03f35ec97aa0c52c94b35e8b29d7fd873617c9b5 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 02:57:37,544 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 02:57:37,640 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-03-17 02:57:37,648 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 02:57:37,648 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 02:57:37,668 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 02:57:37,669 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 02:57:37,669 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 02:57:37,669 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 02:57:37,669 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 02:57:37,669 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 02:57:37,669 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 02:57:37,670 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 02:57:37,670 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 02:57:37,670 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 02:57:37,670 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 02:57:37,670 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 02:57:37,670 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 02:57:37,670 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 02:57:37,670 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 02:57:37,670 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 02:57:37,670 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 02:57:37,671 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 02:57:37,671 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-17 02:57:37,671 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-17 02:57:37,671 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-17 02:57:37,671 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 02:57:37,671 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 02:57:37,671 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 02:57:37,671 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 02:57:37,671 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 02:57:37,672 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 02:57:37,672 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 02:57:37,672 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 02:57:37,673 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 02:57:37,673 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 02:57:37,673 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 02:57:37,673 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 02:57:37,673 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 02:57:37,673 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-17 02:57:37,673 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-17 02:57:37,673 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 02:57:37,673 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 02:57:37,673 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 02:57:37,673 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 02:57:37,673 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 -> 97d791cbaec134197a8e3d1f03f35ec97aa0c52c94b35e8b29d7fd873617c9b5 [2025-03-17 02:57:37,922 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 02:57:37,929 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 02:57:37,932 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 02:57:37,933 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 02:57:37,933 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 02:57:37,934 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-56.i [2025-03-17 02:57:39,196 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ad92975ac/3f7e97b6326a4c0d851ac884cb01135e/FLAG71c7b2b29 [2025-03-17 02:57:39,429 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 02:57:39,430 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-56.i [2025-03-17 02:57:39,438 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ad92975ac/3f7e97b6326a4c0d851ac884cb01135e/FLAG71c7b2b29 [2025-03-17 02:57:39,457 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ad92975ac/3f7e97b6326a4c0d851ac884cb01135e [2025-03-17 02:57:39,461 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 02:57:39,463 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 02:57:39,464 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 02:57:39,464 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 02:57:39,470 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 02:57:39,471 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 02:57:39" (1/1) ... [2025-03-17 02:57:39,471 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@264fc2b6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:57:39, skipping insertion in model container [2025-03-17 02:57:39,472 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 02:57:39" (1/1) ... [2025-03-17 02:57:39,493 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 02:57:39,608 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_no-floats_file-56.i[916,929] [2025-03-17 02:57:39,665 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 02:57:39,691 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 02:57:39,703 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_no-floats_file-56.i[916,929] [2025-03-17 02:57:39,742 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 02:57:39,767 INFO L204 MainTranslator]: Completed translation [2025-03-17 02:57:39,768 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:57:39 WrapperNode [2025-03-17 02:57:39,769 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 02:57:39,770 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 02:57:39,770 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 02:57:39,771 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 02:57:39,778 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:57:39" (1/1) ... [2025-03-17 02:57:39,791 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:57:39" (1/1) ... [2025-03-17 02:57:39,827 INFO L138 Inliner]: procedures = 27, calls = 33, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 115 [2025-03-17 02:57:39,828 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 02:57:39,828 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 02:57:39,828 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 02:57:39,828 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 02:57:39,843 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:57:39" (1/1) ... [2025-03-17 02:57:39,843 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:57:39" (1/1) ... [2025-03-17 02:57:39,846 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:57:39" (1/1) ... [2025-03-17 02:57:39,871 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:57:39,871 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:57:39" (1/1) ... [2025-03-17 02:57:39,872 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:57:39" (1/1) ... [2025-03-17 02:57:39,881 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:57:39" (1/1) ... [2025-03-17 02:57:39,886 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:57:39" (1/1) ... [2025-03-17 02:57:39,887 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:57:39" (1/1) ... [2025-03-17 02:57:39,888 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:57:39" (1/1) ... [2025-03-17 02:57:39,895 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 02:57:39,896 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 02:57:39,896 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 02:57:39,896 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 02:57:39,897 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:57:39" (1/1) ... [2025-03-17 02:57:39,905 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 02:57:39,922 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 02:57:39,940 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:57:39,953 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:57:39,978 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 02:57:39,978 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-17 02:57:39,978 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-17 02:57:39,978 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-17 02:57:39,978 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 02:57:39,978 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 02:57:40,057 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 02:57:40,059 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 02:57:40,255 INFO L? ?]: Removed 10 outVars from TransFormulas that were not future-live. [2025-03-17 02:57:40,255 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 02:57:40,270 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 02:57:40,272 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 02:57:40,273 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 02:57:40 BoogieIcfgContainer [2025-03-17 02:57:40,273 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 02:57:40,276 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 02:57:40,276 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 02:57:40,282 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 02:57:40,283 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 02:57:39" (1/3) ... [2025-03-17 02:57:40,283 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@235173b3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 02:57:40, skipping insertion in model container [2025-03-17 02:57:40,283 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:57:39" (2/3) ... [2025-03-17 02:57:40,283 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@235173b3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 02:57:40, skipping insertion in model container [2025-03-17 02:57:40,284 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 02:57:40" (3/3) ... [2025-03-17 02:57:40,285 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_floatingpointinfluence_no-floats_file-56.i [2025-03-17 02:57:40,298 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 02:57:40,300 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_floatingpointinfluence_no-floats_file-56.i that has 2 procedures, 52 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-17 02:57:40,340 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 02:57:40,349 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;@6a9407d4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 02:57:40,350 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-17 02:57:40,355 INFO L276 IsEmpty]: Start isEmpty. Operand has 52 states, 29 states have (on average 1.4137931034482758) internal successors, (41), 30 states have internal predecessors, (41), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2025-03-17 02:57:40,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2025-03-17 02:57:40,363 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 02:57:40,363 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:57:40,364 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 02:57:40,367 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 02:57:40,368 INFO L85 PathProgramCache]: Analyzing trace with hash 1115283747, now seen corresponding path program 1 times [2025-03-17 02:57:40,376 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 02:57:40,376 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [718363202] [2025-03-17 02:57:40,377 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 02:57:40,377 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 02:57:40,377 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 02:57:40,379 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:57:40,382 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:57:40,474 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 120 statements into 1 equivalence classes. [2025-03-17 02:57:40,518 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 120 of 120 statements. [2025-03-17 02:57:40,519 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 02:57:40,519 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 02:57:40,524 INFO L256 TraceCheckSpWp]: Trace formula consists of 196 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-17 02:57:40,534 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 02:57:40,577 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 722 trivial. 0 not checked. [2025-03-17 02:57:40,578 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 02:57:40,579 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 02:57:40,579 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [718363202] [2025-03-17 02:57:40,579 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [718363202] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 02:57:40,580 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 02:57:40,580 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 02:57:40,581 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1486654728] [2025-03-17 02:57:40,582 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 02:57:40,584 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-17 02:57:40,584 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 02:57:40,613 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-17 02:57:40,614 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 02:57:40,616 INFO L87 Difference]: Start difference. First operand has 52 states, 29 states have (on average 1.4137931034482758) internal successors, (41), 30 states have internal predecessors, (41), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) Second operand has 2 states, 2 states have (on average 12.5) internal successors, (25), 2 states have internal predecessors, (25), 2 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) [2025-03-17 02:57:40,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 02:57:40,631 INFO L93 Difference]: Finished difference Result 101 states and 180 transitions. [2025-03-17 02:57:40,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-17 02:57:40,633 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 12.5) internal successors, (25), 2 states have internal predecessors, (25), 2 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) Word has length 120 [2025-03-17 02:57:40,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 02:57:40,642 INFO L225 Difference]: With dead ends: 101 [2025-03-17 02:57:40,642 INFO L226 Difference]: Without dead ends: 50 [2025-03-17 02:57:40,646 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 119 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:57:40,649 INFO L435 NwaCegarLoop]: 77 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, 77 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:57:40,650 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 02:57:40,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2025-03-17 02:57:40,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2025-03-17 02:57:40,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 28 states have (on average 1.3214285714285714) internal successors, (37), 28 states have internal predecessors, (37), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2025-03-17 02:57:40,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 77 transitions. [2025-03-17 02:57:40,681 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 77 transitions. Word has length 120 [2025-03-17 02:57:40,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 02:57:40,681 INFO L471 AbstractCegarLoop]: Abstraction has 50 states and 77 transitions. [2025-03-17 02:57:40,682 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 12.5) internal successors, (25), 2 states have internal predecessors, (25), 2 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) [2025-03-17 02:57:40,682 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 77 transitions. [2025-03-17 02:57:40,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2025-03-17 02:57:40,685 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 02:57:40,685 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:57:40,693 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-17 02:57:40,888 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 [2025-03-17 02:57:40,889 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 02:57:40,889 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 02:57:40,890 INFO L85 PathProgramCache]: Analyzing trace with hash -61696733, now seen corresponding path program 1 times [2025-03-17 02:57:40,890 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 02:57:40,890 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1737187064] [2025-03-17 02:57:40,890 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 02:57:40,890 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 02:57:40,891 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 02:57:40,893 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:57:40,894 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:57:40,954 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 120 statements into 1 equivalence classes. [2025-03-17 02:57:40,992 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 120 of 120 statements. [2025-03-17 02:57:40,992 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 02:57:40,992 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 02:57:40,998 INFO L256 TraceCheckSpWp]: Trace formula consists of 196 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-03-17 02:57:41,007 INFO L279 TraceCheckSpWp]: Computing forward predicates...