./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.diagonal.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.diagonal.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 16f8726a4add15d0bf2494bd44888be53eb7bc01110882b6fc03ef148c6d9055 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 17:22:33,017 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 17:22:33,073 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2025-03-03 17:22:33,078 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 17:22:33,078 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 17:22:33,091 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 17:22:33,092 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 17:22:33,092 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 17:22:33,092 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 17:22:33,092 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 17:22:33,092 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 17:22:33,093 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 17:22:33,093 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 17:22:33,093 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 17:22:33,093 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 17:22:33,093 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 17:22:33,093 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 17:22:33,094 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 17:22:33,094 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 17:22:33,095 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 17:22:33,095 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 17:22:33,095 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 17:22:33,095 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 17:22:33,095 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 17:22:33,095 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 17:22:33,095 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 17:22:33,095 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 17:22:33,095 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 17:22:33,095 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 17:22:33,095 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 17:22:33,095 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 17:22:33,095 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 17:22:33,095 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 17:22:33,095 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 17:22:33,095 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 17:22:33,095 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 17:22:33,095 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 17:22:33,095 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 17:22:33,096 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 17:22:33,096 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 17:22:33,096 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 -> 16f8726a4add15d0bf2494bd44888be53eb7bc01110882b6fc03ef148c6d9055 [2025-03-03 17:22:33,306 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 17:22:33,313 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 17:22:33,316 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 17:22:33,317 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 17:22:33,317 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 17:22:33,318 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.diagonal.c [2025-03-03 17:22:34,453 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/821d61ebc/274dc1738855434496d39bbf386aab78/FLAG88f0c13cd [2025-03-03 17:22:34,696 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 17:22:34,697 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.diagonal.c [2025-03-03 17:22:34,704 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/821d61ebc/274dc1738855434496d39bbf386aab78/FLAG88f0c13cd [2025-03-03 17:22:35,034 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/821d61ebc/274dc1738855434496d39bbf386aab78 [2025-03-03 17:22:35,036 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 17:22:35,037 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 17:22:35,038 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 17:22:35,038 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 17:22:35,041 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 17:22:35,042 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 05:22:35" (1/1) ... [2025-03-03 17:22:35,043 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3f501580 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:22:35, skipping insertion in model container [2025-03-03 17:22:35,043 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 05:22:35" (1/1) ... [2025-03-03 17:22:35,054 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 17:22:35,138 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.diagonal.c[1248,1261] [2025-03-03 17:22:35,170 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 17:22:35,177 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 17:22:35,183 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.diagonal.c[1248,1261] [2025-03-03 17:22:35,202 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 17:22:35,216 INFO L204 MainTranslator]: Completed translation [2025-03-03 17:22:35,216 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:22:35 WrapperNode [2025-03-03 17:22:35,216 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 17:22:35,217 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 17:22:35,217 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 17:22:35,217 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 17:22:35,221 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:22:35" (1/1) ... [2025-03-03 17:22:35,228 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:22:35" (1/1) ... [2025-03-03 17:22:35,261 INFO L138 Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 265 [2025-03-03 17:22:35,261 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 17:22:35,262 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 17:22:35,262 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 17:22:35,263 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 17:22:35,269 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:22:35" (1/1) ... [2025-03-03 17:22:35,269 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:22:35" (1/1) ... [2025-03-03 17:22:35,275 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:22:35" (1/1) ... [2025-03-03 17:22:35,289 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 17:22:35,289 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:22:35" (1/1) ... [2025-03-03 17:22:35,289 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:22:35" (1/1) ... [2025-03-03 17:22:35,297 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:22:35" (1/1) ... [2025-03-03 17:22:35,299 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:22:35" (1/1) ... [2025-03-03 17:22:35,301 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:22:35" (1/1) ... [2025-03-03 17:22:35,303 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:22:35" (1/1) ... [2025-03-03 17:22:35,307 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 17:22:35,307 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 17:22:35,307 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 17:22:35,308 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 17:22:35,308 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:22:35" (1/1) ... [2025-03-03 17:22:35,316 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 17:22:35,325 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 17:22:35,339 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 17:22:35,342 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 17:22:35,361 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 17:22:35,361 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 17:22:35,361 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 17:22:35,362 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 17:22:35,437 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 17:22:35,439 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 17:22:35,827 INFO L? ?]: Removed 152 outVars from TransFormulas that were not future-live. [2025-03-03 17:22:35,828 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 17:22:35,856 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 17:22:35,857 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 17:22:35,857 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 05:22:35 BoogieIcfgContainer [2025-03-03 17:22:35,857 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 17:22:35,859 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 17:22:35,859 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 17:22:35,862 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 17:22:35,862 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 05:22:35" (1/3) ... [2025-03-03 17:22:35,863 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4b1c204d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 05:22:35, skipping insertion in model container [2025-03-03 17:22:35,863 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:22:35" (2/3) ... [2025-03-03 17:22:35,863 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4b1c204d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 05:22:35, skipping insertion in model container [2025-03-03 17:22:35,863 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 05:22:35" (3/3) ... [2025-03-03 17:22:35,864 INFO L128 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.diagonal.c [2025-03-03 17:22:35,875 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 17:22:35,876 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG btor2c-lazyMod.diagonal.c that has 1 procedures, 72 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 17:22:35,918 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 17:22:35,927 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;@a802c84, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 17:22:35,928 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 17:22:35,932 INFO L276 IsEmpty]: Start isEmpty. Operand has 72 states, 70 states have (on average 1.4714285714285715) internal successors, (103), 71 states have internal predecessors, (103), 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 17:22:35,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2025-03-03 17:22:35,938 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 17:22:35,938 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 17:22:35,938 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 17:22:35,942 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 17:22:35,943 INFO L85 PathProgramCache]: Analyzing trace with hash -1585251547, now seen corresponding path program 1 times [2025-03-03 17:22:35,949 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 17:22:35,950 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [653821521] [2025-03-03 17:22:35,950 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 17:22:35,950 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 17:22:36,027 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-03 17:22:36,068 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-03 17:22:36,069 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 17:22:36,069 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 17:22:36,304 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 17:22:36,304 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 17:22:36,304 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [653821521] [2025-03-03 17:22:36,307 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [653821521] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 17:22:36,307 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 17:22:36,307 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 17:22:36,308 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1123571057] [2025-03-03 17:22:36,309 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 17:22:36,311 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 17:22:36,312 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 17:22:36,324 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 17:22:36,325 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 17:22:36,327 INFO L87 Difference]: Start difference. First operand has 72 states, 70 states have (on average 1.4714285714285715) internal successors, (103), 71 states have internal predecessors, (103), 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 3.25) internal successors, (13), 4 states have internal predecessors, (13), 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 17:22:36,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 17:22:36,402 INFO L93 Difference]: Finished difference Result 133 states and 193 transitions. [2025-03-03 17:22:36,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 17:22:36,405 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 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 13 [2025-03-03 17:22:36,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 17:22:36,409 INFO L225 Difference]: With dead ends: 133 [2025-03-03 17:22:36,410 INFO L226 Difference]: Without dead ends: 71 [2025-03-03 17:22:36,412 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 17:22:36,415 INFO L435 NwaCegarLoop]: 81 mSDtfsCounter, 0 mSDsluCounter, 157 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 238 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 17:22:36,417 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 238 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 17:22:36,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2025-03-03 17:22:36,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2025-03-03 17:22:36,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 70 states have (on average 1.4428571428571428) internal successors, (101), 70 states have internal predecessors, (101), 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 17:22:36,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 101 transitions. [2025-03-03 17:22:36,445 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 101 transitions. Word has length 13 [2025-03-03 17:22:36,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 17:22:36,445 INFO L471 AbstractCegarLoop]: Abstraction has 71 states and 101 transitions. [2025-03-03 17:22:36,446 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 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 17:22:36,446 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 101 transitions. [2025-03-03 17:22:36,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-03-03 17:22:36,447 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 17:22:36,447 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 17:22:36,447 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-03 17:22:36,448 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 17:22:36,448 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 17:22:36,449 INFO L85 PathProgramCache]: Analyzing trace with hash -1893478476, now seen corresponding path program 1 times [2025-03-03 17:22:36,449 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 17:22:36,449 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [899087847] [2025-03-03 17:22:36,449 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 17:22:36,449 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 17:22:36,459 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-03 17:22:36,474 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-03 17:22:36,475 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 17:22:36,476 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 17:22:36,568 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 17:22:36,568 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 17:22:36,568 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [899087847] [2025-03-03 17:22:36,568 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [899087847] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 17:22:36,568 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 17:22:36,568 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 17:22:36,568 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [386884545] [2025-03-03 17:22:36,569 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 17:22:36,569 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 17:22:36,569 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 17:22:36,570 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 17:22:36,570 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 17:22:36,570 INFO L87 Difference]: Start difference. First operand 71 states and 101 transitions. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 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 17:22:36,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 17:22:36,635 INFO L93 Difference]: Finished difference Result 134 states and 191 transitions. [2025-03-03 17:22:36,636 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 17:22:36,636 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 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 14 [2025-03-03 17:22:36,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 17:22:36,637 INFO L225 Difference]: With dead ends: 134 [2025-03-03 17:22:36,637 INFO L226 Difference]: Without dead ends: 73 [2025-03-03 17:22:36,637 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 17:22:36,638 INFO L435 NwaCegarLoop]: 81 mSDtfsCounter, 0 mSDsluCounter, 154 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 235 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 17:22:36,638 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 235 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 17:22:36,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2025-03-03 17:22:36,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2025-03-03 17:22:36,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 72 states have (on average 1.4305555555555556) internal successors, (103), 72 states have internal predecessors, (103), 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 17:22:36,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 103 transitions. [2025-03-03 17:22:36,646 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 103 transitions. Word has length 14 [2025-03-03 17:22:36,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 17:22:36,647 INFO L471 AbstractCegarLoop]: Abstraction has 73 states and 103 transitions. [2025-03-03 17:22:36,647 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 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 17:22:36,647 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 103 transitions. [2025-03-03 17:22:36,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-03-03 17:22:36,647 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 17:22:36,647 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 17:22:36,647 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-03 17:22:36,648 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 17:22:36,648 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 17:22:36,648 INFO L85 PathProgramCache]: Analyzing trace with hash -931748608, now seen corresponding path program 1 times [2025-03-03 17:22:36,648 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 17:22:36,649 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [486987330] [2025-03-03 17:22:36,649 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 17:22:36,649 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 17:22:36,659 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-03 17:22:36,686 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-03 17:22:36,686 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 17:22:36,686 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 17:22:36,901 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 17:22:36,902 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 17:22:36,902 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [486987330] [2025-03-03 17:22:36,902 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [486987330] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 17:22:36,902 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 17:22:36,902 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 17:22:36,902 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1320935438] [2025-03-03 17:22:36,902 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 17:22:36,903 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 17:22:36,903 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 17:22:36,903 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 17:22:36,903 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 17:22:36,903 INFO L87 Difference]: Start difference. First operand 73 states and 103 transitions. Second operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 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 17:22:37,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 17:22:37,021 INFO L93 Difference]: Finished difference Result 185 states and 262 transitions. [2025-03-03 17:22:37,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 17:22:37,022 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 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 15 [2025-03-03 17:22:37,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 17:22:37,024 INFO L225 Difference]: With dead ends: 185 [2025-03-03 17:22:37,024 INFO L226 Difference]: Without dead ends: 122 [2025-03-03 17:22:37,024 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 17:22:37,025 INFO L435 NwaCegarLoop]: 73 mSDtfsCounter, 76 mSDsluCounter, 203 mSDsCounter, 0 mSdLazyCounter, 107 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 276 SdHoareTripleChecker+Invalid, 107 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 107 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 17:22:37,026 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 276 Invalid, 107 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 107 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 17:22:37,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2025-03-03 17:22:37,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 75. [2025-03-03 17:22:37,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 74 states have (on average 1.4189189189189189) internal successors, (105), 74 states have internal predecessors, (105), 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 17:22:37,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 105 transitions. [2025-03-03 17:22:37,032 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 105 transitions. Word has length 15 [2025-03-03 17:22:37,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 17:22:37,032 INFO L471 AbstractCegarLoop]: Abstraction has 75 states and 105 transitions. [2025-03-03 17:22:37,032 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 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 17:22:37,032 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 105 transitions. [2025-03-03 17:22:37,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2025-03-03 17:22:37,034 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 17:22:37,034 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-03 17:22:37,034 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-03 17:22:37,034 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 17:22:37,035 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 17:22:37,036 INFO L85 PathProgramCache]: Analyzing trace with hash -377592472, now seen corresponding path program 1 times [2025-03-03 17:22:37,036 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 17:22:37,036 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1498429679] [2025-03-03 17:22:37,036 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 17:22:37,036 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 17:22:37,058 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-03-03 17:22:37,146 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-03-03 17:22:37,146 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 17:22:37,146 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 17:22:37,560 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 17:22:37,561 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 17:22:37,561 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1498429679] [2025-03-03 17:22:37,562 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1498429679] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 17:22:37,562 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [374729189] [2025-03-03 17:22:37,562 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 17:22:37,562 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 17:22:37,563 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 17:22:37,565 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 17:22:37,566 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 17:22:37,641 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-03-03 17:22:37,687 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-03-03 17:22:37,687 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 17:22:37,687 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 17:22:37,690 INFO L256 TraceCheckSpWp]: Trace formula consists of 331 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-03 17:22:37,693 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 17:22:37,860 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 17:22:37,860 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 17:22:37,862 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [374729189] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 17:22:37,862 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 17:22:37,862 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [8] total 10 [2025-03-03 17:22:37,862 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1970711499] [2025-03-03 17:22:37,862 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 17:22:37,863 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 17:22:37,863 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 17:22:37,864 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 17:22:37,864 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2025-03-03 17:22:37,864 INFO L87 Difference]: Start difference. First operand 75 states and 105 transitions. Second operand has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 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 17:22:37,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 17:22:37,955 INFO L93 Difference]: Finished difference Result 138 states and 194 transitions. [2025-03-03 17:22:37,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 17:22:37,955 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 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 46 [2025-03-03 17:22:37,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 17:22:37,956 INFO L225 Difference]: With dead ends: 138 [2025-03-03 17:22:37,957 INFO L226 Difference]: Without dead ends: 75 [2025-03-03 17:22:37,957 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2025-03-03 17:22:37,958 INFO L435 NwaCegarLoop]: 55 mSDtfsCounter, 82 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 109 SdHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 17:22:37,959 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 109 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 17:22:37,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2025-03-03 17:22:37,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2025-03-03 17:22:37,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 74 states have (on average 1.4054054054054055) internal successors, (104), 74 states have internal predecessors, (104), 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 17:22:37,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 104 transitions. [2025-03-03 17:22:37,968 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 104 transitions. Word has length 46 [2025-03-03 17:22:37,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 17:22:37,968 INFO L471 AbstractCegarLoop]: Abstraction has 75 states and 104 transitions. [2025-03-03 17:22:37,968 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 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 17:22:37,968 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 104 transitions. [2025-03-03 17:22:37,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2025-03-03 17:22:37,969 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 17:22:37,969 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-03 17:22:37,978 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 17:22:38,169 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 17:22:38,170 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 17:22:38,170 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 17:22:38,170 INFO L85 PathProgramCache]: Analyzing trace with hash 1401143458, now seen corresponding path program 1 times [2025-03-03 17:22:38,170 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 17:22:38,170 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1835706854] [2025-03-03 17:22:38,170 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 17:22:38,170 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 17:22:38,191 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-03-03 17:22:38,268 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-03-03 17:22:38,268 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 17:22:38,268 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 17:22:38,603 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 17:22:38,603 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 17:22:38,603 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1835706854] [2025-03-03 17:22:38,603 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1835706854] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 17:22:38,604 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1546449574] [2025-03-03 17:22:38,604 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 17:22:38,604 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 17:22:38,604 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 17:22:38,608 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 17:22:38,610 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 17:22:38,678 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-03-03 17:22:38,727 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-03-03 17:22:38,727 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 17:22:38,728 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 17:22:38,730 INFO L256 TraceCheckSpWp]: Trace formula consists of 331 conjuncts, 88 conjuncts are in the unsatisfiable core [2025-03-03 17:22:38,735 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 17:22:39,248 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 17:22:39,248 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 17:22:39,248 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1546449574] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 17:22:39,248 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 17:22:39,248 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [8] total 17 [2025-03-03 17:22:39,248 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [911101217] [2025-03-03 17:22:39,248 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 17:22:39,249 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-03 17:22:39,249 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 17:22:39,249 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-03 17:22:39,249 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=229, Unknown=0, NotChecked=0, Total=272 [2025-03-03 17:22:39,249 INFO L87 Difference]: Start difference. First operand 75 states and 104 transitions. Second operand has 11 states, 11 states have (on average 4.2727272727272725) internal successors, (47), 11 states have internal predecessors, (47), 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 17:22:39,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 17:22:39,658 INFO L93 Difference]: Finished difference Result 193 states and 270 transitions. [2025-03-03 17:22:39,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-03 17:22:39,659 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.2727272727272725) internal successors, (47), 11 states have internal predecessors, (47), 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 47 [2025-03-03 17:22:39,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 17:22:39,660 INFO L225 Difference]: With dead ends: 193 [2025-03-03 17:22:39,660 INFO L226 Difference]: Without dead ends: 130 [2025-03-03 17:22:39,661 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=91, Invalid=509, Unknown=0, NotChecked=0, Total=600 [2025-03-03 17:22:39,661 INFO L435 NwaCegarLoop]: 43 mSDtfsCounter, 181 mSDsluCounter, 260 mSDsCounter, 0 mSdLazyCounter, 420 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 181 SdHoareTripleChecker+Valid, 303 SdHoareTripleChecker+Invalid, 422 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 420 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 17:22:39,661 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [181 Valid, 303 Invalid, 422 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 420 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 17:22:39,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2025-03-03 17:22:39,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 75. [2025-03-03 17:22:39,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 74 states have (on average 1.3918918918918919) internal successors, (103), 74 states have internal predecessors, (103), 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 17:22:39,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 103 transitions. [2025-03-03 17:22:39,673 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 103 transitions. Word has length 47 [2025-03-03 17:22:39,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 17:22:39,673 INFO L471 AbstractCegarLoop]: Abstraction has 75 states and 103 transitions. [2025-03-03 17:22:39,673 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.2727272727272725) internal successors, (47), 11 states have internal predecessors, (47), 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 17:22:39,673 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 103 transitions. [2025-03-03 17:22:39,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2025-03-03 17:22:39,674 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 17:22:39,674 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-03 17:22:39,682 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-03 17:22:39,874 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 17:22:39,874 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 17:22:39,875 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 17:22:39,875 INFO L85 PathProgramCache]: Analyzing trace with hash 1550176778, now seen corresponding path program 1 times [2025-03-03 17:22:39,875 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 17:22:39,875 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [508783902] [2025-03-03 17:22:39,875 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 17:22:39,875 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 17:22:39,888 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-03-03 17:22:39,900 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-03-03 17:22:39,900 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 17:22:39,900 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 17:22:40,007 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 17:22:40,007 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 17:22:40,007 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [508783902] [2025-03-03 17:22:40,007 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [508783902] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 17:22:40,007 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 17:22:40,008 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 17:22:40,008 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1315223050] [2025-03-03 17:22:40,008 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 17:22:40,008 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 17:22:40,008 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 17:22:40,009 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 17:22:40,009 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 17:22:40,009 INFO L87 Difference]: Start difference. First operand 75 states and 103 transitions. Second operand has 6 states, 6 states have (on average 8.0) internal successors, (48), 6 states have internal predecessors, (48), 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 17:22:40,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 17:22:40,144 INFO L93 Difference]: Finished difference Result 193 states and 267 transitions. [2025-03-03 17:22:40,144 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 17:22:40,144 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.0) internal successors, (48), 6 states have internal predecessors, (48), 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 48 [2025-03-03 17:22:40,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 17:22:40,145 INFO L225 Difference]: With dead ends: 193 [2025-03-03 17:22:40,145 INFO L226 Difference]: Without dead ends: 79 [2025-03-03 17:22:40,145 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-03-03 17:22:40,146 INFO L435 NwaCegarLoop]: 109 mSDtfsCounter, 58 mSDsluCounter, 375 mSDsCounter, 0 mSdLazyCounter, 193 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 484 SdHoareTripleChecker+Invalid, 199 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 193 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 17:22:40,146 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 484 Invalid, 199 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 193 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 17:22:40,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2025-03-03 17:22:40,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 77. [2025-03-03 17:22:40,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 76 states have (on average 1.381578947368421) internal successors, (105), 76 states have internal predecessors, (105), 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 17:22:40,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 105 transitions. [2025-03-03 17:22:40,149 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 105 transitions. Word has length 48 [2025-03-03 17:22:40,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 17:22:40,149 INFO L471 AbstractCegarLoop]: Abstraction has 77 states and 105 transitions. [2025-03-03 17:22:40,149 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.0) internal successors, (48), 6 states have internal predecessors, (48), 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 17:22:40,149 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 105 transitions. [2025-03-03 17:22:40,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2025-03-03 17:22:40,150 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 17:22:40,150 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-03 17:22:40,150 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-03 17:22:40,150 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 17:22:40,150 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 17:22:40,151 INFO L85 PathProgramCache]: Analyzing trace with hash 1624965287, now seen corresponding path program 1 times [2025-03-03 17:22:40,151 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 17:22:40,151 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [966247961] [2025-03-03 17:22:40,151 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 17:22:40,151 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 17:22:40,163 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-03-03 17:22:40,203 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-03-03 17:22:40,203 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 17:22:40,203 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 17:22:40,607 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 17:22:40,607 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 17:22:40,607 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [966247961] [2025-03-03 17:22:40,607 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [966247961] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 17:22:40,607 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 17:22:40,607 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-03 17:22:40,607 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2065482298] [2025-03-03 17:22:40,608 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 17:22:40,608 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-03 17:22:40,608 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 17:22:40,608 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-03 17:22:40,608 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-03 17:22:40,608 INFO L87 Difference]: Start difference. First operand 77 states and 105 transitions. Second operand has 8 states, 8 states have (on average 6.125) internal successors, (49), 8 states have internal predecessors, (49), 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 17:22:40,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 17:22:40,841 INFO L93 Difference]: Finished difference Result 263 states and 360 transitions. [2025-03-03 17:22:40,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-03 17:22:40,842 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.125) internal successors, (49), 8 states have internal predecessors, (49), 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 49 [2025-03-03 17:22:40,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 17:22:40,843 INFO L225 Difference]: With dead ends: 263 [2025-03-03 17:22:40,843 INFO L226 Difference]: Without dead ends: 128 [2025-03-03 17:22:40,843 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2025-03-03 17:22:40,844 INFO L435 NwaCegarLoop]: 82 mSDtfsCounter, 151 mSDsluCounter, 409 mSDsCounter, 0 mSdLazyCounter, 313 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 151 SdHoareTripleChecker+Valid, 491 SdHoareTripleChecker+Invalid, 321 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 313 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 17:22:40,844 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [151 Valid, 491 Invalid, 321 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 313 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 17:22:40,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2025-03-03 17:22:40,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 100. [2025-03-03 17:22:40,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 99 states have (on average 1.3636363636363635) internal successors, (135), 99 states have internal predecessors, (135), 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 17:22:40,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 135 transitions. [2025-03-03 17:22:40,848 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 135 transitions. Word has length 49 [2025-03-03 17:22:40,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 17:22:40,848 INFO L471 AbstractCegarLoop]: Abstraction has 100 states and 135 transitions. [2025-03-03 17:22:40,848 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.125) internal successors, (49), 8 states have internal predecessors, (49), 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 17:22:40,848 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 135 transitions. [2025-03-03 17:22:40,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2025-03-03 17:22:40,848 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 17:22:40,848 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-03 17:22:40,849 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-03 17:22:40,849 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 17:22:40,849 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 17:22:40,849 INFO L85 PathProgramCache]: Analyzing trace with hash -529447557, now seen corresponding path program 1 times [2025-03-03 17:22:40,849 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 17:22:40,849 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1499985162] [2025-03-03 17:22:40,850 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 17:22:40,850 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 17:22:40,864 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-03-03 17:22:40,902 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-03-03 17:22:40,902 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 17:22:40,903 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 17:22:41,074 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 17:22:41,074 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 17:22:41,074 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1499985162] [2025-03-03 17:22:41,074 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1499985162] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 17:22:41,074 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 17:22:41,074 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 17:22:41,074 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1787116681] [2025-03-03 17:22:41,074 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 17:22:41,075 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 17:22:41,075 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 17:22:41,075 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 17:22:41,075 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 17:22:41,075 INFO L87 Difference]: Start difference. First operand 100 states and 135 transitions. Second operand has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 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 17:22:41,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 17:22:41,160 INFO L93 Difference]: Finished difference Result 191 states and 261 transitions. [2025-03-03 17:22:41,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 17:22:41,161 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 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 50 [2025-03-03 17:22:41,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 17:22:41,161 INFO L225 Difference]: With dead ends: 191 [2025-03-03 17:22:41,162 INFO L226 Difference]: Without dead ends: 126 [2025-03-03 17:22:41,163 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 17:22:41,163 INFO L435 NwaCegarLoop]: 69 mSDtfsCounter, 48 mSDsluCounter, 194 mSDsCounter, 0 mSdLazyCounter, 112 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 263 SdHoareTripleChecker+Invalid, 112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 17:22:41,163 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 263 Invalid, 112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 112 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 17:22:41,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2025-03-03 17:22:41,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 120. [2025-03-03 17:22:41,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 119 states have (on average 1.3697478991596639) internal successors, (163), 119 states have internal predecessors, (163), 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 17:22:41,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 163 transitions. [2025-03-03 17:22:41,171 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 163 transitions. Word has length 50 [2025-03-03 17:22:41,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 17:22:41,171 INFO L471 AbstractCegarLoop]: Abstraction has 120 states and 163 transitions. [2025-03-03 17:22:41,171 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 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 17:22:41,171 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 163 transitions. [2025-03-03 17:22:41,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2025-03-03 17:22:41,171 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 17:22:41,171 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-03 17:22:41,172 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-03 17:22:41,172 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 17:22:41,172 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 17:22:41,172 INFO L85 PathProgramCache]: Analyzing trace with hash -475751380, now seen corresponding path program 1 times [2025-03-03 17:22:41,172 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 17:22:41,172 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [20253905] [2025-03-03 17:22:41,172 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 17:22:41,172 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 17:22:41,186 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-03-03 17:22:41,238 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-03-03 17:22:41,239 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 17:22:41,239 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 17:22:41,472 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 17:22:41,472 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 17:22:41,472 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [20253905] [2025-03-03 17:22:41,472 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [20253905] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 17:22:41,472 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 17:22:41,473 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-03 17:22:41,473 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [728886635] [2025-03-03 17:22:41,473 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 17:22:41,473 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 17:22:41,473 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 17:22:41,473 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 17:22:41,473 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-03 17:22:41,474 INFO L87 Difference]: Start difference. First operand 120 states and 163 transitions. Second operand has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 7 states have internal predecessors, (50), 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 17:22:41,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 17:22:41,614 INFO L93 Difference]: Finished difference Result 290 states and 396 transitions. [2025-03-03 17:22:41,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 17:22:41,614 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 7 states have internal predecessors, (50), 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 50 [2025-03-03 17:22:41,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 17:22:41,615 INFO L225 Difference]: With dead ends: 290 [2025-03-03 17:22:41,615 INFO L226 Difference]: Without dead ends: 225 [2025-03-03 17:22:41,615 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2025-03-03 17:22:41,616 INFO L435 NwaCegarLoop]: 125 mSDtfsCounter, 107 mSDsluCounter, 555 mSDsCounter, 0 mSdLazyCounter, 230 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 680 SdHoareTripleChecker+Invalid, 230 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 230 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 17:22:41,616 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [107 Valid, 680 Invalid, 230 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 230 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 17:22:41,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states. [2025-03-03 17:22:41,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 154. [2025-03-03 17:22:41,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 154 states, 153 states have (on average 1.3660130718954249) internal successors, (209), 153 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 17:22:41,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 209 transitions. [2025-03-03 17:22:41,621 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 209 transitions. Word has length 50 [2025-03-03 17:22:41,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 17:22:41,621 INFO L471 AbstractCegarLoop]: Abstraction has 154 states and 209 transitions. [2025-03-03 17:22:41,621 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 7 states have internal predecessors, (50), 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 17:22:41,621 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 209 transitions. [2025-03-03 17:22:41,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2025-03-03 17:22:41,622 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 17:22:41,622 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-03 17:22:41,622 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-03 17:22:41,622 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 17:22:41,622 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 17:22:41,622 INFO L85 PathProgramCache]: Analyzing trace with hash 139299594, now seen corresponding path program 1 times [2025-03-03 17:22:41,622 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 17:22:41,622 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [444114031] [2025-03-03 17:22:41,623 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 17:22:41,623 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 17:22:41,634 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-03-03 17:22:41,669 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-03-03 17:22:41,669 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 17:22:41,669 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 17:22:41,973 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 17:22:41,974 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 17:22:41,974 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [444114031] [2025-03-03 17:22:41,974 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [444114031] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 17:22:41,974 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 17:22:41,974 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-03 17:22:41,974 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2110203593] [2025-03-03 17:22:41,974 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 17:22:41,975 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-03 17:22:41,975 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 17:22:41,975 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-03 17:22:41,976 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-03-03 17:22:41,976 INFO L87 Difference]: Start difference. First operand 154 states and 209 transitions. Second operand has 8 states, 8 states have (on average 6.375) internal successors, (51), 8 states have internal predecessors, (51), 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 17:22:42,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 17:22:42,143 INFO L93 Difference]: Finished difference Result 278 states and 376 transitions. [2025-03-03 17:22:42,143 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-03 17:22:42,143 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.375) internal successors, (51), 8 states have internal predecessors, (51), 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 51 [2025-03-03 17:22:42,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 17:22:42,144 INFO L225 Difference]: With dead ends: 278 [2025-03-03 17:22:42,144 INFO L226 Difference]: Without dead ends: 190 [2025-03-03 17:22:42,144 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-03-03 17:22:42,145 INFO L435 NwaCegarLoop]: 57 mSDtfsCounter, 52 mSDsluCounter, 310 mSDsCounter, 0 mSdLazyCounter, 299 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 367 SdHoareTripleChecker+Invalid, 299 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 299 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 17:22:42,145 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 367 Invalid, 299 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 299 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 17:22:42,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2025-03-03 17:22:42,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 171. [2025-03-03 17:22:42,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 171 states, 170 states have (on average 1.3529411764705883) internal successors, (230), 170 states have internal predecessors, (230), 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 17:22:42,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 230 transitions. [2025-03-03 17:22:42,154 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 230 transitions. Word has length 51 [2025-03-03 17:22:42,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 17:22:42,154 INFO L471 AbstractCegarLoop]: Abstraction has 171 states and 230 transitions. [2025-03-03 17:22:42,154 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.375) internal successors, (51), 8 states have internal predecessors, (51), 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 17:22:42,154 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 230 transitions. [2025-03-03 17:22:42,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2025-03-03 17:22:42,155 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 17:22:42,155 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-03 17:22:42,155 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-03 17:22:42,155 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 17:22:42,155 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 17:22:42,155 INFO L85 PathProgramCache]: Analyzing trace with hash -1821916515, now seen corresponding path program 1 times [2025-03-03 17:22:42,156 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 17:22:42,156 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [246425912] [2025-03-03 17:22:42,156 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 17:22:42,156 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 17:22:42,167 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-03-03 17:22:42,213 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-03-03 17:22:42,213 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 17:22:42,213 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 17:22:42,651 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 17:22:42,652 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 17:22:42,652 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [246425912] [2025-03-03 17:22:42,652 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [246425912] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 17:22:42,652 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 17:22:42,652 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-03 17:22:42,652 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [177270625] [2025-03-03 17:22:42,652 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 17:22:42,652 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-03 17:22:42,653 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 17:22:42,653 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-03 17:22:42,653 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2025-03-03 17:22:42,653 INFO L87 Difference]: Start difference. First operand 171 states and 230 transitions. Second operand has 9 states, 9 states have (on average 5.666666666666667) internal successors, (51), 9 states have internal predecessors, (51), 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 17:22:42,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 17:22:42,837 INFO L93 Difference]: Finished difference Result 313 states and 421 transitions. [2025-03-03 17:22:42,837 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 17:22:42,837 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.666666666666667) internal successors, (51), 9 states have internal predecessors, (51), 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 51 [2025-03-03 17:22:42,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 17:22:42,838 INFO L225 Difference]: With dead ends: 313 [2025-03-03 17:22:42,838 INFO L226 Difference]: Without dead ends: 205 [2025-03-03 17:22:42,838 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2025-03-03 17:22:42,839 INFO L435 NwaCegarLoop]: 57 mSDtfsCounter, 87 mSDsluCounter, 262 mSDsCounter, 0 mSdLazyCounter, 287 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 319 SdHoareTripleChecker+Invalid, 287 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 287 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 17:22:42,839 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 319 Invalid, 287 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 287 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 17:22:42,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2025-03-03 17:22:42,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 189. [2025-03-03 17:22:42,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 189 states, 188 states have (on average 1.351063829787234) internal successors, (254), 188 states have internal predecessors, (254), 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 17:22:42,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 254 transitions. [2025-03-03 17:22:42,845 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 254 transitions. Word has length 51 [2025-03-03 17:22:42,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 17:22:42,846 INFO L471 AbstractCegarLoop]: Abstraction has 189 states and 254 transitions. [2025-03-03 17:22:42,846 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.666666666666667) internal successors, (51), 9 states have internal predecessors, (51), 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 17:22:42,846 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 254 transitions. [2025-03-03 17:22:42,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2025-03-03 17:22:42,846 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 17:22:42,846 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-03 17:22:42,847 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-03 17:22:42,847 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 17:22:42,847 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 17:22:42,847 INFO L85 PathProgramCache]: Analyzing trace with hash -1697205050, now seen corresponding path program 1 times [2025-03-03 17:22:42,847 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 17:22:42,847 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1043676408] [2025-03-03 17:22:42,847 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 17:22:42,848 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 17:22:42,860 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-03-03 17:22:42,911 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-03-03 17:22:42,911 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 17:22:42,911 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 17:22:43,235 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 17:22:43,236 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 17:22:43,236 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1043676408] [2025-03-03 17:22:43,236 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1043676408] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 17:22:43,236 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2032711012] [2025-03-03 17:22:43,236 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 17:22:43,236 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 17:22:43,236 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 17:22:43,238 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 17:22:43,240 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 17:22:43,322 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-03-03 17:22:43,364 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-03-03 17:22:43,365 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 17:22:43,365 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 17:22:43,367 INFO L256 TraceCheckSpWp]: Trace formula consists of 342 conjuncts, 24 conjuncts are in the unsatisfiable core [2025-03-03 17:22:43,372 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 17:22:43,460 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 17:22:43,460 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 17:22:43,622 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 17:22:43,623 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2032711012] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 17:22:43,623 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 17:22:43,624 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6, 6] total 16 [2025-03-03 17:22:43,624 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [13758587] [2025-03-03 17:22:43,624 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 17:22:43,624 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-03 17:22:43,624 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 17:22:43,625 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-03 17:22:43,625 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=200, Unknown=0, NotChecked=0, Total=240 [2025-03-03 17:22:43,625 INFO L87 Difference]: Start difference. First operand 189 states and 254 transitions. Second operand has 16 states, 16 states have (on average 8.875) internal successors, (142), 16 states have internal predecessors, (142), 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 17:22:44,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 17:22:44,282 INFO L93 Difference]: Finished difference Result 500 states and 678 transitions. [2025-03-03 17:22:44,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-03 17:22:44,283 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 8.875) internal successors, (142), 16 states have internal predecessors, (142), 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 52 [2025-03-03 17:22:44,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 17:22:44,284 INFO L225 Difference]: With dead ends: 500 [2025-03-03 17:22:44,284 INFO L226 Difference]: Without dead ends: 412 [2025-03-03 17:22:44,284 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 97 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 92 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=183, Invalid=687, Unknown=0, NotChecked=0, Total=870 [2025-03-03 17:22:44,285 INFO L435 NwaCegarLoop]: 201 mSDtfsCounter, 399 mSDsluCounter, 1534 mSDsCounter, 0 mSdLazyCounter, 981 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 399 SdHoareTripleChecker+Valid, 1735 SdHoareTripleChecker+Invalid, 982 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 981 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-03 17:22:44,285 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [399 Valid, 1735 Invalid, 982 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 981 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-03 17:22:44,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 412 states. [2025-03-03 17:22:44,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 412 to 150. [2025-03-03 17:22:44,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 150 states, 149 states have (on average 1.348993288590604) internal successors, (201), 149 states have internal predecessors, (201), 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 17:22:44,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 201 transitions. [2025-03-03 17:22:44,295 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 201 transitions. Word has length 52 [2025-03-03 17:22:44,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 17:22:44,295 INFO L471 AbstractCegarLoop]: Abstraction has 150 states and 201 transitions. [2025-03-03 17:22:44,295 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 8.875) internal successors, (142), 16 states have internal predecessors, (142), 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 17:22:44,295 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 201 transitions. [2025-03-03 17:22:44,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2025-03-03 17:22:44,297 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 17:22:44,297 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-03 17:22:44,304 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 17:22:44,497 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 17:22:44,498 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 17:22:44,498 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 17:22:44,499 INFO L85 PathProgramCache]: Analyzing trace with hash -459767919, now seen corresponding path program 1 times [2025-03-03 17:22:44,499 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 17:22:44,499 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1324213454] [2025-03-03 17:22:44,499 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 17:22:44,499 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 17:22:44,513 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-03-03 17:22:44,556 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-03-03 17:22:44,556 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 17:22:44,556 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 17:22:44,969 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 17:22:44,969 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 17:22:44,969 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1324213454] [2025-03-03 17:22:44,969 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1324213454] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 17:22:44,970 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 17:22:44,970 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-03 17:22:44,970 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1052775493] [2025-03-03 17:22:44,970 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 17:22:44,971 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-03 17:22:44,971 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 17:22:44,971 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-03 17:22:44,971 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2025-03-03 17:22:44,971 INFO L87 Difference]: Start difference. First operand 150 states and 201 transitions. Second operand has 9 states, 9 states have (on average 5.777777777777778) internal successors, (52), 9 states have internal predecessors, (52), 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 17:22:45,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 17:22:45,207 INFO L93 Difference]: Finished difference Result 248 states and 334 transitions. [2025-03-03 17:22:45,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 17:22:45,208 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.777777777777778) internal successors, (52), 9 states have internal predecessors, (52), 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 52 [2025-03-03 17:22:45,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 17:22:45,208 INFO L225 Difference]: With dead ends: 248 [2025-03-03 17:22:45,209 INFO L226 Difference]: Without dead ends: 180 [2025-03-03 17:22:45,209 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2025-03-03 17:22:45,210 INFO L435 NwaCegarLoop]: 55 mSDtfsCounter, 121 mSDsluCounter, 247 mSDsCounter, 0 mSdLazyCounter, 409 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 121 SdHoareTripleChecker+Valid, 302 SdHoareTripleChecker+Invalid, 412 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 409 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 17:22:45,210 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [121 Valid, 302 Invalid, 412 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 409 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 17:22:45,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2025-03-03 17:22:45,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 167. [2025-03-03 17:22:45,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 167 states, 166 states have (on average 1.355421686746988) internal successors, (225), 166 states have internal predecessors, (225), 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 17:22:45,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 225 transitions. [2025-03-03 17:22:45,214 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 225 transitions. Word has length 52 [2025-03-03 17:22:45,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 17:22:45,215 INFO L471 AbstractCegarLoop]: Abstraction has 167 states and 225 transitions. [2025-03-03 17:22:45,215 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.777777777777778) internal successors, (52), 9 states have internal predecessors, (52), 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 17:22:45,215 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 225 transitions. [2025-03-03 17:22:45,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2025-03-03 17:22:45,215 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 17:22:45,215 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-03 17:22:45,215 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-03 17:22:45,215 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 17:22:45,217 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 17:22:45,217 INFO L85 PathProgramCache]: Analyzing trace with hash 1977933667, now seen corresponding path program 1 times [2025-03-03 17:22:45,217 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 17:22:45,217 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1280951825] [2025-03-03 17:22:45,217 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 17:22:45,217 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 17:22:45,229 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-03-03 17:22:45,251 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-03-03 17:22:45,251 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 17:22:45,252 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 17:22:45,550 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 17:22:45,550 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 17:22:45,550 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1280951825] [2025-03-03 17:22:45,550 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1280951825] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 17:22:45,550 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 17:22:45,550 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-03 17:22:45,550 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1461263904] [2025-03-03 17:22:45,551 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 17:22:45,551 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-03 17:22:45,551 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 17:22:45,551 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-03 17:22:45,551 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-03-03 17:22:45,552 INFO L87 Difference]: Start difference. First operand 167 states and 225 transitions. Second operand has 8 states, 8 states have (on average 6.5) internal successors, (52), 8 states have internal predecessors, (52), 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 17:22:45,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 17:22:45,666 INFO L93 Difference]: Finished difference Result 247 states and 333 transitions. [2025-03-03 17:22:45,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-03 17:22:45,666 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.5) internal successors, (52), 8 states have internal predecessors, (52), 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 52 [2025-03-03 17:22:45,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 17:22:45,667 INFO L225 Difference]: With dead ends: 247 [2025-03-03 17:22:45,667 INFO L226 Difference]: Without dead ends: 178 [2025-03-03 17:22:45,668 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-03-03 17:22:45,669 INFO L435 NwaCegarLoop]: 71 mSDtfsCounter, 51 mSDsluCounter, 367 mSDsCounter, 0 mSdLazyCounter, 196 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 438 SdHoareTripleChecker+Invalid, 196 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 196 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 17:22:45,669 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 438 Invalid, 196 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 196 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 17:22:45,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2025-03-03 17:22:45,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 169. [2025-03-03 17:22:45,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 169 states, 168 states have (on average 1.3511904761904763) internal successors, (227), 168 states have internal predecessors, (227), 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 17:22:45,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 227 transitions. [2025-03-03 17:22:45,677 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 227 transitions. Word has length 52 [2025-03-03 17:22:45,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 17:22:45,677 INFO L471 AbstractCegarLoop]: Abstraction has 169 states and 227 transitions. [2025-03-03 17:22:45,677 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.5) internal successors, (52), 8 states have internal predecessors, (52), 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 17:22:45,677 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 227 transitions. [2025-03-03 17:22:45,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2025-03-03 17:22:45,679 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 17:22:45,679 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-03 17:22:45,679 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-03 17:22:45,679 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 17:22:45,679 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 17:22:45,679 INFO L85 PathProgramCache]: Analyzing trace with hash 1532240559, now seen corresponding path program 1 times [2025-03-03 17:22:45,679 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 17:22:45,679 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [945451665] [2025-03-03 17:22:45,680 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 17:22:45,680 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 17:22:45,695 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-03-03 17:22:45,709 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-03-03 17:22:45,710 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 17:22:45,710 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 17:22:45,817 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 17:22:45,818 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 17:22:45,818 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [945451665] [2025-03-03 17:22:45,818 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [945451665] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 17:22:45,818 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 17:22:45,818 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 17:22:45,818 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [31283749] [2025-03-03 17:22:45,818 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 17:22:45,818 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 17:22:45,818 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 17:22:45,819 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 17:22:45,819 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-03 17:22:45,819 INFO L87 Difference]: Start difference. First operand 169 states and 227 transitions. Second operand has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 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 17:22:45,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 17:22:45,886 INFO L93 Difference]: Finished difference Result 248 states and 334 transitions. [2025-03-03 17:22:45,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 17:22:45,886 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 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 52 [2025-03-03 17:22:45,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 17:22:45,887 INFO L225 Difference]: With dead ends: 248 [2025-03-03 17:22:45,887 INFO L226 Difference]: Without dead ends: 175 [2025-03-03 17:22:45,887 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-03 17:22:45,888 INFO L435 NwaCegarLoop]: 60 mSDtfsCounter, 90 mSDsluCounter, 113 mSDsCounter, 0 mSdLazyCounter, 117 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 173 SdHoareTripleChecker+Invalid, 119 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 117 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 17:22:45,888 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [90 Valid, 173 Invalid, 119 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 117 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 17:22:45,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2025-03-03 17:22:45,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 175. [2025-03-03 17:22:45,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 175 states, 174 states have (on average 1.339080459770115) internal successors, (233), 174 states have internal predecessors, (233), 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 17:22:45,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 233 transitions. [2025-03-03 17:22:45,892 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 233 transitions. Word has length 52 [2025-03-03 17:22:45,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 17:22:45,892 INFO L471 AbstractCegarLoop]: Abstraction has 175 states and 233 transitions. [2025-03-03 17:22:45,892 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 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 17:22:45,892 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 233 transitions. [2025-03-03 17:22:45,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2025-03-03 17:22:45,893 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 17:22:45,893 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-03 17:22:45,893 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-03 17:22:45,893 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 17:22:45,893 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 17:22:45,893 INFO L85 PathProgramCache]: Analyzing trace with hash 586709948, now seen corresponding path program 1 times [2025-03-03 17:22:45,893 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 17:22:45,893 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1048555071] [2025-03-03 17:22:45,893 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 17:22:45,893 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 17:22:45,907 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-03-03 17:22:45,934 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-03-03 17:22:45,935 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 17:22:45,935 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 17:22:46,239 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 17:22:46,239 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 17:22:46,239 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1048555071] [2025-03-03 17:22:46,239 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1048555071] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 17:22:46,239 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 17:22:46,240 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-03 17:22:46,240 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1210670600] [2025-03-03 17:22:46,240 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 17:22:46,240 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 17:22:46,240 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 17:22:46,240 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 17:22:46,240 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-03 17:22:46,241 INFO L87 Difference]: Start difference. First operand 175 states and 233 transitions. Second operand has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 7 states have internal predecessors, (53), 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 17:22:46,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 17:22:46,435 INFO L93 Difference]: Finished difference Result 251 states and 335 transitions. [2025-03-03 17:22:46,435 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-03 17:22:46,435 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 7 states have internal predecessors, (53), 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 53 [2025-03-03 17:22:46,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 17:22:46,436 INFO L225 Difference]: With dead ends: 251 [2025-03-03 17:22:46,436 INFO L226 Difference]: Without dead ends: 178 [2025-03-03 17:22:46,437 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2025-03-03 17:22:46,437 INFO L435 NwaCegarLoop]: 53 mSDtfsCounter, 47 mSDsluCounter, 229 mSDsCounter, 0 mSdLazyCounter, 287 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 282 SdHoareTripleChecker+Invalid, 287 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 287 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 17:22:46,438 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 282 Invalid, 287 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 287 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 17:22:46,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2025-03-03 17:22:46,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 157. [2025-03-03 17:22:46,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 157 states, 156 states have (on average 1.3333333333333333) internal successors, (208), 156 states have internal predecessors, (208), 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 17:22:46,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 208 transitions. [2025-03-03 17:22:46,443 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 208 transitions. Word has length 53 [2025-03-03 17:22:46,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 17:22:46,444 INFO L471 AbstractCegarLoop]: Abstraction has 157 states and 208 transitions. [2025-03-03 17:22:46,444 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 7 states have internal predecessors, (53), 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 17:22:46,444 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 208 transitions. [2025-03-03 17:22:46,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2025-03-03 17:22:46,445 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 17:22:46,445 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-03 17:22:46,445 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-03 17:22:46,445 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 17:22:46,446 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 17:22:46,446 INFO L85 PathProgramCache]: Analyzing trace with hash -1864677737, now seen corresponding path program 1 times [2025-03-03 17:22:46,446 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 17:22:46,446 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1900135158] [2025-03-03 17:22:46,446 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 17:22:46,446 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 17:22:46,459 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-03-03 17:22:46,489 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-03-03 17:22:46,490 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 17:22:46,490 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 17:22:46,783 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 17:22:46,783 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 17:22:46,783 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1900135158] [2025-03-03 17:22:46,784 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1900135158] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 17:22:46,784 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 17:22:46,784 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-03 17:22:46,784 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1083503991] [2025-03-03 17:22:46,784 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 17:22:46,785 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 17:22:46,785 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 17:22:46,785 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 17:22:46,785 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-03 17:22:46,786 INFO L87 Difference]: Start difference. First operand 157 states and 208 transitions. Second operand has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 7 states have internal predecessors, (53), 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 17:22:46,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 17:22:46,917 INFO L93 Difference]: Finished difference Result 235 states and 312 transitions. [2025-03-03 17:22:46,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-03 17:22:46,917 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 7 states have internal predecessors, (53), 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 53 [2025-03-03 17:22:46,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 17:22:46,918 INFO L225 Difference]: With dead ends: 235 [2025-03-03 17:22:46,918 INFO L226 Difference]: Without dead ends: 165 [2025-03-03 17:22:46,918 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-03 17:22:46,919 INFO L435 NwaCegarLoop]: 56 mSDtfsCounter, 49 mSDsluCounter, 234 mSDsCounter, 0 mSdLazyCounter, 214 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 290 SdHoareTripleChecker+Invalid, 215 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 214 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 17:22:46,919 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 290 Invalid, 215 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 214 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 17:22:46,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2025-03-03 17:22:46,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 161. [2025-03-03 17:22:46,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 161 states, 160 states have (on average 1.33125) internal successors, (213), 160 states have internal predecessors, (213), 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 17:22:46,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 213 transitions. [2025-03-03 17:22:46,925 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 213 transitions. Word has length 53 [2025-03-03 17:22:46,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 17:22:46,925 INFO L471 AbstractCegarLoop]: Abstraction has 161 states and 213 transitions. [2025-03-03 17:22:46,925 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 7 states have internal predecessors, (53), 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 17:22:46,925 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 213 transitions. [2025-03-03 17:22:46,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-03-03 17:22:46,926 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 17:22:46,926 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-03 17:22:46,926 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-03 17:22:46,926 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 17:22:46,926 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 17:22:46,926 INFO L85 PathProgramCache]: Analyzing trace with hash -15821450, now seen corresponding path program 1 times [2025-03-03 17:22:46,926 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 17:22:46,927 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [579502603] [2025-03-03 17:22:46,927 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 17:22:46,927 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 17:22:46,939 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-03-03 17:22:46,980 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-03-03 17:22:46,980 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 17:22:46,980 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 17:22:47,438 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 17:22:47,438 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 17:22:47,438 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [579502603] [2025-03-03 17:22:47,438 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [579502603] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 17:22:47,438 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 17:22:47,439 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-03 17:22:47,439 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1633607074] [2025-03-03 17:22:47,439 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 17:22:47,439 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-03 17:22:47,439 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 17:22:47,439 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-03 17:22:47,440 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2025-03-03 17:22:47,440 INFO L87 Difference]: Start difference. First operand 161 states and 213 transitions. Second operand has 11 states, 11 states have (on average 4.909090909090909) internal successors, (54), 11 states have internal predecessors, (54), 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 17:22:47,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 17:22:47,746 INFO L93 Difference]: Finished difference Result 316 states and 417 transitions. [2025-03-03 17:22:47,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-03 17:22:47,746 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.909090909090909) internal successors, (54), 11 states have internal predecessors, (54), 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 54 [2025-03-03 17:22:47,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 17:22:47,747 INFO L225 Difference]: With dead ends: 316 [2025-03-03 17:22:47,747 INFO L226 Difference]: Without dead ends: 164 [2025-03-03 17:22:47,747 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=187, Unknown=0, NotChecked=0, Total=240 [2025-03-03 17:22:47,748 INFO L435 NwaCegarLoop]: 96 mSDtfsCounter, 173 mSDsluCounter, 608 mSDsCounter, 0 mSdLazyCounter, 491 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 173 SdHoareTripleChecker+Valid, 704 SdHoareTripleChecker+Invalid, 494 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 491 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 17:22:47,748 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [173 Valid, 704 Invalid, 494 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 491 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 17:22:47,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2025-03-03 17:22:47,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 161. [2025-03-03 17:22:47,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 161 states, 160 states have (on average 1.325) internal successors, (212), 160 states have internal predecessors, (212), 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 17:22:47,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 212 transitions. [2025-03-03 17:22:47,752 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 212 transitions. Word has length 54 [2025-03-03 17:22:47,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 17:22:47,752 INFO L471 AbstractCegarLoop]: Abstraction has 161 states and 212 transitions. [2025-03-03 17:22:47,752 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.909090909090909) internal successors, (54), 11 states have internal predecessors, (54), 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 17:22:47,752 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 212 transitions. [2025-03-03 17:22:47,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2025-03-03 17:22:47,752 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 17:22:47,753 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-03 17:22:47,753 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-03 17:22:47,753 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 17:22:47,753 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 17:22:47,753 INFO L85 PathProgramCache]: Analyzing trace with hash 116721325, now seen corresponding path program 1 times [2025-03-03 17:22:47,753 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 17:22:47,753 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1257247089] [2025-03-03 17:22:47,753 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 17:22:47,753 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 17:22:47,765 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-03-03 17:22:47,806 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-03-03 17:22:47,806 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 17:22:47,806 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 17:22:48,275 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 17:22:48,275 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 17:22:48,275 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1257247089] [2025-03-03 17:22:48,275 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1257247089] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 17:22:48,275 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 17:22:48,275 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-03 17:22:48,275 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2043713007] [2025-03-03 17:22:48,275 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 17:22:48,276 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-03 17:22:48,277 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 17:22:48,277 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-03 17:22:48,277 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-03 17:22:48,277 INFO L87 Difference]: Start difference. First operand 161 states and 212 transitions. Second operand has 8 states, 8 states have (on average 6.875) internal successors, (55), 8 states have internal predecessors, (55), 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 17:22:48,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 17:22:48,510 INFO L93 Difference]: Finished difference Result 267 states and 353 transitions. [2025-03-03 17:22:48,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-03 17:22:48,510 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.875) internal successors, (55), 8 states have internal predecessors, (55), 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 55 [2025-03-03 17:22:48,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 17:22:48,512 INFO L225 Difference]: With dead ends: 267 [2025-03-03 17:22:48,512 INFO L226 Difference]: Without dead ends: 163 [2025-03-03 17:22:48,512 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2025-03-03 17:22:48,512 INFO L435 NwaCegarLoop]: 50 mSDtfsCounter, 62 mSDsluCounter, 262 mSDsCounter, 0 mSdLazyCounter, 354 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 312 SdHoareTripleChecker+Invalid, 355 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 354 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 17:22:48,513 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 312 Invalid, 355 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 354 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 17:22:48,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2025-03-03 17:22:48,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 163. [2025-03-03 17:22:48,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 163 states, 162 states have (on average 1.3209876543209877) internal successors, (214), 162 states have internal predecessors, (214), 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 17:22:48,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 214 transitions. [2025-03-03 17:22:48,520 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 214 transitions. Word has length 55 [2025-03-03 17:22:48,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 17:22:48,520 INFO L471 AbstractCegarLoop]: Abstraction has 163 states and 214 transitions. [2025-03-03 17:22:48,521 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.875) internal successors, (55), 8 states have internal predecessors, (55), 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 17:22:48,521 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 214 transitions. [2025-03-03 17:22:48,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2025-03-03 17:22:48,521 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 17:22:48,521 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-03 17:22:48,521 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-03 17:22:48,521 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 17:22:48,521 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 17:22:48,521 INFO L85 PathProgramCache]: Analyzing trace with hash -754607982, now seen corresponding path program 1 times [2025-03-03 17:22:48,521 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 17:22:48,521 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1229870232] [2025-03-03 17:22:48,521 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 17:22:48,521 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 17:22:48,535 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-03-03 17:22:48,560 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-03-03 17:22:48,560 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 17:22:48,561 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 17:22:48,768 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 17:22:48,769 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 17:22:48,769 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1229870232] [2025-03-03 17:22:48,769 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1229870232] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 17:22:48,769 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 17:22:48,769 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-03 17:22:48,769 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [374328712] [2025-03-03 17:22:48,769 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 17:22:48,769 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-03 17:22:48,770 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 17:22:48,771 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-03 17:22:48,771 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-03 17:22:48,771 INFO L87 Difference]: Start difference. First operand 163 states and 214 transitions. Second operand has 8 states, 8 states have (on average 6.875) internal successors, (55), 8 states have internal predecessors, (55), 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 17:22:48,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 17:22:48,922 INFO L93 Difference]: Finished difference Result 275 states and 359 transitions. [2025-03-03 17:22:48,922 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-03 17:22:48,923 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.875) internal successors, (55), 8 states have internal predecessors, (55), 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 55 [2025-03-03 17:22:48,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 17:22:48,923 INFO L225 Difference]: With dead ends: 275 [2025-03-03 17:22:48,923 INFO L226 Difference]: Without dead ends: 152 [2025-03-03 17:22:48,924 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2025-03-03 17:22:48,926 INFO L435 NwaCegarLoop]: 66 mSDtfsCounter, 52 mSDsluCounter, 359 mSDsCounter, 0 mSdLazyCounter, 239 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 425 SdHoareTripleChecker+Invalid, 242 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 239 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 17:22:48,926 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 425 Invalid, 242 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 239 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 17:22:48,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2025-03-03 17:22:48,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 152. [2025-03-03 17:22:48,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 152 states, 151 states have (on average 1.2913907284768211) internal successors, (195), 151 states have internal predecessors, (195), 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 17:22:48,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 195 transitions. [2025-03-03 17:22:48,933 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 195 transitions. Word has length 55 [2025-03-03 17:22:48,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 17:22:48,934 INFO L471 AbstractCegarLoop]: Abstraction has 152 states and 195 transitions. [2025-03-03 17:22:48,934 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.875) internal successors, (55), 8 states have internal predecessors, (55), 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 17:22:48,934 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 195 transitions. [2025-03-03 17:22:48,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2025-03-03 17:22:48,934 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 17:22:48,934 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-03 17:22:48,934 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-03 17:22:48,934 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 17:22:48,935 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 17:22:48,935 INFO L85 PathProgramCache]: Analyzing trace with hash 1666129134, now seen corresponding path program 1 times [2025-03-03 17:22:48,935 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 17:22:48,935 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [989231065] [2025-03-03 17:22:48,935 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 17:22:48,935 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 17:22:48,949 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-03-03 17:22:48,958 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-03-03 17:22:48,958 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 17:22:48,958 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 17:22:49,038 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 17:22:49,039 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 17:22:49,039 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [989231065] [2025-03-03 17:22:49,039 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [989231065] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 17:22:49,039 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 17:22:49,039 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 17:22:49,039 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [870178059] [2025-03-03 17:22:49,039 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 17:22:49,039 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 17:22:49,039 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 17:22:49,040 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 17:22:49,040 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-03 17:22:49,040 INFO L87 Difference]: Start difference. First operand 152 states and 195 transitions. Second operand has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 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 17:22:49,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 17:22:49,078 INFO L93 Difference]: Finished difference Result 272 states and 352 transitions. [2025-03-03 17:22:49,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 17:22:49,079 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 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 55 [2025-03-03 17:22:49,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 17:22:49,080 INFO L225 Difference]: With dead ends: 272 [2025-03-03 17:22:49,080 INFO L226 Difference]: Without dead ends: 156 [2025-03-03 17:22:49,080 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-03 17:22:49,081 INFO L435 NwaCegarLoop]: 79 mSDtfsCounter, 0 mSDsluCounter, 148 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 227 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 17:22:49,081 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 227 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 17:22:49,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2025-03-03 17:22:49,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 156. [2025-03-03 17:22:49,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 156 states, 155 states have (on average 1.2838709677419355) internal successors, (199), 155 states have internal predecessors, (199), 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 17:22:49,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 199 transitions. [2025-03-03 17:22:49,084 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 199 transitions. Word has length 55 [2025-03-03 17:22:49,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 17:22:49,084 INFO L471 AbstractCegarLoop]: Abstraction has 156 states and 199 transitions. [2025-03-03 17:22:49,084 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 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 17:22:49,085 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 199 transitions. [2025-03-03 17:22:49,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-03-03 17:22:49,085 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 17:22:49,085 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-03 17:22:49,085 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-03 17:22:49,085 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 17:22:49,086 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 17:22:49,086 INFO L85 PathProgramCache]: Analyzing trace with hash 1169379995, now seen corresponding path program 1 times [2025-03-03 17:22:49,086 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 17:22:49,086 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2091261957] [2025-03-03 17:22:49,086 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 17:22:49,086 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 17:22:49,097 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-03-03 17:22:49,112 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-03-03 17:22:49,112 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 17:22:49,112 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 17:22:49,258 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 17:22:49,258 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 17:22:49,258 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2091261957] [2025-03-03 17:22:49,258 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2091261957] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 17:22:49,258 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 17:22:49,258 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 17:22:49,259 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [387739114] [2025-03-03 17:22:49,259 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 17:22:49,259 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 17:22:49,259 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 17:22:49,259 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 17:22:49,259 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 17:22:49,260 INFO L87 Difference]: Start difference. First operand 156 states and 199 transitions. Second operand has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 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 17:22:49,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 17:22:49,332 INFO L93 Difference]: Finished difference Result 272 states and 347 transitions. [2025-03-03 17:22:49,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 17:22:49,334 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 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 56 [2025-03-03 17:22:49,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 17:22:49,335 INFO L225 Difference]: With dead ends: 272 [2025-03-03 17:22:49,335 INFO L226 Difference]: Without dead ends: 136 [2025-03-03 17:22:49,335 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 17:22:49,336 INFO L435 NwaCegarLoop]: 71 mSDtfsCounter, 49 mSDsluCounter, 197 mSDsCounter, 0 mSdLazyCounter, 107 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 268 SdHoareTripleChecker+Invalid, 107 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 107 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 17:22:49,336 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 268 Invalid, 107 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 107 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 17:22:49,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2025-03-03 17:22:49,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 136. [2025-03-03 17:22:49,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136 states, 135 states have (on average 1.2740740740740741) internal successors, (172), 135 states have internal predecessors, (172), 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 17:22:49,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 172 transitions. [2025-03-03 17:22:49,340 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 172 transitions. Word has length 56 [2025-03-03 17:22:49,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 17:22:49,340 INFO L471 AbstractCegarLoop]: Abstraction has 136 states and 172 transitions. [2025-03-03 17:22:49,340 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 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 17:22:49,341 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 172 transitions. [2025-03-03 17:22:49,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-03-03 17:22:49,341 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 17:22:49,341 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-03 17:22:49,341 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-03 17:22:49,341 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 17:22:49,341 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 17:22:49,341 INFO L85 PathProgramCache]: Analyzing trace with hash -1472107594, now seen corresponding path program 1 times [2025-03-03 17:22:49,342 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 17:22:49,342 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1371004197] [2025-03-03 17:22:49,342 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 17:22:49,342 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 17:22:49,352 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-03-03 17:22:49,391 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-03-03 17:22:49,391 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 17:22:49,391 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-03 17:22:49,391 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-03 17:22:49,395 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-03-03 17:22:49,439 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-03-03 17:22:49,439 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 17:22:49,439 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-03 17:22:49,464 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-03 17:22:49,464 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-03 17:22:49,465 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-03 17:22:49,466 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-03-03 17:22:49,469 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] [2025-03-03 17:22:49,495 WARN L310 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2025-03-03 17:22:49,495 WARN L310 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2025-03-03 17:22:49,502 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-03 17:22:49,504 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.03 05:22:49 BoogieIcfgContainer [2025-03-03 17:22:49,505 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-03 17:22:49,505 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-03 17:22:49,505 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-03 17:22:49,505 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-03 17:22:49,506 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 05:22:35" (3/4) ... [2025-03-03 17:22:49,507 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-03 17:22:49,508 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-03 17:22:49,509 INFO L158 Benchmark]: Toolchain (without parser) took 14471.25ms. Allocated memory was 142.6MB in the beginning and 604.0MB in the end (delta: 461.4MB). Free memory was 105.0MB in the beginning and 463.4MB in the end (delta: -358.4MB). Peak memory consumption was 99.6MB. Max. memory is 16.1GB. [2025-03-03 17:22:49,509 INFO L158 Benchmark]: CDTParser took 0.82ms. Allocated memory is still 201.3MB. Free memory is still 126.4MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 17:22:49,509 INFO L158 Benchmark]: CACSL2BoogieTranslator took 178.33ms. Allocated memory is still 142.6MB. Free memory was 105.0MB in the beginning and 90.2MB in the end (delta: 14.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-03 17:22:49,510 INFO L158 Benchmark]: Boogie Procedure Inliner took 44.30ms. Allocated memory is still 142.6MB. Free memory was 90.2MB in the beginning and 85.0MB in the end (delta: 5.2MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 17:22:49,511 INFO L158 Benchmark]: Boogie Preprocessor took 45.05ms. Allocated memory is still 142.6MB. Free memory was 84.9MB in the beginning and 80.7MB in the end (delta: 4.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-03 17:22:49,511 INFO L158 Benchmark]: IcfgBuilder took 550.08ms. Allocated memory is still 142.6MB. Free memory was 80.7MB in the beginning and 40.9MB in the end (delta: 39.8MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. [2025-03-03 17:22:49,511 INFO L158 Benchmark]: TraceAbstraction took 13645.75ms. Allocated memory was 142.6MB in the beginning and 604.0MB in the end (delta: 461.4MB). Free memory was 40.9MB in the beginning and 467.6MB in the end (delta: -426.8MB). Peak memory consumption was 32.5MB. Max. memory is 16.1GB. [2025-03-03 17:22:49,511 INFO L158 Benchmark]: Witness Printer took 2.62ms. Allocated memory is still 604.0MB. Free memory was 467.6MB in the beginning and 463.4MB in the end (delta: 4.2MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 17:22:49,512 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.82ms. Allocated memory is still 201.3MB. Free memory is still 126.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 178.33ms. Allocated memory is still 142.6MB. Free memory was 105.0MB in the beginning and 90.2MB in the end (delta: 14.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 44.30ms. Allocated memory is still 142.6MB. Free memory was 90.2MB in the beginning and 85.0MB in the end (delta: 5.2MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 45.05ms. Allocated memory is still 142.6MB. Free memory was 84.9MB in the beginning and 80.7MB in the end (delta: 4.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 550.08ms. Allocated memory is still 142.6MB. Free memory was 80.7MB in the beginning and 40.9MB in the end (delta: 39.8MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. * TraceAbstraction took 13645.75ms. Allocated memory was 142.6MB in the beginning and 604.0MB in the end (delta: 461.4MB). Free memory was 40.9MB in the beginning and 467.6MB in the end (delta: -426.8MB). Peak memory consumption was 32.5MB. Max. memory is 16.1GB. * Witness Printer took 2.62ms. Allocated memory is still 604.0MB. Free memory was 467.6MB in the beginning and 463.4MB in the end (delta: 4.2MB). There was no memory consumed. 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 shiftRight at line 78, overapproximation of bitwiseOr at line 134, overapproximation of bitwiseAnd at line 113, overapproximation of bitwiseAnd at line 147, overapproximation of bitwiseAnd at line 135. Possible FailurePath: [L26] const SORT_1 mask_SORT_1 = (SORT_1)-1 >> (sizeof(SORT_1) * 8 - 1); [L27] const SORT_1 msb_SORT_1 = (SORT_1)1 << (1 - 1); [L29] const SORT_4 mask_SORT_4 = (SORT_4)-1 >> (sizeof(SORT_4) * 8 - 4); [L30] const SORT_4 msb_SORT_4 = (SORT_4)1 << (4 - 1); [L32] const SORT_4 var_5 = 0; [L33] const SORT_1 var_14 = 1; [L34] const SORT_4 var_19 = 1; [L35] const SORT_4 var_22 = 15; [L37] SORT_1 input_2; [L38] SORT_1 input_3; [L40] EXPR __VERIFIER_nondet_uchar() & mask_SORT_4 VAL [mask_SORT_1=1, mask_SORT_4=15, var_14=1, var_19=1, var_22=15, var_5=0] [L40] SORT_4 state_6 = __VERIFIER_nondet_uchar() & mask_SORT_4; [L41] EXPR __VERIFIER_nondet_uchar() & mask_SORT_4 VAL [mask_SORT_1=1, mask_SORT_4=15, var_14=1, var_19=1, var_22=15, var_5=0] [L41] SORT_4 state_8 = __VERIFIER_nondet_uchar() & mask_SORT_4; [L43] SORT_4 init_7_arg_1 = var_5; [L44] state_6 = init_7_arg_1 [L45] SORT_4 init_9_arg_1 = var_5; [L46] state_8 = init_9_arg_1 VAL [mask_SORT_1=1, mask_SORT_4=15, state_6=0, state_8=0, var_14=1, var_19=1, var_22=15] [L49] input_2 = __VERIFIER_nondet_uchar() [L50] input_3 = __VERIFIER_nondet_uchar() [L53] SORT_4 var_10_arg_0 = state_6; [L54] SORT_4 var_10_arg_1 = state_8; [L55] SORT_1 var_10 = var_10_arg_0 < var_10_arg_1; [L56] SORT_1 var_11_arg_0 = var_10; [L57] SORT_1 var_11 = ~var_11_arg_0; [L58] SORT_1 var_15_arg_0 = var_11; [L59] SORT_1 var_15 = ~var_15_arg_0; [L60] SORT_1 var_16_arg_0 = var_14; [L61] SORT_1 var_16_arg_1 = var_15; VAL [mask_SORT_1=1, mask_SORT_4=15, state_6=0, state_8=0, var_14=1, var_16_arg_0=1, var_16_arg_1=-256, var_19=1, var_22=15] [L62] EXPR var_16_arg_0 & var_16_arg_1 VAL [mask_SORT_1=1, mask_SORT_4=15, state_6=0, state_8=0, var_14=1, var_19=1, var_22=15] [L62] SORT_1 var_16 = var_16_arg_0 & var_16_arg_1; [L63] EXPR var_16 & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_4=15, state_6=0, state_8=0, var_14=1, var_19=1, var_22=15] [L63] var_16 = var_16 & mask_SORT_1 [L64] SORT_1 bad_17_arg_0 = var_16; [L65] CALL __VERIFIER_assert(!(bad_17_arg_0)) [L21] COND FALSE !(!(cond)) [L65] RET __VERIFIER_assert(!(bad_17_arg_0)) [L67] SORT_1 var_31_arg_0 = input_3; [L68] SORT_1 var_31 = ~var_31_arg_0; [L69] SORT_4 var_32_arg_0 = state_6; [L70] SORT_4 var_32_arg_1 = state_8; [L71] SORT_1 var_32 = var_32_arg_0 > var_32_arg_1; [L72] SORT_1 var_33_arg_0 = var_31; [L73] SORT_1 var_33_arg_1 = var_32; VAL [input_3=255, mask_SORT_1=1, mask_SORT_4=15, state_6=0, state_8=0, var_14=1, var_19=1, var_22=15, var_33_arg_0=-256, var_33_arg_1=0] [L74] EXPR var_33_arg_0 & var_33_arg_1 VAL [input_3=255, mask_SORT_1=1, mask_SORT_4=15, state_6=0, state_8=0, var_14=1, var_19=1, var_22=15] [L74] SORT_1 var_33 = var_33_arg_0 & var_33_arg_1; [L75] EXPR var_33 & mask_SORT_1 VAL [input_3=255, mask_SORT_1=1, mask_SORT_4=15, state_6=0, state_8=0, var_14=1, var_19=1, var_22=15] [L75] var_33 = var_33 & mask_SORT_1 [L76] SORT_4 var_28_arg_0 = var_22; [L77] SORT_4 var_28_arg_1 = var_19; VAL [input_3=255, mask_SORT_1=1, mask_SORT_4=15, state_6=0, state_8=0, var_14=1, var_19=1, var_22=15, var_28_arg_0=15, var_28_arg_1=1, var_33=0] [L78] EXPR var_28_arg_0 >> var_28_arg_1 VAL [input_3=255, mask_SORT_1=1, mask_SORT_4=15, state_6=0, state_8=0, var_14=1, var_19=1, var_22=15, var_33=0] [L78] SORT_4 var_28 = var_28_arg_0 >> var_28_arg_1; [L79] SORT_4 var_29_arg_0 = state_6; [L80] SORT_4 var_29_arg_1 = var_19; VAL [input_3=255, mask_SORT_1=1, mask_SORT_4=15, state_6=0, state_8=0, var_14=1, var_19=1, var_22=15, var_28=-255, var_29_arg_0=0, var_29_arg_1=1, var_33=0] [L81] EXPR var_29_arg_0 >> var_29_arg_1 VAL [input_3=255, mask_SORT_1=1, mask_SORT_4=15, state_6=0, state_8=0, var_14=1, var_19=1, var_22=15, var_28=-255, var_33=0] [L81] SORT_4 var_29 = var_29_arg_0 >> var_29_arg_1; [L82] SORT_4 var_30_arg_0 = var_28; [L83] SORT_4 var_30_arg_1 = var_29; [L84] SORT_4 var_30 = var_30_arg_0 + var_30_arg_1; [L85] SORT_4 var_26_arg_0 = state_6; [L86] SORT_4 var_26_arg_1 = state_8; [L87] SORT_1 var_26 = var_26_arg_0 < var_26_arg_1; [L88] SORT_4 var_21_arg_0 = state_8; [L89] SORT_4 var_21_arg_1 = state_6; [L90] SORT_1 var_21 = var_21_arg_0 == var_21_arg_1; [L91] SORT_4 var_23_arg_0 = state_6; [L92] SORT_4 var_23_arg_1 = var_22; [L93] SORT_1 var_23 = var_23_arg_0 != var_23_arg_1; [L94] SORT_1 var_24_arg_0 = var_21; [L95] SORT_1 var_24_arg_1 = var_23; VAL [input_3=255, mask_SORT_1=1, mask_SORT_4=15, state_6=0, state_8=0, var_14=1, var_19=1, var_22=15, var_24_arg_0=1, var_24_arg_1=1, var_26=0, var_30=1, var_33=0] [L96] EXPR var_24_arg_0 | var_24_arg_1 VAL [input_3=255, mask_SORT_1=1, mask_SORT_4=15, state_6=0, state_8=0, var_14=1, var_19=1, var_22=15, var_26=0, var_30=1, var_33=0] [L96] SORT_1 var_24 = var_24_arg_0 | var_24_arg_1; [L97] EXPR var_24 & mask_SORT_1 VAL [input_3=255, mask_SORT_1=1, mask_SORT_4=15, state_6=0, state_8=0, var_14=1, var_19=1, var_22=15, var_26=0, var_30=1, var_33=0] [L97] var_24 = var_24 & mask_SORT_1 [L98] SORT_4 var_20_arg_0 = state_6; [L99] SORT_4 var_20_arg_1 = var_19; [L100] SORT_4 var_20 = var_20_arg_0 + var_20_arg_1; [L101] SORT_1 var_25_arg_0 = var_24; [L102] SORT_4 var_25_arg_1 = var_20; [L103] SORT_4 var_25_arg_2 = state_8; [L104] SORT_4 var_25 = var_25_arg_0 ? var_25_arg_1 : var_25_arg_2; [L105] SORT_1 var_27_arg_0 = var_26; [L106] SORT_4 var_27_arg_1 = state_6; [L107] SORT_4 var_27_arg_2 = var_25; [L108] SORT_4 var_27 = var_27_arg_0 ? var_27_arg_1 : var_27_arg_2; [L109] SORT_1 var_34_arg_0 = var_33; [L110] SORT_4 var_34_arg_1 = var_30; [L111] SORT_4 var_34_arg_2 = var_27; [L112] SORT_4 var_34 = var_34_arg_0 ? var_34_arg_1 : var_34_arg_2; VAL [input_3=255, mask_SORT_1=1, mask_SORT_4=15, state_6=0, state_8=0, var_14=1, var_19=1, var_22=15, var_34=1] [L113] EXPR var_34 & mask_SORT_4 VAL [input_3=255, mask_SORT_1=1, mask_SORT_4=15, state_6=0, state_8=0, var_14=1, var_19=1, var_22=15] [L113] var_34 = var_34 & mask_SORT_4 [L114] SORT_4 next_35_arg_1 = var_34; [L115] SORT_1 var_42_arg_0 = input_3; [L116] SORT_1 var_42 = ~var_42_arg_0; [L117] SORT_4 var_43_arg_0 = state_6; [L118] SORT_4 var_43_arg_1 = state_8; [L119] SORT_1 var_43 = var_43_arg_0 > var_43_arg_1; [L120] SORT_1 var_44_arg_0 = var_42; [L121] SORT_1 var_44_arg_1 = var_43; VAL [mask_SORT_1=1, mask_SORT_4=15, next_35_arg_1=0, state_6=0, state_8=0, var_14=1, var_19=1, var_22=15, var_44_arg_0=-256, var_44_arg_1=0] [L122] EXPR var_44_arg_0 & var_44_arg_1 VAL [mask_SORT_1=1, mask_SORT_4=15, next_35_arg_1=0, state_6=0, state_8=0, var_14=1, var_19=1, var_22=15] [L122] SORT_1 var_44 = var_44_arg_0 & var_44_arg_1; [L123] EXPR var_44 & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_4=15, next_35_arg_1=0, state_6=0, state_8=0, var_14=1, var_19=1, var_22=15] [L123] var_44 = var_44 & mask_SORT_1 [L124] SORT_4 var_37_arg_0 = state_6; [L125] SORT_4 var_37_arg_1 = state_8; [L126] SORT_1 var_37 = var_37_arg_0 > var_37_arg_1; [L127] SORT_1 var_38_arg_0 = var_37; [L128] SORT_1 var_38 = ~var_38_arg_0; [L129] SORT_4 var_39_arg_0 = state_6; [L130] SORT_4 var_39_arg_1 = var_22; [L131] SORT_1 var_39 = var_39_arg_0 != var_39_arg_1; [L132] SORT_1 var_40_arg_0 = var_38; [L133] SORT_1 var_40_arg_1 = var_39; VAL [mask_SORT_1=1, mask_SORT_4=15, next_35_arg_1=0, state_6=0, state_8=0, var_14=1, var_19=1, var_22=15, var_40_arg_0=-1, var_40_arg_1=1, var_44=0] [L134] EXPR var_40_arg_0 | var_40_arg_1 VAL [mask_SORT_1=1, mask_SORT_4=15, next_35_arg_1=0, state_6=0, state_8=0, var_14=1, var_19=1, var_22=15, var_44=0] [L134] SORT_1 var_40 = var_40_arg_0 | var_40_arg_1; [L135] EXPR var_40 & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_4=15, next_35_arg_1=0, state_6=0, state_8=0, var_14=1, var_19=1, var_22=15, var_44=0] [L135] var_40 = var_40 & mask_SORT_1 [L136] SORT_4 var_36_arg_0 = state_8; [L137] SORT_4 var_36_arg_1 = var_19; [L138] SORT_4 var_36 = var_36_arg_0 + var_36_arg_1; [L139] SORT_1 var_41_arg_0 = var_40; [L140] SORT_4 var_41_arg_1 = var_36; [L141] SORT_4 var_41_arg_2 = state_6; [L142] SORT_4 var_41 = var_41_arg_0 ? var_41_arg_1 : var_41_arg_2; [L143] SORT_1 var_45_arg_0 = var_44; [L144] SORT_4 var_45_arg_1 = state_8; [L145] SORT_4 var_45_arg_2 = var_41; [L146] SORT_4 var_45 = var_45_arg_0 ? var_45_arg_1 : var_45_arg_2; VAL [mask_SORT_1=1, mask_SORT_4=15, next_35_arg_1=0, var_14=1, var_19=1, var_22=15, var_45=1] [L147] EXPR var_45 & mask_SORT_4 VAL [mask_SORT_1=1, mask_SORT_4=15, next_35_arg_1=0, var_14=1, var_19=1, var_22=15] [L147] var_45 = var_45 & mask_SORT_4 [L148] SORT_4 next_46_arg_1 = var_45; [L150] state_6 = next_35_arg_1 [L151] state_8 = next_46_arg_1 [L49] input_2 = __VERIFIER_nondet_uchar() [L50] input_3 = __VERIFIER_nondet_uchar() [L53] SORT_4 var_10_arg_0 = state_6; [L54] SORT_4 var_10_arg_1 = state_8; [L55] SORT_1 var_10 = var_10_arg_0 < var_10_arg_1; [L56] SORT_1 var_11_arg_0 = var_10; [L57] SORT_1 var_11 = ~var_11_arg_0; [L58] SORT_1 var_15_arg_0 = var_11; [L59] SORT_1 var_15 = ~var_15_arg_0; [L60] SORT_1 var_16_arg_0 = var_14; [L61] SORT_1 var_16_arg_1 = var_15; VAL [mask_SORT_1=1, mask_SORT_4=15, state_6=0, state_8=1, var_14=1, var_16_arg_0=1, var_16_arg_1=-255, var_19=1, var_22=15] [L62] EXPR var_16_arg_0 & var_16_arg_1 VAL [mask_SORT_1=1, mask_SORT_4=15, state_6=0, state_8=1, var_14=1, var_19=1, var_22=15] [L62] SORT_1 var_16 = var_16_arg_0 & var_16_arg_1; [L63] EXPR var_16 & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_4=15, state_6=0, state_8=1, var_14=1, var_19=1, var_22=15] [L63] var_16 = var_16 & mask_SORT_1 [L64] SORT_1 bad_17_arg_0 = var_16; [L65] CALL __VERIFIER_assert(!(bad_17_arg_0)) [L21] COND TRUE !(cond) [L21] reach_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 72 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 13.6s, OverallIterations: 23, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 4.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1935 SdHoareTripleChecker+Valid, 3.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1935 mSDsluCounter, 8921 SdHoareTripleChecker+Invalid, 2.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 7231 mSDsCounter, 31 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 5626 IncrementalHoareTripleChecker+Invalid, 5657 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 31 mSolverCounterUnsat, 1690 mSDtfsCounter, 5626 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 422 GetRequests, 241 SyntacticMatches, 1 SemanticMatches, 180 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 213 ImplicationChecksByTransitivity, 1.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=189occurred in iteration=11, InterpolantAutomatonStates: 171, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 22 MinimizatonAttempts, 556 StatesRemovedByMinimization, 14 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 1.0s SatisfiabilityAnalysisTime, 7.0s InterpolantComputationTime, 1224 NumberOfCodeBlocks, 1224 NumberOfCodeBlocksAsserted, 26 NumberOfCheckSat, 1194 ConstructedInterpolants, 0 QuantifiedInterpolants, 6152 SizeOfPredicates, 8 NumberOfNonLiveVariables, 1004 ConjunctsInSsa, 124 ConjunctsInUnsatCore, 26 InterpolantComputations, 21 PerfectInterpolantSequences, 126/138 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 17:22:49,526 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.diagonal.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 16f8726a4add15d0bf2494bd44888be53eb7bc01110882b6fc03ef148c6d9055 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 17:22:51,408 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 17:22:51,491 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Bitvector.epf [2025-03-03 17:22:51,500 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 17:22:51,500 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 17:22:51,523 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 17:22:51,524 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 17:22:51,524 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 17:22:51,525 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 17:22:51,525 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 17:22:51,526 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 17:22:51,526 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 17:22:51,526 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 17:22:51,526 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 17:22:51,527 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 17:22:51,527 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 17:22:51,527 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 17:22:51,527 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 17:22:51,527 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 17:22:51,527 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 17:22:51,528 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 17:22:51,528 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-03 17:22:51,528 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-03 17:22:51,528 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-03 17:22:51,528 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 17:22:51,528 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 17:22:51,528 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 17:22:51,528 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 17:22:51,528 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 17:22:51,528 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 17:22:51,528 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 17:22:51,529 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 17:22:51,529 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 17:22:51,529 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 17:22:51,529 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 17:22:51,529 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 17:22:51,529 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-03 17:22:51,529 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-03 17:22:51,529 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 17:22:51,529 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 17:22:51,530 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 17:22:51,530 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 17:22:51,530 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 -> 16f8726a4add15d0bf2494bd44888be53eb7bc01110882b6fc03ef148c6d9055 [2025-03-03 17:22:51,768 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 17:22:51,775 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 17:22:51,778 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 17:22:51,779 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 17:22:51,779 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 17:22:51,781 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.diagonal.c [2025-03-03 17:22:52,937 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/33dec78c2/58b3c908a5c8410e8b34cafe088e30cc/FLAGaf2ce732d [2025-03-03 17:22:53,131 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 17:22:53,132 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.diagonal.c [2025-03-03 17:22:53,138 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/33dec78c2/58b3c908a5c8410e8b34cafe088e30cc/FLAGaf2ce732d [2025-03-03 17:22:53,516 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/33dec78c2/58b3c908a5c8410e8b34cafe088e30cc [2025-03-03 17:22:53,518 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 17:22:53,519 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 17:22:53,520 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 17:22:53,520 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 17:22:53,522 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 17:22:53,523 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 05:22:53" (1/1) ... [2025-03-03 17:22:53,523 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2076fad3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:22:53, skipping insertion in model container [2025-03-03 17:22:53,523 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 05:22:53" (1/1) ... [2025-03-03 17:22:53,536 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 17:22:53,628 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.diagonal.c[1248,1261] [2025-03-03 17:22:53,661 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 17:22:53,672 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 17:22:53,679 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.diagonal.c[1248,1261] [2025-03-03 17:22:53,697 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 17:22:53,710 INFO L204 MainTranslator]: Completed translation [2025-03-03 17:22:53,711 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:22:53 WrapperNode [2025-03-03 17:22:53,711 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 17:22:53,712 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 17:22:53,713 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 17:22:53,713 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 17:22:53,718 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:22:53" (1/1) ... [2025-03-03 17:22:53,730 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:22:53" (1/1) ... [2025-03-03 17:22:53,764 INFO L138 Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 141 [2025-03-03 17:22:53,764 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 17:22:53,765 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 17:22:53,765 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 17:22:53,765 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 17:22:53,776 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:22:53" (1/1) ... [2025-03-03 17:22:53,776 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:22:53" (1/1) ... [2025-03-03 17:22:53,783 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:22:53" (1/1) ... [2025-03-03 17:22:53,800 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 17:22:53,800 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:22:53" (1/1) ... [2025-03-03 17:22:53,800 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:22:53" (1/1) ... [2025-03-03 17:22:53,804 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:22:53" (1/1) ... [2025-03-03 17:22:53,805 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:22:53" (1/1) ... [2025-03-03 17:22:53,806 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:22:53" (1/1) ... [2025-03-03 17:22:53,810 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:22:53" (1/1) ... [2025-03-03 17:22:53,812 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 17:22:53,813 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 17:22:53,816 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 17:22:53,817 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 17:22:53,817 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:22:53" (1/1) ... [2025-03-03 17:22:53,823 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 17:22:53,833 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 17:22:53,846 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 17:22:53,849 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 17:22:53,868 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 17:22:53,868 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-03 17:22:53,868 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 17:22:53,869 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 17:22:53,923 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 17:22:53,925 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 17:22:54,082 INFO L? ?]: Removed 22 outVars from TransFormulas that were not future-live. [2025-03-03 17:22:54,082 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 17:22:54,088 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 17:22:54,089 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 17:22:54,089 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 05:22:54 BoogieIcfgContainer [2025-03-03 17:22:54,089 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 17:22:54,091 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 17:22:54,091 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 17:22:54,094 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 17:22:54,094 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 05:22:53" (1/3) ... [2025-03-03 17:22:54,095 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5dac89d0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 05:22:54, skipping insertion in model container [2025-03-03 17:22:54,095 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:22:53" (2/3) ... [2025-03-03 17:22:54,096 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5dac89d0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 05:22:54, skipping insertion in model container [2025-03-03 17:22:54,096 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 05:22:54" (3/3) ... [2025-03-03 17:22:54,096 INFO L128 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.diagonal.c [2025-03-03 17:22:54,118 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 17:22:54,119 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG btor2c-lazyMod.diagonal.c that has 1 procedures, 10 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 17:22:54,148 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 17:22:54,155 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;@29ef0ee5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 17:22:54,156 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 17:22:54,158 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 17:22:54,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2025-03-03 17:22:54,160 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 17:22:54,161 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2025-03-03 17:22:54,161 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 17:22:54,165 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 17:22:54,165 INFO L85 PathProgramCache]: Analyzing trace with hash 38140359, now seen corresponding path program 1 times [2025-03-03 17:22:54,171 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 17:22:54,171 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1594473995] [2025-03-03 17:22:54,172 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 17:22:54,172 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 17:22:54,172 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 17:22:54,174 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 17:22:54,175 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 17:22:54,245 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-03 17:22:54,253 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-03 17:22:54,253 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 17:22:54,253 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 17:22:54,255 INFO L256 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-03 17:22:54,260 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 17:22:54,388 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 17:22:54,389 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 17:22:54,389 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-03 17:22:54,389 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1594473995] [2025-03-03 17:22:54,390 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1594473995] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 17:22:54,390 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 17:22:54,390 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 17:22:54,392 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [293041631] [2025-03-03 17:22:54,392 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 17:22:54,395 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 17:22:54,395 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-03 17:22:54,409 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 17:22:54,410 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 17:22:54,411 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 17:22:54,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 17:22:54,445 INFO L93 Difference]: Finished difference Result 18 states and 23 transitions. [2025-03-03 17:22:54,445 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 17:22:54,446 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 17:22:54,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 17:22:54,453 INFO L225 Difference]: With dead ends: 18 [2025-03-03 17:22:54,454 INFO L226 Difference]: Without dead ends: 10 [2025-03-03 17:22:54,456 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 17:22:54,458 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 17:22:54,459 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 17:22:54,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2025-03-03 17:22:54,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 9. [2025-03-03 17:22:54,476 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 17:22:54,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2025-03-03 17:22:54,481 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 5 [2025-03-03 17:22:54,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 17:22:54,481 INFO L471 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2025-03-03 17:22:54,481 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 17:22:54,481 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2025-03-03 17:22:54,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-03-03 17:22:54,482 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 17:22:54,482 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2025-03-03 17:22:54,489 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 17:22:54,686 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 17:22:54,686 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 17:22:54,687 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 17:22:54,687 INFO L85 PathProgramCache]: Analyzing trace with hash -1926026653, now seen corresponding path program 1 times [2025-03-03 17:22:54,688 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 17:22:54,688 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [533151954] [2025-03-03 17:22:54,688 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 17:22:54,688 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 17:22:54,688 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 17:22:54,690 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 17:22:54,691 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 17:22:54,757 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-03 17:22:54,772 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-03 17:22:54,772 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 17:22:54,772 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 17:22:54,774 INFO L256 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 26 conjuncts are in the unsatisfiable core [2025-03-03 17:22:54,778 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 17:22:55,098 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 17:22:55,099 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 17:22:57,171 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 17:22:57,171 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-03 17:22:57,171 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [533151954] [2025-03-03 17:22:57,171 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [533151954] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 17:22:57,171 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-03 17:22:57,171 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2025-03-03 17:22:57,172 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1776105702] [2025-03-03 17:22:57,172 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-03 17:22:57,172 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-03 17:22:57,173 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-03 17:22:57,173 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-03 17:22:57,173 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2025-03-03 17:22:57,173 INFO L87 Difference]: Start difference. First operand 9 states and 9 transitions. Second operand has 10 states, 10 states have (on average 1.4) internal successors, (14), 10 states have internal predecessors, (14), 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 17:22:57,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 17:22:57,574 INFO L93 Difference]: Finished difference Result 21 states and 23 transitions. [2025-03-03 17:22:57,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-03 17:22:57,574 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 1.4) internal successors, (14), 10 states have internal predecessors, (14), 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 8 [2025-03-03 17:22:57,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 17:22:57,575 INFO L225 Difference]: With dead ends: 21 [2025-03-03 17:22:57,575 INFO L226 Difference]: Without dead ends: 19 [2025-03-03 17:22:57,575 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=74, Invalid=136, Unknown=0, NotChecked=0, Total=210 [2025-03-03 17:22:57,577 INFO L435 NwaCegarLoop]: 4 mSDtfsCounter, 10 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 19 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 17:22:57,577 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 19 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 17:22:57,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2025-03-03 17:22:57,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 18. [2025-03-03 17:22:57,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 17 states have (on average 1.0588235294117647) internal successors, (18), 17 states have internal predecessors, (18), 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 17:22:57,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 18 transitions. [2025-03-03 17:22:57,582 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 18 transitions. Word has length 8 [2025-03-03 17:22:57,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 17:22:57,583 INFO L471 AbstractCegarLoop]: Abstraction has 18 states and 18 transitions. [2025-03-03 17:22:57,583 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 1.4) internal successors, (14), 10 states have internal predecessors, (14), 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 17:22:57,583 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2025-03-03 17:22:57,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2025-03-03 17:22:57,583 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 17:22:57,583 INFO L218 NwaCegarLoop]: trace histogram [5, 4, 4, 1, 1, 1, 1] [2025-03-03 17:22:57,590 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 17:22:57,784 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 17:22:57,784 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 17:22:57,785 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 17:22:57,785 INFO L85 PathProgramCache]: Analyzing trace with hash -209850681, now seen corresponding path program 2 times [2025-03-03 17:22:57,785 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 17:22:57,785 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [723070607] [2025-03-03 17:22:57,785 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-03 17:22:57,785 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 17:22:57,786 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 17:22:57,789 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 17:22:57,790 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 17:22:57,861 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 17 statements into 2 equivalence classes. [2025-03-03 17:22:57,886 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 17 of 17 statements. [2025-03-03 17:22:57,886 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-03 17:22:57,886 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 17:22:57,889 INFO L256 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 29 conjuncts are in the unsatisfiable core [2025-03-03 17:22:57,894 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 17:22:58,326 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 17:22:58,326 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 17:23:22,132 WARN L286 SmtUtils]: Spent 5.08s on a formula simplification. DAG size of input: 1437 DAG size of output: 1271 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate)