./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.h_b02.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.h_b02.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 e188a971cba665e2b77b0e826b47d617ddf57bd12a8f8136f6d81bf903c7591b --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 17:35:54,972 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 17:35:55,024 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2025-03-03 17:35:55,028 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 17:35:55,028 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 17:35:55,044 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 17:35:55,045 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 17:35:55,045 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 17:35:55,046 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 17:35:55,046 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 17:35:55,046 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 17:35:55,046 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 17:35:55,046 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 17:35:55,046 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 17:35:55,046 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 17:35:55,046 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 17:35:55,046 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 17:35:55,047 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 17:35:55,047 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 17:35:55,048 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 17:35:55,048 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 17:35:55,048 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 17:35:55,048 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 17:35:55,048 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 17:35:55,048 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 17:35:55,049 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 17:35:55,049 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 17:35:55,049 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 17:35:55,049 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 17:35:55,049 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 17:35:55,049 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 17:35:55,049 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 17:35:55,049 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 17:35:55,049 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 17:35:55,049 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 17:35:55,049 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 17:35:55,049 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 17:35:55,049 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 17:35:55,050 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 17:35:55,050 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 17:35:55,050 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 -> e188a971cba665e2b77b0e826b47d617ddf57bd12a8f8136f6d81bf903c7591b [2025-03-03 17:35:55,279 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 17:35:55,286 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 17:35:55,288 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 17:35:55,288 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 17:35:55,289 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 17:35:55,289 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.h_b02.c [2025-03-03 17:35:56,390 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ff5582f21/1cb17b73c7494daba39c1097d718118d/FLAG653ebd290 [2025-03-03 17:35:56,646 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 17:35:56,647 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.h_b02.c [2025-03-03 17:35:56,653 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ff5582f21/1cb17b73c7494daba39c1097d718118d/FLAG653ebd290 [2025-03-03 17:35:56,972 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ff5582f21/1cb17b73c7494daba39c1097d718118d [2025-03-03 17:35:56,974 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 17:35:56,975 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 17:35:56,975 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 17:35:56,976 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 17:35:56,978 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 17:35:56,979 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 05:35:56" (1/1) ... [2025-03-03 17:35:56,979 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2248a924 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:35:56, skipping insertion in model container [2025-03-03 17:35:56,979 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 05:35:56" (1/1) ... [2025-03-03 17:35:56,994 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 17:35:57,088 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.h_b02.c[1245,1258] [2025-03-03 17:35:57,147 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 17:35:57,156 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 17:35:57,164 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.h_b02.c[1245,1258] [2025-03-03 17:35:57,224 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 17:35:57,237 INFO L204 MainTranslator]: Completed translation [2025-03-03 17:35:57,237 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:35:57 WrapperNode [2025-03-03 17:35:57,237 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 17:35:57,238 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 17:35:57,238 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 17:35:57,238 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 17:35:57,242 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:35:57" (1/1) ... [2025-03-03 17:35:57,256 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:35:57" (1/1) ... [2025-03-03 17:35:57,317 INFO L138 Inliner]: procedures = 17, calls = 16, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 506 [2025-03-03 17:35:57,318 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 17:35:57,318 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 17:35:57,318 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 17:35:57,318 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 17:35:57,325 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:35:57" (1/1) ... [2025-03-03 17:35:57,326 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:35:57" (1/1) ... [2025-03-03 17:35:57,342 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:35:57" (1/1) ... [2025-03-03 17:35:57,363 INFO L175 MemorySlicer]: Split 10 memory accesses to 2 slices as follows [2, 8]. 80 percent of accesses are in the largest equivalence class. The 10 initializations are split as follows [2, 8]. The 0 writes are split as follows [0, 0]. [2025-03-03 17:35:57,363 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:35:57" (1/1) ... [2025-03-03 17:35:57,363 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:35:57" (1/1) ... [2025-03-03 17:35:57,380 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:35:57" (1/1) ... [2025-03-03 17:35:57,384 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:35:57" (1/1) ... [2025-03-03 17:35:57,392 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:35:57" (1/1) ... [2025-03-03 17:35:57,399 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:35:57" (1/1) ... [2025-03-03 17:35:57,406 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 17:35:57,407 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 17:35:57,407 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 17:35:57,407 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 17:35:57,408 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:35:57" (1/1) ... [2025-03-03 17:35:57,412 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 17:35:57,422 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 17:35:57,435 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:35:57,440 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:35:57,457 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 17:35:57,457 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 17:35:57,457 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-03 17:35:57,457 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 17:35:57,457 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 17:35:57,576 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 17:35:57,578 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 17:35:58,238 INFO L? ?]: Removed 307 outVars from TransFormulas that were not future-live. [2025-03-03 17:35:58,240 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 17:35:58,269 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 17:35:58,270 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 17:35:58,270 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 05:35:58 BoogieIcfgContainer [2025-03-03 17:35:58,270 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 17:35:58,272 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 17:35:58,272 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 17:35:58,275 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 17:35:58,275 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 05:35:56" (1/3) ... [2025-03-03 17:35:58,276 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5d8e6da0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 05:35:58, skipping insertion in model container [2025-03-03 17:35:58,276 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:35:57" (2/3) ... [2025-03-03 17:35:58,276 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5d8e6da0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 05:35:58, skipping insertion in model container [2025-03-03 17:35:58,276 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 05:35:58" (3/3) ... [2025-03-03 17:35:58,277 INFO L128 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.h_b02.c [2025-03-03 17:35:58,288 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 17:35:58,290 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG btor2c-lazyMod.h_b02.c that has 1 procedures, 118 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 17:35:58,332 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 17:35:58,342 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;@1b7d4a87, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 17:35:58,343 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 17:35:58,346 INFO L276 IsEmpty]: Start isEmpty. Operand has 118 states, 116 states have (on average 1.4913793103448276) internal successors, (173), 117 states have internal predecessors, (173), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:35:58,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-03-03 17:35:58,350 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 17:35:58,350 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 17:35:58,351 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 17:35:58,354 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 17:35:58,354 INFO L85 PathProgramCache]: Analyzing trace with hash -606469421, now seen corresponding path program 1 times [2025-03-03 17:35:58,359 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 17:35:58,361 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [549063604] [2025-03-03 17:35:58,361 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 17:35:58,361 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 17:35:58,420 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-03 17:35:58,472 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-03 17:35:58,473 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 17:35:58,473 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 17:35:58,837 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:35:58,838 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 17:35:58,838 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [549063604] [2025-03-03 17:35:58,840 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [549063604] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 17:35:58,840 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 17:35:58,840 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 17:35:58,841 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [273798788] [2025-03-03 17:35:58,842 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 17:35:58,844 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 17:35:58,844 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 17:35:58,857 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 17:35:58,857 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 17:35:58,860 INFO L87 Difference]: Start difference. First operand has 118 states, 116 states have (on average 1.4913793103448276) internal successors, (173), 117 states have internal predecessors, (173), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 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:35:58,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 17:35:58,966 INFO L93 Difference]: Finished difference Result 225 states and 333 transitions. [2025-03-03 17:35:58,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 17:35:58,967 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 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 19 [2025-03-03 17:35:58,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 17:35:58,971 INFO L225 Difference]: With dead ends: 225 [2025-03-03 17:35:58,971 INFO L226 Difference]: Without dead ends: 117 [2025-03-03 17:35:58,973 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:35:58,975 INFO L435 NwaCegarLoop]: 140 mSDtfsCounter, 0 mSDsluCounter, 275 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 415 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 17:35:58,976 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 415 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 17:35:58,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2025-03-03 17:35:58,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 117. [2025-03-03 17:35:58,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 116 states have (on average 1.4741379310344827) internal successors, (171), 116 states have internal predecessors, (171), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:35:58,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 171 transitions. [2025-03-03 17:35:59,000 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 171 transitions. Word has length 19 [2025-03-03 17:35:59,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 17:35:59,001 INFO L471 AbstractCegarLoop]: Abstraction has 117 states and 171 transitions. [2025-03-03 17:35:59,001 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 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:35:59,001 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 171 transitions. [2025-03-03 17:35:59,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-03-03 17:35:59,001 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 17:35:59,001 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 17:35:59,004 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-03 17:35:59,004 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 17:35:59,004 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 17:35:59,004 INFO L85 PathProgramCache]: Analyzing trace with hash -1616003582, now seen corresponding path program 1 times [2025-03-03 17:35:59,004 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 17:35:59,004 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1933170162] [2025-03-03 17:35:59,005 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 17:35:59,005 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 17:35:59,017 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-03 17:35:59,027 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-03 17:35:59,027 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 17:35:59,027 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 17:35:59,148 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:35:59,148 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 17:35:59,148 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1933170162] [2025-03-03 17:35:59,148 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1933170162] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 17:35:59,148 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 17:35:59,148 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 17:35:59,149 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [284431854] [2025-03-03 17:35:59,149 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 17:35:59,150 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 17:35:59,150 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 17:35:59,151 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 17:35:59,153 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 17:35:59,153 INFO L87 Difference]: Start difference. First operand 117 states and 171 transitions. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 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:35:59,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 17:35:59,250 INFO L93 Difference]: Finished difference Result 226 states and 331 transitions. [2025-03-03 17:35:59,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 17:35:59,250 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 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 20 [2025-03-03 17:35:59,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 17:35:59,251 INFO L225 Difference]: With dead ends: 226 [2025-03-03 17:35:59,251 INFO L226 Difference]: Without dead ends: 119 [2025-03-03 17:35:59,252 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:35:59,252 INFO L435 NwaCegarLoop]: 140 mSDtfsCounter, 0 mSDsluCounter, 272 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 412 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 94 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 17:35:59,253 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 412 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 94 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 17:35:59,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2025-03-03 17:35:59,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 119. [2025-03-03 17:35:59,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 118 states have (on average 1.4661016949152543) internal successors, (173), 118 states have internal predecessors, (173), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:35:59,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 173 transitions. [2025-03-03 17:35:59,265 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 173 transitions. Word has length 20 [2025-03-03 17:35:59,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 17:35:59,265 INFO L471 AbstractCegarLoop]: Abstraction has 119 states and 173 transitions. [2025-03-03 17:35:59,265 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 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:35:59,265 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 173 transitions. [2025-03-03 17:35:59,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-03-03 17:35:59,265 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 17:35:59,265 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 17:35:59,265 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-03 17:35:59,266 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 17:35:59,266 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 17:35:59,266 INFO L85 PathProgramCache]: Analyzing trace with hash -919961426, now seen corresponding path program 1 times [2025-03-03 17:35:59,266 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 17:35:59,266 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2006202735] [2025-03-03 17:35:59,266 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 17:35:59,266 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 17:35:59,282 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-03-03 17:35:59,304 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-03-03 17:35:59,304 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 17:35:59,305 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 17:35:59,519 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:35:59,519 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 17:35:59,519 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2006202735] [2025-03-03 17:35:59,520 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2006202735] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 17:35:59,520 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 17:35:59,520 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 17:35:59,520 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1867964611] [2025-03-03 17:35:59,520 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 17:35:59,520 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 17:35:59,520 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 17:35:59,521 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 17:35:59,521 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 17:35:59,521 INFO L87 Difference]: Start difference. First operand 119 states and 173 transitions. Second operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 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:35:59,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 17:35:59,613 INFO L93 Difference]: Finished difference Result 228 states and 332 transitions. [2025-03-03 17:35:59,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 17:35:59,614 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 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 21 [2025-03-03 17:35:59,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 17:35:59,615 INFO L225 Difference]: With dead ends: 228 [2025-03-03 17:35:59,615 INFO L226 Difference]: Without dead ends: 119 [2025-03-03 17:35:59,616 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:35:59,616 INFO L435 NwaCegarLoop]: 137 mSDtfsCounter, 6 mSDsluCounter, 265 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 402 SdHoareTripleChecker+Invalid, 93 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 17:35:59,616 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 402 Invalid, 93 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 17:35:59,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2025-03-03 17:35:59,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 119. [2025-03-03 17:35:59,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 118 states have (on average 1.4576271186440677) internal successors, (172), 118 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:35:59,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 172 transitions. [2025-03-03 17:35:59,620 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 172 transitions. Word has length 21 [2025-03-03 17:35:59,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 17:35:59,621 INFO L471 AbstractCegarLoop]: Abstraction has 119 states and 172 transitions. [2025-03-03 17:35:59,621 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 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:35:59,621 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 172 transitions. [2025-03-03 17:35:59,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-03-03 17:35:59,621 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 17:35:59,621 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 17:35:59,621 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-03 17:35:59,622 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 17:35:59,622 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 17:35:59,622 INFO L85 PathProgramCache]: Analyzing trace with hash -860637785, now seen corresponding path program 1 times [2025-03-03 17:35:59,622 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 17:35:59,622 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1698206369] [2025-03-03 17:35:59,622 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 17:35:59,622 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 17:35:59,634 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-03 17:35:59,673 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-03 17:35:59,673 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 17:35:59,673 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 17:35:59,936 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:35:59,936 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 17:35:59,936 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1698206369] [2025-03-03 17:35:59,936 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1698206369] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 17:35:59,936 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 17:35:59,936 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-03 17:35:59,936 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1792046514] [2025-03-03 17:35:59,936 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 17:35:59,936 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-03 17:35:59,936 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 17:35:59,937 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-03 17:35:59,937 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-03 17:35:59,938 INFO L87 Difference]: Start difference. First operand 119 states and 172 transitions. Second operand has 8 states, 8 states have (on average 2.75) internal successors, (22), 8 states have internal predecessors, (22), 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:36:00,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 17:36:00,102 INFO L93 Difference]: Finished difference Result 238 states and 344 transitions. [2025-03-03 17:36:00,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-03 17:36:00,103 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.75) internal successors, (22), 8 states have internal predecessors, (22), 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 22 [2025-03-03 17:36:00,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 17:36:00,104 INFO L225 Difference]: With dead ends: 238 [2025-03-03 17:36:00,104 INFO L226 Difference]: Without dead ends: 129 [2025-03-03 17:36:00,105 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2025-03-03 17:36:00,106 INFO L435 NwaCegarLoop]: 135 mSDtfsCounter, 178 mSDsluCounter, 663 mSDsCounter, 0 mSdLazyCounter, 210 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 178 SdHoareTripleChecker+Valid, 798 SdHoareTripleChecker+Invalid, 210 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 210 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 17:36:00,107 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [178 Valid, 798 Invalid, 210 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 210 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 17:36:00,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2025-03-03 17:36:00,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 128. [2025-03-03 17:36:00,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 127 states have (on average 1.4488188976377954) internal successors, (184), 127 states have internal predecessors, (184), 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:36:00,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 184 transitions. [2025-03-03 17:36:00,115 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 184 transitions. Word has length 22 [2025-03-03 17:36:00,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 17:36:00,115 INFO L471 AbstractCegarLoop]: Abstraction has 128 states and 184 transitions. [2025-03-03 17:36:00,116 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.75) internal successors, (22), 8 states have internal predecessors, (22), 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:36:00,116 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 184 transitions. [2025-03-03 17:36:00,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-03-03 17:36:00,116 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 17:36:00,116 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 17:36:00,116 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-03 17:36:00,117 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 17:36:00,117 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 17:36:00,117 INFO L85 PathProgramCache]: Analyzing trace with hash -565383140, now seen corresponding path program 1 times [2025-03-03 17:36:00,117 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 17:36:00,117 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1738183833] [2025-03-03 17:36:00,117 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 17:36:00,117 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 17:36:00,126 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-03 17:36:00,143 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-03 17:36:00,143 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 17:36:00,143 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 17:36:00,365 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:36:00,365 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 17:36:00,366 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1738183833] [2025-03-03 17:36:00,366 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1738183833] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 17:36:00,366 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 17:36:00,366 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 17:36:00,366 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1037661100] [2025-03-03 17:36:00,366 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 17:36:00,366 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 17:36:00,366 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 17:36:00,367 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 17:36:00,367 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-03 17:36:00,367 INFO L87 Difference]: Start difference. First operand 128 states and 184 transitions. Second operand has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:36:00,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 17:36:00,451 INFO L93 Difference]: Finished difference Result 252 states and 362 transitions. [2025-03-03 17:36:00,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 17:36:00,451 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2025-03-03 17:36:00,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 17:36:00,452 INFO L225 Difference]: With dead ends: 252 [2025-03-03 17:36:00,453 INFO L226 Difference]: Without dead ends: 134 [2025-03-03 17:36:00,453 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-03-03 17:36:00,455 INFO L435 NwaCegarLoop]: 137 mSDtfsCounter, 161 mSDsluCounter, 268 mSDsCounter, 0 mSdLazyCounter, 98 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 161 SdHoareTripleChecker+Valid, 405 SdHoareTripleChecker+Invalid, 98 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 98 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 17:36:00,456 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [161 Valid, 405 Invalid, 98 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 98 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 17:36:00,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2025-03-03 17:36:00,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 134. [2025-03-03 17:36:00,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 133 states have (on average 1.4285714285714286) internal successors, (190), 133 states have internal predecessors, (190), 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:36:00,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 190 transitions. [2025-03-03 17:36:00,461 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 190 transitions. Word has length 23 [2025-03-03 17:36:00,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 17:36:00,461 INFO L471 AbstractCegarLoop]: Abstraction has 134 states and 190 transitions. [2025-03-03 17:36:00,461 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:36:00,461 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 190 transitions. [2025-03-03 17:36:00,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-03-03 17:36:00,461 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 17:36:00,462 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 17:36:00,462 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-03 17:36:00,462 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 17:36:00,462 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 17:36:00,462 INFO L85 PathProgramCache]: Analyzing trace with hash 40107140, now seen corresponding path program 1 times [2025-03-03 17:36:00,462 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 17:36:00,462 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [299302344] [2025-03-03 17:36:00,463 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 17:36:00,463 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 17:36:00,472 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-03 17:36:00,477 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-03 17:36:00,478 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 17:36:00,478 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 17:36:00,577 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:36:00,578 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 17:36:00,578 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [299302344] [2025-03-03 17:36:00,578 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [299302344] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 17:36:00,578 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 17:36:00,578 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 17:36:00,578 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [782561802] [2025-03-03 17:36:00,579 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 17:36:00,580 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 17:36:00,580 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 17:36:00,580 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 17:36:00,580 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-03 17:36:00,580 INFO L87 Difference]: Start difference. First operand 134 states and 190 transitions. Second operand has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 6 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:36:00,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 17:36:00,686 INFO L93 Difference]: Finished difference Result 322 states and 454 transitions. [2025-03-03 17:36:00,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 17:36:00,687 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 6 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2025-03-03 17:36:00,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 17:36:00,688 INFO L225 Difference]: With dead ends: 322 [2025-03-03 17:36:00,688 INFO L226 Difference]: Without dead ends: 198 [2025-03-03 17:36:00,688 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2025-03-03 17:36:00,689 INFO L435 NwaCegarLoop]: 136 mSDtfsCounter, 318 mSDsluCounter, 267 mSDsCounter, 0 mSdLazyCounter, 102 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 318 SdHoareTripleChecker+Valid, 403 SdHoareTripleChecker+Invalid, 103 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 102 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 17:36:00,689 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [318 Valid, 403 Invalid, 103 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 102 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 17:36:00,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2025-03-03 17:36:00,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 136. [2025-03-03 17:36:00,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136 states, 135 states have (on average 1.4222222222222223) internal successors, (192), 135 states have internal predecessors, (192), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:36:00,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 192 transitions. [2025-03-03 17:36:00,701 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 192 transitions. Word has length 23 [2025-03-03 17:36:00,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 17:36:00,701 INFO L471 AbstractCegarLoop]: Abstraction has 136 states and 192 transitions. [2025-03-03 17:36:00,701 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 6 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:36:00,702 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 192 transitions. [2025-03-03 17:36:00,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-03-03 17:36:00,702 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 17:36:00,702 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 17:36:00,702 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-03 17:36:00,702 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 17:36:00,703 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 17:36:00,703 INFO L85 PathProgramCache]: Analyzing trace with hash -1875717510, now seen corresponding path program 1 times [2025-03-03 17:36:00,703 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 17:36:00,703 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [6037523] [2025-03-03 17:36:00,703 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 17:36:00,703 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 17:36:00,714 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-03 17:36:00,724 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-03 17:36:00,724 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 17:36:00,724 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 17:36:00,798 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:36:00,798 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 17:36:00,798 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [6037523] [2025-03-03 17:36:00,798 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [6037523] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 17:36:00,798 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 17:36:00,798 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 17:36:00,798 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [271867808] [2025-03-03 17:36:00,798 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 17:36:00,799 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 17:36:00,799 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 17:36:00,799 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 17:36:00,799 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 17:36:00,799 INFO L87 Difference]: Start difference. First operand 136 states and 192 transitions. Second operand has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:36:00,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 17:36:00,936 INFO L93 Difference]: Finished difference Result 348 states and 495 transitions. [2025-03-03 17:36:00,936 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 17:36:00,936 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2025-03-03 17:36:00,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 17:36:00,937 INFO L225 Difference]: With dead ends: 348 [2025-03-03 17:36:00,937 INFO L226 Difference]: Without dead ends: 224 [2025-03-03 17:36:00,938 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-03 17:36:00,938 INFO L435 NwaCegarLoop]: 128 mSDtfsCounter, 416 mSDsluCounter, 251 mSDsCounter, 0 mSdLazyCounter, 125 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 416 SdHoareTripleChecker+Valid, 379 SdHoareTripleChecker+Invalid, 125 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 125 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 17:36:00,939 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [416 Valid, 379 Invalid, 125 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 125 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 17:36:00,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states. [2025-03-03 17:36:00,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 138. [2025-03-03 17:36:00,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 138 states, 137 states have (on average 1.416058394160584) internal successors, (194), 137 states have internal predecessors, (194), 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:36:00,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 194 transitions. [2025-03-03 17:36:00,944 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 194 transitions. Word has length 24 [2025-03-03 17:36:00,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 17:36:00,944 INFO L471 AbstractCegarLoop]: Abstraction has 138 states and 194 transitions. [2025-03-03 17:36:00,944 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:36:00,944 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 194 transitions. [2025-03-03 17:36:00,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2025-03-03 17:36:00,948 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 17:36:00,948 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 17:36:00,948 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-03 17:36:00,949 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 17:36:00,949 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 17:36:00,949 INFO L85 PathProgramCache]: Analyzing trace with hash 1636024461, now seen corresponding path program 1 times [2025-03-03 17:36:00,949 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 17:36:00,949 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [957908117] [2025-03-03 17:36:00,949 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 17:36:00,949 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 17:36:00,984 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-03-03 17:36:01,520 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-03-03 17:36:01,520 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 17:36:01,520 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 17:36:02,797 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 11 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 17:36:02,799 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 17:36:02,799 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [957908117] [2025-03-03 17:36:02,799 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [957908117] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 17:36:02,799 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [216444256] [2025-03-03 17:36:02,799 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 17:36:02,800 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 17:36:02,800 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 17:36:02,803 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:36:02,805 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:36:02,924 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-03-03 17:36:03,072 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-03-03 17:36:03,072 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 17:36:03,072 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 17:36:03,077 INFO L256 TraceCheckSpWp]: Trace formula consists of 680 conjuncts, 95 conjuncts are in the unsatisfiable core [2025-03-03 17:36:03,086 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 17:36:03,961 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 17:36:03,962 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 17:36:03,962 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [216444256] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 17:36:03,962 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 17:36:03,962 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [10] total 17 [2025-03-03 17:36:03,962 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1468218490] [2025-03-03 17:36:03,962 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 17:36:03,963 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-03 17:36:03,963 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 17:36:03,963 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-03 17:36:03,963 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=218, Unknown=0, NotChecked=0, Total=272 [2025-03-03 17:36:03,964 INFO L87 Difference]: Start difference. First operand 138 states and 194 transitions. Second operand has 9 states, 9 states have (on average 8.555555555555555) internal successors, (77), 9 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:36:04,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 17:36:04,359 INFO L93 Difference]: Finished difference Result 381 states and 543 transitions. [2025-03-03 17:36:04,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 17:36:04,359 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 8.555555555555555) internal successors, (77), 9 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 77 [2025-03-03 17:36:04,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 17:36:04,362 INFO L225 Difference]: With dead ends: 381 [2025-03-03 17:36:04,362 INFO L226 Difference]: Without dead ends: 257 [2025-03-03 17:36:04,363 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=58, Invalid=248, Unknown=0, NotChecked=0, Total=306 [2025-03-03 17:36:04,364 INFO L435 NwaCegarLoop]: 68 mSDtfsCounter, 315 mSDsluCounter, 311 mSDsCounter, 0 mSdLazyCounter, 539 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 315 SdHoareTripleChecker+Valid, 379 SdHoareTripleChecker+Invalid, 540 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 539 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 17:36:04,364 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [315 Valid, 379 Invalid, 540 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 539 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 17:36:04,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 257 states. [2025-03-03 17:36:04,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 257 to 222. [2025-03-03 17:36:04,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 222 states, 221 states have (on average 1.420814479638009) internal successors, (314), 221 states have internal predecessors, (314), 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:36:04,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 314 transitions. [2025-03-03 17:36:04,374 INFO L78 Accepts]: Start accepts. Automaton has 222 states and 314 transitions. Word has length 77 [2025-03-03 17:36:04,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 17:36:04,375 INFO L471 AbstractCegarLoop]: Abstraction has 222 states and 314 transitions. [2025-03-03 17:36:04,375 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.555555555555555) internal successors, (77), 9 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:36:04,375 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 314 transitions. [2025-03-03 17:36:04,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2025-03-03 17:36:04,379 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 17:36:04,379 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 17:36:04,388 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:36:04,579 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 17:36:04,580 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 17:36:04,580 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 17:36:04,580 INFO L85 PathProgramCache]: Analyzing trace with hash 1327773491, now seen corresponding path program 1 times [2025-03-03 17:36:04,580 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 17:36:04,581 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2071473936] [2025-03-03 17:36:04,581 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 17:36:04,581 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 17:36:04,624 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 78 statements into 1 equivalence classes. [2025-03-03 17:36:04,882 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 78 of 78 statements. [2025-03-03 17:36:04,882 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 17:36:04,882 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 17:36:05,100 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 17:36:05,102 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 17:36:05,102 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2071473936] [2025-03-03 17:36:05,102 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2071473936] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 17:36:05,102 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 17:36:05,102 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-03 17:36:05,102 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2037993260] [2025-03-03 17:36:05,102 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 17:36:05,103 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 17:36:05,103 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 17:36:05,103 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 17:36:05,103 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-03 17:36:05,103 INFO L87 Difference]: Start difference. First operand 222 states and 314 transitions. Second operand has 7 states, 7 states have (on average 11.142857142857142) internal successors, (78), 7 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:36:05,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 17:36:05,249 INFO L93 Difference]: Finished difference Result 380 states and 540 transitions. [2025-03-03 17:36:05,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-03 17:36:05,250 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.142857142857142) internal successors, (78), 7 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 78 [2025-03-03 17:36:05,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 17:36:05,250 INFO L225 Difference]: With dead ends: 380 [2025-03-03 17:36:05,251 INFO L226 Difference]: Without dead ends: 232 [2025-03-03 17:36:05,251 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-03 17:36:05,251 INFO L435 NwaCegarLoop]: 116 mSDtfsCounter, 129 mSDsluCounter, 452 mSDsCounter, 0 mSdLazyCounter, 268 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 129 SdHoareTripleChecker+Valid, 568 SdHoareTripleChecker+Invalid, 270 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 268 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 17:36:05,253 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [129 Valid, 568 Invalid, 270 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 268 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 17:36:05,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2025-03-03 17:36:05,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 232. [2025-03-03 17:36:05,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 232 states, 231 states have (on average 1.4112554112554112) internal successors, (326), 231 states have internal predecessors, (326), 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:36:05,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 326 transitions. [2025-03-03 17:36:05,259 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 326 transitions. Word has length 78 [2025-03-03 17:36:05,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 17:36:05,260 INFO L471 AbstractCegarLoop]: Abstraction has 232 states and 326 transitions. [2025-03-03 17:36:05,260 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.142857142857142) internal successors, (78), 7 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:36:05,260 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 326 transitions. [2025-03-03 17:36:05,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2025-03-03 17:36:05,261 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 17:36:05,261 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 17:36:05,261 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-03 17:36:05,261 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 17:36:05,262 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 17:36:05,262 INFO L85 PathProgramCache]: Analyzing trace with hash -215664126, now seen corresponding path program 1 times [2025-03-03 17:36:05,262 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 17:36:05,262 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [276840741] [2025-03-03 17:36:05,262 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 17:36:05,262 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 17:36:05,287 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 78 statements into 1 equivalence classes. [2025-03-03 17:36:05,444 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 78 of 78 statements. [2025-03-03 17:36:05,444 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 17:36:05,444 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 17:36:05,912 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 17:36:05,913 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 17:36:05,913 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [276840741] [2025-03-03 17:36:05,913 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [276840741] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 17:36:05,913 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 17:36:05,913 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-03 17:36:05,913 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1013243791] [2025-03-03 17:36:05,913 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 17:36:05,913 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 17:36:05,913 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 17:36:05,914 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 17:36:05,914 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-03 17:36:05,914 INFO L87 Difference]: Start difference. First operand 232 states and 326 transitions. Second operand has 7 states, 7 states have (on average 11.142857142857142) internal successors, (78), 7 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:36:06,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 17:36:06,212 INFO L93 Difference]: Finished difference Result 400 states and 565 transitions. [2025-03-03 17:36:06,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-03 17:36:06,213 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.142857142857142) internal successors, (78), 7 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 78 [2025-03-03 17:36:06,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 17:36:06,214 INFO L225 Difference]: With dead ends: 400 [2025-03-03 17:36:06,214 INFO L226 Difference]: Without dead ends: 257 [2025-03-03 17:36:06,214 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2025-03-03 17:36:06,215 INFO L435 NwaCegarLoop]: 85 mSDtfsCounter, 376 mSDsluCounter, 337 mSDsCounter, 0 mSdLazyCounter, 418 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 376 SdHoareTripleChecker+Valid, 422 SdHoareTripleChecker+Invalid, 420 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 418 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 17:36:06,215 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [376 Valid, 422 Invalid, 420 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 418 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 17:36:06,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 257 states. [2025-03-03 17:36:06,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 257 to 244. [2025-03-03 17:36:06,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 244 states, 243 states have (on average 1.4032921810699588) internal successors, (341), 243 states have internal predecessors, (341), 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:36:06,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 244 states to 244 states and 341 transitions. [2025-03-03 17:36:06,225 INFO L78 Accepts]: Start accepts. Automaton has 244 states and 341 transitions. Word has length 78 [2025-03-03 17:36:06,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 17:36:06,226 INFO L471 AbstractCegarLoop]: Abstraction has 244 states and 341 transitions. [2025-03-03 17:36:06,226 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.142857142857142) internal successors, (78), 7 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:36:06,226 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states and 341 transitions. [2025-03-03 17:36:06,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2025-03-03 17:36:06,227 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 17:36:06,227 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 17:36:06,227 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-03 17:36:06,227 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 17:36:06,227 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 17:36:06,228 INFO L85 PathProgramCache]: Analyzing trace with hash -63707561, now seen corresponding path program 1 times [2025-03-03 17:36:06,228 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 17:36:06,228 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [214664129] [2025-03-03 17:36:06,228 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 17:36:06,228 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 17:36:06,254 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 79 statements into 1 equivalence classes. [2025-03-03 17:36:06,424 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 79 of 79 statements. [2025-03-03 17:36:06,425 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 17:36:06,425 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 17:36:06,682 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 17:36:06,682 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 17:36:06,683 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [214664129] [2025-03-03 17:36:06,683 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [214664129] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 17:36:06,683 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 17:36:06,683 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 17:36:06,683 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [544941824] [2025-03-03 17:36:06,683 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 17:36:06,683 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 17:36:06,683 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 17:36:06,684 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 17:36:06,684 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-03-03 17:36:06,684 INFO L87 Difference]: Start difference. First operand 244 states and 341 transitions. Second operand has 6 states, 6 states have (on average 13.166666666666666) internal successors, (79), 6 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:36:06,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 17:36:06,773 INFO L93 Difference]: Finished difference Result 420 states and 589 transitions. [2025-03-03 17:36:06,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 17:36:06,775 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.166666666666666) internal successors, (79), 6 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 79 [2025-03-03 17:36:06,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 17:36:06,776 INFO L225 Difference]: With dead ends: 420 [2025-03-03 17:36:06,776 INFO L226 Difference]: Without dead ends: 252 [2025-03-03 17:36:06,776 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-03-03 17:36:06,776 INFO L435 NwaCegarLoop]: 128 mSDtfsCounter, 133 mSDsluCounter, 376 mSDsCounter, 0 mSdLazyCounter, 162 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 133 SdHoareTripleChecker+Valid, 504 SdHoareTripleChecker+Invalid, 162 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 162 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 17:36:06,776 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [133 Valid, 504 Invalid, 162 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 162 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 17:36:06,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 252 states. [2025-03-03 17:36:06,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 252 to 250. [2025-03-03 17:36:06,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 250 states, 249 states have (on average 1.4016064257028114) internal successors, (349), 249 states have internal predecessors, (349), 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:36:06,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 349 transitions. [2025-03-03 17:36:06,785 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 349 transitions. Word has length 79 [2025-03-03 17:36:06,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 17:36:06,786 INFO L471 AbstractCegarLoop]: Abstraction has 250 states and 349 transitions. [2025-03-03 17:36:06,786 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.166666666666666) internal successors, (79), 6 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:36:06,786 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 349 transitions. [2025-03-03 17:36:06,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2025-03-03 17:36:06,786 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 17:36:06,787 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 17:36:06,787 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-03 17:36:06,788 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 17:36:06,788 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 17:36:06,788 INFO L85 PathProgramCache]: Analyzing trace with hash 1950515542, now seen corresponding path program 1 times [2025-03-03 17:36:06,788 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 17:36:06,788 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [178031349] [2025-03-03 17:36:06,788 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 17:36:06,788 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 17:36:06,812 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 79 statements into 1 equivalence classes. [2025-03-03 17:36:06,990 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 79 of 79 statements. [2025-03-03 17:36:06,990 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 17:36:06,990 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 17:36:08,015 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 11 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 17:36:08,016 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 17:36:08,016 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [178031349] [2025-03-03 17:36:08,016 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [178031349] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 17:36:08,016 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [602410074] [2025-03-03 17:36:08,016 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 17:36:08,016 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 17:36:08,016 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 17:36:08,018 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:36:08,020 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:36:08,153 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 79 statements into 1 equivalence classes. [2025-03-03 17:36:08,356 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 79 of 79 statements. [2025-03-03 17:36:08,356 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 17:36:08,356 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 17:36:08,367 INFO L256 TraceCheckSpWp]: Trace formula consists of 684 conjuncts, 76 conjuncts are in the unsatisfiable core [2025-03-03 17:36:08,374 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 17:36:08,855 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 11 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 17:36:08,855 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 17:36:09,748 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 17:36:09,748 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [602410074] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 17:36:09,748 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 17:36:09,748 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 12, 12] total 30 [2025-03-03 17:36:09,748 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [884888301] [2025-03-03 17:36:09,749 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 17:36:09,749 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2025-03-03 17:36:09,749 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 17:36:09,750 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2025-03-03 17:36:09,750 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=135, Invalid=735, Unknown=0, NotChecked=0, Total=870 [2025-03-03 17:36:09,750 INFO L87 Difference]: Start difference. First operand 250 states and 349 transitions. Second operand has 30 states, 30 states have (on average 7.0) internal successors, (210), 30 states have internal predecessors, (210), 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:36:10,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 17:36:10,749 INFO L93 Difference]: Finished difference Result 613 states and 861 transitions. [2025-03-03 17:36:10,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-03-03 17:36:10,750 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 7.0) internal successors, (210), 30 states have internal predecessors, (210), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 79 [2025-03-03 17:36:10,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 17:36:10,751 INFO L225 Difference]: With dead ends: 613 [2025-03-03 17:36:10,751 INFO L226 Difference]: Without dead ends: 481 [2025-03-03 17:36:10,753 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 184 GetRequests, 139 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 563 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=353, Invalid=1809, Unknown=0, NotChecked=0, Total=2162 [2025-03-03 17:36:10,753 INFO L435 NwaCegarLoop]: 87 mSDtfsCounter, 1438 mSDsluCounter, 1322 mSDsCounter, 0 mSdLazyCounter, 1356 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1438 SdHoareTripleChecker+Valid, 1409 SdHoareTripleChecker+Invalid, 1369 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 1356 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-03 17:36:10,753 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1438 Valid, 1409 Invalid, 1369 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 1356 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-03 17:36:10,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 481 states. [2025-03-03 17:36:10,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 481 to 437. [2025-03-03 17:36:10,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 437 states, 436 states have (on average 1.408256880733945) internal successors, (614), 436 states have internal predecessors, (614), 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:36:10,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 437 states to 437 states and 614 transitions. [2025-03-03 17:36:10,767 INFO L78 Accepts]: Start accepts. Automaton has 437 states and 614 transitions. Word has length 79 [2025-03-03 17:36:10,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 17:36:10,768 INFO L471 AbstractCegarLoop]: Abstraction has 437 states and 614 transitions. [2025-03-03 17:36:10,768 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 7.0) internal successors, (210), 30 states have internal predecessors, (210), 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:36:10,768 INFO L276 IsEmpty]: Start isEmpty. Operand 437 states and 614 transitions. [2025-03-03 17:36:10,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2025-03-03 17:36:10,769 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 17:36:10,769 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 17:36:10,777 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:36:10,973 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2025-03-03 17:36:10,973 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 17:36:10,973 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 17:36:10,973 INFO L85 PathProgramCache]: Analyzing trace with hash 1512368104, now seen corresponding path program 1 times [2025-03-03 17:36:10,973 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 17:36:10,973 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1717306948] [2025-03-03 17:36:10,973 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 17:36:10,974 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 17:36:10,995 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 80 statements into 1 equivalence classes. [2025-03-03 17:36:11,153 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 80 of 80 statements. [2025-03-03 17:36:11,154 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 17:36:11,154 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 17:36:11,689 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 10 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 17:36:11,689 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 17:36:11,689 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1717306948] [2025-03-03 17:36:11,689 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1717306948] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 17:36:11,689 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1437175763] [2025-03-03 17:36:11,689 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 17:36:11,689 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 17:36:11,689 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 17:36:11,692 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:36:11,693 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:36:11,838 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 80 statements into 1 equivalence classes. [2025-03-03 17:36:12,006 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 80 of 80 statements. [2025-03-03 17:36:12,007 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 17:36:12,007 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 17:36:12,017 INFO L256 TraceCheckSpWp]: Trace formula consists of 685 conjuncts, 98 conjuncts are in the unsatisfiable core [2025-03-03 17:36:12,023 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 17:36:12,796 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 17:36:12,796 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 17:36:15,614 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 6 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 17:36:15,614 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1437175763] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 17:36:15,614 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 17:36:15,614 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 15, 20] total 39 [2025-03-03 17:36:15,614 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1446138972] [2025-03-03 17:36:15,615 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 17:36:15,615 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2025-03-03 17:36:15,615 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 17:36:15,616 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2025-03-03 17:36:15,617 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=181, Invalid=1301, Unknown=0, NotChecked=0, Total=1482 [2025-03-03 17:36:15,617 INFO L87 Difference]: Start difference. First operand 437 states and 614 transitions. Second operand has 39 states, 39 states have (on average 5.769230769230769) internal successors, (225), 39 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:36:17,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 17:36:17,501 INFO L93 Difference]: Finished difference Result 1054 states and 1486 transitions. [2025-03-03 17:36:17,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2025-03-03 17:36:17,502 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 39 states have (on average 5.769230769230769) internal successors, (225), 39 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) Word has length 80 [2025-03-03 17:36:17,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 17:36:17,505 INFO L225 Difference]: With dead ends: 1054 [2025-03-03 17:36:17,505 INFO L226 Difference]: Without dead ends: 806 [2025-03-03 17:36:17,506 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 199 GetRequests, 131 SyntacticMatches, 1 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 968 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=612, Invalid=4080, Unknown=0, NotChecked=0, Total=4692 [2025-03-03 17:36:17,506 INFO L435 NwaCegarLoop]: 62 mSDtfsCounter, 1912 mSDsluCounter, 1305 mSDsCounter, 0 mSdLazyCounter, 2395 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1912 SdHoareTripleChecker+Valid, 1367 SdHoareTripleChecker+Invalid, 2413 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 2395 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-03-03 17:36:17,507 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1912 Valid, 1367 Invalid, 2413 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 2395 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-03-03 17:36:17,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 806 states. [2025-03-03 17:36:17,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 806 to 456. [2025-03-03 17:36:17,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 456 states, 455 states have (on average 1.402197802197802) internal successors, (638), 455 states have internal predecessors, (638), 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:36:17,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 456 states to 456 states and 638 transitions. [2025-03-03 17:36:17,519 INFO L78 Accepts]: Start accepts. Automaton has 456 states and 638 transitions. Word has length 80 [2025-03-03 17:36:17,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 17:36:17,519 INFO L471 AbstractCegarLoop]: Abstraction has 456 states and 638 transitions. [2025-03-03 17:36:17,520 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 39 states have (on average 5.769230769230769) internal successors, (225), 39 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:36:17,520 INFO L276 IsEmpty]: Start isEmpty. Operand 456 states and 638 transitions. [2025-03-03 17:36:17,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2025-03-03 17:36:17,520 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 17:36:17,521 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 17:36:17,529 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-03 17:36:17,725 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 17:36:17,725 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 17:36:17,725 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 17:36:17,726 INFO L85 PathProgramCache]: Analyzing trace with hash 895411540, now seen corresponding path program 1 times [2025-03-03 17:36:17,726 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 17:36:17,726 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [776913183] [2025-03-03 17:36:17,726 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 17:36:17,726 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 17:36:17,744 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 80 statements into 1 equivalence classes. [2025-03-03 17:36:17,876 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 80 of 80 statements. [2025-03-03 17:36:17,876 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 17:36:17,876 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 17:36:18,044 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 17:36:18,044 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 17:36:18,044 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [776913183] [2025-03-03 17:36:18,044 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [776913183] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 17:36:18,044 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 17:36:18,044 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-03 17:36:18,045 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1370020697] [2025-03-03 17:36:18,045 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 17:36:18,045 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 17:36:18,045 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 17:36:18,045 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 17:36:18,046 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-03 17:36:18,046 INFO L87 Difference]: Start difference. First operand 456 states and 638 transitions. Second operand has 7 states, 7 states have (on average 11.428571428571429) internal successors, (80), 7 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:36:18,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 17:36:18,165 INFO L93 Difference]: Finished difference Result 885 states and 1244 transitions. [2025-03-03 17:36:18,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-03 17:36:18,166 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.428571428571429) internal successors, (80), 7 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 80 [2025-03-03 17:36:18,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 17:36:18,167 INFO L225 Difference]: With dead ends: 885 [2025-03-03 17:36:18,167 INFO L226 Difference]: Without dead ends: 471 [2025-03-03 17:36:18,168 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-03 17:36:18,168 INFO L435 NwaCegarLoop]: 116 mSDtfsCounter, 145 mSDsluCounter, 452 mSDsCounter, 0 mSdLazyCounter, 268 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 145 SdHoareTripleChecker+Valid, 568 SdHoareTripleChecker+Invalid, 270 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 268 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 17:36:18,168 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [145 Valid, 568 Invalid, 270 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 268 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 17:36:18,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 471 states. [2025-03-03 17:36:18,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 471 to 471. [2025-03-03 17:36:18,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 471 states, 470 states have (on average 1.3957446808510638) internal successors, (656), 470 states have internal predecessors, (656), 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:36:18,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 471 states to 471 states and 656 transitions. [2025-03-03 17:36:18,179 INFO L78 Accepts]: Start accepts. Automaton has 471 states and 656 transitions. Word has length 80 [2025-03-03 17:36:18,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 17:36:18,179 INFO L471 AbstractCegarLoop]: Abstraction has 471 states and 656 transitions. [2025-03-03 17:36:18,179 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.428571428571429) internal successors, (80), 7 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:36:18,179 INFO L276 IsEmpty]: Start isEmpty. Operand 471 states and 656 transitions. [2025-03-03 17:36:18,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2025-03-03 17:36:18,180 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 17:36:18,180 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 17:36:18,181 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-03 17:36:18,181 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 17:36:18,181 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 17:36:18,181 INFO L85 PathProgramCache]: Analyzing trace with hash 126297339, now seen corresponding path program 1 times [2025-03-03 17:36:18,181 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 17:36:18,182 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1518908039] [2025-03-03 17:36:18,182 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 17:36:18,182 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 17:36:18,205 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 81 statements into 1 equivalence classes. [2025-03-03 17:36:18,222 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 81 of 81 statements. [2025-03-03 17:36:18,222 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 17:36:18,223 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 17:36:18,355 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 17:36:18,355 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 17:36:18,355 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1518908039] [2025-03-03 17:36:18,355 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1518908039] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 17:36:18,356 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 17:36:18,356 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 17:36:18,356 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [113982619] [2025-03-03 17:36:18,356 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 17:36:18,356 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 17:36:18,356 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 17:36:18,356 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 17:36:18,356 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 17:36:18,357 INFO L87 Difference]: Start difference. First operand 471 states and 656 transitions. Second operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:36:18,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 17:36:18,424 INFO L93 Difference]: Finished difference Result 953 states and 1332 transitions. [2025-03-03 17:36:18,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 17:36:18,424 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 81 [2025-03-03 17:36:18,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 17:36:18,426 INFO L225 Difference]: With dead ends: 953 [2025-03-03 17:36:18,426 INFO L226 Difference]: Without dead ends: 527 [2025-03-03 17:36:18,427 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:36:18,428 INFO L435 NwaCegarLoop]: 137 mSDtfsCounter, 16 mSDsluCounter, 398 mSDsCounter, 0 mSdLazyCounter, 136 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 535 SdHoareTripleChecker+Invalid, 136 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 136 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 17:36:18,428 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 535 Invalid, 136 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 136 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 17:36:18,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 527 states. [2025-03-03 17:36:18,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 527 to 507. [2025-03-03 17:36:18,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 507 states, 506 states have (on average 1.391304347826087) internal successors, (704), 506 states have internal predecessors, (704), 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:36:18,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 507 states to 507 states and 704 transitions. [2025-03-03 17:36:18,435 INFO L78 Accepts]: Start accepts. Automaton has 507 states and 704 transitions. Word has length 81 [2025-03-03 17:36:18,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 17:36:18,435 INFO L471 AbstractCegarLoop]: Abstraction has 507 states and 704 transitions. [2025-03-03 17:36:18,436 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:36:18,436 INFO L276 IsEmpty]: Start isEmpty. Operand 507 states and 704 transitions. [2025-03-03 17:36:18,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2025-03-03 17:36:18,439 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 17:36:18,439 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 17:36:18,439 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-03 17:36:18,439 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 17:36:18,440 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 17:36:18,440 INFO L85 PathProgramCache]: Analyzing trace with hash 1904032318, now seen corresponding path program 1 times [2025-03-03 17:36:18,440 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 17:36:18,440 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [953543737] [2025-03-03 17:36:18,440 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 17:36:18,440 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 17:36:18,460 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 81 statements into 1 equivalence classes. [2025-03-03 17:36:18,582 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 81 of 81 statements. [2025-03-03 17:36:18,582 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 17:36:18,582 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 17:36:19,215 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 5 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-03 17:36:19,216 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 17:36:19,216 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [953543737] [2025-03-03 17:36:19,216 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [953543737] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 17:36:19,216 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1953294921] [2025-03-03 17:36:19,216 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 17:36:19,216 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 17:36:19,216 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 17:36:19,218 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 17:36:19,220 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-03 17:36:19,382 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 81 statements into 1 equivalence classes. [2025-03-03 17:36:19,535 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 81 of 81 statements. [2025-03-03 17:36:19,536 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 17:36:19,536 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 17:36:19,539 INFO L256 TraceCheckSpWp]: Trace formula consists of 686 conjuncts, 77 conjuncts are in the unsatisfiable core [2025-03-03 17:36:19,545 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 17:36:19,926 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-03 17:36:19,926 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 17:36:21,951 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 4 proven. 7 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-03 17:36:21,951 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1953294921] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 17:36:21,951 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 17:36:21,951 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 13, 11] total 30 [2025-03-03 17:36:21,952 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [612986264] [2025-03-03 17:36:21,952 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 17:36:21,952 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2025-03-03 17:36:21,952 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 17:36:21,952 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2025-03-03 17:36:21,953 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=126, Invalid=744, Unknown=0, NotChecked=0, Total=870 [2025-03-03 17:36:21,953 INFO L87 Difference]: Start difference. First operand 507 states and 704 transitions. Second operand has 30 states, 30 states have (on average 7.566666666666666) internal successors, (227), 30 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:36:22,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 17:36:22,443 INFO L93 Difference]: Finished difference Result 937 states and 1306 transitions. [2025-03-03 17:36:22,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-03 17:36:22,443 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 7.566666666666666) internal successors, (227), 30 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) Word has length 81 [2025-03-03 17:36:22,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 17:36:22,445 INFO L225 Difference]: With dead ends: 937 [2025-03-03 17:36:22,445 INFO L226 Difference]: Without dead ends: 638 [2025-03-03 17:36:22,446 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 142 SyntacticMatches, 1 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 322 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=190, Invalid=1070, Unknown=0, NotChecked=0, Total=1260 [2025-03-03 17:36:22,447 INFO L435 NwaCegarLoop]: 88 mSDtfsCounter, 313 mSDsluCounter, 946 mSDsCounter, 0 mSdLazyCounter, 975 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 313 SdHoareTripleChecker+Valid, 1034 SdHoareTripleChecker+Invalid, 980 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 975 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 17:36:22,447 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [313 Valid, 1034 Invalid, 980 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 975 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 17:36:22,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 638 states. [2025-03-03 17:36:22,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 638 to 511. [2025-03-03 17:36:22,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 511 states, 510 states have (on average 1.388235294117647) internal successors, (708), 510 states have internal predecessors, (708), 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:36:22,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 511 states to 511 states and 708 transitions. [2025-03-03 17:36:22,455 INFO L78 Accepts]: Start accepts. Automaton has 511 states and 708 transitions. Word has length 81 [2025-03-03 17:36:22,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 17:36:22,455 INFO L471 AbstractCegarLoop]: Abstraction has 511 states and 708 transitions. [2025-03-03 17:36:22,455 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 7.566666666666666) internal successors, (227), 30 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:36:22,455 INFO L276 IsEmpty]: Start isEmpty. Operand 511 states and 708 transitions. [2025-03-03 17:36:22,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2025-03-03 17:36:22,456 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 17:36:22,456 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 17:36:22,467 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-03 17:36:22,657 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2025-03-03 17:36:22,657 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 17:36:22,657 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 17:36:22,657 INFO L85 PathProgramCache]: Analyzing trace with hash 1774576544, now seen corresponding path program 1 times [2025-03-03 17:36:22,657 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 17:36:22,657 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1287753878] [2025-03-03 17:36:22,657 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 17:36:22,658 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 17:36:22,680 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 81 statements into 1 equivalence classes. [2025-03-03 17:36:22,815 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 81 of 81 statements. [2025-03-03 17:36:22,815 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 17:36:22,816 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 17:36:23,071 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 17:36:23,071 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 17:36:23,071 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1287753878] [2025-03-03 17:36:23,071 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1287753878] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 17:36:23,071 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 17:36:23,071 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 17:36:23,071 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [775493222] [2025-03-03 17:36:23,072 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 17:36:23,072 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 17:36:23,072 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 17:36:23,072 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 17:36:23,072 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-03-03 17:36:23,072 INFO L87 Difference]: Start difference. First operand 511 states and 708 transitions. Second operand has 6 states, 6 states have (on average 13.5) internal successors, (81), 6 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:36:23,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 17:36:23,158 INFO L93 Difference]: Finished difference Result 992 states and 1381 transitions. [2025-03-03 17:36:23,158 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 17:36:23,159 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.5) internal successors, (81), 6 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 81 [2025-03-03 17:36:23,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 17:36:23,160 INFO L225 Difference]: With dead ends: 992 [2025-03-03 17:36:23,160 INFO L226 Difference]: Without dead ends: 535 [2025-03-03 17:36:23,161 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-03-03 17:36:23,161 INFO L435 NwaCegarLoop]: 128 mSDtfsCounter, 148 mSDsluCounter, 377 mSDsCounter, 0 mSdLazyCounter, 162 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 148 SdHoareTripleChecker+Valid, 505 SdHoareTripleChecker+Invalid, 162 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 162 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 17:36:23,161 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [148 Valid, 505 Invalid, 162 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 162 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 17:36:23,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 535 states. [2025-03-03 17:36:23,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 535 to 529. [2025-03-03 17:36:23,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 529 states, 528 states have (on average 1.3863636363636365) internal successors, (732), 528 states have internal predecessors, (732), 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:36:23,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 529 states to 529 states and 732 transitions. [2025-03-03 17:36:23,170 INFO L78 Accepts]: Start accepts. Automaton has 529 states and 732 transitions. Word has length 81 [2025-03-03 17:36:23,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 17:36:23,171 INFO L471 AbstractCegarLoop]: Abstraction has 529 states and 732 transitions. [2025-03-03 17:36:23,171 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.5) internal successors, (81), 6 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:36:23,171 INFO L276 IsEmpty]: Start isEmpty. Operand 529 states and 732 transitions. [2025-03-03 17:36:23,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2025-03-03 17:36:23,172 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 17:36:23,172 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 17:36:23,172 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-03 17:36:23,172 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 17:36:23,172 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 17:36:23,172 INFO L85 PathProgramCache]: Analyzing trace with hash -1511378417, now seen corresponding path program 1 times [2025-03-03 17:36:23,173 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 17:36:23,173 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1445057143] [2025-03-03 17:36:23,173 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 17:36:23,173 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 17:36:23,194 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 82 statements into 1 equivalence classes. [2025-03-03 17:36:23,234 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 82 of 82 statements. [2025-03-03 17:36:23,235 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 17:36:23,235 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 17:36:23,471 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 17:36:23,472 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 17:36:23,472 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1445057143] [2025-03-03 17:36:23,472 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1445057143] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 17:36:23,472 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 17:36:23,472 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 17:36:23,472 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1125450742] [2025-03-03 17:36:23,472 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 17:36:23,472 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 17:36:23,472 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 17:36:23,473 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 17:36:23,473 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 17:36:23,473 INFO L87 Difference]: Start difference. First operand 529 states and 732 transitions. Second operand has 5 states, 5 states have (on average 16.4) internal successors, (82), 5 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:36:23,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 17:36:23,583 INFO L93 Difference]: Finished difference Result 1033 states and 1433 transitions. [2025-03-03 17:36:23,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 17:36:23,584 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.4) internal successors, (82), 5 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 82 [2025-03-03 17:36:23,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 17:36:23,586 INFO L225 Difference]: With dead ends: 1033 [2025-03-03 17:36:23,586 INFO L226 Difference]: Without dead ends: 545 [2025-03-03 17:36:23,586 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-03 17:36:23,587 INFO L435 NwaCegarLoop]: 128 mSDtfsCounter, 387 mSDsluCounter, 252 mSDsCounter, 0 mSdLazyCounter, 124 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 387 SdHoareTripleChecker+Valid, 380 SdHoareTripleChecker+Invalid, 124 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 124 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 17:36:23,587 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [387 Valid, 380 Invalid, 124 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 124 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 17:36:23,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 545 states. [2025-03-03 17:36:23,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 545 to 519. [2025-03-03 17:36:23,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 519 states, 518 states have (on average 1.3783783783783783) internal successors, (714), 518 states have internal predecessors, (714), 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:36:23,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 519 states to 519 states and 714 transitions. [2025-03-03 17:36:23,595 INFO L78 Accepts]: Start accepts. Automaton has 519 states and 714 transitions. Word has length 82 [2025-03-03 17:36:23,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 17:36:23,595 INFO L471 AbstractCegarLoop]: Abstraction has 519 states and 714 transitions. [2025-03-03 17:36:23,596 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.4) internal successors, (82), 5 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:36:23,596 INFO L276 IsEmpty]: Start isEmpty. Operand 519 states and 714 transitions. [2025-03-03 17:36:23,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2025-03-03 17:36:23,596 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 17:36:23,597 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 17:36:23,597 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-03 17:36:23,597 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 17:36:23,597 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 17:36:23,597 INFO L85 PathProgramCache]: Analyzing trace with hash 2031772000, now seen corresponding path program 1 times [2025-03-03 17:36:23,598 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 17:36:23,598 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [609947396] [2025-03-03 17:36:23,598 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 17:36:23,598 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 17:36:23,621 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 82 statements into 1 equivalence classes. [2025-03-03 17:36:23,818 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 82 of 82 statements. [2025-03-03 17:36:23,818 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 17:36:23,818 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-03 17:36:23,818 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-03 17:36:23,827 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 82 statements into 1 equivalence classes. [2025-03-03 17:36:24,006 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 82 of 82 statements. [2025-03-03 17:36:24,008 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 17:36:24,008 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-03 17:36:24,046 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-03 17:36:24,046 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-03 17:36:24,048 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-03 17:36:24,049 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-03 17:36:24,051 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] [2025-03-03 17:36:24,114 WARN L310 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2025-03-03 17:36:24,115 WARN L310 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2025-03-03 17:36:24,143 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-03 17:36:24,149 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.03 05:36:24 BoogieIcfgContainer [2025-03-03 17:36:24,150 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-03 17:36:24,150 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-03 17:36:24,150 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-03 17:36:24,151 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-03 17:36:24,151 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 05:35:58" (3/4) ... [2025-03-03 17:36:24,153 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-03 17:36:24,154 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-03 17:36:24,158 INFO L158 Benchmark]: Toolchain (without parser) took 27183.33ms. Allocated memory was 142.6MB in the beginning and 696.3MB in the end (delta: 553.6MB). Free memory was 105.9MB in the beginning and 645.5MB in the end (delta: -539.7MB). Peak memory consumption was 13.6MB. Max. memory is 16.1GB. [2025-03-03 17:36:24,158 INFO L158 Benchmark]: CDTParser took 0.22ms. Allocated memory is still 201.3MB. Free memory is still 116.2MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 17:36:24,159 INFO L158 Benchmark]: CACSL2BoogieTranslator took 262.01ms. Allocated memory is still 142.6MB. Free memory was 104.9MB in the beginning and 86.4MB in the end (delta: 18.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-03 17:36:24,159 INFO L158 Benchmark]: Boogie Procedure Inliner took 79.75ms. Allocated memory is still 142.6MB. Free memory was 86.4MB in the beginning and 75.3MB in the end (delta: 11.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-03 17:36:24,159 INFO L158 Benchmark]: Boogie Preprocessor took 88.01ms. Allocated memory is still 142.6MB. Free memory was 75.3MB in the beginning and 68.7MB in the end (delta: 6.7MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 17:36:24,159 INFO L158 Benchmark]: IcfgBuilder took 863.70ms. Allocated memory is still 142.6MB. Free memory was 68.7MB in the beginning and 64.8MB in the end (delta: 3.8MB). Peak memory consumption was 43.0MB. Max. memory is 16.1GB. [2025-03-03 17:36:24,159 INFO L158 Benchmark]: TraceAbstraction took 25877.62ms. Allocated memory was 142.6MB in the beginning and 696.3MB in the end (delta: 553.6MB). Free memory was 64.8MB in the beginning and 645.6MB in the end (delta: -580.8MB). Peak memory consumption was 130.1MB. Max. memory is 16.1GB. [2025-03-03 17:36:24,159 INFO L158 Benchmark]: Witness Printer took 6.98ms. Allocated memory is still 696.3MB. Free memory was 645.6MB in the beginning and 645.5MB in the end (delta: 93.8kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 17:36:24,160 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.22ms. Allocated memory is still 201.3MB. Free memory is still 116.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 262.01ms. Allocated memory is still 142.6MB. Free memory was 104.9MB in the beginning and 86.4MB in the end (delta: 18.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 79.75ms. Allocated memory is still 142.6MB. Free memory was 86.4MB in the beginning and 75.3MB in the end (delta: 11.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Preprocessor took 88.01ms. Allocated memory is still 142.6MB. Free memory was 75.3MB in the beginning and 68.7MB in the end (delta: 6.7MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 863.70ms. Allocated memory is still 142.6MB. Free memory was 68.7MB in the beginning and 64.8MB in the end (delta: 3.8MB). Peak memory consumption was 43.0MB. Max. memory is 16.1GB. * TraceAbstraction took 25877.62ms. Allocated memory was 142.6MB in the beginning and 696.3MB in the end (delta: 553.6MB). Free memory was 64.8MB in the beginning and 645.6MB in the end (delta: -580.8MB). Peak memory consumption was 130.1MB. Max. memory is 16.1GB. * Witness Printer took 6.98ms. Allocated memory is still 696.3MB. Free memory was 645.6MB in the beginning and 645.5MB in the end (delta: 93.8kB). 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 bitwiseOr at line 88, overapproximation of bitwiseAnd at line 81, overapproximation of bitwiseAnd at line 93, overapproximation of bitwiseAnd at line 284. 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_7 mask_SORT_7 = (SORT_7)-1 >> (sizeof(SORT_7) * 8 - 32); [L30] const SORT_7 msb_SORT_7 = (SORT_7)1 << (32 - 1); [L32] const SORT_12 mask_SORT_12 = (SORT_12)-1 >> (sizeof(SORT_12) * 8 - 3); [L33] const SORT_12 msb_SORT_12 = (SORT_12)1 << (3 - 1); [L35] const SORT_47 mask_SORT_47 = (SORT_47)-1 >> (sizeof(SORT_47) * 8 - 2); [L36] const SORT_47 msb_SORT_47 = (SORT_47)1 << (2 - 1); [L38] const SORT_1 var_4 = 0; [L39] const SORT_7 var_9 = 1; [L40] const SORT_12 var_13 = 0; [L41] const SORT_1 var_21 = 1; [L42] const SORT_12 var_28 = 2; [L43] const SORT_12 var_31 = 1; [L44] const SORT_12 var_35 = 4; [L45] const SORT_12 var_38 = 6; [L46] const SORT_12 var_41 = 5; [L47] const SORT_12 var_45 = 3; [L48] const SORT_7 var_57 = 0; [L50] SORT_1 input_2; [L51] SORT_1 input_3; [L52] SORT_12 input_55; [L53] SORT_12 input_62; [L54] SORT_12 input_75; [L56] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_12=7, mask_SORT_1=1, mask_SORT_47=3, var_13=0, var_21=1, var_28=2, var_31=1, var_35=4, var_38=6, var_41=5, var_45=3, var_4=0, var_57=0, var_9=1] [L56] SORT_1 state_5 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L57] EXPR __VERIFIER_nondet_uchar() & mask_SORT_12 VAL [mask_SORT_12=7, mask_SORT_1=1, mask_SORT_47=3, var_13=0, var_21=1, var_28=2, var_31=1, var_35=4, var_38=6, var_41=5, var_45=3, var_4=0, var_57=0, var_9=1] [L57] SORT_12 state_14 = __VERIFIER_nondet_uchar() & mask_SORT_12; [L59] SORT_1 init_6_arg_1 = var_4; [L60] state_5 = init_6_arg_1 [L61] SORT_12 init_15_arg_1 = var_13; [L62] state_14 = init_15_arg_1 VAL [mask_SORT_12=7, mask_SORT_1=1, mask_SORT_47=3, state_14=0, state_5=0, var_13=0, var_21=1, var_28=2, var_31=1, var_35=4, var_38=6, var_41=5, var_45=3, var_4=0, var_57=0, var_9=1] [L65] input_2 = __VERIFIER_nondet_uchar() [L66] input_3 = __VERIFIER_nondet_uchar() [L67] input_55 = __VERIFIER_nondet_uchar() [L68] input_62 = __VERIFIER_nondet_uchar() [L69] input_75 = __VERIFIER_nondet_uchar() [L72] SORT_1 var_8_arg_0 = state_5; VAL [mask_SORT_12=7, mask_SORT_1=1, mask_SORT_47=3, state_14=0, state_5=0, var_13=0, var_21=1, var_28=2, var_31=1, var_35=4, var_38=6, var_41=5, var_45=3, var_4=0, var_57=0, var_8_arg_0=0, var_9=1] [L73] EXPR var_8_arg_0 & mask_SORT_1 VAL [mask_SORT_12=7, mask_SORT_1=1, mask_SORT_47=3, state_14=0, state_5=0, var_13=0, var_21=1, var_28=2, var_31=1, var_35=4, var_38=6, var_41=5, var_45=3, var_4=0, var_57=0, var_9=1] [L73] var_8_arg_0 = var_8_arg_0 & mask_SORT_1 [L74] SORT_7 var_8 = var_8_arg_0; [L75] SORT_7 var_10_arg_0 = var_8; [L76] SORT_7 var_10_arg_1 = var_9; [L77] SORT_1 var_10 = var_10_arg_0 == var_10_arg_1; [L78] SORT_1 var_11_arg_0 = var_10; [L79] SORT_1 var_11 = ~var_11_arg_0; [L80] SORT_12 var_16_arg_0 = state_14; VAL [mask_SORT_12=7, mask_SORT_1=1, mask_SORT_47=3, state_14=0, state_5=0, var_11=-1, var_13=0, var_16_arg_0=0, var_21=1, var_28=2, var_31=1, var_35=4, var_38=6, var_41=5, var_45=3, var_4=0, var_57=0, var_9=1] [L81] EXPR var_16_arg_0 & mask_SORT_12 VAL [mask_SORT_12=7, mask_SORT_1=1, mask_SORT_47=3, state_14=0, state_5=0, var_11=-1, var_13=0, var_21=1, var_28=2, var_31=1, var_35=4, var_38=6, var_41=5, var_45=3, var_4=0, var_57=0, var_9=1] [L81] var_16_arg_0 = var_16_arg_0 & mask_SORT_12 [L82] SORT_7 var_16 = var_16_arg_0; [L83] SORT_7 var_17_arg_0 = var_16; [L84] SORT_7 var_17_arg_1 = var_9; [L85] SORT_1 var_17 = var_17_arg_0 == var_17_arg_1; [L86] SORT_1 var_18_arg_0 = var_11; [L87] SORT_1 var_18_arg_1 = var_17; VAL [mask_SORT_12=7, mask_SORT_1=1, mask_SORT_47=3, state_14=0, state_5=0, var_13=0, var_18_arg_0=-1, var_18_arg_1=0, var_21=1, var_28=2, var_31=1, var_35=4, var_38=6, var_41=5, var_45=3, var_4=0, var_57=0, var_9=1] [L88] EXPR var_18_arg_0 | var_18_arg_1 VAL [mask_SORT_12=7, mask_SORT_1=1, mask_SORT_47=3, state_14=0, state_5=0, var_13=0, var_21=1, var_28=2, var_31=1, var_35=4, var_38=6, var_41=5, var_45=3, var_4=0, var_57=0, var_9=1] [L88] SORT_1 var_18 = var_18_arg_0 | var_18_arg_1; [L89] SORT_1 var_22_arg_0 = var_18; [L90] SORT_1 var_22 = ~var_22_arg_0; [L91] SORT_1 var_23_arg_0 = var_21; [L92] SORT_1 var_23_arg_1 = var_22; VAL [mask_SORT_12=7, mask_SORT_1=1, mask_SORT_47=3, state_14=0, state_5=0, var_13=0, var_21=1, var_23_arg_0=1, var_23_arg_1=-256, var_28=2, var_31=1, var_35=4, var_38=6, var_41=5, var_45=3, var_4=0, var_57=0, var_9=1] [L93] EXPR var_23_arg_0 & var_23_arg_1 VAL [mask_SORT_12=7, mask_SORT_1=1, mask_SORT_47=3, state_14=0, state_5=0, var_13=0, var_21=1, var_28=2, var_31=1, var_35=4, var_38=6, var_41=5, var_45=3, var_4=0, var_57=0, var_9=1] [L93] SORT_1 var_23 = var_23_arg_0 & var_23_arg_1; [L94] EXPR var_23 & mask_SORT_1 VAL [mask_SORT_12=7, mask_SORT_1=1, mask_SORT_47=3, state_14=0, state_5=0, var_13=0, var_21=1, var_28=2, var_31=1, var_35=4, var_38=6, var_41=5, var_45=3, var_4=0, var_57=0, var_9=1] [L94] var_23 = var_23 & mask_SORT_1 [L95] SORT_1 bad_24_arg_0 = var_23; [L96] CALL __VERIFIER_assert(!(bad_24_arg_0)) [L21] COND FALSE !(!(cond)) [L96] RET __VERIFIER_assert(!(bad_24_arg_0)) [L98] SORT_12 var_42_arg_0 = state_14; [L99] SORT_12 var_42_arg_1 = var_41; [L100] SORT_1 var_42 = var_42_arg_0 == var_42_arg_1; [L101] SORT_12 var_39_arg_0 = state_14; [L102] SORT_12 var_39_arg_1 = var_38; [L103] SORT_1 var_39 = var_39_arg_0 == var_39_arg_1; [L104] SORT_1 var_43_arg_0 = var_42; [L105] SORT_1 var_43_arg_1 = var_39; VAL [mask_SORT_12=7, mask_SORT_1=1, mask_SORT_47=3, state_14=0, state_5=0, var_13=0, var_21=1, var_28=2, var_31=1, var_35=4, var_38=6, var_39=0, var_41=5, var_43_arg_0=0, var_43_arg_1=0, var_45=3, var_4=0, var_57=0, var_9=1] [L106] EXPR var_43_arg_0 | var_43_arg_1 VAL [mask_SORT_12=7, mask_SORT_1=1, mask_SORT_47=3, state_14=0, state_5=0, var_13=0, var_21=1, var_28=2, var_31=1, var_35=4, var_38=6, var_39=0, var_41=5, var_45=3, var_4=0, var_57=0, var_9=1] [L106] SORT_1 var_43 = var_43_arg_0 | var_43_arg_1; [L107] EXPR var_43 & mask_SORT_1 VAL [mask_SORT_12=7, mask_SORT_1=1, mask_SORT_47=3, state_14=0, state_5=0, var_13=0, var_21=1, var_28=2, var_31=1, var_35=4, var_38=6, var_39=0, var_41=5, var_45=3, var_4=0, var_57=0, var_9=1] [L107] var_43 = var_43 & mask_SORT_1 [L108] SORT_12 var_36_arg_0 = state_14; [L109] SORT_12 var_36_arg_1 = var_35; [L110] SORT_1 var_36 = var_36_arg_0 == var_36_arg_1; [L111] SORT_12 var_46_arg_0 = state_14; [L112] SORT_12 var_46_arg_1 = var_45; [L113] SORT_1 var_46 = var_46_arg_0 == var_46_arg_1; [L114] SORT_1 var_48_arg_0 = var_36; [L115] SORT_1 var_48_arg_1 = var_46; VAL [mask_SORT_12=7, mask_SORT_1=1, mask_SORT_47=3, state_14=0, state_5=0, var_13=0, var_21=1, var_28=2, var_31=1, var_35=4, var_36=0, var_38=6, var_39=0, var_41=5, var_43=0, var_45=3, var_48_arg_0=0, var_48_arg_1=0, var_4=0, var_57=0, var_9=1] [L116] EXPR ((SORT_47)var_48_arg_0 << 1) | var_48_arg_1 VAL [mask_SORT_12=7, mask_SORT_1=1, mask_SORT_47=3, state_14=0, state_5=0, var_13=0, var_21=1, var_28=2, var_31=1, var_35=4, var_36=0, var_38=6, var_39=0, var_41=5, var_43=0, var_45=3, var_4=0, var_57=0, var_9=1] [L116] SORT_47 var_48 = ((SORT_47)var_48_arg_0 << 1) | var_48_arg_1; [L117] EXPR var_48 & mask_SORT_47 VAL [mask_SORT_12=7, mask_SORT_1=1, mask_SORT_47=3, state_14=0, state_5=0, var_13=0, var_21=1, var_28=2, var_31=1, var_35=4, var_36=0, var_38=6, var_39=0, var_41=5, var_43=0, var_45=3, var_4=0, var_57=0, var_9=1] [L117] var_48 = var_48 & mask_SORT_47 [L118] SORT_1 var_49_arg_0 = var_43; [L119] SORT_47 var_49_arg_1 = var_48; VAL [mask_SORT_12=7, mask_SORT_1=1, mask_SORT_47=3, state_14=0, state_5=0, var_13=0, var_21=1, var_28=2, var_31=1, var_35=4, var_36=0, var_38=6, var_39=0, var_41=5, var_43=0, var_45=3, var_49_arg_0=0, var_49_arg_1=0, var_4=0, var_57=0, var_9=1] [L120] EXPR ((SORT_12)var_49_arg_0 << 2) | var_49_arg_1 VAL [mask_SORT_12=7, mask_SORT_1=1, mask_SORT_47=3, state_14=0, state_5=0, var_13=0, var_21=1, var_28=2, var_31=1, var_35=4, var_36=0, var_38=6, var_39=0, var_41=5, var_43=0, var_45=3, var_4=0, var_57=0, var_9=1] [L120] SORT_12 var_49 = ((SORT_12)var_49_arg_0 << 2) | var_49_arg_1; [L121] EXPR var_49 & mask_SORT_12 VAL [mask_SORT_12=7, mask_SORT_1=1, mask_SORT_47=3, state_14=0, state_5=0, var_13=0, var_21=1, var_28=2, var_31=1, var_35=4, var_36=0, var_38=6, var_39=0, var_41=5, var_43=0, var_45=3, var_4=0, var_57=0, var_9=1] [L121] var_49 = var_49 & mask_SORT_12 [L122] SORT_12 var_50_arg_0 = var_49; [L123] SORT_1 var_50 = var_50_arg_0 != 0; [L124] SORT_1 var_40_arg_0 = var_39; [L125] SORT_1 var_40_arg_1 = var_4; [L126] SORT_1 var_40_arg_2 = var_4; [L127] SORT_1 var_40 = var_40_arg_0 ? var_40_arg_1 : var_40_arg_2; [L128] SORT_1 var_37_arg_0 = var_36; [L129] SORT_1 var_37_arg_1 = var_21; [L130] SORT_1 var_37_arg_2 = var_4; [L131] SORT_1 var_37 = var_37_arg_0 ? var_37_arg_1 : var_37_arg_2; [L132] SORT_1 var_44_arg_0 = var_43; [L133] SORT_1 var_44_arg_1 = var_40; [L134] SORT_1 var_44_arg_2 = var_37; [L135] SORT_1 var_44 = var_44_arg_0 ? var_44_arg_1 : var_44_arg_2; [L136] SORT_12 var_32_arg_0 = state_14; [L137] SORT_12 var_32_arg_1 = var_31; [L138] SORT_1 var_32 = var_32_arg_0 == var_32_arg_1; [L139] SORT_12 var_29_arg_0 = state_14; [L140] SORT_12 var_29_arg_1 = var_28; [L141] SORT_1 var_29 = var_29_arg_0 == var_29_arg_1; [L142] SORT_1 var_33_arg_0 = var_32; [L143] SORT_1 var_33_arg_1 = var_29; VAL [mask_SORT_12=7, mask_SORT_1=1, mask_SORT_47=3, state_14=0, state_5=0, var_13=0, var_21=1, var_28=2, var_29=0, var_31=1, var_33_arg_0=0, var_33_arg_1=0, var_35=4, var_38=6, var_41=5, var_44=0, var_45=3, var_4=0, var_50=0, var_57=0, var_9=1] [L144] EXPR var_33_arg_0 | var_33_arg_1 VAL [mask_SORT_12=7, mask_SORT_1=1, mask_SORT_47=3, state_14=0, state_5=0, var_13=0, var_21=1, var_28=2, var_29=0, var_31=1, var_35=4, var_38=6, var_41=5, var_44=0, var_45=3, var_4=0, var_50=0, var_57=0, var_9=1] [L144] SORT_1 var_33 = var_33_arg_0 | var_33_arg_1; [L145] EXPR var_33 & mask_SORT_1 VAL [mask_SORT_12=7, mask_SORT_1=1, mask_SORT_47=3, state_14=0, state_5=0, var_13=0, var_21=1, var_28=2, var_29=0, var_31=1, var_35=4, var_38=6, var_41=5, var_44=0, var_45=3, var_4=0, var_50=0, var_57=0, var_9=1] [L145] var_33 = var_33 & mask_SORT_1 [L146] SORT_1 var_30_arg_0 = var_29; [L147] SORT_1 var_30_arg_1 = var_4; [L148] SORT_1 var_30_arg_2 = var_4; [L149] SORT_1 var_30 = var_30_arg_0 ? var_30_arg_1 : var_30_arg_2; [L150] SORT_12 var_26_arg_0 = state_14; [L151] SORT_12 var_26_arg_1 = var_13; [L152] SORT_1 var_26 = var_26_arg_0 == var_26_arg_1; [L153] SORT_1 var_27_arg_0 = var_26; [L154] SORT_1 var_27_arg_1 = var_4; [L155] SORT_1 var_27_arg_2 = state_5; [L156] SORT_1 var_27 = var_27_arg_0 ? var_27_arg_1 : var_27_arg_2; [L157] SORT_1 var_34_arg_0 = var_33; [L158] SORT_1 var_34_arg_1 = var_30; [L159] SORT_1 var_34_arg_2 = var_27; [L160] SORT_1 var_34 = var_34_arg_0 ? var_34_arg_1 : var_34_arg_2; [L161] SORT_1 var_51_arg_0 = var_50; [L162] SORT_1 var_51_arg_1 = var_44; [L163] SORT_1 var_51_arg_2 = var_34; [L164] SORT_1 var_51 = var_51_arg_0 ? var_51_arg_1 : var_51_arg_2; [L165] SORT_1 next_52_arg_1 = var_51; [L166] SORT_12 var_83_arg_0 = state_14; [L167] SORT_12 var_83_arg_1 = var_41; [L168] SORT_1 var_83 = var_83_arg_0 == var_83_arg_1; [L169] SORT_12 var_81_arg_0 = state_14; [L170] SORT_12 var_81_arg_1 = var_38; [L171] SORT_1 var_81 = var_81_arg_0 == var_81_arg_1; [L172] SORT_1 var_84_arg_0 = var_83; [L173] SORT_1 var_84_arg_1 = var_81; VAL [mask_SORT_12=7, mask_SORT_1=1, mask_SORT_47=3, next_52_arg_1=0, state_14=0, var_13=0, var_21=1, var_28=2, var_31=1, var_35=4, var_38=6, var_41=5, var_45=3, var_4=0, var_57=0, var_81=0, var_84_arg_0=0, var_84_arg_1=0, var_9=1] [L174] EXPR var_84_arg_0 | var_84_arg_1 VAL [mask_SORT_12=7, mask_SORT_1=1, mask_SORT_47=3, next_52_arg_1=0, state_14=0, var_13=0, var_21=1, var_28=2, var_31=1, var_35=4, var_38=6, var_41=5, var_45=3, var_4=0, var_57=0, var_81=0, var_9=1] [L174] SORT_1 var_84 = var_84_arg_0 | var_84_arg_1; [L175] EXPR var_84 & mask_SORT_1 VAL [mask_SORT_12=7, mask_SORT_1=1, mask_SORT_47=3, next_52_arg_1=0, state_14=0, var_13=0, var_21=1, var_28=2, var_31=1, var_35=4, var_38=6, var_41=5, var_45=3, var_4=0, var_57=0, var_81=0, var_9=1] [L175] var_84 = var_84 & mask_SORT_1 [L176] SORT_12 var_73_arg_0 = state_14; [L177] SORT_12 var_73_arg_1 = var_35; [L178] SORT_1 var_73 = var_73_arg_0 == var_73_arg_1; [L179] SORT_12 var_86_arg_0 = state_14; [L180] SORT_12 var_86_arg_1 = var_45; [L181] SORT_1 var_86 = var_86_arg_0 == var_86_arg_1; [L182] SORT_1 var_87_arg_0 = var_73; [L183] SORT_1 var_87_arg_1 = var_86; VAL [mask_SORT_12=7, mask_SORT_1=1, mask_SORT_47=3, next_52_arg_1=0, state_14=0, var_13=0, var_21=1, var_28=2, var_31=1, var_35=4, var_38=6, var_41=5, var_45=3, var_4=0, var_57=0, var_73=0, var_81=0, var_84=0, var_87_arg_0=0, var_87_arg_1=0, var_9=1] [L184] EXPR ((SORT_47)var_87_arg_0 << 1) | var_87_arg_1 VAL [mask_SORT_12=7, mask_SORT_1=1, mask_SORT_47=3, next_52_arg_1=0, state_14=0, var_13=0, var_21=1, var_28=2, var_31=1, var_35=4, var_38=6, var_41=5, var_45=3, var_4=0, var_57=0, var_73=0, var_81=0, var_84=0, var_9=1] [L184] SORT_47 var_87 = ((SORT_47)var_87_arg_0 << 1) | var_87_arg_1; [L185] EXPR var_87 & mask_SORT_47 VAL [mask_SORT_12=7, mask_SORT_1=1, mask_SORT_47=3, next_52_arg_1=0, state_14=0, var_13=0, var_21=1, var_28=2, var_31=1, var_35=4, var_38=6, var_41=5, var_45=3, var_4=0, var_57=0, var_73=0, var_81=0, var_84=0, var_9=1] [L185] var_87 = var_87 & mask_SORT_47 [L186] SORT_1 var_88_arg_0 = var_84; [L187] SORT_47 var_88_arg_1 = var_87; VAL [mask_SORT_12=7, mask_SORT_1=1, mask_SORT_47=3, next_52_arg_1=0, state_14=0, var_13=0, var_21=1, var_28=2, var_31=1, var_35=4, var_38=6, var_41=5, var_45=3, var_4=0, var_57=0, var_73=0, var_81=0, var_84=0, var_88_arg_0=0, var_88_arg_1=0, var_9=1] [L188] EXPR ((SORT_12)var_88_arg_0 << 2) | var_88_arg_1 VAL [mask_SORT_12=7, mask_SORT_1=1, mask_SORT_47=3, next_52_arg_1=0, state_14=0, var_13=0, var_21=1, var_28=2, var_31=1, var_35=4, var_38=6, var_41=5, var_45=3, var_4=0, var_57=0, var_73=0, var_81=0, var_84=0, var_9=1] [L188] SORT_12 var_88 = ((SORT_12)var_88_arg_0 << 2) | var_88_arg_1; [L189] EXPR var_88 & mask_SORT_12 VAL [mask_SORT_12=7, mask_SORT_1=1, mask_SORT_47=3, next_52_arg_1=0, state_14=0, var_13=0, var_21=1, var_28=2, var_31=1, var_35=4, var_38=6, var_41=5, var_45=3, var_4=0, var_57=0, var_73=0, var_81=0, var_84=0, var_9=1] [L189] var_88 = var_88 & mask_SORT_12 [L190] SORT_12 var_89_arg_0 = var_88; [L191] SORT_1 var_89 = var_89_arg_0 != 0; [L192] SORT_12 var_79_arg_0 = state_14; [L193] SORT_12 var_79_arg_1 = var_38; [L194] SORT_1 var_79 = var_79_arg_0 == var_79_arg_1; [L195] SORT_1 var_76_arg_0 = input_2; VAL [input_2=0, mask_SORT_12=7, mask_SORT_1=1, mask_SORT_47=3, next_52_arg_1=0, state_14=0, var_13=0, var_21=1, var_28=2, var_31=1, var_35=4, var_38=6, var_41=5, var_45=3, var_4=0, var_57=0, var_73=0, var_76_arg_0=0, var_79=0, var_81=0, var_84=0, var_89=0, var_9=1] [L196] EXPR var_76_arg_0 & mask_SORT_1 VAL [input_2=0, mask_SORT_12=7, mask_SORT_1=1, mask_SORT_47=3, next_52_arg_1=0, state_14=0, var_13=0, var_21=1, var_28=2, var_31=1, var_35=4, var_38=6, var_41=5, var_45=3, var_4=0, var_57=0, var_73=0, var_79=0, var_81=0, var_84=0, var_89=0, var_9=1] [L196] var_76_arg_0 = var_76_arg_0 & mask_SORT_1 [L197] SORT_7 var_76 = var_76_arg_0; [L198] SORT_7 var_77_arg_0 = var_76; [L199] SORT_7 var_77_arg_1 = var_57; [L200] SORT_1 var_77 = var_77_arg_0 == var_77_arg_1; [L201] SORT_1 var_78_arg_0 = var_77; [L202] SORT_12 var_78_arg_1 = var_35; [L203] SORT_12 var_78_arg_2 = var_13; [L204] SORT_12 var_78 = var_78_arg_0 ? var_78_arg_1 : var_78_arg_2; [L205] SORT_1 var_80_arg_0 = var_79; [L206] SORT_12 var_80_arg_1 = var_78; [L207] SORT_12 var_80_arg_2 = input_75; [L208] SORT_12 var_80 = var_80_arg_0 ? var_80_arg_1 : var_80_arg_2; [L209] SORT_1 var_82_arg_0 = var_81; [L210] SORT_12 var_82_arg_1 = var_80; [L211] SORT_12 var_82_arg_2 = var_38; [L212] SORT_12 var_82 = var_82_arg_0 ? var_82_arg_1 : var_82_arg_2; [L213] SORT_1 var_74_arg_0 = var_73; [L214] SORT_12 var_74_arg_1 = var_31; [L215] SORT_12 var_74_arg_2 = var_35; [L216] SORT_12 var_74 = var_74_arg_0 ? var_74_arg_1 : var_74_arg_2; [L217] SORT_1 var_85_arg_0 = var_84; [L218] SORT_12 var_85_arg_1 = var_82; [L219] SORT_12 var_85_arg_2 = var_74; [L220] SORT_12 var_85 = var_85_arg_0 ? var_85_arg_1 : var_85_arg_2; [L221] SORT_12 var_70_arg_0 = state_14; [L222] SORT_12 var_70_arg_1 = var_31; [L223] SORT_1 var_70 = var_70_arg_0 == var_70_arg_1; [L224] SORT_12 var_68_arg_0 = state_14; [L225] SORT_12 var_68_arg_1 = var_28; [L226] SORT_1 var_68 = var_68_arg_0 == var_68_arg_1; [L227] SORT_1 var_71_arg_0 = var_70; [L228] SORT_1 var_71_arg_1 = var_68; VAL [input_2=0, mask_SORT_12=7, mask_SORT_1=1, mask_SORT_47=3, next_52_arg_1=0, state_14=0, var_13=0, var_21=1, var_28=2, var_31=1, var_35=4, var_38=6, var_41=5, var_45=3, var_4=0, var_57=0, var_68=0, var_71_arg_0=0, var_71_arg_1=0, var_85=4, var_89=0, var_9=1] [L229] EXPR var_71_arg_0 | var_71_arg_1 VAL [input_2=0, mask_SORT_12=7, mask_SORT_1=1, mask_SORT_47=3, next_52_arg_1=0, state_14=0, var_13=0, var_21=1, var_28=2, var_31=1, var_35=4, var_38=6, var_41=5, var_45=3, var_4=0, var_57=0, var_68=0, var_85=4, var_89=0, var_9=1] [L229] SORT_1 var_71 = var_71_arg_0 | var_71_arg_1; [L230] EXPR var_71 & mask_SORT_1 VAL [input_2=0, mask_SORT_12=7, mask_SORT_1=1, mask_SORT_47=3, next_52_arg_1=0, state_14=0, var_13=0, var_21=1, var_28=2, var_31=1, var_35=4, var_38=6, var_41=5, var_45=3, var_4=0, var_57=0, var_68=0, var_85=4, var_89=0, var_9=1] [L230] var_71 = var_71 & mask_SORT_1 [L231] SORT_12 var_66_arg_0 = state_14; [L232] SORT_12 var_66_arg_1 = var_28; [L233] SORT_1 var_66 = var_66_arg_0 == var_66_arg_1; [L234] SORT_1 var_63_arg_0 = input_2; VAL [input_2=0, mask_SORT_12=7, mask_SORT_1=1, mask_SORT_47=3, next_52_arg_1=0, state_14=0, var_13=0, var_21=1, var_28=2, var_31=1, var_35=4, var_38=6, var_41=5, var_45=3, var_4=0, var_57=0, var_63_arg_0=0, var_66=0, var_68=0, var_71=0, var_85=4, var_89=0, var_9=1] [L235] EXPR var_63_arg_0 & mask_SORT_1 VAL [input_2=0, mask_SORT_12=7, mask_SORT_1=1, mask_SORT_47=3, next_52_arg_1=0, state_14=0, var_13=0, var_21=1, var_28=2, var_31=1, var_35=4, var_38=6, var_41=5, var_45=3, var_4=0, var_57=0, var_66=0, var_68=0, var_71=0, var_85=4, var_89=0, var_9=1] [L235] var_63_arg_0 = var_63_arg_0 & mask_SORT_1 [L236] SORT_7 var_63 = var_63_arg_0; [L237] SORT_7 var_64_arg_0 = var_63; [L238] SORT_7 var_64_arg_1 = var_57; [L239] SORT_1 var_64 = var_64_arg_0 == var_64_arg_1; [L240] SORT_1 var_65_arg_0 = var_64; [L241] SORT_12 var_65_arg_1 = var_45; [L242] SORT_12 var_65_arg_2 = var_38; [L243] SORT_12 var_65 = var_65_arg_0 ? var_65_arg_1 : var_65_arg_2; [L244] SORT_1 var_67_arg_0 = var_66; [L245] SORT_12 var_67_arg_1 = var_65; [L246] SORT_12 var_67_arg_2 = input_62; [L247] SORT_12 var_67 = var_67_arg_0 ? var_67_arg_1 : var_67_arg_2; [L248] SORT_12 var_60_arg_0 = state_14; [L249] SORT_12 var_60_arg_1 = var_31; [L250] SORT_1 var_60 = var_60_arg_0 == var_60_arg_1; [L251] SORT_1 var_56_arg_0 = input_2; VAL [mask_SORT_12=7, mask_SORT_1=1, mask_SORT_47=3, next_52_arg_1=0, state_14=0, var_13=0, var_21=1, var_28=2, var_31=1, var_35=4, var_38=6, var_41=5, var_45=3, var_4=0, var_56_arg_0=0, var_57=0, var_60=0, var_67=3, var_68=0, var_71=0, var_85=4, var_89=0, var_9=1] [L252] EXPR var_56_arg_0 & mask_SORT_1 VAL [mask_SORT_12=7, mask_SORT_1=1, mask_SORT_47=3, next_52_arg_1=0, state_14=0, var_13=0, var_21=1, var_28=2, var_31=1, var_35=4, var_38=6, var_41=5, var_45=3, var_4=0, var_57=0, var_60=0, var_67=3, var_68=0, var_71=0, var_85=4, var_89=0, var_9=1] [L252] var_56_arg_0 = var_56_arg_0 & mask_SORT_1 [L253] SORT_7 var_56 = var_56_arg_0; [L254] SORT_7 var_58_arg_0 = var_56; [L255] SORT_7 var_58_arg_1 = var_57; [L256] SORT_1 var_58 = var_58_arg_0 == var_58_arg_1; [L257] SORT_1 var_59_arg_0 = var_58; [L258] SORT_12 var_59_arg_1 = var_28; [L259] SORT_12 var_59_arg_2 = var_41; [L260] SORT_12 var_59 = var_59_arg_0 ? var_59_arg_1 : var_59_arg_2; [L261] SORT_1 var_61_arg_0 = var_60; [L262] SORT_12 var_61_arg_1 = var_59; [L263] SORT_12 var_61_arg_2 = input_55; [L264] SORT_12 var_61 = var_61_arg_0 ? var_61_arg_1 : var_61_arg_2; [L265] SORT_1 var_69_arg_0 = var_68; [L266] SORT_12 var_69_arg_1 = var_67; [L267] SORT_12 var_69_arg_2 = var_61; [L268] SORT_12 var_69 = var_69_arg_0 ? var_69_arg_1 : var_69_arg_2; [L269] SORT_12 var_53_arg_0 = state_14; [L270] SORT_12 var_53_arg_1 = var_13; [L271] SORT_1 var_53 = var_53_arg_0 == var_53_arg_1; [L272] SORT_1 var_54_arg_0 = var_53; [L273] SORT_12 var_54_arg_1 = var_31; [L274] SORT_12 var_54_arg_2 = state_14; [L275] SORT_12 var_54 = var_54_arg_0 ? var_54_arg_1 : var_54_arg_2; [L276] SORT_1 var_72_arg_0 = var_71; [L277] SORT_12 var_72_arg_1 = var_69; [L278] SORT_12 var_72_arg_2 = var_54; [L279] SORT_12 var_72 = var_72_arg_0 ? var_72_arg_1 : var_72_arg_2; [L280] SORT_1 var_90_arg_0 = var_89; [L281] SORT_12 var_90_arg_1 = var_85; [L282] SORT_12 var_90_arg_2 = var_72; [L283] SORT_12 var_90 = var_90_arg_0 ? var_90_arg_1 : var_90_arg_2; VAL [mask_SORT_12=7, mask_SORT_1=1, mask_SORT_47=3, next_52_arg_1=0, var_13=0, var_21=1, var_28=2, var_31=1, var_35=4, var_38=6, var_41=5, var_45=3, var_4=0, var_57=0, var_90=1, var_9=1] [L284] EXPR var_90 & mask_SORT_12 VAL [mask_SORT_12=7, mask_SORT_1=1, mask_SORT_47=3, next_52_arg_1=0, var_13=0, var_21=1, var_28=2, var_31=1, var_35=4, var_38=6, var_41=5, var_45=3, var_4=0, var_57=0, var_9=1] [L284] var_90 = var_90 & mask_SORT_12 [L285] SORT_12 next_91_arg_1 = var_90; [L287] state_5 = next_52_arg_1 [L288] state_14 = next_91_arg_1 [L65] input_2 = __VERIFIER_nondet_uchar() [L66] input_3 = __VERIFIER_nondet_uchar() [L67] input_55 = __VERIFIER_nondet_uchar() [L68] input_62 = __VERIFIER_nondet_uchar() [L69] input_75 = __VERIFIER_nondet_uchar() [L72] SORT_1 var_8_arg_0 = state_5; VAL [mask_SORT_12=7, mask_SORT_1=1, mask_SORT_47=3, state_14=1, state_5=0, var_13=0, var_21=1, var_28=2, var_31=1, var_35=4, var_38=6, var_41=5, var_45=3, var_4=0, var_57=0, var_8_arg_0=0, var_9=1] [L73] EXPR var_8_arg_0 & mask_SORT_1 VAL [mask_SORT_12=7, mask_SORT_1=1, mask_SORT_47=3, state_14=1, state_5=0, var_13=0, var_21=1, var_28=2, var_31=1, var_35=4, var_38=6, var_41=5, var_45=3, var_4=0, var_57=0, var_9=1] [L73] var_8_arg_0 = var_8_arg_0 & mask_SORT_1 [L74] SORT_7 var_8 = var_8_arg_0; [L75] SORT_7 var_10_arg_0 = var_8; [L76] SORT_7 var_10_arg_1 = var_9; [L77] SORT_1 var_10 = var_10_arg_0 == var_10_arg_1; [L78] SORT_1 var_11_arg_0 = var_10; [L79] SORT_1 var_11 = ~var_11_arg_0; [L80] SORT_12 var_16_arg_0 = state_14; VAL [mask_SORT_12=7, mask_SORT_1=1, mask_SORT_47=3, state_14=1, state_5=0, var_11=-1, var_13=0, var_16_arg_0=1, var_21=1, var_28=2, var_31=1, var_35=4, var_38=6, var_41=5, var_45=3, var_4=0, var_57=0, var_9=1] [L81] EXPR var_16_arg_0 & mask_SORT_12 VAL [mask_SORT_12=7, mask_SORT_1=1, mask_SORT_47=3, state_14=1, state_5=0, var_11=-1, var_13=0, var_21=1, var_28=2, var_31=1, var_35=4, var_38=6, var_41=5, var_45=3, var_4=0, var_57=0, var_9=1] [L81] var_16_arg_0 = var_16_arg_0 & mask_SORT_12 [L82] SORT_7 var_16 = var_16_arg_0; [L83] SORT_7 var_17_arg_0 = var_16; [L84] SORT_7 var_17_arg_1 = var_9; [L85] SORT_1 var_17 = var_17_arg_0 == var_17_arg_1; [L86] SORT_1 var_18_arg_0 = var_11; [L87] SORT_1 var_18_arg_1 = var_17; VAL [mask_SORT_12=7, mask_SORT_1=1, mask_SORT_47=3, state_14=1, state_5=0, var_13=0, var_18_arg_0=-1, var_18_arg_1=1, var_21=1, var_28=2, var_31=1, var_35=4, var_38=6, var_41=5, var_45=3, var_4=0, var_57=0, var_9=1] [L88] EXPR var_18_arg_0 | var_18_arg_1 VAL [mask_SORT_12=7, mask_SORT_1=1, mask_SORT_47=3, state_14=1, state_5=0, var_13=0, var_21=1, var_28=2, var_31=1, var_35=4, var_38=6, var_41=5, var_45=3, var_4=0, var_57=0, var_9=1] [L88] SORT_1 var_18 = var_18_arg_0 | var_18_arg_1; [L89] SORT_1 var_22_arg_0 = var_18; [L90] SORT_1 var_22 = ~var_22_arg_0; [L91] SORT_1 var_23_arg_0 = var_21; [L92] SORT_1 var_23_arg_1 = var_22; VAL [mask_SORT_12=7, mask_SORT_1=1, mask_SORT_47=3, state_14=1, state_5=0, var_13=0, var_21=1, var_23_arg_0=1, var_23_arg_1=-1, var_28=2, var_31=1, var_35=4, var_38=6, var_41=5, var_45=3, var_4=0, var_57=0, var_9=1] [L93] EXPR var_23_arg_0 & var_23_arg_1 VAL [mask_SORT_12=7, mask_SORT_1=1, mask_SORT_47=3, state_14=1, state_5=0, var_13=0, var_21=1, var_28=2, var_31=1, var_35=4, var_38=6, var_41=5, var_45=3, var_4=0, var_57=0, var_9=1] [L93] SORT_1 var_23 = var_23_arg_0 & var_23_arg_1; [L94] EXPR var_23 & mask_SORT_1 VAL [mask_SORT_12=7, mask_SORT_1=1, mask_SORT_47=3, state_14=1, state_5=0, var_13=0, var_21=1, var_28=2, var_31=1, var_35=4, var_38=6, var_41=5, var_45=3, var_4=0, var_57=0, var_9=1] [L94] var_23 = var_23 & mask_SORT_1 [L95] SORT_1 bad_24_arg_0 = var_23; [L96] CALL __VERIFIER_assert(!(bad_24_arg_0)) [L21] COND TRUE !(cond) [L21] reach_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 118 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 25.7s, OverallIterations: 19, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 5.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 6391 SdHoareTripleChecker+Valid, 4.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 6391 mSDsluCounter, 10885 SdHoareTripleChecker+Invalid, 3.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 8789 mSDsCounter, 44 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 7616 IncrementalHoareTripleChecker+Invalid, 7660 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 44 mSolverCounterUnsat, 2096 mSDtfsCounter, 7616 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 756 GetRequests, 524 SyntacticMatches, 3 SemanticMatches, 229 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1933 ImplicationChecksByTransitivity, 3.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=529occurred in iteration=17, InterpolantAutomatonStates: 154, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 18 MinimizatonAttempts, 772 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 2.9s SatisfiabilityAnalysisTime, 14.9s InterpolantComputationTime, 1427 NumberOfCodeBlocks, 1427 NumberOfCodeBlocksAsserted, 23 NumberOfCheckSat, 1560 ConstructedInterpolants, 63 QuantifiedInterpolants, 17765 SizeOfPredicates, 19 NumberOfNonLiveVariables, 2735 ConjunctsInSsa, 346 ConjunctsInUnsatCore, 25 InterpolantComputations, 15 PerfectInterpolantSequences, 191/234 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:36:24,206 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.h_b02.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 e188a971cba665e2b77b0e826b47d617ddf57bd12a8f8136f6d81bf903c7591b --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 17:36:25,909 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 17:36:25,998 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Bitvector.epf [2025-03-03 17:36:26,004 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 17:36:26,005 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 17:36:26,023 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 17:36:26,025 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 17:36:26,026 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 17:36:26,026 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 17:36:26,026 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 17:36:26,026 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 17:36:26,027 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 17:36:26,027 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 17:36:26,027 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 17:36:26,027 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 17:36:26,027 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 17:36:26,028 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 17:36:26,028 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 17:36:26,028 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 17:36:26,028 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 17:36:26,028 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 17:36:26,028 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-03 17:36:26,028 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-03 17:36:26,028 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-03 17:36:26,028 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 17:36:26,028 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 17:36:26,028 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 17:36:26,028 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 17:36:26,028 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 17:36:26,028 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 17:36:26,028 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 17:36:26,028 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 17:36:26,028 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 17:36:26,028 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 17:36:26,028 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 17:36:26,028 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 17:36:26,028 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-03 17:36:26,028 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-03 17:36:26,028 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 17:36:26,028 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 17:36:26,029 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 17:36:26,029 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 17:36:26,029 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 -> e188a971cba665e2b77b0e826b47d617ddf57bd12a8f8136f6d81bf903c7591b [2025-03-03 17:36:26,252 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 17:36:26,257 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 17:36:26,259 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 17:36:26,260 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 17:36:26,260 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 17:36:26,261 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.h_b02.c [2025-03-03 17:36:27,363 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/260de5d94/87dca3cb9adb409fb14e295de3fa4d85/FLAG7a46c2a78 [2025-03-03 17:36:27,537 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 17:36:27,537 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.h_b02.c [2025-03-03 17:36:27,549 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/260de5d94/87dca3cb9adb409fb14e295de3fa4d85/FLAG7a46c2a78 [2025-03-03 17:36:27,563 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/260de5d94/87dca3cb9adb409fb14e295de3fa4d85 [2025-03-03 17:36:27,566 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 17:36:27,567 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 17:36:27,568 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 17:36:27,568 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 17:36:27,573 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 17:36:27,574 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 05:36:27" (1/1) ... [2025-03-03 17:36:27,574 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@151d21d4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:36:27, skipping insertion in model container [2025-03-03 17:36:27,574 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 05:36:27" (1/1) ... [2025-03-03 17:36:27,597 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 17:36:27,702 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.h_b02.c[1245,1258] [2025-03-03 17:36:27,787 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 17:36:27,800 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 17:36:27,809 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.h_b02.c[1245,1258] [2025-03-03 17:36:27,859 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 17:36:27,871 INFO L204 MainTranslator]: Completed translation [2025-03-03 17:36:27,872 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:36:27 WrapperNode [2025-03-03 17:36:27,872 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 17:36:27,873 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 17:36:27,874 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 17:36:27,874 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 17:36:27,878 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:36:27" (1/1) ... [2025-03-03 17:36:27,887 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:36:27" (1/1) ... [2025-03-03 17:36:27,919 INFO L138 Inliner]: procedures = 17, calls = 16, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 290 [2025-03-03 17:36:27,920 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 17:36:27,920 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 17:36:27,920 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 17:36:27,924 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 17:36:27,930 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:36:27" (1/1) ... [2025-03-03 17:36:27,930 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:36:27" (1/1) ... [2025-03-03 17:36:27,936 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:36:27" (1/1) ... [2025-03-03 17:36:27,960 INFO L175 MemorySlicer]: Split 10 memory accesses to 2 slices as follows [2, 8]. 80 percent of accesses are in the largest equivalence class. The 10 initializations are split as follows [2, 8]. The 0 writes are split as follows [0, 0]. [2025-03-03 17:36:27,960 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:36:27" (1/1) ... [2025-03-03 17:36:27,960 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:36:27" (1/1) ... [2025-03-03 17:36:27,972 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:36:27" (1/1) ... [2025-03-03 17:36:27,977 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:36:27" (1/1) ... [2025-03-03 17:36:27,979 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:36:27" (1/1) ... [2025-03-03 17:36:27,980 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:36:27" (1/1) ... [2025-03-03 17:36:27,986 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 17:36:27,986 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 17:36:27,990 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 17:36:27,991 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 17:36:27,991 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:36:27" (1/1) ... [2025-03-03 17:36:27,996 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 17:36:28,010 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 17:36:28,022 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:36:28,025 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:36:28,044 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 17:36:28,045 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-03 17:36:28,046 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2025-03-03 17:36:28,046 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 17:36:28,046 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 17:36:28,164 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 17:36:28,165 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 17:36:28,490 INFO L? ?]: Removed 37 outVars from TransFormulas that were not future-live. [2025-03-03 17:36:28,491 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 17:36:28,499 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 17:36:28,500 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 17:36:28,501 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 05:36:28 BoogieIcfgContainer [2025-03-03 17:36:28,501 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 17:36:28,503 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 17:36:28,504 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 17:36:28,507 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 17:36:28,508 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 05:36:27" (1/3) ... [2025-03-03 17:36:28,508 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7acb2ddb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 05:36:28, skipping insertion in model container [2025-03-03 17:36:28,508 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:36:27" (2/3) ... [2025-03-03 17:36:28,509 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7acb2ddb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 05:36:28, skipping insertion in model container [2025-03-03 17:36:28,509 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 05:36:28" (3/3) ... [2025-03-03 17:36:28,510 INFO L128 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.h_b02.c [2025-03-03 17:36:28,522 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 17:36:28,524 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG btor2c-lazyMod.h_b02.c that has 1 procedures, 10 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 17:36:28,562 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 17:36:28,571 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;@7138ee02, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 17:36:28,572 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 17:36:28,574 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:36:28,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2025-03-03 17:36:28,578 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 17:36:28,579 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2025-03-03 17:36:28,579 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 17:36:28,583 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 17:36:28,583 INFO L85 PathProgramCache]: Analyzing trace with hash 38140359, now seen corresponding path program 1 times [2025-03-03 17:36:28,590 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 17:36:28,591 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1884781428] [2025-03-03 17:36:28,591 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 17:36:28,591 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 17:36:28,591 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 17:36:28,595 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:36:28,596 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:36:28,699 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-03 17:36:28,715 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-03 17:36:28,716 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 17:36:28,716 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 17:36:28,719 INFO L256 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 22 conjuncts are in the unsatisfiable core [2025-03-03 17:36:28,725 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 17:36:28,876 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:36:28,876 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 17:36:28,877 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-03 17:36:28,877 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1884781428] [2025-03-03 17:36:28,878 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1884781428] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 17:36:28,879 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 17:36:28,880 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 17:36:28,881 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [714419123] [2025-03-03 17:36:28,882 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 17:36:28,884 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 17:36:28,884 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-03 17:36:28,895 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 17:36:28,896 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 17:36:28,897 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:36:28,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 17:36:28,935 INFO L93 Difference]: Finished difference Result 18 states and 23 transitions. [2025-03-03 17:36:28,936 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 17:36:28,937 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:36:28,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 17:36:28,941 INFO L225 Difference]: With dead ends: 18 [2025-03-03 17:36:28,941 INFO L226 Difference]: Without dead ends: 10 [2025-03-03 17:36:28,943 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:36:28,944 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:36:28,947 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:36:28,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2025-03-03 17:36:28,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 9. [2025-03-03 17:36:28,962 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:36:28,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2025-03-03 17:36:28,965 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 5 [2025-03-03 17:36:28,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 17:36:28,966 INFO L471 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2025-03-03 17:36:28,966 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:36:28,966 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2025-03-03 17:36:28,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-03-03 17:36:28,966 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 17:36:28,966 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2025-03-03 17:36:28,973 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:36:29,170 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:36:29,170 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 17:36:29,170 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 17:36:29,170 INFO L85 PathProgramCache]: Analyzing trace with hash -1926026653, now seen corresponding path program 1 times [2025-03-03 17:36:29,171 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 17:36:29,171 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [707511308] [2025-03-03 17:36:29,171 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 17:36:29,171 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 17:36:29,171 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 17:36:29,174 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:36:29,175 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:36:29,271 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-03 17:36:29,294 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-03 17:36:29,295 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 17:36:29,295 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 17:36:29,296 INFO L256 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 28 conjuncts are in the unsatisfiable core [2025-03-03 17:36:29,301 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 17:36:32,333 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:36:32,334 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 17:36:54,532 WARN L286 SmtUtils]: Spent 5.29s on a formula simplification. DAG size of input: 407 DAG size of output: 310 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-03-03 17:37:02,465 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:37:02,466 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-03 17:37:02,466 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [707511308] [2025-03-03 17:37:02,466 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [707511308] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 17:37:02,466 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-03 17:37:02,466 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2025-03-03 17:37:02,466 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1098493120] [2025-03-03 17:37:02,466 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-03 17:37:02,467 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-03 17:37:02,467 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-03 17:37:02,468 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-03 17:37:02,468 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2025-03-03 17:37:02,468 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:37:02,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 17:37:02,566 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2025-03-03 17:37:02,567 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 17:37:02,567 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:37:02,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 17:37:02,568 INFO L225 Difference]: With dead ends: 15 [2025-03-03 17:37:02,568 INFO L226 Difference]: Without dead ends: 13 [2025-03-03 17:37:02,568 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 6.8s TimeCoverageRelationStatistics Valid=50, Invalid=106, Unknown=0, NotChecked=0, Total=156 [2025-03-03 17:37:02,568 INFO L435 NwaCegarLoop]: 4 mSDtfsCounter, 8 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 19 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 17:37:02,568 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 19 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 17:37:02,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2025-03-03 17:37:02,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 12. [2025-03-03 17:37:02,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 11 states have (on average 1.0909090909090908) internal successors, (12), 11 states have internal predecessors, (12), 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:37:02,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2025-03-03 17:37:02,570 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 8 [2025-03-03 17:37:02,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 17:37:02,570 INFO L471 AbstractCegarLoop]: Abstraction has 12 states and 12 transitions. [2025-03-03 17:37:02,570 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:37:02,570 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2025-03-03 17:37:02,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-03-03 17:37:02,570 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 17:37:02,570 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1] [2025-03-03 17:37:02,577 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:37:02,771 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:37:02,771 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 17:37:02,772 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 17:37:02,772 INFO L85 PathProgramCache]: Analyzing trace with hash -1791040441, now seen corresponding path program 2 times [2025-03-03 17:37:02,772 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 17:37:02,772 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1280825726] [2025-03-03 17:37:02,772 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-03 17:37:02,772 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 17:37:02,772 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 17:37:02,774 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:37:02,775 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:37:02,851 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 11 statements into 2 equivalence classes. [2025-03-03 17:37:02,870 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 11 of 11 statements. [2025-03-03 17:37:02,871 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-03 17:37:02,871 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 17:37:02,873 WARN L254 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 66 conjuncts are in the unsatisfiable core [2025-03-03 17:37:02,884 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 17:37:07,778 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 17:37:07,778 INFO L312 TraceCheckSpWp]: Computing backward predicates...