./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_QF_BV_s1269b_p4.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_QF_BV_s1269b_p4.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-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 64bit --witnessprinter.graph.data.programhash cc15dd8c58787d1f6894f4700fb98e0d8cb8608f1a57f24801c50df888951e5d --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 18:29:09,875 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 18:29:09,930 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2025-03-03 18:29:09,934 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 18:29:09,934 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 18:29:09,955 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 18:29:09,956 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 18:29:09,956 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 18:29:09,957 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 18:29:09,957 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 18:29:09,957 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 18:29:09,957 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 18:29:09,958 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 18:29:09,958 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 18:29:09,958 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 18:29:09,958 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 18:29:09,958 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 18:29:09,958 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 18:29:09,958 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 18:29:09,958 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 18:29:09,958 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 18:29:09,958 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 18:29:09,958 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 18:29:09,958 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 18:29:09,958 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 18:29:09,958 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 18:29:09,958 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 18:29:09,958 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 18:29:09,958 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 18:29:09,959 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 18:29:09,960 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 18:29:09,960 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 18:29:09,960 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 18:29:09,960 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 18:29:09,960 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 18:29:09,960 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 18:29:09,960 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 18:29:09,960 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 18:29:09,960 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 18:29:09,960 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 18:29:09,960 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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> cc15dd8c58787d1f6894f4700fb98e0d8cb8608f1a57f24801c50df888951e5d [2025-03-03 18:29:10,191 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 18:29:10,197 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 18:29:10,199 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 18:29:10,199 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 18:29:10,199 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 18:29:10,200 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_QF_BV_s1269b_p4.c [2025-03-03 18:29:11,325 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8212aa3db/94d8dfd94e1a4a00960cd58ee6234173/FLAGb44f4ef3d [2025-03-03 18:29:11,572 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 18:29:11,573 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_QF_BV_s1269b_p4.c [2025-03-03 18:29:11,582 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8212aa3db/94d8dfd94e1a4a00960cd58ee6234173/FLAGb44f4ef3d [2025-03-03 18:29:11,884 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8212aa3db/94d8dfd94e1a4a00960cd58ee6234173 [2025-03-03 18:29:11,887 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 18:29:11,888 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 18:29:11,889 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 18:29:11,889 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 18:29:11,893 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 18:29:11,894 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 06:29:11" (1/1) ... [2025-03-03 18:29:11,896 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1fbc0b43 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:29:11, skipping insertion in model container [2025-03-03 18:29:11,896 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 06:29:11" (1/1) ... [2025-03-03 18:29:11,910 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 18:29:12,023 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/hardware-verification-bv/btor2c-lazyMod.vis_QF_BV_s1269b_p4.c[1259,1272] [2025-03-03 18:29:12,083 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 18:29:12,090 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 18:29:12,100 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/hardware-verification-bv/btor2c-lazyMod.vis_QF_BV_s1269b_p4.c[1259,1272] [2025-03-03 18:29:12,139 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 18:29:12,151 INFO L204 MainTranslator]: Completed translation [2025-03-03 18:29:12,152 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:29:12 WrapperNode [2025-03-03 18:29:12,152 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 18:29:12,153 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 18:29:12,153 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 18:29:12,153 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 18:29:12,158 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:29:12" (1/1) ... [2025-03-03 18:29:12,169 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:29:12" (1/1) ... [2025-03-03 18:29:12,205 INFO L138 Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 457 [2025-03-03 18:29:12,206 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 18:29:12,206 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 18:29:12,206 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 18:29:12,206 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 18:29:12,212 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:29:12" (1/1) ... [2025-03-03 18:29:12,213 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:29:12" (1/1) ... [2025-03-03 18:29:12,228 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:29:12" (1/1) ... [2025-03-03 18:29:12,251 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-03 18:29:12,253 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:29:12" (1/1) ... [2025-03-03 18:29:12,253 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:29:12" (1/1) ... [2025-03-03 18:29:12,268 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:29:12" (1/1) ... [2025-03-03 18:29:12,271 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:29:12" (1/1) ... [2025-03-03 18:29:12,280 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:29:12" (1/1) ... [2025-03-03 18:29:12,283 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:29:12" (1/1) ... [2025-03-03 18:29:12,292 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 18:29:12,293 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 18:29:12,293 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 18:29:12,293 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 18:29:12,294 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:29:12" (1/1) ... [2025-03-03 18:29:12,297 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 18:29:12,306 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 18:29:12,318 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-03 18:29:12,323 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-03 18:29:12,337 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 18:29:12,337 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 18:29:12,337 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 18:29:12,337 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 18:29:12,417 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 18:29:12,419 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 18:29:12,938 INFO L? ?]: Removed 232 outVars from TransFormulas that were not future-live. [2025-03-03 18:29:12,938 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 18:29:12,972 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 18:29:12,972 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 18:29:12,972 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 06:29:12 BoogieIcfgContainer [2025-03-03 18:29:12,972 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 18:29:12,974 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 18:29:12,974 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 18:29:12,978 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 18:29:12,979 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 06:29:11" (1/3) ... [2025-03-03 18:29:12,979 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@33ded636 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 06:29:12, skipping insertion in model container [2025-03-03 18:29:12,979 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:29:12" (2/3) ... [2025-03-03 18:29:12,980 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@33ded636 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 06:29:12, skipping insertion in model container [2025-03-03 18:29:12,980 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 06:29:12" (3/3) ... [2025-03-03 18:29:12,981 INFO L128 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.vis_QF_BV_s1269b_p4.c [2025-03-03 18:29:12,992 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 18:29:12,993 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG btor2c-lazyMod.vis_QF_BV_s1269b_p4.c that has 1 procedures, 118 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 18:29:13,038 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 18:29:13,047 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;@24832f04, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 18:29:13,048 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 18:29:13,052 INFO L276 IsEmpty]: Start isEmpty. Operand has 118 states, 116 states have (on average 1.4913793103448276) internal successors, (173), 117 states have internal predecessors, (173), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:29:13,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-03-03 18:29:13,057 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 18:29:13,057 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 18:29:13,058 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 18:29:13,064 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 18:29:13,065 INFO L85 PathProgramCache]: Analyzing trace with hash 725589287, now seen corresponding path program 1 times [2025-03-03 18:29:13,069 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 18:29:13,070 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [231672275] [2025-03-03 18:29:13,070 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:29:13,070 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 18:29:13,128 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-03 18:29:13,161 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-03 18:29:13,162 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:29:13,162 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:29:13,481 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 18:29:13,482 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 18:29:13,482 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [231672275] [2025-03-03 18:29:13,483 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [231672275] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 18:29:13,483 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 18:29:13,484 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 18:29:13,485 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1659624568] [2025-03-03 18:29:13,485 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 18:29:13,488 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 18:29:13,488 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 18:29:13,501 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 18:29:13,501 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 18:29:13,503 INFO L87 Difference]: Start difference. First operand has 118 states, 116 states have (on average 1.4913793103448276) internal successors, (173), 117 states have internal predecessors, (173), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:29:13,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 18:29:13,610 INFO L93 Difference]: Finished difference Result 217 states and 321 transitions. [2025-03-03 18:29:13,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 18:29:13,613 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2025-03-03 18:29:13,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 18:29:13,618 INFO L225 Difference]: With dead ends: 217 [2025-03-03 18:29:13,618 INFO L226 Difference]: Without dead ends: 117 [2025-03-03 18:29:13,621 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 18:29:13,626 INFO L435 NwaCegarLoop]: 140 mSDtfsCounter, 0 mSDsluCounter, 275 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 415 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 18:29:13,627 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 415 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 18:29:13,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2025-03-03 18:29:13,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 117. [2025-03-03 18:29:13,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 116 states have (on average 1.4741379310344827) internal successors, (171), 116 states have internal predecessors, (171), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:29:13,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 171 transitions. [2025-03-03 18:29:13,656 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 171 transitions. Word has length 23 [2025-03-03 18:29:13,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 18:29:13,657 INFO L471 AbstractCegarLoop]: Abstraction has 117 states and 171 transitions. [2025-03-03 18:29:13,657 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:29:13,658 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 171 transitions. [2025-03-03 18:29:13,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-03-03 18:29:13,659 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 18:29:13,659 INFO L218 NwaCegarLoop]: trace 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-03 18:29:13,660 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-03 18:29:13,660 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 18:29:13,660 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 18:29:13,661 INFO L85 PathProgramCache]: Analyzing trace with hash 1023110688, now seen corresponding path program 1 times [2025-03-03 18:29:13,661 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 18:29:13,661 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1467746205] [2025-03-03 18:29:13,661 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:29:13,661 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 18:29:13,676 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-03 18:29:13,691 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-03 18:29:13,691 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:29:13,691 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:29:13,785 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 18:29:13,786 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 18:29:13,786 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1467746205] [2025-03-03 18:29:13,786 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1467746205] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 18:29:13,786 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 18:29:13,786 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 18:29:13,786 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1705518392] [2025-03-03 18:29:13,786 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 18:29:13,787 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 18:29:13,787 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 18:29:13,787 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 18:29:13,787 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 18:29:13,788 INFO L87 Difference]: Start difference. First operand 117 states and 171 transitions. Second operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:29:13,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 18:29:13,871 INFO L93 Difference]: Finished difference Result 218 states and 319 transitions. [2025-03-03 18:29:13,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 18:29:13,872 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2025-03-03 18:29:13,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 18:29:13,873 INFO L225 Difference]: With dead ends: 218 [2025-03-03 18:29:13,873 INFO L226 Difference]: Without dead ends: 119 [2025-03-03 18:29:13,873 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 18:29:13,874 INFO L435 NwaCegarLoop]: 140 mSDtfsCounter, 0 mSDsluCounter, 272 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 412 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 94 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 18:29:13,874 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 412 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 94 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 18:29:13,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2025-03-03 18:29:13,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 119. [2025-03-03 18:29:13,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 118 states have (on average 1.4661016949152543) internal successors, (173), 118 states have internal predecessors, (173), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:29:13,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 173 transitions. [2025-03-03 18:29:13,882 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 173 transitions. Word has length 24 [2025-03-03 18:29:13,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 18:29:13,882 INFO L471 AbstractCegarLoop]: Abstraction has 119 states and 173 transitions. [2025-03-03 18:29:13,882 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:29:13,882 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 173 transitions. [2025-03-03 18:29:13,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-03-03 18:29:13,883 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 18:29:13,883 INFO L218 NwaCegarLoop]: trace 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, 1] [2025-03-03 18:29:13,883 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-03 18:29:13,883 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 18:29:13,883 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 18:29:13,883 INFO L85 PathProgramCache]: Analyzing trace with hash -711797694, now seen corresponding path program 1 times [2025-03-03 18:29:13,883 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 18:29:13,883 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1349315687] [2025-03-03 18:29:13,883 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:29:13,883 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 18:29:13,896 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-03 18:29:13,913 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-03 18:29:13,914 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:29:13,914 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:29:14,115 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 18:29:14,116 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 18:29:14,116 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1349315687] [2025-03-03 18:29:14,116 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1349315687] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 18:29:14,116 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 18:29:14,116 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-03 18:29:14,116 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [719885617] [2025-03-03 18:29:14,116 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 18:29:14,117 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 18:29:14,117 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 18:29:14,117 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 18:29:14,117 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-03 18:29:14,117 INFO L87 Difference]: Start difference. First operand 119 states and 173 transitions. Second operand has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 7 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:29:14,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 18:29:14,307 INFO L93 Difference]: Finished difference Result 231 states and 337 transitions. [2025-03-03 18:29:14,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-03 18:29:14,309 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 7 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2025-03-03 18:29:14,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 18:29:14,311 INFO L225 Difference]: With dead ends: 231 [2025-03-03 18:29:14,311 INFO L226 Difference]: Without dead ends: 130 [2025-03-03 18:29:14,312 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-03-03 18:29:14,313 INFO L435 NwaCegarLoop]: 134 mSDtfsCounter, 26 mSDsluCounter, 638 mSDsCounter, 0 mSdLazyCounter, 217 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 772 SdHoareTripleChecker+Invalid, 219 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 217 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 18:29:14,313 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 772 Invalid, 219 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 217 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 18:29:14,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2025-03-03 18:29:14,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 129. [2025-03-03 18:29:14,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 129 states, 128 states have (on average 1.453125) internal successors, (186), 128 states have internal predecessors, (186), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:29:14,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 186 transitions. [2025-03-03 18:29:14,322 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 186 transitions. Word has length 25 [2025-03-03 18:29:14,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 18:29:14,323 INFO L471 AbstractCegarLoop]: Abstraction has 129 states and 186 transitions. [2025-03-03 18:29:14,323 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 7 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:29:14,323 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 186 transitions. [2025-03-03 18:29:14,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-03-03 18:29:14,323 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 18:29:14,324 INFO L218 NwaCegarLoop]: trace 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, 1, 1] [2025-03-03 18:29:14,324 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-03 18:29:14,324 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 18:29:14,324 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 18:29:14,324 INFO L85 PathProgramCache]: Analyzing trace with hash -1511816854, now seen corresponding path program 1 times [2025-03-03 18:29:14,324 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 18:29:14,325 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [108692310] [2025-03-03 18:29:14,325 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:29:14,325 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 18:29:14,336 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-03-03 18:29:14,343 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-03-03 18:29:14,344 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:29:14,344 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:29:14,468 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 18:29:14,468 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 18:29:14,468 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [108692310] [2025-03-03 18:29:14,468 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [108692310] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 18:29:14,468 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 18:29:14,468 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-03 18:29:14,468 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [169797541] [2025-03-03 18:29:14,468 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 18:29:14,468 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 18:29:14,468 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 18:29:14,469 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 18:29:14,469 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-03 18:29:14,469 INFO L87 Difference]: Start difference. First operand 129 states and 186 transitions. Second operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 7 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:29:14,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 18:29:14,629 INFO L93 Difference]: Finished difference Result 299 states and 430 transitions. [2025-03-03 18:29:14,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-03 18:29:14,630 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 7 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2025-03-03 18:29:14,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 18:29:14,631 INFO L225 Difference]: With dead ends: 299 [2025-03-03 18:29:14,633 INFO L226 Difference]: Without dead ends: 191 [2025-03-03 18:29:14,633 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2025-03-03 18:29:14,634 INFO L435 NwaCegarLoop]: 130 mSDtfsCounter, 109 mSDsluCounter, 625 mSDsCounter, 0 mSdLazyCounter, 234 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 109 SdHoareTripleChecker+Valid, 755 SdHoareTripleChecker+Invalid, 235 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 234 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 18:29:14,634 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [109 Valid, 755 Invalid, 235 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 234 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 18:29:14,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2025-03-03 18:29:14,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 130. [2025-03-03 18:29:14,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 129 states have (on average 1.441860465116279) internal successors, (186), 129 states have internal predecessors, (186), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:29:14,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 186 transitions. [2025-03-03 18:29:14,644 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 186 transitions. Word has length 26 [2025-03-03 18:29:14,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 18:29:14,644 INFO L471 AbstractCegarLoop]: Abstraction has 130 states and 186 transitions. [2025-03-03 18:29:14,645 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 7 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:29:14,645 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 186 transitions. [2025-03-03 18:29:14,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-03-03 18:29:14,645 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 18:29:14,645 INFO L218 NwaCegarLoop]: trace 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, 1, 1] [2025-03-03 18:29:14,645 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-03 18:29:14,645 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 18:29:14,646 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 18:29:14,646 INFO L85 PathProgramCache]: Analyzing trace with hash 1297470597, now seen corresponding path program 1 times [2025-03-03 18:29:14,646 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 18:29:14,646 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1909883501] [2025-03-03 18:29:14,646 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:29:14,646 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 18:29:14,656 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-03-03 18:29:14,666 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-03-03 18:29:14,666 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:29:14,666 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:29:14,862 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 18:29:14,862 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 18:29:14,862 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1909883501] [2025-03-03 18:29:14,862 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1909883501] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 18:29:14,862 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 18:29:14,863 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-03 18:29:14,863 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [160055250] [2025-03-03 18:29:14,863 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 18:29:14,863 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-03 18:29:14,863 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 18:29:14,863 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-03 18:29:14,864 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-03 18:29:14,864 INFO L87 Difference]: Start difference. First operand 130 states and 186 transitions. Second operand has 9 states, 9 states have (on average 2.888888888888889) internal successors, (26), 9 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:29:15,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 18:29:15,105 INFO L93 Difference]: Finished difference Result 306 states and 441 transitions. [2025-03-03 18:29:15,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 18:29:15,105 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.888888888888889) internal successors, (26), 9 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2025-03-03 18:29:15,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 18:29:15,106 INFO L225 Difference]: With dead ends: 306 [2025-03-03 18:29:15,106 INFO L226 Difference]: Without dead ends: 205 [2025-03-03 18:29:15,107 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2025-03-03 18:29:15,107 INFO L435 NwaCegarLoop]: 128 mSDtfsCounter, 128 mSDsluCounter, 868 mSDsCounter, 0 mSdLazyCounter, 331 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 128 SdHoareTripleChecker+Valid, 996 SdHoareTripleChecker+Invalid, 331 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 331 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 18:29:15,107 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [128 Valid, 996 Invalid, 331 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 331 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 18:29:15,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2025-03-03 18:29:15,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 132. [2025-03-03 18:29:15,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 131 states have (on average 1.4351145038167938) internal successors, (188), 131 states have internal predecessors, (188), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:29:15,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 188 transitions. [2025-03-03 18:29:15,116 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 188 transitions. Word has length 26 [2025-03-03 18:29:15,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 18:29:15,116 INFO L471 AbstractCegarLoop]: Abstraction has 132 states and 188 transitions. [2025-03-03 18:29:15,116 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.888888888888889) internal successors, (26), 9 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:29:15,116 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 188 transitions. [2025-03-03 18:29:15,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-03-03 18:29:15,116 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 18:29:15,116 INFO L218 NwaCegarLoop]: trace 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, 1, 1, 1] [2025-03-03 18:29:15,117 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-03 18:29:15,117 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 18:29:15,117 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 18:29:15,117 INFO L85 PathProgramCache]: Analyzing trace with hash -292329923, now seen corresponding path program 1 times [2025-03-03 18:29:15,117 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 18:29:15,117 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1268219118] [2025-03-03 18:29:15,117 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:29:15,117 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 18:29:15,129 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-03-03 18:29:15,133 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-03-03 18:29:15,133 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:29:15,133 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:29:15,191 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 18:29:15,191 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 18:29:15,191 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1268219118] [2025-03-03 18:29:15,191 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1268219118] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 18:29:15,192 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 18:29:15,192 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 18:29:15,192 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2049054181] [2025-03-03 18:29:15,192 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 18:29:15,192 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 18:29:15,192 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 18:29:15,192 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 18:29:15,193 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 18:29:15,193 INFO L87 Difference]: Start difference. First operand 132 states and 188 transitions. Second operand has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:29:15,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 18:29:15,279 INFO L93 Difference]: Finished difference Result 283 states and 405 transitions. [2025-03-03 18:29:15,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 18:29:15,280 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2025-03-03 18:29:15,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 18:29:15,281 INFO L225 Difference]: With dead ends: 283 [2025-03-03 18:29:15,281 INFO L226 Difference]: Without dead ends: 173 [2025-03-03 18:29:15,281 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-03 18:29:15,281 INFO L435 NwaCegarLoop]: 137 mSDtfsCounter, 89 mSDsluCounter, 386 mSDsCounter, 0 mSdLazyCounter, 128 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 523 SdHoareTripleChecker+Invalid, 128 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 128 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 18:29:15,282 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [89 Valid, 523 Invalid, 128 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 128 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 18:29:15,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2025-03-03 18:29:15,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 128. [2025-03-03 18:29:15,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 127 states have (on average 1.4330708661417322) internal successors, (182), 127 states have internal predecessors, (182), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:29:15,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 182 transitions. [2025-03-03 18:29:15,291 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 182 transitions. Word has length 27 [2025-03-03 18:29:15,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 18:29:15,291 INFO L471 AbstractCegarLoop]: Abstraction has 128 states and 182 transitions. [2025-03-03 18:29:15,291 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:29:15,291 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 182 transitions. [2025-03-03 18:29:15,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2025-03-03 18:29:15,293 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 18:29:15,293 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 18:29:15,293 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-03 18:29:15,293 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 18:29:15,295 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 18:29:15,295 INFO L85 PathProgramCache]: Analyzing trace with hash 978456617, now seen corresponding path program 1 times [2025-03-03 18:29:15,295 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 18:29:15,295 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1029664278] [2025-03-03 18:29:15,295 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:29:15,295 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 18:29:15,320 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 75 statements into 1 equivalence classes. [2025-03-03 18:29:15,407 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 75 of 75 statements. [2025-03-03 18:29:15,407 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:29:15,407 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:29:15,705 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 18:29:15,705 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 18:29:15,706 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1029664278] [2025-03-03 18:29:15,706 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1029664278] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 18:29:15,706 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 18:29:15,706 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-03 18:29:15,706 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [150557431] [2025-03-03 18:29:15,706 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 18:29:15,707 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 18:29:15,707 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 18:29:15,707 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 18:29:15,707 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-03 18:29:15,708 INFO L87 Difference]: Start difference. First operand 128 states and 182 transitions. Second operand has 7 states, 7 states have (on average 10.714285714285714) internal successors, (75), 7 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:29:15,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 18:29:15,862 INFO L93 Difference]: Finished difference Result 277 states and 399 transitions. [2025-03-03 18:29:15,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-03 18:29:15,863 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.714285714285714) internal successors, (75), 7 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 75 [2025-03-03 18:29:15,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 18:29:15,863 INFO L225 Difference]: With dead ends: 277 [2025-03-03 18:29:15,863 INFO L226 Difference]: Without dead ends: 176 [2025-03-03 18:29:15,865 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2025-03-03 18:29:15,865 INFO L435 NwaCegarLoop]: 135 mSDtfsCounter, 92 mSDsluCounter, 646 mSDsCounter, 0 mSdLazyCounter, 208 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 781 SdHoareTripleChecker+Invalid, 209 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 208 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 18:29:15,865 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 781 Invalid, 209 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 208 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 18:29:15,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2025-03-03 18:29:15,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 145. [2025-03-03 18:29:15,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 145 states, 144 states have (on average 1.4166666666666667) internal successors, (204), 144 states have internal predecessors, (204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:29:15,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 204 transitions. [2025-03-03 18:29:15,872 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 204 transitions. Word has length 75 [2025-03-03 18:29:15,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 18:29:15,872 INFO L471 AbstractCegarLoop]: Abstraction has 145 states and 204 transitions. [2025-03-03 18:29:15,872 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.714285714285714) internal successors, (75), 7 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:29:15,872 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 204 transitions. [2025-03-03 18:29:15,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2025-03-03 18:29:15,878 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 18:29:15,878 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 18:29:15,878 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-03 18:29:15,878 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 18:29:15,878 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 18:29:15,878 INFO L85 PathProgramCache]: Analyzing trace with hash 1376350754, now seen corresponding path program 1 times [2025-03-03 18:29:15,878 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 18:29:15,878 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [362005050] [2025-03-03 18:29:15,878 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:29:15,878 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 18:29:15,900 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes. [2025-03-03 18:29:15,926 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements. [2025-03-03 18:29:15,926 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:29:15,926 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:29:16,064 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 18:29:16,064 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 18:29:16,064 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [362005050] [2025-03-03 18:29:16,064 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [362005050] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 18:29:16,064 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 18:29:16,064 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 18:29:16,065 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1368419434] [2025-03-03 18:29:16,065 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 18:29:16,065 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 18:29:16,065 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 18:29:16,066 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 18:29:16,066 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 18:29:16,066 INFO L87 Difference]: Start difference. First operand 145 states and 204 transitions. Second operand has 5 states, 5 states have (on average 15.2) internal successors, (76), 5 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:29:16,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 18:29:16,154 INFO L93 Difference]: Finished difference Result 271 states and 388 transitions. [2025-03-03 18:29:16,154 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 18:29:16,154 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.2) internal successors, (76), 5 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 76 [2025-03-03 18:29:16,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 18:29:16,155 INFO L225 Difference]: With dead ends: 271 [2025-03-03 18:29:16,155 INFO L226 Difference]: Without dead ends: 170 [2025-03-03 18:29:16,155 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-03 18:29:16,156 INFO L435 NwaCegarLoop]: 134 mSDtfsCounter, 65 mSDsluCounter, 376 mSDsCounter, 0 mSdLazyCounter, 141 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 510 SdHoareTripleChecker+Invalid, 141 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 141 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 18:29:16,156 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 510 Invalid, 141 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 141 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 18:29:16,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2025-03-03 18:29:16,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 145. [2025-03-03 18:29:16,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 145 states, 144 states have (on average 1.4097222222222223) internal successors, (203), 144 states have internal predecessors, (203), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:29:16,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 203 transitions. [2025-03-03 18:29:16,159 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 203 transitions. Word has length 76 [2025-03-03 18:29:16,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 18:29:16,159 INFO L471 AbstractCegarLoop]: Abstraction has 145 states and 203 transitions. [2025-03-03 18:29:16,160 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.2) internal successors, (76), 5 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:29:16,160 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 203 transitions. [2025-03-03 18:29:16,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2025-03-03 18:29:16,160 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 18:29:16,160 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 18:29:16,161 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-03 18:29:16,161 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 18:29:16,162 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 18:29:16,162 INFO L85 PathProgramCache]: Analyzing trace with hash 659108135, now seen corresponding path program 1 times [2025-03-03 18:29:16,162 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 18:29:16,162 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [790505420] [2025-03-03 18:29:16,162 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:29:16,163 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 18:29:16,184 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes. [2025-03-03 18:29:16,245 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements. [2025-03-03 18:29:16,245 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:29:16,245 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:29:16,484 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 18:29:16,484 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 18:29:16,485 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [790505420] [2025-03-03 18:29:16,485 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [790505420] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 18:29:16,485 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 18:29:16,485 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 18:29:16,485 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [871788876] [2025-03-03 18:29:16,485 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 18:29:16,485 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 18:29:16,485 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 18:29:16,486 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 18:29:16,486 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-03 18:29:16,486 INFO L87 Difference]: Start difference. First operand 145 states and 203 transitions. Second operand has 6 states, 6 states have (on average 12.666666666666666) internal successors, (76), 6 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:29:16,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 18:29:16,566 INFO L93 Difference]: Finished difference Result 254 states and 362 transitions. [2025-03-03 18:29:16,567 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 18:29:16,567 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.666666666666666) internal successors, (76), 6 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 76 [2025-03-03 18:29:16,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 18:29:16,567 INFO L225 Difference]: With dead ends: 254 [2025-03-03 18:29:16,567 INFO L226 Difference]: Without dead ends: 153 [2025-03-03 18:29:16,568 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-03 18:29:16,568 INFO L435 NwaCegarLoop]: 138 mSDtfsCounter, 5 mSDsluCounter, 407 mSDsCounter, 0 mSdLazyCounter, 135 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 545 SdHoareTripleChecker+Invalid, 136 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 135 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 18:29:16,568 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 545 Invalid, 136 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 135 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 18:29:16,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2025-03-03 18:29:16,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 150. [2025-03-03 18:29:16,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 150 states, 149 states have (on average 1.4026845637583893) internal successors, (209), 149 states have internal predecessors, (209), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:29:16,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 209 transitions. [2025-03-03 18:29:16,589 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 209 transitions. Word has length 76 [2025-03-03 18:29:16,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 18:29:16,589 INFO L471 AbstractCegarLoop]: Abstraction has 150 states and 209 transitions. [2025-03-03 18:29:16,589 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.666666666666666) internal successors, (76), 6 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:29:16,590 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 209 transitions. [2025-03-03 18:29:16,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2025-03-03 18:29:16,590 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 18:29:16,590 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 18:29:16,590 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-03 18:29:16,593 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 18:29:16,597 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 18:29:16,597 INFO L85 PathProgramCache]: Analyzing trace with hash 935962858, now seen corresponding path program 1 times [2025-03-03 18:29:16,597 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 18:29:16,597 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [373435355] [2025-03-03 18:29:16,597 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:29:16,597 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 18:29:16,627 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-03-03 18:29:16,722 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-03-03 18:29:16,723 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:29:16,723 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:29:18,031 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 18:29:18,031 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 18:29:18,031 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [373435355] [2025-03-03 18:29:18,031 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [373435355] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 18:29:18,031 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 18:29:18,032 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2025-03-03 18:29:18,032 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [189379843] [2025-03-03 18:29:18,032 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 18:29:18,032 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-03-03 18:29:18,032 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 18:29:18,032 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-03-03 18:29:18,033 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=235, Unknown=0, NotChecked=0, Total=272 [2025-03-03 18:29:18,033 INFO L87 Difference]: Start difference. First operand 150 states and 209 transitions. Second operand has 17 states, 17 states have (on average 4.529411764705882) internal successors, (77), 17 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:29:18,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 18:29:18,514 INFO L93 Difference]: Finished difference Result 306 states and 438 transitions. [2025-03-03 18:29:18,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-03 18:29:18,515 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 4.529411764705882) internal successors, (77), 17 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 77 [2025-03-03 18:29:18,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 18:29:18,516 INFO L225 Difference]: With dead ends: 306 [2025-03-03 18:29:18,516 INFO L226 Difference]: Without dead ends: 200 [2025-03-03 18:29:18,517 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=42, Invalid=264, Unknown=0, NotChecked=0, Total=306 [2025-03-03 18:29:18,517 INFO L435 NwaCegarLoop]: 116 mSDtfsCounter, 85 mSDsluCounter, 1425 mSDsCounter, 0 mSdLazyCounter, 768 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 1541 SdHoareTripleChecker+Invalid, 774 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 768 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 18:29:18,517 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 1541 Invalid, 774 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 768 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 18:29:18,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2025-03-03 18:29:18,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 193. [2025-03-03 18:29:18,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 193 states, 192 states have (on average 1.4114583333333333) internal successors, (271), 192 states have internal predecessors, (271), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:29:18,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 271 transitions. [2025-03-03 18:29:18,522 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 271 transitions. Word has length 77 [2025-03-03 18:29:18,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 18:29:18,522 INFO L471 AbstractCegarLoop]: Abstraction has 193 states and 271 transitions. [2025-03-03 18:29:18,522 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 4.529411764705882) internal successors, (77), 17 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:29:18,522 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 271 transitions. [2025-03-03 18:29:18,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2025-03-03 18:29:18,523 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 18:29:18,523 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 18:29:18,523 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-03 18:29:18,523 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 18:29:18,524 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 18:29:18,524 INFO L85 PathProgramCache]: Analyzing trace with hash 193965477, now seen corresponding path program 1 times [2025-03-03 18:29:18,524 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 18:29:18,524 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1109042398] [2025-03-03 18:29:18,524 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:29:18,524 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 18:29:18,541 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-03-03 18:29:18,607 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-03-03 18:29:18,608 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:29:18,608 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:29:18,846 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 18:29:18,846 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 18:29:18,846 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1109042398] [2025-03-03 18:29:18,846 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1109042398] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 18:29:18,846 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 18:29:18,846 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-03 18:29:18,847 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [448639865] [2025-03-03 18:29:18,847 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 18:29:18,847 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-03 18:29:18,847 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 18:29:18,847 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-03 18:29:18,847 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-03 18:29:18,848 INFO L87 Difference]: Start difference. First operand 193 states and 271 transitions. Second operand has 9 states, 9 states have (on average 8.555555555555555) internal successors, (77), 9 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:29:19,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 18:29:19,019 INFO L93 Difference]: Finished difference Result 317 states and 451 transitions. [2025-03-03 18:29:19,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 18:29:19,020 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 8.555555555555555) internal successors, (77), 9 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 77 [2025-03-03 18:29:19,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 18:29:19,021 INFO L225 Difference]: With dead ends: 317 [2025-03-03 18:29:19,021 INFO L226 Difference]: Without dead ends: 211 [2025-03-03 18:29:19,021 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-03 18:29:19,021 INFO L435 NwaCegarLoop]: 139 mSDtfsCounter, 11 mSDsluCounter, 947 mSDsCounter, 0 mSdLazyCounter, 322 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 1086 SdHoareTripleChecker+Invalid, 324 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 322 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 18:29:19,022 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 1086 Invalid, 324 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 322 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 18:29:19,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2025-03-03 18:29:19,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 210. [2025-03-03 18:29:19,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 210 states, 209 states have (on average 1.4066985645933014) internal successors, (294), 209 states have internal predecessors, (294), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:29:19,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 294 transitions. [2025-03-03 18:29:19,026 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 294 transitions. Word has length 77 [2025-03-03 18:29:19,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 18:29:19,026 INFO L471 AbstractCegarLoop]: Abstraction has 210 states and 294 transitions. [2025-03-03 18:29:19,026 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.555555555555555) internal successors, (77), 9 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:29:19,026 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 294 transitions. [2025-03-03 18:29:19,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2025-03-03 18:29:19,027 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 18:29:19,027 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 18:29:19,027 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-03 18:29:19,028 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 18:29:19,028 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 18:29:19,028 INFO L85 PathProgramCache]: Analyzing trace with hash 1835883978, now seen corresponding path program 1 times [2025-03-03 18:29:19,028 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 18:29:19,028 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1655548343] [2025-03-03 18:29:19,029 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:29:19,029 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 18:29:19,044 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 78 statements into 1 equivalence classes. [2025-03-03 18:29:19,089 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 78 of 78 statements. [2025-03-03 18:29:19,090 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:29:19,090 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:29:19,306 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 18:29:19,307 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 18:29:19,307 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1655548343] [2025-03-03 18:29:19,307 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1655548343] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 18:29:19,307 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 18:29:19,307 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 18:29:19,307 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [646940294] [2025-03-03 18:29:19,307 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 18:29:19,307 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 18:29:19,307 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 18:29:19,308 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 18:29:19,308 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 18:29:19,308 INFO L87 Difference]: Start difference. First operand 210 states and 294 transitions. Second operand has 5 states, 5 states have (on average 15.6) internal successors, (78), 5 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:29:19,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 18:29:19,384 INFO L93 Difference]: Finished difference Result 339 states and 479 transitions. [2025-03-03 18:29:19,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 18:29:19,385 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.6) internal successors, (78), 5 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 78 [2025-03-03 18:29:19,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 18:29:19,386 INFO L225 Difference]: With dead ends: 339 [2025-03-03 18:29:19,386 INFO L226 Difference]: Without dead ends: 216 [2025-03-03 18:29:19,386 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 18:29:19,387 INFO L435 NwaCegarLoop]: 135 mSDtfsCounter, 3 mSDsluCounter, 397 mSDsCounter, 0 mSdLazyCounter, 139 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 532 SdHoareTripleChecker+Invalid, 140 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 139 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 18:29:19,387 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 532 Invalid, 140 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 139 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 18:29:19,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2025-03-03 18:29:19,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 215. [2025-03-03 18:29:19,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 215 states, 214 states have (on average 1.4065420560747663) internal successors, (301), 214 states have internal predecessors, (301), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:29:19,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 301 transitions. [2025-03-03 18:29:19,391 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 301 transitions. Word has length 78 [2025-03-03 18:29:19,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 18:29:19,391 INFO L471 AbstractCegarLoop]: Abstraction has 215 states and 301 transitions. [2025-03-03 18:29:19,391 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.6) internal successors, (78), 5 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:29:19,391 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 301 transitions. [2025-03-03 18:29:19,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2025-03-03 18:29:19,392 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 18:29:19,392 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 18:29:19,392 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-03 18:29:19,392 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 18:29:19,392 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 18:29:19,392 INFO L85 PathProgramCache]: Analyzing trace with hash -598557652, now seen corresponding path program 1 times [2025-03-03 18:29:19,392 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 18:29:19,392 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [530568569] [2025-03-03 18:29:19,393 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:29:19,393 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 18:29:19,408 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 78 statements into 1 equivalence classes. [2025-03-03 18:29:19,461 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 78 of 78 statements. [2025-03-03 18:29:19,462 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:29:19,462 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:29:19,826 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 11 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 18:29:19,826 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 18:29:19,826 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [530568569] [2025-03-03 18:29:19,826 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [530568569] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 18:29:19,827 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1736766267] [2025-03-03 18:29:19,827 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:29:19,827 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 18:29:19,827 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 18:29:19,829 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 18:29:19,831 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-03 18:29:19,927 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 78 statements into 1 equivalence classes. [2025-03-03 18:29:19,979 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 78 of 78 statements. [2025-03-03 18:29:19,980 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:29:19,980 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:29:19,983 INFO L256 TraceCheckSpWp]: Trace formula consists of 441 conjuncts, 71 conjuncts are in the unsatisfiable core [2025-03-03 18:29:19,989 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 18:29:20,509 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 18:29:20,509 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 18:29:20,509 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1736766267] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 18:29:20,510 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 18:29:20,510 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [13] total 28 [2025-03-03 18:29:20,510 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [503289184] [2025-03-03 18:29:20,510 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 18:29:20,510 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-03-03 18:29:20,510 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 18:29:20,510 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-03-03 18:29:20,511 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=687, Unknown=0, NotChecked=0, Total=756 [2025-03-03 18:29:20,511 INFO L87 Difference]: Start difference. First operand 215 states and 301 transitions. Second operand has 17 states, 17 states have (on average 4.588235294117647) internal successors, (78), 17 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:29:21,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 18:29:21,041 INFO L93 Difference]: Finished difference Result 403 states and 570 transitions. [2025-03-03 18:29:21,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-03-03 18:29:21,041 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 4.588235294117647) internal successors, (78), 17 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 78 [2025-03-03 18:29:21,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 18:29:21,042 INFO L225 Difference]: With dead ends: 403 [2025-03-03 18:29:21,043 INFO L226 Difference]: Without dead ends: 277 [2025-03-03 18:29:21,044 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 314 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=117, Invalid=1215, Unknown=0, NotChecked=0, Total=1332 [2025-03-03 18:29:21,044 INFO L435 NwaCegarLoop]: 114 mSDtfsCounter, 156 mSDsluCounter, 1240 mSDsCounter, 0 mSdLazyCounter, 690 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 156 SdHoareTripleChecker+Valid, 1354 SdHoareTripleChecker+Invalid, 692 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 690 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 18:29:21,045 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [156 Valid, 1354 Invalid, 692 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 690 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 18:29:21,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 277 states. [2025-03-03 18:29:21,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 277 to 253. [2025-03-03 18:29:21,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 253 states, 252 states have (on average 1.4087301587301588) internal successors, (355), 252 states have internal predecessors, (355), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:29:21,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 253 states to 253 states and 355 transitions. [2025-03-03 18:29:21,053 INFO L78 Accepts]: Start accepts. Automaton has 253 states and 355 transitions. Word has length 78 [2025-03-03 18:29:21,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 18:29:21,054 INFO L471 AbstractCegarLoop]: Abstraction has 253 states and 355 transitions. [2025-03-03 18:29:21,054 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 4.588235294117647) internal successors, (78), 17 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:29:21,054 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 355 transitions. [2025-03-03 18:29:21,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2025-03-03 18:29:21,054 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 18:29:21,054 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 18:29:21,063 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-03 18:29:21,255 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,SelfDestructingSolverStorable12 [2025-03-03 18:29:21,256 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 18:29:21,256 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 18:29:21,256 INFO L85 PathProgramCache]: Analyzing trace with hash 1189921969, now seen corresponding path program 1 times [2025-03-03 18:29:21,256 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 18:29:21,256 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1225744732] [2025-03-03 18:29:21,256 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:29:21,257 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 18:29:21,272 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 78 statements into 1 equivalence classes. [2025-03-03 18:29:21,331 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 78 of 78 statements. [2025-03-03 18:29:21,331 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:29:21,331 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:29:21,850 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 18:29:21,851 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 18:29:21,851 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1225744732] [2025-03-03 18:29:21,851 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1225744732] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 18:29:21,851 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 18:29:21,851 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-03 18:29:21,851 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1070106864] [2025-03-03 18:29:21,851 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 18:29:21,851 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-03 18:29:21,852 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 18:29:21,852 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-03 18:29:21,852 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2025-03-03 18:29:21,852 INFO L87 Difference]: Start difference. First operand 253 states and 355 transitions. Second operand has 12 states, 12 states have (on average 6.5) internal successors, (78), 12 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:29:22,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 18:29:22,093 INFO L93 Difference]: Finished difference Result 464 states and 655 transitions. [2025-03-03 18:29:22,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-03 18:29:22,094 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 6.5) internal successors, (78), 12 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 78 [2025-03-03 18:29:22,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 18:29:22,095 INFO L225 Difference]: With dead ends: 464 [2025-03-03 18:29:22,095 INFO L226 Difference]: Without dead ends: 336 [2025-03-03 18:29:22,096 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2025-03-03 18:29:22,096 INFO L435 NwaCegarLoop]: 128 mSDtfsCounter, 53 mSDsluCounter, 901 mSDsCounter, 0 mSdLazyCounter, 383 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 1029 SdHoareTripleChecker+Invalid, 383 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 383 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 18:29:22,096 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 1029 Invalid, 383 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 383 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 18:29:22,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 336 states. [2025-03-03 18:29:22,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 336 to 321. [2025-03-03 18:29:22,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 321 states, 320 states have (on average 1.409375) internal successors, (451), 320 states have internal predecessors, (451), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:29:22,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 321 states to 321 states and 451 transitions. [2025-03-03 18:29:22,107 INFO L78 Accepts]: Start accepts. Automaton has 321 states and 451 transitions. Word has length 78 [2025-03-03 18:29:22,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 18:29:22,107 INFO L471 AbstractCegarLoop]: Abstraction has 321 states and 451 transitions. [2025-03-03 18:29:22,107 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 6.5) internal successors, (78), 12 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:29:22,107 INFO L276 IsEmpty]: Start isEmpty. Operand 321 states and 451 transitions. [2025-03-03 18:29:22,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2025-03-03 18:29:22,108 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 18:29:22,108 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 18:29:22,108 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-03 18:29:22,108 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 18:29:22,108 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 18:29:22,108 INFO L85 PathProgramCache]: Analyzing trace with hash -78996827, now seen corresponding path program 1 times [2025-03-03 18:29:22,108 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 18:29:22,108 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [453934849] [2025-03-03 18:29:22,108 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:29:22,108 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 18:29:22,129 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 78 statements into 1 equivalence classes. [2025-03-03 18:29:22,145 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 78 of 78 statements. [2025-03-03 18:29:22,145 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:29:22,145 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:29:22,237 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 18:29:22,238 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 18:29:22,238 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [453934849] [2025-03-03 18:29:22,238 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [453934849] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 18:29:22,239 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 18:29:22,239 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 18:29:22,239 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1392467794] [2025-03-03 18:29:22,239 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 18:29:22,239 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 18:29:22,239 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 18:29:22,239 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 18:29:22,241 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 18:29:22,241 INFO L87 Difference]: Start difference. First operand 321 states and 451 transitions. Second operand has 5 states, 5 states have (on average 15.6) internal successors, (78), 5 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:29:22,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 18:29:22,315 INFO L93 Difference]: Finished difference Result 487 states and 687 transitions. [2025-03-03 18:29:22,315 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 18:29:22,315 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.6) internal successors, (78), 5 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 78 [2025-03-03 18:29:22,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 18:29:22,317 INFO L225 Difference]: With dead ends: 487 [2025-03-03 18:29:22,317 INFO L226 Difference]: Without dead ends: 297 [2025-03-03 18:29:22,318 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 18:29:22,318 INFO L435 NwaCegarLoop]: 137 mSDtfsCounter, 48 mSDsluCounter, 385 mSDsCounter, 0 mSdLazyCounter, 129 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 522 SdHoareTripleChecker+Invalid, 129 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 129 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 18:29:22,320 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 522 Invalid, 129 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 129 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 18:29:22,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 297 states. [2025-03-03 18:29:22,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 297 to 297. [2025-03-03 18:29:22,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 297 states, 296 states have (on average 1.3817567567567568) internal successors, (409), 296 states have internal predecessors, (409), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:29:22,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 297 states to 297 states and 409 transitions. [2025-03-03 18:29:22,326 INFO L78 Accepts]: Start accepts. Automaton has 297 states and 409 transitions. Word has length 78 [2025-03-03 18:29:22,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 18:29:22,326 INFO L471 AbstractCegarLoop]: Abstraction has 297 states and 409 transitions. [2025-03-03 18:29:22,326 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.6) internal successors, (78), 5 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:29:22,327 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 409 transitions. [2025-03-03 18:29:22,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2025-03-03 18:29:22,327 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 18:29:22,327 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 18:29:22,327 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-03 18:29:22,327 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 18:29:22,329 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 18:29:22,329 INFO L85 PathProgramCache]: Analyzing trace with hash 550143021, now seen corresponding path program 1 times [2025-03-03 18:29:22,329 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 18:29:22,329 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1691909760] [2025-03-03 18:29:22,329 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:29:22,329 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 18:29:22,346 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 79 statements into 1 equivalence classes. [2025-03-03 18:29:22,404 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 79 of 79 statements. [2025-03-03 18:29:22,404 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:29:22,405 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:29:22,828 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 18:29:22,828 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 18:29:22,828 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1691909760] [2025-03-03 18:29:22,828 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1691909760] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 18:29:22,828 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 18:29:22,828 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-03-03 18:29:22,828 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [32872813] [2025-03-03 18:29:22,828 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 18:29:22,829 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-03 18:29:22,829 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 18:29:22,829 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-03 18:29:22,830 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2025-03-03 18:29:22,830 INFO L87 Difference]: Start difference. First operand 297 states and 409 transitions. Second operand has 14 states, 14 states have (on average 5.642857142857143) internal successors, (79), 14 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:29:23,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 18:29:23,073 INFO L93 Difference]: Finished difference Result 528 states and 737 transitions. [2025-03-03 18:29:23,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-03 18:29:23,074 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 5.642857142857143) internal successors, (79), 14 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 79 [2025-03-03 18:29:23,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 18:29:23,075 INFO L225 Difference]: With dead ends: 528 [2025-03-03 18:29:23,075 INFO L226 Difference]: Without dead ends: 375 [2025-03-03 18:29:23,076 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=201, Unknown=0, NotChecked=0, Total=240 [2025-03-03 18:29:23,076 INFO L435 NwaCegarLoop]: 139 mSDtfsCounter, 51 mSDsluCounter, 1023 mSDsCounter, 0 mSdLazyCounter, 480 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 1162 SdHoareTripleChecker+Invalid, 483 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 480 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 18:29:23,077 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 1162 Invalid, 483 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 480 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 18:29:23,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 375 states. [2025-03-03 18:29:23,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 375 to 347. [2025-03-03 18:29:23,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 347 states, 346 states have (on average 1.3786127167630058) internal successors, (477), 346 states have internal predecessors, (477), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:29:23,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 347 states to 347 states and 477 transitions. [2025-03-03 18:29:23,083 INFO L78 Accepts]: Start accepts. Automaton has 347 states and 477 transitions. Word has length 79 [2025-03-03 18:29:23,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 18:29:23,084 INFO L471 AbstractCegarLoop]: Abstraction has 347 states and 477 transitions. [2025-03-03 18:29:23,084 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 5.642857142857143) internal successors, (79), 14 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:29:23,084 INFO L276 IsEmpty]: Start isEmpty. Operand 347 states and 477 transitions. [2025-03-03 18:29:23,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2025-03-03 18:29:23,087 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 18:29:23,087 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 18:29:23,087 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-03 18:29:23,087 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 18:29:23,087 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 18:29:23,088 INFO L85 PathProgramCache]: Analyzing trace with hash -887441915, now seen corresponding path program 1 times [2025-03-03 18:29:23,088 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 18:29:23,088 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [757535585] [2025-03-03 18:29:23,088 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:29:23,088 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 18:29:23,106 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 79 statements into 1 equivalence classes. [2025-03-03 18:29:23,151 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 79 of 79 statements. [2025-03-03 18:29:23,151 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:29:23,151 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:29:23,377 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 18:29:23,377 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 18:29:23,377 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [757535585] [2025-03-03 18:29:23,377 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [757535585] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 18:29:23,377 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 18:29:23,378 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-03 18:29:23,378 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1261533027] [2025-03-03 18:29:23,378 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 18:29:23,378 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-03 18:29:23,378 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 18:29:23,379 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-03 18:29:23,379 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2025-03-03 18:29:23,379 INFO L87 Difference]: Start difference. First operand 347 states and 477 transitions. Second operand has 9 states, 9 states have (on average 8.777777777777779) internal successors, (79), 9 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:29:23,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 18:29:23,578 INFO L93 Difference]: Finished difference Result 670 states and 926 transitions. [2025-03-03 18:29:23,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 18:29:23,578 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 8.777777777777779) internal successors, (79), 9 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 79 [2025-03-03 18:29:23,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 18:29:23,579 INFO L225 Difference]: With dead ends: 670 [2025-03-03 18:29:23,579 INFO L226 Difference]: Without dead ends: 375 [2025-03-03 18:29:23,580 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=144, Unknown=0, NotChecked=0, Total=182 [2025-03-03 18:29:23,580 INFO L435 NwaCegarLoop]: 129 mSDtfsCounter, 88 mSDsluCounter, 872 mSDsCounter, 0 mSdLazyCounter, 326 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 1001 SdHoareTripleChecker+Invalid, 328 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 326 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 18:29:23,580 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [88 Valid, 1001 Invalid, 328 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 326 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 18:29:23,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 375 states. [2025-03-03 18:29:23,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 375 to 352. [2025-03-03 18:29:23,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 352 states, 351 states have (on average 1.3732193732193732) internal successors, (482), 351 states have internal predecessors, (482), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:29:23,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 352 states to 352 states and 482 transitions. [2025-03-03 18:29:23,592 INFO L78 Accepts]: Start accepts. Automaton has 352 states and 482 transitions. Word has length 79 [2025-03-03 18:29:23,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 18:29:23,592 INFO L471 AbstractCegarLoop]: Abstraction has 352 states and 482 transitions. [2025-03-03 18:29:23,593 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.777777777777779) internal successors, (79), 9 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:29:23,593 INFO L276 IsEmpty]: Start isEmpty. Operand 352 states and 482 transitions. [2025-03-03 18:29:23,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2025-03-03 18:29:23,595 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 18:29:23,595 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 18:29:23,596 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-03 18:29:23,596 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 18:29:23,596 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 18:29:23,597 INFO L85 PathProgramCache]: Analyzing trace with hash 1254256367, now seen corresponding path program 1 times [2025-03-03 18:29:23,597 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 18:29:23,597 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [493939954] [2025-03-03 18:29:23,597 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:29:23,597 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 18:29:23,614 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 80 statements into 1 equivalence classes. [2025-03-03 18:29:23,655 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 80 of 80 statements. [2025-03-03 18:29:23,655 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:29:23,655 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:29:23,974 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 11 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 18:29:23,974 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 18:29:23,974 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [493939954] [2025-03-03 18:29:23,974 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [493939954] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 18:29:23,974 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1772974507] [2025-03-03 18:29:23,974 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:29:23,974 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 18:29:23,975 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 18:29:23,976 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 18:29:23,978 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-03 18:29:24,086 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 80 statements into 1 equivalence classes. [2025-03-03 18:29:24,150 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 80 of 80 statements. [2025-03-03 18:29:24,150 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:29:24,151 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:29:24,154 INFO L256 TraceCheckSpWp]: Trace formula consists of 447 conjuncts, 42 conjuncts are in the unsatisfiable core [2025-03-03 18:29:24,157 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 18:29:24,474 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 18:29:24,474 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 18:29:24,474 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1772974507] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 18:29:24,474 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 18:29:24,474 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [13] total 25 [2025-03-03 18:29:24,474 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [299724265] [2025-03-03 18:29:24,474 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 18:29:24,474 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-03 18:29:24,474 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 18:29:24,475 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-03 18:29:24,475 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=541, Unknown=0, NotChecked=0, Total=600 [2025-03-03 18:29:24,475 INFO L87 Difference]: Start difference. First operand 352 states and 482 transitions. Second operand has 14 states, 14 states have (on average 5.714285714285714) internal successors, (80), 14 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:29:24,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 18:29:24,797 INFO L93 Difference]: Finished difference Result 614 states and 860 transitions. [2025-03-03 18:29:24,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-03 18:29:24,798 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 5.714285714285714) internal successors, (80), 14 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 80 [2025-03-03 18:29:24,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 18:29:24,799 INFO L225 Difference]: With dead ends: 614 [2025-03-03 18:29:24,799 INFO L226 Difference]: Without dead ends: 420 [2025-03-03 18:29:24,801 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 138 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=59, Invalid=541, Unknown=0, NotChecked=0, Total=600 [2025-03-03 18:29:24,801 INFO L435 NwaCegarLoop]: 120 mSDtfsCounter, 63 mSDsluCounter, 1395 mSDsCounter, 0 mSdLazyCounter, 657 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 1515 SdHoareTripleChecker+Invalid, 659 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 657 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 18:29:24,801 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 1515 Invalid, 659 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 657 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 18:29:24,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 420 states. [2025-03-03 18:29:24,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 420 to 388. [2025-03-03 18:29:24,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 388 states, 387 states have (on average 1.3746770025839794) internal successors, (532), 387 states have internal predecessors, (532), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:29:24,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 388 states to 388 states and 532 transitions. [2025-03-03 18:29:24,809 INFO L78 Accepts]: Start accepts. Automaton has 388 states and 532 transitions. Word has length 80 [2025-03-03 18:29:24,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 18:29:24,809 INFO L471 AbstractCegarLoop]: Abstraction has 388 states and 532 transitions. [2025-03-03 18:29:24,809 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 5.714285714285714) internal successors, (80), 14 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:29:24,809 INFO L276 IsEmpty]: Start isEmpty. Operand 388 states and 532 transitions. [2025-03-03 18:29:24,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2025-03-03 18:29:24,810 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 18:29:24,810 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 18:29:24,817 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-03 18:29:25,011 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,SelfDestructingSolverStorable17 [2025-03-03 18:29:25,011 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 18:29:25,012 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 18:29:25,012 INFO L85 PathProgramCache]: Analyzing trace with hash 708376337, now seen corresponding path program 1 times [2025-03-03 18:29:25,012 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 18:29:25,012 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [971348475] [2025-03-03 18:29:25,012 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:29:25,012 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 18:29:25,031 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 80 statements into 1 equivalence classes. [2025-03-03 18:29:25,075 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 80 of 80 statements. [2025-03-03 18:29:25,075 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:29:25,075 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:29:25,410 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 18:29:25,410 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 18:29:25,410 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [971348475] [2025-03-03 18:29:25,410 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [971348475] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 18:29:25,411 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 18:29:25,411 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-03 18:29:25,411 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1685775165] [2025-03-03 18:29:25,411 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 18:29:25,411 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-03 18:29:25,411 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 18:29:25,411 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-03 18:29:25,412 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2025-03-03 18:29:25,412 INFO L87 Difference]: Start difference. First operand 388 states and 532 transitions. Second operand has 10 states, 10 states have (on average 8.0) internal successors, (80), 10 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:29:25,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 18:29:25,594 INFO L93 Difference]: Finished difference Result 618 states and 859 transitions. [2025-03-03 18:29:25,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-03 18:29:25,594 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 8.0) internal successors, (80), 10 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 80 [2025-03-03 18:29:25,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 18:29:25,596 INFO L225 Difference]: With dead ends: 618 [2025-03-03 18:29:25,596 INFO L226 Difference]: Without dead ends: 424 [2025-03-03 18:29:25,596 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2025-03-03 18:29:25,597 INFO L435 NwaCegarLoop]: 144 mSDtfsCounter, 28 mSDsluCounter, 992 mSDsCounter, 0 mSdLazyCounter, 356 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 1136 SdHoareTripleChecker+Invalid, 357 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 356 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 18:29:25,597 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 1136 Invalid, 357 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 356 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 18:29:25,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 424 states. [2025-03-03 18:29:25,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 424 to 417. [2025-03-03 18:29:25,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 417 states, 416 states have (on average 1.3774038461538463) internal successors, (573), 416 states have internal predecessors, (573), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:29:25,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 417 states to 417 states and 573 transitions. [2025-03-03 18:29:25,607 INFO L78 Accepts]: Start accepts. Automaton has 417 states and 573 transitions. Word has length 80 [2025-03-03 18:29:25,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 18:29:25,607 INFO L471 AbstractCegarLoop]: Abstraction has 417 states and 573 transitions. [2025-03-03 18:29:25,607 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.0) internal successors, (80), 10 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:29:25,607 INFO L276 IsEmpty]: Start isEmpty. Operand 417 states and 573 transitions. [2025-03-03 18:29:25,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2025-03-03 18:29:25,608 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 18:29:25,608 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 18:29:25,609 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-03 18:29:25,609 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 18:29:25,609 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 18:29:25,609 INFO L85 PathProgramCache]: Analyzing trace with hash -1109237883, now seen corresponding path program 1 times [2025-03-03 18:29:25,609 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 18:29:25,609 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1709126521] [2025-03-03 18:29:25,609 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:29:25,610 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 18:29:25,625 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 80 statements into 1 equivalence classes. [2025-03-03 18:29:25,675 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 80 of 80 statements. [2025-03-03 18:29:25,676 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:29:25,676 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:29:25,993 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 11 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 18:29:25,993 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 18:29:25,994 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1709126521] [2025-03-03 18:29:25,994 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1709126521] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 18:29:25,994 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1251332299] [2025-03-03 18:29:25,994 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:29:25,994 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 18:29:25,994 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 18:29:25,996 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 18:29:25,998 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-03 18:29:26,115 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 80 statements into 1 equivalence classes. [2025-03-03 18:29:26,174 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 80 of 80 statements. [2025-03-03 18:29:26,174 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:29:26,174 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:29:26,177 INFO L256 TraceCheckSpWp]: Trace formula consists of 447 conjuncts, 29 conjuncts are in the unsatisfiable core [2025-03-03 18:29:26,180 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 18:29:26,410 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 18:29:26,411 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 18:29:26,411 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1251332299] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 18:29:26,411 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 18:29:26,411 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [13] total 22 [2025-03-03 18:29:26,411 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1741759375] [2025-03-03 18:29:26,412 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 18:29:26,412 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-03 18:29:26,412 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 18:29:26,412 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-03 18:29:26,413 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=410, Unknown=0, NotChecked=0, Total=462 [2025-03-03 18:29:26,413 INFO L87 Difference]: Start difference. First operand 417 states and 573 transitions. Second operand has 11 states, 11 states have (on average 7.2727272727272725) internal successors, (80), 11 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:29:26,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 18:29:26,593 INFO L93 Difference]: Finished difference Result 693 states and 961 transitions. [2025-03-03 18:29:26,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-03 18:29:26,594 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 7.2727272727272725) internal successors, (80), 11 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 80 [2025-03-03 18:29:26,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 18:29:26,595 INFO L225 Difference]: With dead ends: 693 [2025-03-03 18:29:26,596 INFO L226 Difference]: Without dead ends: 422 [2025-03-03 18:29:26,597 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 96 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=52, Invalid=410, Unknown=0, NotChecked=0, Total=462 [2025-03-03 18:29:26,598 INFO L435 NwaCegarLoop]: 128 mSDtfsCounter, 47 mSDsluCounter, 982 mSDsCounter, 0 mSdLazyCounter, 387 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 1110 SdHoareTripleChecker+Invalid, 389 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 387 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 18:29:26,598 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 1110 Invalid, 389 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 387 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 18:29:26,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 422 states. [2025-03-03 18:29:26,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 422 to 422. [2025-03-03 18:29:26,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 422 states, 421 states have (on average 1.3586698337292162) internal successors, (572), 421 states have internal predecessors, (572), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:29:26,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 422 states to 422 states and 572 transitions. [2025-03-03 18:29:26,608 INFO L78 Accepts]: Start accepts. Automaton has 422 states and 572 transitions. Word has length 80 [2025-03-03 18:29:26,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 18:29:26,609 INFO L471 AbstractCegarLoop]: Abstraction has 422 states and 572 transitions. [2025-03-03 18:29:26,609 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.2727272727272725) internal successors, (80), 11 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:29:26,609 INFO L276 IsEmpty]: Start isEmpty. Operand 422 states and 572 transitions. [2025-03-03 18:29:26,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2025-03-03 18:29:26,610 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 18:29:26,610 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 18:29:26,617 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-03 18:29:26,813 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 18:29:26,814 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 18:29:26,814 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 18:29:26,814 INFO L85 PathProgramCache]: Analyzing trace with hash 678606535, now seen corresponding path program 1 times [2025-03-03 18:29:26,814 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 18:29:26,814 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1075106911] [2025-03-03 18:29:26,815 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:29:26,815 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 18:29:26,830 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 81 statements into 1 equivalence classes. [2025-03-03 18:29:26,868 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 81 of 81 statements. [2025-03-03 18:29:26,868 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:29:26,868 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:29:27,151 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 11 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 18:29:27,152 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 18:29:27,152 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1075106911] [2025-03-03 18:29:27,152 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1075106911] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 18:29:27,152 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1497676804] [2025-03-03 18:29:27,152 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:29:27,152 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 18:29:27,152 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 18:29:27,167 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 18:29:27,169 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-03 18:29:27,294 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 81 statements into 1 equivalence classes. [2025-03-03 18:29:27,348 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 81 of 81 statements. [2025-03-03 18:29:27,348 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:29:27,348 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:29:27,351 INFO L256 TraceCheckSpWp]: Trace formula consists of 450 conjuncts, 52 conjuncts are in the unsatisfiable core [2025-03-03 18:29:27,357 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 18:29:27,549 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 18:29:27,551 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 18:29:27,551 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1497676804] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 18:29:27,551 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 18:29:27,551 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [13] total 25 [2025-03-03 18:29:27,551 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [490795516] [2025-03-03 18:29:27,551 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 18:29:27,551 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-03 18:29:27,551 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 18:29:27,552 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-03 18:29:27,552 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=544, Unknown=0, NotChecked=0, Total=600 [2025-03-03 18:29:27,553 INFO L87 Difference]: Start difference. First operand 422 states and 572 transitions. Second operand has 14 states, 14 states have (on average 5.785714285714286) internal successors, (81), 14 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:29:27,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 18:29:27,867 INFO L93 Difference]: Finished difference Result 752 states and 1041 transitions. [2025-03-03 18:29:27,868 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-03 18:29:27,868 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 5.785714285714286) internal successors, (81), 14 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 81 [2025-03-03 18:29:27,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 18:29:27,870 INFO L225 Difference]: With dead ends: 752 [2025-03-03 18:29:27,870 INFO L226 Difference]: Without dead ends: 529 [2025-03-03 18:29:27,870 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 126 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=60, Invalid=590, Unknown=0, NotChecked=0, Total=650 [2025-03-03 18:29:27,871 INFO L435 NwaCegarLoop]: 135 mSDtfsCounter, 91 mSDsluCounter, 1547 mSDsCounter, 0 mSdLazyCounter, 732 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 1682 SdHoareTripleChecker+Invalid, 734 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 732 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 18:29:27,872 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [91 Valid, 1682 Invalid, 734 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 732 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 18:29:27,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 529 states. [2025-03-03 18:29:27,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 529 to 476. [2025-03-03 18:29:27,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 476 states, 475 states have (on average 1.3747368421052633) internal successors, (653), 475 states have internal predecessors, (653), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:29:27,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 476 states to 476 states and 653 transitions. [2025-03-03 18:29:27,882 INFO L78 Accepts]: Start accepts. Automaton has 476 states and 653 transitions. Word has length 81 [2025-03-03 18:29:27,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 18:29:27,882 INFO L471 AbstractCegarLoop]: Abstraction has 476 states and 653 transitions. [2025-03-03 18:29:27,882 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 5.785714285714286) internal successors, (81), 14 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:29:27,882 INFO L276 IsEmpty]: Start isEmpty. Operand 476 states and 653 transitions. [2025-03-03 18:29:27,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2025-03-03 18:29:27,883 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 18:29:27,883 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 18:29:27,890 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-03 18:29:28,087 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 18:29:28,088 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 18:29:28,088 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 18:29:28,088 INFO L85 PathProgramCache]: Analyzing trace with hash 596241489, now seen corresponding path program 1 times [2025-03-03 18:29:28,088 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 18:29:28,088 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1559677171] [2025-03-03 18:29:28,088 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:29:28,088 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 18:29:28,103 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 81 statements into 1 equivalence classes. [2025-03-03 18:29:28,117 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 81 of 81 statements. [2025-03-03 18:29:28,117 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:29:28,117 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:29:28,199 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 18:29:28,199 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 18:29:28,199 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1559677171] [2025-03-03 18:29:28,199 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1559677171] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 18:29:28,199 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 18:29:28,199 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 18:29:28,200 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [362760906] [2025-03-03 18:29:28,200 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 18:29:28,200 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 18:29:28,200 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 18:29:28,201 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 18:29:28,201 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 18:29:28,201 INFO L87 Difference]: Start difference. First operand 476 states and 653 transitions. Second operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:29:28,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 18:29:28,273 INFO L93 Difference]: Finished difference Result 764 states and 1066 transitions. [2025-03-03 18:29:28,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 18:29:28,273 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 81 [2025-03-03 18:29:28,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 18:29:28,275 INFO L225 Difference]: With dead ends: 764 [2025-03-03 18:29:28,275 INFO L226 Difference]: Without dead ends: 486 [2025-03-03 18:29:28,275 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 18:29:28,276 INFO L435 NwaCegarLoop]: 135 mSDtfsCounter, 50 mSDsluCounter, 379 mSDsCounter, 0 mSdLazyCounter, 137 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 514 SdHoareTripleChecker+Invalid, 137 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 137 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 18:29:28,277 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 514 Invalid, 137 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 137 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 18:29:28,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 486 states. [2025-03-03 18:29:28,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 486 to 464. [2025-03-03 18:29:28,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 464 states, 463 states have (on average 1.367170626349892) internal successors, (633), 463 states have internal predecessors, (633), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:29:28,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 464 states to 464 states and 633 transitions. [2025-03-03 18:29:28,285 INFO L78 Accepts]: Start accepts. Automaton has 464 states and 633 transitions. Word has length 81 [2025-03-03 18:29:28,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 18:29:28,285 INFO L471 AbstractCegarLoop]: Abstraction has 464 states and 633 transitions. [2025-03-03 18:29:28,285 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:29:28,285 INFO L276 IsEmpty]: Start isEmpty. Operand 464 states and 633 transitions. [2025-03-03 18:29:28,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2025-03-03 18:29:28,286 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 18:29:28,286 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 18:29:28,286 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-03 18:29:28,286 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 18:29:28,287 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 18:29:28,287 INFO L85 PathProgramCache]: Analyzing trace with hash -44388256, now seen corresponding path program 1 times [2025-03-03 18:29:28,287 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 18:29:28,287 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [193163908] [2025-03-03 18:29:28,287 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:29:28,287 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 18:29:28,300 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 81 statements into 1 equivalence classes. [2025-03-03 18:29:28,329 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 81 of 81 statements. [2025-03-03 18:29:28,329 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:29:28,329 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:29:28,608 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 11 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 18:29:28,609 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 18:29:28,609 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [193163908] [2025-03-03 18:29:28,609 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [193163908] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 18:29:28,609 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [395806716] [2025-03-03 18:29:28,609 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:29:28,609 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 18:29:28,609 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 18:29:28,611 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 18:29:28,613 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-03 18:29:28,757 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 81 statements into 1 equivalence classes. [2025-03-03 18:29:28,822 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 81 of 81 statements. [2025-03-03 18:29:28,823 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:29:28,823 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:29:28,826 INFO L256 TraceCheckSpWp]: Trace formula consists of 448 conjuncts, 41 conjuncts are in the unsatisfiable core [2025-03-03 18:29:28,829 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 18:29:29,035 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 8 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 18:29:29,035 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 18:29:29,534 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 8 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 18:29:29,535 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [395806716] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 18:29:29,535 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 18:29:29,535 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 15, 15] total 39 [2025-03-03 18:29:29,535 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2010422490] [2025-03-03 18:29:29,535 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 18:29:29,535 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2025-03-03 18:29:29,535 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 18:29:29,536 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2025-03-03 18:29:29,536 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=1382, Unknown=0, NotChecked=0, Total=1482 [2025-03-03 18:29:29,537 INFO L87 Difference]: Start difference. First operand 464 states and 633 transitions. Second operand has 39 states, 39 states have (on average 5.717948717948718) internal successors, (223), 39 states have internal predecessors, (223), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:29:31,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 18:29:31,521 INFO L93 Difference]: Finished difference Result 1129 states and 1556 transitions. [2025-03-03 18:29:31,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2025-03-03 18:29:31,521 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 39 states have (on average 5.717948717948718) internal successors, (223), 39 states have internal predecessors, (223), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 81 [2025-03-03 18:29:31,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 18:29:31,523 INFO L225 Difference]: With dead ends: 1129 [2025-03-03 18:29:31,524 INFO L226 Difference]: Without dead ends: 851 [2025-03-03 18:29:31,525 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 209 GetRequests, 137 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 948 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=397, Invalid=5005, Unknown=0, NotChecked=0, Total=5402 [2025-03-03 18:29:31,526 INFO L435 NwaCegarLoop]: 166 mSDtfsCounter, 854 mSDsluCounter, 4809 mSDsCounter, 0 mSdLazyCounter, 3299 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 854 SdHoareTripleChecker+Valid, 4975 SdHoareTripleChecker+Invalid, 3307 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 3299 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-03-03 18:29:31,526 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [854 Valid, 4975 Invalid, 3307 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 3299 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-03-03 18:29:31,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 851 states. [2025-03-03 18:29:31,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 851 to 728. [2025-03-03 18:29:31,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 728 states, 727 states have (on average 1.3466299862448419) internal successors, (979), 727 states have internal predecessors, (979), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:29:31,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 728 states to 728 states and 979 transitions. [2025-03-03 18:29:31,541 INFO L78 Accepts]: Start accepts. Automaton has 728 states and 979 transitions. Word has length 81 [2025-03-03 18:29:31,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 18:29:31,541 INFO L471 AbstractCegarLoop]: Abstraction has 728 states and 979 transitions. [2025-03-03 18:29:31,541 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 39 states have (on average 5.717948717948718) internal successors, (223), 39 states have internal predecessors, (223), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:29:31,541 INFO L276 IsEmpty]: Start isEmpty. Operand 728 states and 979 transitions. [2025-03-03 18:29:31,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2025-03-03 18:29:31,542 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 18:29:31,542 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 18:29:31,551 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-03-03 18:29:31,746 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2025-03-03 18:29:31,746 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 18:29:31,746 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 18:29:31,746 INFO L85 PathProgramCache]: Analyzing trace with hash -1530068101, now seen corresponding path program 1 times [2025-03-03 18:29:31,747 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 18:29:31,747 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1942659239] [2025-03-03 18:29:31,747 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:29:31,747 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 18:29:31,763 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 81 statements into 1 equivalence classes. [2025-03-03 18:29:31,806 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 81 of 81 statements. [2025-03-03 18:29:31,807 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:29:31,807 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:29:31,966 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 18:29:31,966 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 18:29:31,967 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1942659239] [2025-03-03 18:29:31,967 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1942659239] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 18:29:31,967 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 18:29:31,967 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-03 18:29:31,967 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [949550398] [2025-03-03 18:29:31,967 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 18:29:31,967 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-03 18:29:31,967 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 18:29:31,968 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-03 18:29:31,968 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2025-03-03 18:29:31,968 INFO L87 Difference]: Start difference. First operand 728 states and 979 transitions. Second operand has 10 states, 10 states have (on average 8.1) internal successors, (81), 10 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:29:32,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 18:29:32,209 INFO L93 Difference]: Finished difference Result 1197 states and 1642 transitions. [2025-03-03 18:29:32,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-03 18:29:32,209 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 8.1) internal successors, (81), 10 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 81 [2025-03-03 18:29:32,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 18:29:32,212 INFO L225 Difference]: With dead ends: 1197 [2025-03-03 18:29:32,212 INFO L226 Difference]: Without dead ends: 896 [2025-03-03 18:29:32,212 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=199, Unknown=0, NotChecked=0, Total=240 [2025-03-03 18:29:32,213 INFO L435 NwaCegarLoop]: 195 mSDtfsCounter, 135 mSDsluCounter, 1473 mSDsCounter, 0 mSdLazyCounter, 474 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 135 SdHoareTripleChecker+Valid, 1668 SdHoareTripleChecker+Invalid, 476 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 474 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 18:29:32,213 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [135 Valid, 1668 Invalid, 476 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 474 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 18:29:32,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 896 states. [2025-03-03 18:29:32,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 896 to 761. [2025-03-03 18:29:32,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 761 states, 760 states have (on average 1.3447368421052632) internal successors, (1022), 760 states have internal predecessors, (1022), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:29:32,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 761 states to 761 states and 1022 transitions. [2025-03-03 18:29:32,226 INFO L78 Accepts]: Start accepts. Automaton has 761 states and 1022 transitions. Word has length 81 [2025-03-03 18:29:32,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 18:29:32,227 INFO L471 AbstractCegarLoop]: Abstraction has 761 states and 1022 transitions. [2025-03-03 18:29:32,227 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.1) internal successors, (81), 10 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:29:32,227 INFO L276 IsEmpty]: Start isEmpty. Operand 761 states and 1022 transitions. [2025-03-03 18:29:32,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2025-03-03 18:29:32,228 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 18:29:32,228 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 18:29:32,228 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-03-03 18:29:32,228 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 18:29:32,229 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 18:29:32,229 INFO L85 PathProgramCache]: Analyzing trace with hash -1403315522, now seen corresponding path program 1 times [2025-03-03 18:29:32,229 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 18:29:32,229 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [560451869] [2025-03-03 18:29:32,229 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:29:32,229 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 18:29:32,241 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 81 statements into 1 equivalence classes. [2025-03-03 18:29:32,274 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 81 of 81 statements. [2025-03-03 18:29:32,274 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:29:32,274 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:29:32,422 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 18:29:32,423 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 18:29:32,423 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [560451869] [2025-03-03 18:29:32,423 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [560451869] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 18:29:32,423 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 18:29:32,423 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 18:29:32,423 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [680892465] [2025-03-03 18:29:32,423 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 18:29:32,424 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 18:29:32,424 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 18:29:32,424 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 18:29:32,424 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 18:29:32,424 INFO L87 Difference]: Start difference. First operand 761 states and 1022 transitions. Second operand has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:29:32,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 18:29:32,468 INFO L93 Difference]: Finished difference Result 1131 states and 1535 transitions. [2025-03-03 18:29:32,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 18:29:32,469 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 81 [2025-03-03 18:29:32,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 18:29:32,471 INFO L225 Difference]: With dead ends: 1131 [2025-03-03 18:29:32,471 INFO L226 Difference]: Without dead ends: 617 [2025-03-03 18:29:32,471 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 18:29:32,472 INFO L435 NwaCegarLoop]: 138 mSDtfsCounter, 2 mSDsluCounter, 135 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 273 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 18:29:32,472 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 273 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 18:29:32,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 617 states. [2025-03-03 18:29:32,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 617 to 617. [2025-03-03 18:29:32,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 617 states, 616 states have (on average 1.349025974025974) internal successors, (831), 616 states have internal predecessors, (831), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:29:32,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 617 states to 617 states and 831 transitions. [2025-03-03 18:29:32,481 INFO L78 Accepts]: Start accepts. Automaton has 617 states and 831 transitions. Word has length 81 [2025-03-03 18:29:32,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 18:29:32,481 INFO L471 AbstractCegarLoop]: Abstraction has 617 states and 831 transitions. [2025-03-03 18:29:32,481 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:29:32,481 INFO L276 IsEmpty]: Start isEmpty. Operand 617 states and 831 transitions. [2025-03-03 18:29:32,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2025-03-03 18:29:32,482 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 18:29:32,482 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 18:29:32,482 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-03-03 18:29:32,482 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 18:29:32,482 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 18:29:32,482 INFO L85 PathProgramCache]: Analyzing trace with hash 1175259897, now seen corresponding path program 1 times [2025-03-03 18:29:32,483 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 18:29:32,483 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1194836082] [2025-03-03 18:29:32,483 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:29:32,483 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 18:29:32,502 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 81 statements into 1 equivalence classes. [2025-03-03 18:29:32,542 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 81 of 81 statements. [2025-03-03 18:29:32,543 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:29:32,543 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:29:32,881 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 12 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 18:29:32,881 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 18:29:32,881 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1194836082] [2025-03-03 18:29:32,881 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1194836082] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 18:29:32,881 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [115822090] [2025-03-03 18:29:32,881 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:29:32,881 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 18:29:32,882 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 18:29:32,884 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 18:29:32,886 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-03 18:29:33,011 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 81 statements into 1 equivalence classes. [2025-03-03 18:29:33,059 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 81 of 81 statements. [2025-03-03 18:29:33,060 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:29:33,060 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:29:33,063 INFO L256 TraceCheckSpWp]: Trace formula consists of 448 conjuncts, 65 conjuncts are in the unsatisfiable core [2025-03-03 18:29:33,066 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 18:29:33,550 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 4 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 18:29:33,550 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 18:29:34,541 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 4 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 18:29:34,541 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [115822090] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 18:29:34,541 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 18:29:34,541 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 20, 20] total 45 [2025-03-03 18:29:34,541 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1190421201] [2025-03-03 18:29:34,541 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 18:29:34,542 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2025-03-03 18:29:34,542 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 18:29:34,542 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2025-03-03 18:29:34,542 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=350, Invalid=1630, Unknown=0, NotChecked=0, Total=1980 [2025-03-03 18:29:34,543 INFO L87 Difference]: Start difference. First operand 617 states and 831 transitions. Second operand has 45 states, 45 states have (on average 4.911111111111111) internal successors, (221), 45 states have internal predecessors, (221), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:29:35,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 18:29:35,241 INFO L93 Difference]: Finished difference Result 970 states and 1316 transitions. [2025-03-03 18:29:35,242 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2025-03-03 18:29:35,242 INFO L78 Accepts]: Start accepts. Automaton has has 45 states, 45 states have (on average 4.911111111111111) internal successors, (221), 45 states have internal predecessors, (221), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 81 [2025-03-03 18:29:35,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 18:29:35,243 INFO L225 Difference]: With dead ends: 970 [2025-03-03 18:29:35,244 INFO L226 Difference]: Without dead ends: 615 [2025-03-03 18:29:35,244 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 178 GetRequests, 129 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 838 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=441, Invalid=2109, Unknown=0, NotChecked=0, Total=2550 [2025-03-03 18:29:35,245 INFO L435 NwaCegarLoop]: 118 mSDtfsCounter, 356 mSDsluCounter, 2325 mSDsCounter, 0 mSdLazyCounter, 1243 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 356 SdHoareTripleChecker+Valid, 2443 SdHoareTripleChecker+Invalid, 1248 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 1243 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-03 18:29:35,245 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [356 Valid, 2443 Invalid, 1248 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 1243 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-03 18:29:35,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 615 states. [2025-03-03 18:29:35,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 615 to 611. [2025-03-03 18:29:35,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 611 states, 610 states have (on average 1.3459016393442622) internal successors, (821), 610 states have internal predecessors, (821), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:29:35,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 611 states to 611 states and 821 transitions. [2025-03-03 18:29:35,253 INFO L78 Accepts]: Start accepts. Automaton has 611 states and 821 transitions. Word has length 81 [2025-03-03 18:29:35,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 18:29:35,253 INFO L471 AbstractCegarLoop]: Abstraction has 611 states and 821 transitions. [2025-03-03 18:29:35,253 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 45 states, 45 states have (on average 4.911111111111111) internal successors, (221), 45 states have internal predecessors, (221), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:29:35,253 INFO L276 IsEmpty]: Start isEmpty. Operand 611 states and 821 transitions. [2025-03-03 18:29:35,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2025-03-03 18:29:35,254 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 18:29:35,254 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 18:29:35,262 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-03-03 18:29:35,459 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2025-03-03 18:29:35,459 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 18:29:35,459 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 18:29:35,459 INFO L85 PathProgramCache]: Analyzing trace with hash -1818648783, now seen corresponding path program 1 times [2025-03-03 18:29:35,460 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 18:29:35,460 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [481661509] [2025-03-03 18:29:35,460 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:29:35,460 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 18:29:35,472 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 81 statements into 1 equivalence classes. [2025-03-03 18:29:35,484 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 81 of 81 statements. [2025-03-03 18:29:35,484 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:29:35,485 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:29:35,566 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 18:29:35,567 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 18:29:35,567 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [481661509] [2025-03-03 18:29:35,567 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [481661509] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 18:29:35,567 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 18:29:35,567 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 18:29:35,567 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1522691524] [2025-03-03 18:29:35,567 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 18:29:35,568 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 18:29:35,568 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 18:29:35,568 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 18:29:35,568 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 18:29:35,568 INFO L87 Difference]: Start difference. First operand 611 states and 821 transitions. Second operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:29:35,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 18:29:35,653 INFO L93 Difference]: Finished difference Result 1077 states and 1459 transitions. [2025-03-03 18:29:35,654 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 18:29:35,654 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 81 [2025-03-03 18:29:35,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 18:29:35,656 INFO L225 Difference]: With dead ends: 1077 [2025-03-03 18:29:35,656 INFO L226 Difference]: Without dead ends: 521 [2025-03-03 18:29:35,657 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-03 18:29:35,657 INFO L435 NwaCegarLoop]: 133 mSDtfsCounter, 44 mSDsluCounter, 373 mSDsCounter, 0 mSdLazyCounter, 141 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 506 SdHoareTripleChecker+Invalid, 141 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 141 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 18:29:35,657 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 506 Invalid, 141 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 141 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 18:29:35,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 521 states. [2025-03-03 18:29:35,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 521 to 521. [2025-03-03 18:29:35,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 521 states, 520 states have (on average 1.3596153846153847) internal successors, (707), 520 states have internal predecessors, (707), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:29:35,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 521 states to 521 states and 707 transitions. [2025-03-03 18:29:35,666 INFO L78 Accepts]: Start accepts. Automaton has 521 states and 707 transitions. Word has length 81 [2025-03-03 18:29:35,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 18:29:35,666 INFO L471 AbstractCegarLoop]: Abstraction has 521 states and 707 transitions. [2025-03-03 18:29:35,666 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:29:35,666 INFO L276 IsEmpty]: Start isEmpty. Operand 521 states and 707 transitions. [2025-03-03 18:29:35,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2025-03-03 18:29:35,667 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 18:29:35,667 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 18:29:35,667 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-03-03 18:29:35,667 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 18:29:35,668 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 18:29:35,668 INFO L85 PathProgramCache]: Analyzing trace with hash -78476165, now seen corresponding path program 1 times [2025-03-03 18:29:35,668 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 18:29:35,668 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1686812994] [2025-03-03 18:29:35,668 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:29:35,668 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 18:29:35,685 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 82 statements into 1 equivalence classes. [2025-03-03 18:29:35,736 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 82 of 82 statements. [2025-03-03 18:29:35,736 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:29:35,736 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:29:35,994 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 18:29:35,994 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 18:29:35,994 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1686812994] [2025-03-03 18:29:35,994 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1686812994] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 18:29:35,994 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 18:29:35,994 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-03-03 18:29:35,994 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [305175788] [2025-03-03 18:29:35,994 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 18:29:35,995 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-03 18:29:35,995 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 18:29:35,995 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-03 18:29:35,995 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=154, Unknown=0, NotChecked=0, Total=182 [2025-03-03 18:29:35,995 INFO L87 Difference]: Start difference. First operand 521 states and 707 transitions. Second operand has 14 states, 14 states have (on average 5.857142857142857) internal successors, (82), 14 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:29:36,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 18:29:36,316 INFO L93 Difference]: Finished difference Result 840 states and 1154 transitions. [2025-03-03 18:29:36,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-03 18:29:36,316 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 5.857142857142857) internal successors, (82), 14 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 82 [2025-03-03 18:29:36,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 18:29:36,318 INFO L225 Difference]: With dead ends: 840 [2025-03-03 18:29:36,318 INFO L226 Difference]: Without dead ends: 525 [2025-03-03 18:29:36,319 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=86, Invalid=420, Unknown=0, NotChecked=0, Total=506 [2025-03-03 18:29:36,319 INFO L435 NwaCegarLoop]: 120 mSDtfsCounter, 100 mSDsluCounter, 1427 mSDsCounter, 0 mSdLazyCounter, 634 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 1547 SdHoareTripleChecker+Invalid, 637 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 634 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 18:29:36,319 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [100 Valid, 1547 Invalid, 637 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 634 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 18:29:36,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 525 states. [2025-03-03 18:29:36,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 525 to 525. [2025-03-03 18:29:36,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 525 states, 524 states have (on average 1.3587786259541985) internal successors, (712), 524 states have internal predecessors, (712), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:29:36,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 525 states to 525 states and 712 transitions. [2025-03-03 18:29:36,327 INFO L78 Accepts]: Start accepts. Automaton has 525 states and 712 transitions. Word has length 82 [2025-03-03 18:29:36,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 18:29:36,328 INFO L471 AbstractCegarLoop]: Abstraction has 525 states and 712 transitions. [2025-03-03 18:29:36,328 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 5.857142857142857) internal successors, (82), 14 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:29:36,328 INFO L276 IsEmpty]: Start isEmpty. Operand 525 states and 712 transitions. [2025-03-03 18:29:36,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2025-03-03 18:29:36,329 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 18:29:36,329 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 18:29:36,329 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-03-03 18:29:36,329 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 18:29:36,329 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 18:29:36,329 INFO L85 PathProgramCache]: Analyzing trace with hash -1922595764, now seen corresponding path program 1 times [2025-03-03 18:29:36,329 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 18:29:36,330 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [396149590] [2025-03-03 18:29:36,330 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:29:36,330 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 18:29:36,344 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 82 statements into 1 equivalence classes. [2025-03-03 18:29:36,395 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 82 of 82 statements. [2025-03-03 18:29:36,395 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:29:36,395 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:29:36,655 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 18:29:36,656 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 18:29:36,656 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [396149590] [2025-03-03 18:29:36,656 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [396149590] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 18:29:36,656 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 18:29:36,656 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-03 18:29:36,656 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1647637204] [2025-03-03 18:29:36,656 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 18:29:36,657 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-03 18:29:36,657 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 18:29:36,657 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-03 18:29:36,657 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2025-03-03 18:29:36,658 INFO L87 Difference]: Start difference. First operand 525 states and 712 transitions. Second operand has 11 states, 11 states have (on average 7.454545454545454) internal successors, (82), 11 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:29:36,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 18:29:36,819 INFO L93 Difference]: Finished difference Result 794 states and 1093 transitions. [2025-03-03 18:29:36,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-03 18:29:36,820 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 7.454545454545454) internal successors, (82), 11 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 82 [2025-03-03 18:29:36,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 18:29:36,821 INFO L225 Difference]: With dead ends: 794 [2025-03-03 18:29:36,821 INFO L226 Difference]: Without dead ends: 530 [2025-03-03 18:29:36,822 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2025-03-03 18:29:36,822 INFO L435 NwaCegarLoop]: 135 mSDtfsCounter, 33 mSDsluCounter, 958 mSDsCounter, 0 mSdLazyCounter, 357 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 1093 SdHoareTripleChecker+Invalid, 357 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 357 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 18:29:36,822 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 1093 Invalid, 357 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 357 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 18:29:36,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 530 states. [2025-03-03 18:29:36,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 530 to 529. [2025-03-03 18:29:36,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 529 states, 528 states have (on average 1.356060606060606) internal successors, (716), 528 states have internal predecessors, (716), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:29:36,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 529 states to 529 states and 716 transitions. [2025-03-03 18:29:36,829 INFO L78 Accepts]: Start accepts. Automaton has 529 states and 716 transitions. Word has length 82 [2025-03-03 18:29:36,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 18:29:36,830 INFO L471 AbstractCegarLoop]: Abstraction has 529 states and 716 transitions. [2025-03-03 18:29:36,830 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.454545454545454) internal successors, (82), 11 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:29:36,830 INFO L276 IsEmpty]: Start isEmpty. Operand 529 states and 716 transitions. [2025-03-03 18:29:36,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2025-03-03 18:29:36,831 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 18:29:36,831 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 18:29:36,831 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2025-03-03 18:29:36,831 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 18:29:36,832 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 18:29:36,832 INFO L85 PathProgramCache]: Analyzing trace with hash -601246033, now seen corresponding path program 1 times [2025-03-03 18:29:36,832 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 18:29:36,832 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1031426406] [2025-03-03 18:29:36,832 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:29:36,832 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 18:29:36,845 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 82 statements into 1 equivalence classes. [2025-03-03 18:29:36,877 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 82 of 82 statements. [2025-03-03 18:29:36,878 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:29:36,878 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:29:37,157 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 12 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 18:29:37,158 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 18:29:37,158 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1031426406] [2025-03-03 18:29:37,158 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1031426406] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 18:29:37,158 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1691221312] [2025-03-03 18:29:37,158 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:29:37,158 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 18:29:37,158 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 18:29:37,159 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 18:29:37,160 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-03 18:29:37,321 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 82 statements into 1 equivalence classes. [2025-03-03 18:29:37,383 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 82 of 82 statements. [2025-03-03 18:29:37,383 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:29:37,383 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:29:37,386 INFO L256 TraceCheckSpWp]: Trace formula consists of 451 conjuncts, 41 conjuncts are in the unsatisfiable core [2025-03-03 18:29:37,388 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 18:29:37,725 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 12 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 18:29:37,725 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 18:29:38,521 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 4 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 18:29:38,522 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1691221312] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 18:29:38,522 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 18:29:38,522 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 13] total 34 [2025-03-03 18:29:38,522 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1512152194] [2025-03-03 18:29:38,522 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 18:29:38,523 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2025-03-03 18:29:38,523 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 18:29:38,523 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2025-03-03 18:29:38,524 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=147, Invalid=975, Unknown=0, NotChecked=0, Total=1122 [2025-03-03 18:29:38,524 INFO L87 Difference]: Start difference. First operand 529 states and 716 transitions. Second operand has 34 states, 34 states have (on average 6.882352941176471) internal successors, (234), 34 states have internal predecessors, (234), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:29:39,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 18:29:39,480 INFO L93 Difference]: Finished difference Result 904 states and 1243 transitions. [2025-03-03 18:29:39,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-03-03 18:29:39,480 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 34 states have (on average 6.882352941176471) internal successors, (234), 34 states have internal predecessors, (234), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 82 [2025-03-03 18:29:39,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 18:29:39,482 INFO L225 Difference]: With dead ends: 904 [2025-03-03 18:29:39,482 INFO L226 Difference]: Without dead ends: 638 [2025-03-03 18:29:39,483 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 190 GetRequests, 144 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 513 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=286, Invalid=1970, Unknown=0, NotChecked=0, Total=2256 [2025-03-03 18:29:39,483 INFO L435 NwaCegarLoop]: 165 mSDtfsCounter, 426 mSDsluCounter, 3470 mSDsCounter, 0 mSdLazyCounter, 1888 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 426 SdHoareTripleChecker+Valid, 3635 SdHoareTripleChecker+Invalid, 1893 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 1888 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-03 18:29:39,483 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [426 Valid, 3635 Invalid, 1893 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 1888 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-03 18:29:39,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 638 states. [2025-03-03 18:29:39,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 638 to 529. [2025-03-03 18:29:39,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 529 states, 528 states have (on average 1.356060606060606) internal successors, (716), 528 states have internal predecessors, (716), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:29:39,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 529 states to 529 states and 716 transitions. [2025-03-03 18:29:39,490 INFO L78 Accepts]: Start accepts. Automaton has 529 states and 716 transitions. Word has length 82 [2025-03-03 18:29:39,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 18:29:39,490 INFO L471 AbstractCegarLoop]: Abstraction has 529 states and 716 transitions. [2025-03-03 18:29:39,490 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 6.882352941176471) internal successors, (234), 34 states have internal predecessors, (234), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:29:39,490 INFO L276 IsEmpty]: Start isEmpty. Operand 529 states and 716 transitions. [2025-03-03 18:29:39,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2025-03-03 18:29:39,491 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 18:29:39,491 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 18:29:39,499 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-03-03 18:29:39,694 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 18:29:39,694 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 18:29:39,695 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 18:29:39,695 INFO L85 PathProgramCache]: Analyzing trace with hash 1321740401, now seen corresponding path program 1 times [2025-03-03 18:29:39,695 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 18:29:39,695 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [321607647] [2025-03-03 18:29:39,695 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:29:39,696 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 18:29:39,711 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 82 statements into 1 equivalence classes. [2025-03-03 18:29:39,783 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 82 of 82 statements. [2025-03-03 18:29:39,783 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:29:39,783 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:29:40,085 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 10 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-03 18:29:40,085 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 18:29:40,085 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [321607647] [2025-03-03 18:29:40,085 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [321607647] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 18:29:40,085 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1769115181] [2025-03-03 18:29:40,085 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:29:40,085 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 18:29:40,086 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 18:29:40,087 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 18:29:40,089 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-03-03 18:29:40,235 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 82 statements into 1 equivalence classes. [2025-03-03 18:29:40,278 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 82 of 82 statements. [2025-03-03 18:29:40,278 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:29:40,278 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:29:40,281 INFO L256 TraceCheckSpWp]: Trace formula consists of 453 conjuncts, 55 conjuncts are in the unsatisfiable core [2025-03-03 18:29:40,283 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 18:29:40,540 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 10 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 18:29:40,540 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 18:29:40,985 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 11 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 18:29:40,985 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1769115181] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 18:29:40,985 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 18:29:40,985 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 15, 14] total 34 [2025-03-03 18:29:40,985 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [50270381] [2025-03-03 18:29:40,985 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 18:29:40,985 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2025-03-03 18:29:40,985 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 18:29:40,986 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2025-03-03 18:29:40,986 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=1011, Unknown=0, NotChecked=0, Total=1122 [2025-03-03 18:29:40,986 INFO L87 Difference]: Start difference. First operand 529 states and 716 transitions. Second operand has 34 states, 34 states have (on average 5.647058823529412) internal successors, (192), 34 states have internal predecessors, (192), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:29:41,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 18:29:41,550 INFO L93 Difference]: Finished difference Result 1497 states and 2035 transitions. [2025-03-03 18:29:41,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2025-03-03 18:29:41,550 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 34 states have (on average 5.647058823529412) internal successors, (192), 34 states have internal predecessors, (192), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 82 [2025-03-03 18:29:41,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 18:29:41,552 INFO L225 Difference]: With dead ends: 1497 [2025-03-03 18:29:41,552 INFO L226 Difference]: Without dead ends: 1015 [2025-03-03 18:29:41,554 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 195 GetRequests, 145 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 571 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=282, Invalid=2370, Unknown=0, NotChecked=0, Total=2652 [2025-03-03 18:29:41,554 INFO L435 NwaCegarLoop]: 127 mSDtfsCounter, 518 mSDsluCounter, 2052 mSDsCounter, 0 mSdLazyCounter, 957 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 518 SdHoareTripleChecker+Valid, 2179 SdHoareTripleChecker+Invalid, 962 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 957 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 18:29:41,554 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [518 Valid, 2179 Invalid, 962 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 957 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 18:29:41,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1015 states. [2025-03-03 18:29:41,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1015 to 984. [2025-03-03 18:29:41,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 984 states, 983 states have (on average 1.3448626653102747) internal successors, (1322), 983 states have internal predecessors, (1322), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:29:41,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 984 states to 984 states and 1322 transitions. [2025-03-03 18:29:41,569 INFO L78 Accepts]: Start accepts. Automaton has 984 states and 1322 transitions. Word has length 82 [2025-03-03 18:29:41,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 18:29:41,569 INFO L471 AbstractCegarLoop]: Abstraction has 984 states and 1322 transitions. [2025-03-03 18:29:41,569 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 5.647058823529412) internal successors, (192), 34 states have internal predecessors, (192), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:29:41,569 INFO L276 IsEmpty]: Start isEmpty. Operand 984 states and 1322 transitions. [2025-03-03 18:29:41,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2025-03-03 18:29:41,570 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 18:29:41,570 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 18:29:41,578 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2025-03-03 18:29:41,775 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable30 [2025-03-03 18:29:41,775 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 18:29:41,775 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 18:29:41,775 INFO L85 PathProgramCache]: Analyzing trace with hash 109462072, now seen corresponding path program 1 times [2025-03-03 18:29:41,776 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 18:29:41,776 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1998107264] [2025-03-03 18:29:41,776 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:29:41,776 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 18:29:41,789 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 83 statements into 1 equivalence classes. [2025-03-03 18:29:41,819 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 83 of 83 statements. [2025-03-03 18:29:41,819 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:29:41,819 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:29:41,956 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 18:29:41,956 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 18:29:41,956 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1998107264] [2025-03-03 18:29:41,957 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1998107264] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 18:29:41,957 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 18:29:41,957 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-03 18:29:41,957 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2141378537] [2025-03-03 18:29:41,957 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 18:29:41,960 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 18:29:41,960 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 18:29:41,961 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 18:29:41,961 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-03 18:29:41,961 INFO L87 Difference]: Start difference. First operand 984 states and 1322 transitions. Second operand has 7 states, 7 states have (on average 11.857142857142858) internal successors, (83), 7 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:29:42,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 18:29:42,058 INFO L93 Difference]: Finished difference Result 1967 states and 2648 transitions. [2025-03-03 18:29:42,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-03 18:29:42,059 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.857142857142858) internal successors, (83), 7 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 83 [2025-03-03 18:29:42,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 18:29:42,062 INFO L225 Difference]: With dead ends: 1967 [2025-03-03 18:29:42,062 INFO L226 Difference]: Without dead ends: 1022 [2025-03-03 18:29:42,063 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-03 18:29:42,063 INFO L435 NwaCegarLoop]: 134 mSDtfsCounter, 9 mSDsluCounter, 656 mSDsCounter, 0 mSdLazyCounter, 217 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 790 SdHoareTripleChecker+Invalid, 218 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 217 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 18:29:42,063 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 790 Invalid, 218 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 217 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 18:29:42,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1022 states. [2025-03-03 18:29:42,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1022 to 1019. [2025-03-03 18:29:42,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1019 states, 1018 states have (on average 1.343811394891945) internal successors, (1368), 1018 states have internal predecessors, (1368), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:29:42,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1019 states to 1019 states and 1368 transitions. [2025-03-03 18:29:42,083 INFO L78 Accepts]: Start accepts. Automaton has 1019 states and 1368 transitions. Word has length 83 [2025-03-03 18:29:42,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 18:29:42,083 INFO L471 AbstractCegarLoop]: Abstraction has 1019 states and 1368 transitions. [2025-03-03 18:29:42,083 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.857142857142858) internal successors, (83), 7 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:29:42,083 INFO L276 IsEmpty]: Start isEmpty. Operand 1019 states and 1368 transitions. [2025-03-03 18:29:42,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2025-03-03 18:29:42,084 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 18:29:42,084 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 18:29:42,084 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2025-03-03 18:29:42,084 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 18:29:42,086 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 18:29:42,086 INFO L85 PathProgramCache]: Analyzing trace with hash 132833679, now seen corresponding path program 1 times [2025-03-03 18:29:42,086 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 18:29:42,086 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1383334367] [2025-03-03 18:29:42,086 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:29:42,086 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 18:29:42,109 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 83 statements into 1 equivalence classes. [2025-03-03 18:29:42,177 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 83 of 83 statements. [2025-03-03 18:29:42,178 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:29:42,178 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:29:42,438 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 18:29:42,438 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 18:29:42,438 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1383334367] [2025-03-03 18:29:42,438 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1383334367] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 18:29:42,438 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 18:29:42,439 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-03 18:29:42,439 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [146190765] [2025-03-03 18:29:42,439 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 18:29:42,439 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-03 18:29:42,439 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 18:29:42,439 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-03 18:29:42,439 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-03 18:29:42,439 INFO L87 Difference]: Start difference. First operand 1019 states and 1368 transitions. Second operand has 8 states, 8 states have (on average 10.375) internal successors, (83), 8 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:29:42,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 18:29:42,535 INFO L93 Difference]: Finished difference Result 1787 states and 2417 transitions. [2025-03-03 18:29:42,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-03 18:29:42,536 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 10.375) internal successors, (83), 8 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 83 [2025-03-03 18:29:42,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 18:29:42,538 INFO L225 Difference]: With dead ends: 1787 [2025-03-03 18:29:42,538 INFO L226 Difference]: Without dead ends: 1029 [2025-03-03 18:29:42,539 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-03 18:29:42,539 INFO L435 NwaCegarLoop]: 131 mSDtfsCounter, 7 mSDsluCounter, 771 mSDsCounter, 0 mSdLazyCounter, 270 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 902 SdHoareTripleChecker+Invalid, 270 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 270 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 18:29:42,539 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 902 Invalid, 270 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 270 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 18:29:42,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1029 states. [2025-03-03 18:29:42,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1029 to 1023. [2025-03-03 18:29:42,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1023 states, 1022 states have (on average 1.3424657534246576) internal successors, (1372), 1022 states have internal predecessors, (1372), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:29:42,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1023 states to 1023 states and 1372 transitions. [2025-03-03 18:29:42,549 INFO L78 Accepts]: Start accepts. Automaton has 1023 states and 1372 transitions. Word has length 83 [2025-03-03 18:29:42,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 18:29:42,550 INFO L471 AbstractCegarLoop]: Abstraction has 1023 states and 1372 transitions. [2025-03-03 18:29:42,550 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.375) internal successors, (83), 8 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:29:42,550 INFO L276 IsEmpty]: Start isEmpty. Operand 1023 states and 1372 transitions. [2025-03-03 18:29:42,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2025-03-03 18:29:42,551 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 18:29:42,551 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 18:29:42,551 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2025-03-03 18:29:42,551 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 18:29:42,551 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 18:29:42,552 INFO L85 PathProgramCache]: Analyzing trace with hash -1159704746, now seen corresponding path program 1 times [2025-03-03 18:29:42,552 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 18:29:42,552 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [666237283] [2025-03-03 18:29:42,552 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:29:42,552 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 18:29:42,563 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 83 statements into 1 equivalence classes. [2025-03-03 18:29:42,597 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 83 of 83 statements. [2025-03-03 18:29:42,597 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:29:42,597 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-03 18:29:42,597 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-03 18:29:42,602 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 83 statements into 1 equivalence classes. [2025-03-03 18:29:42,649 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 83 of 83 statements. [2025-03-03 18:29:42,650 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:29:42,650 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-03 18:29:42,678 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-03 18:29:42,678 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-03 18:29:42,679 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-03 18:29:42,680 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2025-03-03 18:29:42,682 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 18:29:42,709 WARN L310 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2025-03-03 18:29:42,709 WARN L310 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2025-03-03 18:29:42,721 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-03 18:29:42,724 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.03 06:29:42 BoogieIcfgContainer [2025-03-03 18:29:42,724 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-03 18:29:42,725 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-03 18:29:42,725 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-03 18:29:42,725 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-03 18:29:42,726 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 06:29:12" (3/4) ... [2025-03-03 18:29:42,727 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-03 18:29:42,728 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-03 18:29:42,729 INFO L158 Benchmark]: Toolchain (without parser) took 30840.42ms. Allocated memory was 142.6MB in the beginning and 629.1MB in the end (delta: 486.5MB). Free memory was 112.4MB in the beginning and 444.0MB in the end (delta: -331.6MB). Peak memory consumption was 158.7MB. Max. memory is 16.1GB. [2025-03-03 18:29:42,729 INFO L158 Benchmark]: CDTParser took 0.25ms. Allocated memory is still 201.3MB. Free memory is still 122.4MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 18:29:42,729 INFO L158 Benchmark]: CACSL2BoogieTranslator took 263.56ms. Allocated memory is still 142.6MB. Free memory was 112.0MB in the beginning and 96.8MB in the end (delta: 15.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-03 18:29:42,729 INFO L158 Benchmark]: Boogie Procedure Inliner took 52.84ms. Allocated memory is still 142.6MB. Free memory was 96.8MB in the beginning and 87.1MB in the end (delta: 9.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-03 18:29:42,731 INFO L158 Benchmark]: Boogie Preprocessor took 86.14ms. Allocated memory is still 142.6MB. Free memory was 87.1MB in the beginning and 81.7MB in the end (delta: 5.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-03 18:29:42,731 INFO L158 Benchmark]: IcfgBuilder took 679.45ms. Allocated memory is still 142.6MB. Free memory was 81.7MB in the beginning and 88.9MB in the end (delta: -7.2MB). Peak memory consumption was 50.5MB. Max. memory is 16.1GB. [2025-03-03 18:29:42,731 INFO L158 Benchmark]: TraceAbstraction took 29750.29ms. Allocated memory was 142.6MB in the beginning and 629.1MB in the end (delta: 486.5MB). Free memory was 88.3MB in the beginning and 444.1MB in the end (delta: -355.9MB). Peak memory consumption was 125.0MB. Max. memory is 16.1GB. [2025-03-03 18:29:42,731 INFO L158 Benchmark]: Witness Printer took 3.25ms. Allocated memory is still 629.1MB. Free memory was 444.1MB in the beginning and 444.0MB in the end (delta: 86.0kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-03 18:29:42,732 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.25ms. Allocated memory is still 201.3MB. Free memory is still 122.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 263.56ms. Allocated memory is still 142.6MB. Free memory was 112.0MB in the beginning and 96.8MB in the end (delta: 15.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 52.84ms. Allocated memory is still 142.6MB. Free memory was 96.8MB in the beginning and 87.1MB in the end (delta: 9.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 86.14ms. Allocated memory is still 142.6MB. Free memory was 87.1MB in the beginning and 81.7MB in the end (delta: 5.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 679.45ms. Allocated memory is still 142.6MB. Free memory was 81.7MB in the beginning and 88.9MB in the end (delta: -7.2MB). Peak memory consumption was 50.5MB. Max. memory is 16.1GB. * TraceAbstraction took 29750.29ms. Allocated memory was 142.6MB in the beginning and 629.1MB in the end (delta: 486.5MB). Free memory was 88.3MB in the beginning and 444.1MB in the end (delta: -355.9MB). Peak memory consumption was 125.0MB. Max. memory is 16.1GB. * Witness Printer took 3.25ms. Allocated memory is still 629.1MB. Free memory was 444.1MB in the beginning and 444.0MB in the end (delta: 86.0kB). 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: 21]: 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 bitwiseOr at line 106, overapproximation of bitwiseAnd at line 111. Possible FailurePath: [L26] const SORT_1 mask_SORT_1 = (SORT_1)-1 >> (sizeof(SORT_1) * 8 - 3); [L27] const SORT_1 msb_SORT_1 = (SORT_1)1 << (3 - 1); [L29] const SORT_3 mask_SORT_3 = (SORT_3)-1 >> (sizeof(SORT_3) * 8 - 1); [L30] const SORT_3 msb_SORT_3 = (SORT_3)1 << (1 - 1); [L32] const SORT_12 mask_SORT_12 = (SORT_12)-1 >> (sizeof(SORT_12) * 8 - 8); [L33] const SORT_12 msb_SORT_12 = (SORT_12)1 << (8 - 1); [L35] const SORT_3 var_14 = 0; [L36] const SORT_3 var_29 = 1; [L38] SORT_1 input_2; [L39] SORT_3 input_4; [L40] SORT_3 input_5; [L41] SORT_3 input_6; [L42] SORT_3 input_7; [L43] SORT_3 input_8; [L44] SORT_3 input_9; [L45] SORT_3 input_10; [L46] SORT_3 input_11; [L47] SORT_12 input_13; [L48] SORT_12 input_33; [L49] SORT_12 input_35; [L50] SORT_3 input_37; [L51] SORT_3 input_39; [L52] SORT_12 input_97; [L53] SORT_3 input_99; [L54] SORT_1 input_102; [L55] SORT_3 input_104; [L56] SORT_3 input_106; [L57] SORT_3 input_108; [L59] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_3=1, var_14=0, var_29=1] [L59] SORT_3 state_15 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L60] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_3=1, var_14=0, var_29=1] [L60] SORT_3 state_17 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L61] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_3=1, var_14=0, var_29=1] [L61] SORT_3 state_20 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L62] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_3=1, var_14=0, var_29=1] [L62] SORT_3 state_24 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L64] SORT_3 init_16_arg_1 = var_14; [L65] state_15 = init_16_arg_1 [L66] SORT_3 init_18_arg_1 = var_14; [L67] state_17 = init_18_arg_1 [L68] SORT_3 init_21_arg_1 = var_14; [L69] state_20 = init_21_arg_1 [L70] SORT_3 init_25_arg_1 = var_14; [L71] state_24 = init_25_arg_1 VAL [mask_SORT_3=1, state_15=0, state_17=0, state_20=0, state_24=0, var_29=1] [L74] input_2 = __VERIFIER_nondet_uchar() [L75] input_4 = __VERIFIER_nondet_uchar() [L76] input_5 = __VERIFIER_nondet_uchar() [L77] input_6 = __VERIFIER_nondet_uchar() [L78] input_7 = __VERIFIER_nondet_uchar() [L79] input_8 = __VERIFIER_nondet_uchar() [L80] input_9 = __VERIFIER_nondet_uchar() [L81] input_10 = __VERIFIER_nondet_uchar() [L82] input_11 = __VERIFIER_nondet_uchar() [L83] input_13 = __VERIFIER_nondet_uchar() [L84] input_33 = __VERIFIER_nondet_uchar() [L85] input_35 = __VERIFIER_nondet_uchar() [L86] input_37 = __VERIFIER_nondet_uchar() [L87] input_39 = __VERIFIER_nondet_uchar() [L88] input_97 = __VERIFIER_nondet_uchar() [L89] input_99 = __VERIFIER_nondet_uchar() [L90] input_102 = __VERIFIER_nondet_uchar() [L91] input_104 = __VERIFIER_nondet_uchar() [L92] input_106 = __VERIFIER_nondet_uchar() [L93] input_108 = __VERIFIER_nondet_uchar() [L96] SORT_3 var_19_arg_0 = state_15; [L97] SORT_3 var_19_arg_1 = state_17; VAL [mask_SORT_3=1, state_15=0, state_17=0, state_20=0, state_24=0, var_19_arg_0=0, var_19_arg_1=0, var_29=1] [L98] EXPR var_19_arg_0 | var_19_arg_1 VAL [mask_SORT_3=1, state_15=0, state_17=0, state_20=0, state_24=0, var_29=1] [L98] SORT_3 var_19 = var_19_arg_0 | var_19_arg_1; [L99] SORT_3 var_22_arg_0 = var_19; [L100] SORT_3 var_22_arg_1 = state_20; VAL [mask_SORT_3=1, state_15=0, state_17=0, state_20=0, state_24=0, var_22_arg_0=0, var_22_arg_1=0, var_29=1] [L101] EXPR var_22_arg_0 | var_22_arg_1 VAL [mask_SORT_3=1, state_15=0, state_17=0, state_20=0, state_24=0, var_29=1] [L101] SORT_3 var_22 = var_22_arg_0 | var_22_arg_1; [L102] SORT_3 var_23_arg_0 = var_22; [L103] SORT_3 var_23 = ~var_23_arg_0; [L104] SORT_3 var_26_arg_0 = var_23; [L105] SORT_3 var_26_arg_1 = state_24; VAL [mask_SORT_3=1, state_15=0, state_17=0, state_20=0, var_26_arg_0=-1, var_26_arg_1=0, var_29=1] [L106] EXPR var_26_arg_0 | var_26_arg_1 VAL [mask_SORT_3=1, state_15=0, state_17=0, state_20=0, var_29=1] [L106] SORT_3 var_26 = var_26_arg_0 | var_26_arg_1; [L107] SORT_3 var_30_arg_0 = var_26; [L108] SORT_3 var_30 = ~var_30_arg_0; [L109] SORT_3 var_31_arg_0 = var_29; [L110] SORT_3 var_31_arg_1 = var_30; VAL [mask_SORT_3=1, state_15=0, state_17=0, state_20=0, var_29=1, var_31_arg_0=1, var_31_arg_1=-256] [L111] EXPR var_31_arg_0 & var_31_arg_1 VAL [mask_SORT_3=1, state_15=0, state_17=0, state_20=0, var_29=1] [L111] SORT_3 var_31 = var_31_arg_0 & var_31_arg_1; [L112] EXPR var_31 & mask_SORT_3 VAL [mask_SORT_3=1, state_15=0, state_17=0, state_20=0, var_29=1] [L112] var_31 = var_31 & mask_SORT_3 [L113] SORT_3 bad_32_arg_0 = var_31; [L114] CALL __VERIFIER_assert(!(bad_32_arg_0)) [L21] COND FALSE !(!(cond)) [L114] RET __VERIFIER_assert(!(bad_32_arg_0)) [L116] SORT_3 var_41_arg_0 = state_17; [L117] SORT_3 var_41 = ~var_41_arg_0; [L118] SORT_3 var_42_arg_0 = state_15; [L119] SORT_3 var_42 = ~var_42_arg_0; [L120] SORT_3 var_43_arg_0 = var_42; [L121] SORT_3 var_43_arg_1 = state_20; VAL [mask_SORT_3=1, state_15=0, state_17=0, state_20=0, var_29=1, var_41=-1, var_42=-1, var_43_arg_0=-1, var_43_arg_1=0] [L122] EXPR var_43_arg_0 & var_43_arg_1 VAL [mask_SORT_3=1, state_15=0, state_17=0, state_20=0, var_29=1, var_41=-1, var_42=-1] [L122] SORT_3 var_43 = var_43_arg_0 & var_43_arg_1; [L123] SORT_3 var_44_arg_0 = var_43; [L124] SORT_3 var_44 = ~var_44_arg_0; [L125] SORT_3 var_45_arg_0 = var_41; [L126] SORT_3 var_45_arg_1 = var_44; VAL [mask_SORT_3=1, state_15=0, state_17=0, state_20=0, var_29=1, var_42=-1, var_45_arg_0=-1, var_45_arg_1=-1] [L127] EXPR var_45_arg_0 | var_45_arg_1 VAL [mask_SORT_3=1, state_15=0, state_17=0, state_20=0, var_29=1, var_42=-1] [L127] SORT_3 var_45 = var_45_arg_0 | var_45_arg_1; [L128] SORT_3 var_46_arg_0 = var_45; [L129] SORT_3 var_46 = ~var_46_arg_0; [L130] SORT_3 var_47_arg_0 = state_17; [L131] SORT_3 var_47_arg_1 = state_20; VAL [mask_SORT_3=1, state_15=0, state_17=0, state_20=0, var_29=1, var_42=-1, var_46=-256, var_47_arg_0=0, var_47_arg_1=0] [L132] EXPR var_47_arg_0 & var_47_arg_1 VAL [mask_SORT_3=1, state_15=0, state_17=0, state_20=0, var_29=1, var_42=-1, var_46=-256] [L132] SORT_3 var_47 = var_47_arg_0 & var_47_arg_1; [L133] SORT_3 var_48_arg_0 = var_42; [L134] SORT_3 var_48_arg_1 = var_47; VAL [mask_SORT_3=1, state_15=0, state_17=0, state_20=0, var_29=1, var_46=-256, var_48_arg_0=-1, var_48_arg_1=0] [L135] EXPR var_48_arg_0 | var_48_arg_1 VAL [mask_SORT_3=1, state_15=0, state_17=0, state_20=0, var_29=1, var_46=-256] [L135] SORT_3 var_48 = var_48_arg_0 | var_48_arg_1; [L136] SORT_3 var_49_arg_0 = var_48; [L137] SORT_3 var_49 = ~var_49_arg_0; [L138] SORT_3 var_50_arg_0 = var_46; [L139] SORT_3 var_50_arg_1 = var_49; VAL [mask_SORT_3=1, state_15=0, state_17=0, state_20=0, var_29=1, var_50_arg_0=-256, var_50_arg_1=-256] [L140] EXPR var_50_arg_0 | var_50_arg_1 VAL [mask_SORT_3=1, state_15=0, state_17=0, state_20=0, var_29=1] [L140] SORT_3 var_50 = var_50_arg_0 | var_50_arg_1; [L141] SORT_3 next_110_arg_1 = var_50; [L142] SORT_3 var_52_arg_0 = state_20; [L143] SORT_3 var_52 = ~var_52_arg_0; [L144] SORT_3 var_53_arg_0 = state_17; [L145] SORT_3 var_53_arg_1 = var_52; VAL [mask_SORT_3=1, next_110_arg_1=0, state_15=0, state_17=0, state_20=0, var_29=1, var_52=-1, var_53_arg_0=0, var_53_arg_1=-1] [L146] EXPR var_53_arg_0 | var_53_arg_1 VAL [mask_SORT_3=1, next_110_arg_1=0, state_15=0, state_17=0, state_20=0, var_29=1, var_52=-1] [L146] SORT_3 var_53 = var_53_arg_0 | var_53_arg_1; [L147] SORT_3 var_54_arg_0 = state_17; [L148] SORT_3 var_54_arg_1 = var_52; VAL [mask_SORT_3=1, next_110_arg_1=0, state_15=0, state_17=0, state_20=0, var_29=1, var_52=-1, var_53=255, var_54_arg_0=0, var_54_arg_1=-1] [L149] EXPR var_54_arg_0 & var_54_arg_1 VAL [mask_SORT_3=1, next_110_arg_1=0, state_15=0, state_17=0, state_20=0, var_29=1, var_52=-1, var_53=255] [L149] SORT_3 var_54 = var_54_arg_0 & var_54_arg_1; [L150] SORT_3 var_55_arg_0 = var_54; [L151] SORT_3 var_55 = ~var_55_arg_0; [L152] SORT_3 var_56_arg_0 = var_53; [L153] SORT_3 var_56_arg_1 = var_55; VAL [mask_SORT_3=1, next_110_arg_1=0, state_15=0, state_17=0, state_20=0, var_29=1, var_52=-1, var_56_arg_0=255, var_56_arg_1=-1] [L154] EXPR var_56_arg_0 & var_56_arg_1 VAL [mask_SORT_3=1, next_110_arg_1=0, state_15=0, state_17=0, state_20=0, var_29=1, var_52=-1] [L154] SORT_3 var_56 = var_56_arg_0 & var_56_arg_1; [L155] SORT_3 var_57_arg_0 = var_56; [L156] SORT_3 var_57 = ~var_57_arg_0; [L157] SORT_3 next_111_arg_1 = var_57; [L158] SORT_1 var_59_arg_0 = input_2; [L159] SORT_3 var_59 = var_59_arg_0 >> 0; [L160] SORT_1 var_60_arg_0 = input_2; [L161] SORT_3 var_60 = var_60_arg_0 >> 2; [L162] SORT_3 var_61_arg_0 = var_60; [L163] SORT_3 var_61 = ~var_61_arg_0; [L164] SORT_1 var_62_arg_0 = input_2; [L165] SORT_3 var_62 = var_62_arg_0 >> 1; [L166] SORT_3 var_63_arg_0 = var_61; [L167] SORT_3 var_63_arg_1 = var_62; VAL [mask_SORT_3=1, next_110_arg_1=0, next_111_arg_1=-256, state_15=0, state_17=0, state_20=0, var_29=1, var_52=-1, var_59=0, var_63_arg_0=-1, var_63_arg_1=0] [L168] EXPR var_63_arg_0 | var_63_arg_1 VAL [mask_SORT_3=1, next_110_arg_1=0, next_111_arg_1=-256, state_15=0, state_17=0, state_20=0, var_29=1, var_52=-1, var_59=0] [L168] SORT_3 var_63 = var_63_arg_0 | var_63_arg_1; [L169] SORT_3 var_64_arg_0 = var_59; [L170] SORT_3 var_64_arg_1 = var_63; VAL [mask_SORT_3=1, next_110_arg_1=0, next_111_arg_1=-256, state_15=0, state_17=0, state_20=0, var_29=1, var_52=-1, var_59=0, var_63=255, var_64_arg_0=0, var_64_arg_1=255] [L171] EXPR var_64_arg_0 | var_64_arg_1 VAL [mask_SORT_3=1, next_110_arg_1=0, next_111_arg_1=-256, state_15=0, state_17=0, state_20=0, var_29=1, var_52=-1, var_59=0, var_63=255] [L171] SORT_3 var_64 = var_64_arg_0 | var_64_arg_1; [L172] SORT_3 var_65_arg_0 = var_64; [L173] SORT_3 var_65 = ~var_65_arg_0; [L174] SORT_3 var_66_arg_0 = state_15; [L175] SORT_3 var_66_arg_1 = state_17; VAL [mask_SORT_3=1, next_110_arg_1=0, next_111_arg_1=-256, state_20=0, var_29=1, var_52=-1, var_59=0, var_63=255, var_65=-256, var_66_arg_0=0, var_66_arg_1=0] [L176] EXPR var_66_arg_0 | var_66_arg_1 VAL [mask_SORT_3=1, next_110_arg_1=0, next_111_arg_1=-256, state_20=0, var_29=1, var_52=-1, var_59=0, var_63=255, var_65=-256] [L176] SORT_3 var_66 = var_66_arg_0 | var_66_arg_1; [L177] SORT_3 var_67_arg_0 = var_65; [L178] SORT_3 var_67_arg_1 = var_66; VAL [mask_SORT_3=1, next_110_arg_1=0, next_111_arg_1=-256, state_20=0, var_29=1, var_52=-1, var_59=0, var_63=255, var_66=0, var_67_arg_0=-256, var_67_arg_1=0] [L179] EXPR var_67_arg_0 | var_67_arg_1 VAL [mask_SORT_3=1, next_110_arg_1=0, next_111_arg_1=-256, state_20=0, var_29=1, var_52=-1, var_59=0, var_63=255, var_66=0] [L179] SORT_3 var_67 = var_67_arg_0 | var_67_arg_1; [L180] SORT_3 var_68_arg_0 = var_67; [L181] SORT_3 var_68_arg_1 = var_52; VAL [mask_SORT_3=1, next_110_arg_1=0, next_111_arg_1=-256, state_20=0, var_29=1, var_59=0, var_63=255, var_66=0, var_68_arg_0=0, var_68_arg_1=-1] [L182] EXPR var_68_arg_0 & var_68_arg_1 VAL [mask_SORT_3=1, next_110_arg_1=0, next_111_arg_1=-256, state_20=0, var_29=1, var_59=0, var_63=255, var_66=0] [L182] SORT_3 var_68 = var_68_arg_0 & var_68_arg_1; [L183] SORT_3 next_112_arg_1 = var_68; [L184] SORT_3 var_75_arg_0 = state_20; [L185] SORT_3 var_75_arg_1 = var_66; VAL [mask_SORT_3=1, next_110_arg_1=0, next_111_arg_1=-256, next_112_arg_1=0, var_29=1, var_59=0, var_63=255, var_75_arg_0=0, var_75_arg_1=0] [L186] EXPR var_75_arg_0 | var_75_arg_1 VAL [mask_SORT_3=1, next_110_arg_1=0, next_111_arg_1=-256, next_112_arg_1=0, var_29=1, var_59=0, var_63=255] [L186] SORT_3 var_75 = var_75_arg_0 | var_75_arg_1; [L187] SORT_3 var_76_arg_0 = var_75; [L188] SORT_3 var_76 = ~var_76_arg_0; [L189] SORT_3 var_77_arg_0 = var_59; [L190] SORT_3 var_77_arg_1 = var_76; VAL [mask_SORT_3=1, next_110_arg_1=0, next_111_arg_1=-256, next_112_arg_1=0, var_29=1, var_63=255, var_76=-1, var_77_arg_0=0, var_77_arg_1=-1] [L191] EXPR var_77_arg_0 & var_77_arg_1 VAL [mask_SORT_3=1, next_110_arg_1=0, next_111_arg_1=-256, next_112_arg_1=0, var_29=1, var_63=255, var_76=-1] [L191] SORT_3 var_77 = var_77_arg_0 & var_77_arg_1; [L192] SORT_3 var_78_arg_0 = var_77; [L193] SORT_3 var_78 = ~var_78_arg_0; [L194] SORT_3 var_82_arg_0 = var_63; [L195] SORT_3 var_82_arg_1 = var_76; VAL [mask_SORT_3=1, next_110_arg_1=0, next_111_arg_1=-256, next_112_arg_1=0, var_29=1, var_78=-1, var_82_arg_0=255, var_82_arg_1=-1] [L196] EXPR var_82_arg_0 & var_82_arg_1 VAL [mask_SORT_3=1, next_110_arg_1=0, next_111_arg_1=-256, next_112_arg_1=0, var_29=1, var_78=-1] [L196] SORT_3 var_82 = var_82_arg_0 & var_82_arg_1; [L197] SORT_3 var_91_arg_0 = var_82; [L198] SORT_3 var_91 = ~var_91_arg_0; [L199] SORT_3 var_92_arg_0 = var_78; [L200] SORT_3 var_92_arg_1 = var_91; VAL [mask_SORT_3=1, next_110_arg_1=0, next_111_arg_1=-256, next_112_arg_1=0, var_29=1, var_92_arg_0=-1, var_92_arg_1=-256] [L201] EXPR var_92_arg_0 & var_92_arg_1 VAL [mask_SORT_3=1, next_110_arg_1=0, next_111_arg_1=-256, next_112_arg_1=0, var_29=1] [L201] SORT_3 var_92 = var_92_arg_0 & var_92_arg_1; [L202] SORT_3 var_94_arg_0 = input_4; [L203] SORT_3 var_94_arg_1 = var_92; VAL [mask_SORT_3=1, next_110_arg_1=0, next_111_arg_1=-256, next_112_arg_1=0, var_29=1, var_94_arg_0=257, var_94_arg_1=0] [L204] EXPR var_94_arg_0 | var_94_arg_1 VAL [mask_SORT_3=1, next_110_arg_1=0, next_111_arg_1=-256, next_112_arg_1=0, var_29=1] [L204] SORT_3 var_94 = var_94_arg_0 | var_94_arg_1; [L205] SORT_3 var_95_arg_0 = var_94; [L206] SORT_3 var_95 = ~var_95_arg_0; [L207] SORT_3 next_113_arg_1 = var_95; [L209] state_15 = next_110_arg_1 [L210] state_17 = next_111_arg_1 [L211] state_20 = next_112_arg_1 [L212] state_24 = next_113_arg_1 [L74] input_2 = __VERIFIER_nondet_uchar() [L75] input_4 = __VERIFIER_nondet_uchar() [L76] input_5 = __VERIFIER_nondet_uchar() [L77] input_6 = __VERIFIER_nondet_uchar() [L78] input_7 = __VERIFIER_nondet_uchar() [L79] input_8 = __VERIFIER_nondet_uchar() [L80] input_9 = __VERIFIER_nondet_uchar() [L81] input_10 = __VERIFIER_nondet_uchar() [L82] input_11 = __VERIFIER_nondet_uchar() [L83] input_13 = __VERIFIER_nondet_uchar() [L84] input_33 = __VERIFIER_nondet_uchar() [L85] input_35 = __VERIFIER_nondet_uchar() [L86] input_37 = __VERIFIER_nondet_uchar() [L87] input_39 = __VERIFIER_nondet_uchar() [L88] input_97 = __VERIFIER_nondet_uchar() [L89] input_99 = __VERIFIER_nondet_uchar() [L90] input_102 = __VERIFIER_nondet_uchar() [L91] input_104 = __VERIFIER_nondet_uchar() [L92] input_106 = __VERIFIER_nondet_uchar() [L93] input_108 = __VERIFIER_nondet_uchar() [L96] SORT_3 var_19_arg_0 = state_15; [L97] SORT_3 var_19_arg_1 = state_17; VAL [mask_SORT_3=1, state_15=0, state_17=-256, state_20=0, state_24=-2, var_19_arg_0=0, var_19_arg_1=-256, var_29=1] [L98] EXPR var_19_arg_0 | var_19_arg_1 VAL [mask_SORT_3=1, state_15=0, state_17=-256, state_20=0, state_24=-2, var_29=1] [L98] SORT_3 var_19 = var_19_arg_0 | var_19_arg_1; [L99] SORT_3 var_22_arg_0 = var_19; [L100] SORT_3 var_22_arg_1 = state_20; VAL [mask_SORT_3=1, state_15=0, state_17=-256, state_20=0, state_24=-2, var_22_arg_0=0, var_22_arg_1=0, var_29=1] [L101] EXPR var_22_arg_0 | var_22_arg_1 VAL [mask_SORT_3=1, state_15=0, state_17=-256, state_20=0, state_24=-2, var_29=1] [L101] SORT_3 var_22 = var_22_arg_0 | var_22_arg_1; [L102] SORT_3 var_23_arg_0 = var_22; [L103] SORT_3 var_23 = ~var_23_arg_0; [L104] SORT_3 var_26_arg_0 = var_23; [L105] SORT_3 var_26_arg_1 = state_24; VAL [mask_SORT_3=1, state_15=0, state_17=-256, state_20=0, var_26_arg_0=-1, var_26_arg_1=-2, var_29=1] [L106] EXPR var_26_arg_0 | var_26_arg_1 VAL [mask_SORT_3=1, state_15=0, state_17=-256, state_20=0, var_29=1] [L106] SORT_3 var_26 = var_26_arg_0 | var_26_arg_1; [L107] SORT_3 var_30_arg_0 = var_26; [L108] SORT_3 var_30 = ~var_30_arg_0; [L109] SORT_3 var_31_arg_0 = var_29; [L110] SORT_3 var_31_arg_1 = var_30; VAL [mask_SORT_3=1, state_15=0, state_17=-256, state_20=0, var_29=1, var_31_arg_0=1, var_31_arg_1=-1] [L111] EXPR var_31_arg_0 & var_31_arg_1 VAL [mask_SORT_3=1, state_15=0, state_17=-256, state_20=0, var_29=1] [L111] SORT_3 var_31 = var_31_arg_0 & var_31_arg_1; [L112] EXPR var_31 & mask_SORT_3 VAL [mask_SORT_3=1, state_15=0, state_17=-256, state_20=0, var_29=1] [L112] var_31 = var_31 & mask_SORT_3 [L113] SORT_3 bad_32_arg_0 = var_31; [L114] CALL __VERIFIER_assert(!(bad_32_arg_0)) [L21] COND TRUE !(cond) [L21] reach_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 118 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 29.7s, OverallIterations: 34, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 9.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 3772 SdHoareTripleChecker+Valid, 7.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3772 mSDsluCounter, 39904 SdHoareTripleChecker+Invalid, 6.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 35427 mSDsCounter, 57 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 16625 IncrementalHoareTripleChecker+Invalid, 16682 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 57 mSolverCounterUnsat, 4477 mSDtfsCounter, 16625 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1415 GetRequests, 904 SyntacticMatches, 0 SemanticMatches, 511 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3758 ImplicationChecksByTransitivity, 5.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1023occurred in iteration=33, InterpolantAutomatonStates: 371, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 33 MinimizatonAttempts, 864 StatesRemovedByMinimization, 26 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.4s SsaConstructionTime, 1.9s SatisfiabilityAnalysisTime, 14.2s InterpolantComputationTime, 3031 NumberOfCodeBlocks, 3031 NumberOfCodeBlocksAsserted, 42 NumberOfCheckSat, 3229 ConstructedInterpolants, 0 QuantifiedInterpolants, 15269 SizeOfPredicates, 29 NumberOfNonLiveVariables, 3585 ConjunctsInSsa, 396 ConjunctsInUnsatCore, 45 InterpolantComputations, 29 PerfectInterpolantSequences, 430/477 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-03 18:29:42,747 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/hardware-verification-bv/btor2c-lazyMod.vis_QF_BV_s1269b_p4.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-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 64bit --witnessprinter.graph.data.programhash cc15dd8c58787d1f6894f4700fb98e0d8cb8608f1a57f24801c50df888951e5d --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 18:29:44,651 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 18:29:44,742 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Bitvector.epf [2025-03-03 18:29:44,750 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 18:29:44,750 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 18:29:44,774 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 18:29:44,774 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 18:29:44,774 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 18:29:44,775 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 18:29:44,775 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 18:29:44,776 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 18:29:44,776 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 18:29:44,776 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 18:29:44,776 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 18:29:44,776 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 18:29:44,777 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 18:29:44,777 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 18:29:44,777 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 18:29:44,777 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 18:29:44,777 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 18:29:44,777 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 18:29:44,777 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-03 18:29:44,777 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-03 18:29:44,777 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-03 18:29:44,777 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 18:29:44,777 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 18:29:44,777 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 18:29:44,777 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 18:29:44,778 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 18:29:44,778 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 18:29:44,778 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 18:29:44,778 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 18:29:44,778 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 18:29:44,778 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 18:29:44,778 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 18:29:44,778 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 18:29:44,778 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-03 18:29:44,778 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-03 18:29:44,778 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 18:29:44,779 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 18:29:44,779 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 18:29:44,779 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 18:29:44,779 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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> cc15dd8c58787d1f6894f4700fb98e0d8cb8608f1a57f24801c50df888951e5d [2025-03-03 18:29:45,017 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 18:29:45,023 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 18:29:45,024 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 18:29:45,025 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 18:29:45,025 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 18:29:45,026 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_QF_BV_s1269b_p4.c [2025-03-03 18:29:46,170 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ec89b7a51/7687433dc34f49ea8048c419c6001135/FLAG88329a9b5 [2025-03-03 18:29:46,354 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 18:29:46,354 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_QF_BV_s1269b_p4.c [2025-03-03 18:29:46,360 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ec89b7a51/7687433dc34f49ea8048c419c6001135/FLAG88329a9b5 [2025-03-03 18:29:46,743 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ec89b7a51/7687433dc34f49ea8048c419c6001135 [2025-03-03 18:29:46,745 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 18:29:46,746 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 18:29:46,747 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 18:29:46,747 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 18:29:46,751 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 18:29:46,751 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 06:29:46" (1/1) ... [2025-03-03 18:29:46,752 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4096e30 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:29:46, skipping insertion in model container [2025-03-03 18:29:46,752 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 06:29:46" (1/1) ... [2025-03-03 18:29:46,767 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 18:29:46,876 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/hardware-verification-bv/btor2c-lazyMod.vis_QF_BV_s1269b_p4.c[1259,1272] [2025-03-03 18:29:46,940 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 18:29:46,951 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 18:29:46,960 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/hardware-verification-bv/btor2c-lazyMod.vis_QF_BV_s1269b_p4.c[1259,1272] [2025-03-03 18:29:46,995 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 18:29:47,012 INFO L204 MainTranslator]: Completed translation [2025-03-03 18:29:47,012 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:29:47 WrapperNode [2025-03-03 18:29:47,012 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 18:29:47,013 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 18:29:47,013 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 18:29:47,013 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 18:29:47,019 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:29:47" (1/1) ... [2025-03-03 18:29:47,026 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:29:47" (1/1) ... [2025-03-03 18:29:47,051 INFO L138 Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 241 [2025-03-03 18:29:47,055 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 18:29:47,055 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 18:29:47,056 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 18:29:47,056 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 18:29:47,062 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:29:47" (1/1) ... [2025-03-03 18:29:47,063 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:29:47" (1/1) ... [2025-03-03 18:29:47,070 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:29:47" (1/1) ... [2025-03-03 18:29:47,082 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-03 18:29:47,087 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:29:47" (1/1) ... [2025-03-03 18:29:47,087 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:29:47" (1/1) ... [2025-03-03 18:29:47,092 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:29:47" (1/1) ... [2025-03-03 18:29:47,097 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:29:47" (1/1) ... [2025-03-03 18:29:47,098 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:29:47" (1/1) ... [2025-03-03 18:29:47,102 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:29:47" (1/1) ... [2025-03-03 18:29:47,104 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 18:29:47,108 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 18:29:47,108 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 18:29:47,108 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 18:29:47,109 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:29:47" (1/1) ... [2025-03-03 18:29:47,114 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 18:29:47,127 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 18:29:47,137 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-03 18:29:47,140 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-03 18:29:47,159 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 18:29:47,159 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-03 18:29:47,159 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 18:29:47,160 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 18:29:47,261 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 18:29:47,263 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 18:29:47,507 INFO L? ?]: Removed 35 outVars from TransFormulas that were not future-live. [2025-03-03 18:29:47,509 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 18:29:47,515 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 18:29:47,516 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 18:29:47,516 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 06:29:47 BoogieIcfgContainer [2025-03-03 18:29:47,516 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 18:29:47,518 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 18:29:47,518 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 18:29:47,521 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 18:29:47,522 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 06:29:46" (1/3) ... [2025-03-03 18:29:47,522 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@57b84bad and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 06:29:47, skipping insertion in model container [2025-03-03 18:29:47,522 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:29:47" (2/3) ... [2025-03-03 18:29:47,522 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@57b84bad and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 06:29:47, skipping insertion in model container [2025-03-03 18:29:47,522 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 06:29:47" (3/3) ... [2025-03-03 18:29:47,523 INFO L128 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.vis_QF_BV_s1269b_p4.c [2025-03-03 18:29:47,534 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 18:29:47,537 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG btor2c-lazyMod.vis_QF_BV_s1269b_p4.c that has 1 procedures, 10 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 18:29:47,578 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 18:29:47,588 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;@10cc84b8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 18:29:47,589 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 18:29:47,592 INFO L276 IsEmpty]: Start isEmpty. Operand has 10 states, 8 states have (on average 1.375) internal successors, (11), 9 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:29:47,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2025-03-03 18:29:47,596 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 18:29:47,596 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2025-03-03 18:29:47,597 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 18:29:47,602 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 18:29:47,602 INFO L85 PathProgramCache]: Analyzing trace with hash 38140359, now seen corresponding path program 1 times [2025-03-03 18:29:47,609 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 18:29:47,609 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1867304866] [2025-03-03 18:29:47,609 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:29:47,610 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 18:29:47,610 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 18:29:47,612 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 18:29:47,613 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-03 18:29:47,707 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-03 18:29:47,723 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-03 18:29:47,723 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:29:47,723 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:29:47,725 WARN L254 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 26 conjuncts are in the unsatisfiable core [2025-03-03 18:29:47,733 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 18:29:47,958 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 18:29:47,958 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 18:29:47,959 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-03 18:29:47,959 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1867304866] [2025-03-03 18:29:47,960 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1867304866] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 18:29:47,960 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 18:29:47,960 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 18:29:47,961 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1570717675] [2025-03-03 18:29:47,962 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 18:29:47,964 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 18:29:47,965 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-03 18:29:47,980 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 18:29:47,980 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 18:29:47,982 INFO L87 Difference]: Start difference. First operand has 10 states, 8 states have (on average 1.375) internal successors, (11), 9 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 4 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:29:48,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 18:29:48,013 INFO L93 Difference]: Finished difference Result 18 states and 23 transitions. [2025-03-03 18:29:48,015 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 18:29:48,016 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2025-03-03 18:29:48,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 18:29:48,020 INFO L225 Difference]: With dead ends: 18 [2025-03-03 18:29:48,020 INFO L226 Difference]: Without dead ends: 10 [2025-03-03 18:29:48,022 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-03 18:29:48,024 INFO L435 NwaCegarLoop]: 4 mSDtfsCounter, 2 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 11 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 18:29:48,025 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 11 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 18:29:48,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2025-03-03 18:29:48,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 9. [2025-03-03 18:29:48,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 1.125) internal successors, (9), 8 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:29:48,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2025-03-03 18:29:48,045 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 5 [2025-03-03 18:29:48,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 18:29:48,046 INFO L471 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2025-03-03 18:29:48,046 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:29:48,046 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2025-03-03 18:29:48,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-03-03 18:29:48,046 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 18:29:48,046 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2025-03-03 18:29:48,052 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-03 18:29:48,246 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-03 18:29:48,247 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 18:29:48,247 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 18:29:48,247 INFO L85 PathProgramCache]: Analyzing trace with hash -1926026653, now seen corresponding path program 1 times [2025-03-03 18:29:48,248 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 18:29:48,248 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1878769557] [2025-03-03 18:29:48,248 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:29:48,248 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 18:29:48,248 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 18:29:48,250 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 18:29:48,251 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-03 18:29:48,352 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-03 18:29:48,374 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-03 18:29:48,374 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:29:48,374 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-03 18:29:48,374 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-03 18:29:48,403 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-03 18:29:48,409 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-03 18:29:48,409 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:29:48,409 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-03 18:29:48,469 INFO L130 FreeRefinementEngine]: Strategy FOX found a feasible trace [2025-03-03 18:29:48,469 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-03 18:29:48,470 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-03 18:29:48,479 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-03 18:29:48,673 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 [2025-03-03 18:29:48,676 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1] [2025-03-03 18:29:48,686 WARN L310 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2025-03-03 18:29:48,686 WARN L310 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2025-03-03 18:29:48,692 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-03 18:29:48,694 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.03 06:29:48 BoogieIcfgContainer [2025-03-03 18:29:48,694 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-03 18:29:48,694 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-03 18:29:48,694 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-03 18:29:48,694 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-03 18:29:48,695 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 06:29:47" (3/4) ... [2025-03-03 18:29:48,695 INFO L140 WitnessPrinter]: Generating witness for reachability counterexample [2025-03-03 18:29:48,702 WARN L310 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2025-03-03 18:29:48,703 WARN L310 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2025-03-03 18:29:48,739 INFO L127 tionWitnessGenerator]: Generated YAML witness of length 6. [2025-03-03 18:29:48,774 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-03 18:29:48,775 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-03 18:29:48,775 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-03 18:29:48,775 INFO L158 Benchmark]: Toolchain (without parser) took 2029.11ms. Allocated memory is still 117.4MB. Free memory was 92.2MB in the beginning and 72.0MB in the end (delta: 20.2MB). Peak memory consumption was 22.2MB. Max. memory is 16.1GB. [2025-03-03 18:29:48,776 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 83.9MB. Free memory is still 63.0MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 18:29:48,776 INFO L158 Benchmark]: CACSL2BoogieTranslator took 265.44ms. Allocated memory is still 117.4MB. Free memory was 92.0MB in the beginning and 77.0MB in the end (delta: 14.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-03 18:29:48,777 INFO L158 Benchmark]: Boogie Procedure Inliner took 41.92ms. Allocated memory is still 117.4MB. Free memory was 77.0MB in the beginning and 74.9MB in the end (delta: 2.1MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 18:29:48,777 INFO L158 Benchmark]: Boogie Preprocessor took 51.91ms. Allocated memory is still 117.4MB. Free memory was 74.9MB in the beginning and 72.6MB in the end (delta: 2.3MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 18:29:48,777 INFO L158 Benchmark]: IcfgBuilder took 408.29ms. Allocated memory is still 117.4MB. Free memory was 72.6MB in the beginning and 51.0MB in the end (delta: 21.6MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-03-03 18:29:48,778 INFO L158 Benchmark]: TraceAbstraction took 1176.02ms. Allocated memory is still 117.4MB. Free memory was 50.5MB in the beginning and 79.5MB in the end (delta: -28.9MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 18:29:48,778 INFO L158 Benchmark]: Witness Printer took 80.51ms. Allocated memory is still 117.4MB. Free memory was 79.5MB in the beginning and 72.0MB in the end (delta: 7.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-03 18:29:48,779 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.16ms. Allocated memory is still 83.9MB. Free memory is still 63.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 265.44ms. Allocated memory is still 117.4MB. Free memory was 92.0MB in the beginning and 77.0MB in the end (delta: 14.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 41.92ms. Allocated memory is still 117.4MB. Free memory was 77.0MB in the beginning and 74.9MB in the end (delta: 2.1MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 51.91ms. Allocated memory is still 117.4MB. Free memory was 74.9MB in the beginning and 72.6MB in the end (delta: 2.3MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 408.29ms. Allocated memory is still 117.4MB. Free memory was 72.6MB in the beginning and 51.0MB in the end (delta: 21.6MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 1176.02ms. Allocated memory is still 117.4MB. Free memory was 50.5MB in the beginning and 79.5MB in the end (delta: -28.9MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 80.51ms. Allocated memory is still 117.4MB. Free memory was 79.5MB in the beginning and 72.0MB in the end (delta: 7.5MB). 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 - CounterExampleResult [Line: 21]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L26] const SORT_1 mask_SORT_1 = (SORT_1)-1 >> (sizeof(SORT_1) * 8 - 3); [L27] const SORT_1 msb_SORT_1 = (SORT_1)1 << (3 - 1); [L29] const SORT_3 mask_SORT_3 = (SORT_3)-1 >> (sizeof(SORT_3) * 8 - 1); [L30] const SORT_3 msb_SORT_3 = (SORT_3)1 << (1 - 1); [L32] const SORT_12 mask_SORT_12 = (SORT_12)-1 >> (sizeof(SORT_12) * 8 - 8); [L33] const SORT_12 msb_SORT_12 = (SORT_12)1 << (8 - 1); [L35] const SORT_3 var_14 = 0; [L36] const SORT_3 var_29 = 1; [L38] SORT_1 input_2; [L39] SORT_3 input_4; [L40] SORT_3 input_5; [L41] SORT_3 input_6; [L42] SORT_3 input_7; [L43] SORT_3 input_8; [L44] SORT_3 input_9; [L45] SORT_3 input_10; [L46] SORT_3 input_11; [L47] SORT_12 input_13; [L48] SORT_12 input_33; [L49] SORT_12 input_35; [L50] SORT_3 input_37; [L51] SORT_3 input_39; [L52] SORT_12 input_97; [L53] SORT_3 input_99; [L54] SORT_1 input_102; [L55] SORT_3 input_104; [L56] SORT_3 input_106; [L57] SORT_3 input_108; [L59] SORT_3 state_15 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L60] SORT_3 state_17 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L61] SORT_3 state_20 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L62] SORT_3 state_24 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L64] SORT_3 init_16_arg_1 = var_14; [L65] state_15 = init_16_arg_1 [L66] SORT_3 init_18_arg_1 = var_14; [L67] state_17 = init_18_arg_1 [L68] SORT_3 init_21_arg_1 = var_14; [L69] state_20 = init_21_arg_1 [L70] SORT_3 init_25_arg_1 = var_14; [L71] state_24 = init_25_arg_1 VAL [mask_SORT_3=1, state_15=0, state_17=0, state_20=0, state_24=0, var_29=1] [L74] input_2 = __VERIFIER_nondet_uchar() [L75] input_4 = __VERIFIER_nondet_uchar() [L76] input_5 = __VERIFIER_nondet_uchar() [L77] input_6 = __VERIFIER_nondet_uchar() [L78] input_7 = __VERIFIER_nondet_uchar() [L79] input_8 = __VERIFIER_nondet_uchar() [L80] input_9 = __VERIFIER_nondet_uchar() [L81] input_10 = __VERIFIER_nondet_uchar() [L82] input_11 = __VERIFIER_nondet_uchar() [L83] input_13 = __VERIFIER_nondet_uchar() [L84] input_33 = __VERIFIER_nondet_uchar() [L85] input_35 = __VERIFIER_nondet_uchar() [L86] input_37 = __VERIFIER_nondet_uchar() [L87] input_39 = __VERIFIER_nondet_uchar() [L88] input_97 = __VERIFIER_nondet_uchar() [L89] input_99 = __VERIFIER_nondet_uchar() [L90] input_102 = __VERIFIER_nondet_uchar() [L91] input_104 = __VERIFIER_nondet_uchar() [L92] input_106 = __VERIFIER_nondet_uchar() [L93] input_108 = __VERIFIER_nondet_uchar() [L96] SORT_3 var_19_arg_0 = state_15; [L97] SORT_3 var_19_arg_1 = state_17; [L98] SORT_3 var_19 = var_19_arg_0 | var_19_arg_1; [L99] SORT_3 var_22_arg_0 = var_19; [L100] SORT_3 var_22_arg_1 = state_20; [L101] SORT_3 var_22 = var_22_arg_0 | var_22_arg_1; [L102] SORT_3 var_23_arg_0 = var_22; [L103] SORT_3 var_23 = ~var_23_arg_0; [L104] SORT_3 var_26_arg_0 = var_23; [L105] SORT_3 var_26_arg_1 = state_24; [L106] SORT_3 var_26 = var_26_arg_0 | var_26_arg_1; [L107] SORT_3 var_30_arg_0 = var_26; [L108] SORT_3 var_30 = ~var_30_arg_0; [L109] SORT_3 var_31_arg_0 = var_29; [L110] SORT_3 var_31_arg_1 = var_30; [L111] SORT_3 var_31 = var_31_arg_0 & var_31_arg_1; [L112] var_31 = var_31 & mask_SORT_3 [L113] SORT_3 bad_32_arg_0 = var_31; [L114] CALL __VERIFIER_assert(!(bad_32_arg_0)) [L21] COND FALSE !(!(cond)) [L114] RET __VERIFIER_assert(!(bad_32_arg_0)) [L116] SORT_3 var_41_arg_0 = state_17; [L117] SORT_3 var_41 = ~var_41_arg_0; [L118] SORT_3 var_42_arg_0 = state_15; [L119] SORT_3 var_42 = ~var_42_arg_0; [L120] SORT_3 var_43_arg_0 = var_42; [L121] SORT_3 var_43_arg_1 = state_20; [L122] SORT_3 var_43 = var_43_arg_0 & var_43_arg_1; [L123] SORT_3 var_44_arg_0 = var_43; [L124] SORT_3 var_44 = ~var_44_arg_0; [L125] SORT_3 var_45_arg_0 = var_41; [L126] SORT_3 var_45_arg_1 = var_44; [L127] SORT_3 var_45 = var_45_arg_0 | var_45_arg_1; [L128] SORT_3 var_46_arg_0 = var_45; [L129] SORT_3 var_46 = ~var_46_arg_0; [L130] SORT_3 var_47_arg_0 = state_17; [L131] SORT_3 var_47_arg_1 = state_20; [L132] SORT_3 var_47 = var_47_arg_0 & var_47_arg_1; [L133] SORT_3 var_48_arg_0 = var_42; [L134] SORT_3 var_48_arg_1 = var_47; [L135] SORT_3 var_48 = var_48_arg_0 | var_48_arg_1; [L136] SORT_3 var_49_arg_0 = var_48; [L137] SORT_3 var_49 = ~var_49_arg_0; [L138] SORT_3 var_50_arg_0 = var_46; [L139] SORT_3 var_50_arg_1 = var_49; [L140] SORT_3 var_50 = var_50_arg_0 | var_50_arg_1; [L141] SORT_3 next_110_arg_1 = var_50; [L142] SORT_3 var_52_arg_0 = state_20; [L143] SORT_3 var_52 = ~var_52_arg_0; [L144] SORT_3 var_53_arg_0 = state_17; [L145] SORT_3 var_53_arg_1 = var_52; [L146] SORT_3 var_53 = var_53_arg_0 | var_53_arg_1; [L147] SORT_3 var_54_arg_0 = state_17; [L148] SORT_3 var_54_arg_1 = var_52; [L149] SORT_3 var_54 = var_54_arg_0 & var_54_arg_1; [L150] SORT_3 var_55_arg_0 = var_54; [L151] SORT_3 var_55 = ~var_55_arg_0; [L152] SORT_3 var_56_arg_0 = var_53; [L153] SORT_3 var_56_arg_1 = var_55; [L154] SORT_3 var_56 = var_56_arg_0 & var_56_arg_1; [L155] SORT_3 var_57_arg_0 = var_56; [L156] SORT_3 var_57 = ~var_57_arg_0; [L157] SORT_3 next_111_arg_1 = var_57; [L158] SORT_1 var_59_arg_0 = input_2; [L159] SORT_3 var_59 = var_59_arg_0 >> 0; [L160] SORT_1 var_60_arg_0 = input_2; [L161] SORT_3 var_60 = var_60_arg_0 >> 2; [L162] SORT_3 var_61_arg_0 = var_60; [L163] SORT_3 var_61 = ~var_61_arg_0; [L164] SORT_1 var_62_arg_0 = input_2; [L165] SORT_3 var_62 = var_62_arg_0 >> 1; [L166] SORT_3 var_63_arg_0 = var_61; [L167] SORT_3 var_63_arg_1 = var_62; [L168] SORT_3 var_63 = var_63_arg_0 | var_63_arg_1; [L169] SORT_3 var_64_arg_0 = var_59; [L170] SORT_3 var_64_arg_1 = var_63; [L171] SORT_3 var_64 = var_64_arg_0 | var_64_arg_1; [L172] SORT_3 var_65_arg_0 = var_64; [L173] SORT_3 var_65 = ~var_65_arg_0; [L174] SORT_3 var_66_arg_0 = state_15; [L175] SORT_3 var_66_arg_1 = state_17; [L176] SORT_3 var_66 = var_66_arg_0 | var_66_arg_1; [L177] SORT_3 var_67_arg_0 = var_65; [L178] SORT_3 var_67_arg_1 = var_66; [L179] SORT_3 var_67 = var_67_arg_0 | var_67_arg_1; [L180] SORT_3 var_68_arg_0 = var_67; [L181] SORT_3 var_68_arg_1 = var_52; [L182] SORT_3 var_68 = var_68_arg_0 & var_68_arg_1; [L183] SORT_3 next_112_arg_1 = var_68; [L184] SORT_3 var_75_arg_0 = state_20; [L185] SORT_3 var_75_arg_1 = var_66; [L186] SORT_3 var_75 = var_75_arg_0 | var_75_arg_1; [L187] SORT_3 var_76_arg_0 = var_75; [L188] SORT_3 var_76 = ~var_76_arg_0; [L189] SORT_3 var_77_arg_0 = var_59; [L190] SORT_3 var_77_arg_1 = var_76; [L191] SORT_3 var_77 = var_77_arg_0 & var_77_arg_1; [L192] SORT_3 var_78_arg_0 = var_77; [L193] SORT_3 var_78 = ~var_78_arg_0; [L194] SORT_3 var_82_arg_0 = var_63; [L195] SORT_3 var_82_arg_1 = var_76; [L196] SORT_3 var_82 = var_82_arg_0 & var_82_arg_1; [L197] SORT_3 var_91_arg_0 = var_82; [L198] SORT_3 var_91 = ~var_91_arg_0; [L199] SORT_3 var_92_arg_0 = var_78; [L200] SORT_3 var_92_arg_1 = var_91; [L201] SORT_3 var_92 = var_92_arg_0 & var_92_arg_1; [L202] SORT_3 var_94_arg_0 = input_4; [L203] SORT_3 var_94_arg_1 = var_92; [L204] SORT_3 var_94 = var_94_arg_0 | var_94_arg_1; [L205] SORT_3 var_95_arg_0 = var_94; [L206] SORT_3 var_95 = ~var_95_arg_0; [L207] SORT_3 next_113_arg_1 = var_95; [L209] state_15 = next_110_arg_1 [L210] state_17 = next_111_arg_1 [L211] state_20 = next_112_arg_1 [L212] state_24 = next_113_arg_1 [L74] input_2 = __VERIFIER_nondet_uchar() [L75] input_4 = __VERIFIER_nondet_uchar() [L76] input_5 = __VERIFIER_nondet_uchar() [L77] input_6 = __VERIFIER_nondet_uchar() [L78] input_7 = __VERIFIER_nondet_uchar() [L79] input_8 = __VERIFIER_nondet_uchar() [L80] input_9 = __VERIFIER_nondet_uchar() [L81] input_10 = __VERIFIER_nondet_uchar() [L82] input_11 = __VERIFIER_nondet_uchar() [L83] input_13 = __VERIFIER_nondet_uchar() [L84] input_33 = __VERIFIER_nondet_uchar() [L85] input_35 = __VERIFIER_nondet_uchar() [L86] input_37 = __VERIFIER_nondet_uchar() [L87] input_39 = __VERIFIER_nondet_uchar() [L88] input_97 = __VERIFIER_nondet_uchar() [L89] input_99 = __VERIFIER_nondet_uchar() [L90] input_102 = __VERIFIER_nondet_uchar() [L91] input_104 = __VERIFIER_nondet_uchar() [L92] input_106 = __VERIFIER_nondet_uchar() [L93] input_108 = __VERIFIER_nondet_uchar() [L96] SORT_3 var_19_arg_0 = state_15; [L97] SORT_3 var_19_arg_1 = state_17; [L98] SORT_3 var_19 = var_19_arg_0 | var_19_arg_1; [L99] SORT_3 var_22_arg_0 = var_19; [L100] SORT_3 var_22_arg_1 = state_20; [L101] SORT_3 var_22 = var_22_arg_0 | var_22_arg_1; [L102] SORT_3 var_23_arg_0 = var_22; [L103] SORT_3 var_23 = ~var_23_arg_0; [L104] SORT_3 var_26_arg_0 = var_23; [L105] SORT_3 var_26_arg_1 = state_24; [L106] SORT_3 var_26 = var_26_arg_0 | var_26_arg_1; [L107] SORT_3 var_30_arg_0 = var_26; [L108] SORT_3 var_30 = ~var_30_arg_0; [L109] SORT_3 var_31_arg_0 = var_29; [L110] SORT_3 var_31_arg_1 = var_30; [L111] SORT_3 var_31 = var_31_arg_0 & var_31_arg_1; [L112] var_31 = var_31 & mask_SORT_3 [L113] SORT_3 bad_32_arg_0 = var_31; [L114] CALL __VERIFIER_assert(!(bad_32_arg_0)) [L21] COND TRUE !(cond) [L21] reach_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 10 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.1s, OverallIterations: 2, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2 mSDsluCounter, 11 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 7 mSDsCounter, 0 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 9 IncrementalHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 0 mSolverCounterUnsat, 4 mSDtfsCounter, 9 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=10occurred in iteration=0, InterpolantAutomatonStates: 4, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 1 MinimizatonAttempts, 1 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.2s InterpolantComputationTime, 13 NumberOfCodeBlocks, 13 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 4 ConstructedInterpolants, 0 QuantifiedInterpolants, 18 SizeOfPredicates, 4 NumberOfNonLiveVariables, 49 ConjunctsInSsa, 26 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 0/0 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 proved your program to be incorrect! [2025-03-03 18:29:48,796 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 Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE