./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_arrays_vsaR_p12.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 48c9605d Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_arrays_vsaR_p12.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/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 d570de8a468b2e5d7e18a67170da2d8f06202ccdf10baa0799e3c0763140866e --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-08 00:15:48,287 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-08 00:15:48,324 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2025-02-08 00:15:48,327 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-08 00:15:48,327 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-08 00:15:48,340 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-08 00:15:48,341 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-08 00:15:48,341 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-08 00:15:48,341 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-08 00:15:48,341 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-08 00:15:48,341 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-08 00:15:48,341 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-08 00:15:48,342 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-08 00:15:48,342 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-08 00:15:48,342 INFO L153 SettingsManager]: * Use SBE=true [2025-02-08 00:15:48,342 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-08 00:15:48,342 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-08 00:15:48,342 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-08 00:15:48,342 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-08 00:15:48,342 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-08 00:15:48,342 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-08 00:15:48,342 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-08 00:15:48,343 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-08 00:15:48,343 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-08 00:15:48,343 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-08 00:15:48,343 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-08 00:15:48,343 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-08 00:15:48,343 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-08 00:15:48,343 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-08 00:15:48,343 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 00:15:48,343 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-08 00:15:48,343 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-08 00:15:48,344 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-08 00:15:48,344 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-08 00:15:48,344 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-08 00:15:48,344 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-08 00:15:48,344 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-08 00:15:48,344 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-08 00:15:48,344 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-08 00:15:48,344 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-08 00:15:48,344 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-jdk21/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 -> d570de8a468b2e5d7e18a67170da2d8f06202ccdf10baa0799e3c0763140866e [2025-02-08 00:15:48,591 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-08 00:15:48,597 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-08 00:15:48,599 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-08 00:15:48,599 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-08 00:15:48,599 INFO L274 PluginConnector]: CDTParser initialized [2025-02-08 00:15:48,600 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_arrays_vsaR_p12.c [2025-02-08 00:15:49,971 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/553ec6b17/46a2560c4a4a4e049eefe39382c688d4/FLAG51d011f61 [2025-02-08 00:15:50,316 INFO L384 CDTParser]: Found 1 translation units. [2025-02-08 00:15:50,322 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_arrays_vsaR_p12.c [2025-02-08 00:15:50,344 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/553ec6b17/46a2560c4a4a4e049eefe39382c688d4/FLAG51d011f61 [2025-02-08 00:15:50,364 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/553ec6b17/46a2560c4a4a4e049eefe39382c688d4 [2025-02-08 00:15:50,366 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-08 00:15:50,368 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-08 00:15:50,373 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-08 00:15:50,373 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-08 00:15:50,376 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-08 00:15:50,377 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 12:15:50" (1/1) ... [2025-02-08 00:15:50,381 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@45dd29d2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:15:50, skipping insertion in model container [2025-02-08 00:15:50,381 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 12:15:50" (1/1) ... [2025-02-08 00:15:50,415 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-08 00:15:50,505 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_arrays_vsaR_p12.c[1259,1272] [2025-02-08 00:15:50,708 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 00:15:50,721 INFO L200 MainTranslator]: Completed pre-run [2025-02-08 00:15:50,729 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_arrays_vsaR_p12.c[1259,1272] [2025-02-08 00:15:50,826 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 00:15:50,836 INFO L204 MainTranslator]: Completed translation [2025-02-08 00:15:50,837 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:15:50 WrapperNode [2025-02-08 00:15:50,837 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-08 00:15:50,837 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-08 00:15:50,838 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-08 00:15:50,838 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-08 00:15:50,842 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:15:50" (1/1) ... [2025-02-08 00:15:50,865 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:15:50" (1/1) ... [2025-02-08 00:15:51,091 INFO L138 Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 2238 [2025-02-08 00:15:51,092 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-08 00:15:51,093 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-08 00:15:51,093 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-08 00:15:51,093 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-08 00:15:51,099 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:15:50" (1/1) ... [2025-02-08 00:15:51,099 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:15:50" (1/1) ... [2025-02-08 00:15:51,153 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:15:50" (1/1) ... [2025-02-08 00:15:51,220 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-02-08 00:15:51,221 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:15:50" (1/1) ... [2025-02-08 00:15:51,221 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:15:50" (1/1) ... [2025-02-08 00:15:51,271 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:15:50" (1/1) ... [2025-02-08 00:15:51,282 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:15:50" (1/1) ... [2025-02-08 00:15:51,297 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:15:50" (1/1) ... [2025-02-08 00:15:51,309 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:15:50" (1/1) ... [2025-02-08 00:15:51,332 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-08 00:15:51,334 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-08 00:15:51,334 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-08 00:15:51,334 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-08 00:15:51,335 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:15:50" (1/1) ... [2025-02-08 00:15:51,338 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 00:15:51,347 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 00:15:51,362 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-08 00:15:51,369 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-08 00:15:51,387 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-08 00:15:51,388 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-08 00:15:51,388 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-08 00:15:51,388 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-08 00:15:51,572 INFO L257 CfgBuilder]: Building ICFG [2025-02-08 00:15:51,573 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-08 00:15:53,265 INFO L? ?]: Removed 1399 outVars from TransFormulas that were not future-live. [2025-02-08 00:15:53,266 INFO L308 CfgBuilder]: Performing block encoding [2025-02-08 00:15:53,357 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-08 00:15:53,357 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-08 00:15:53,358 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 12:15:53 BoogieIcfgContainer [2025-02-08 00:15:53,358 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-08 00:15:53,359 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-08 00:15:53,359 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-08 00:15:53,366 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-08 00:15:53,366 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.02 12:15:50" (1/3) ... [2025-02-08 00:15:53,366 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7e721dd5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 12:15:53, skipping insertion in model container [2025-02-08 00:15:53,366 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:15:50" (2/3) ... [2025-02-08 00:15:53,366 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7e721dd5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 12:15:53, skipping insertion in model container [2025-02-08 00:15:53,366 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 12:15:53" (3/3) ... [2025-02-08 00:15:53,367 INFO L128 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.vis_arrays_vsaR_p12.c [2025-02-08 00:15:53,380 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-08 00:15:53,382 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG btor2c-lazyMod.vis_arrays_vsaR_p12.c that has 1 procedures, 569 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-08 00:15:53,437 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 00:15:53,447 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;@62cbaedc, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 00:15:53,448 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-08 00:15:53,453 INFO L276 IsEmpty]: Start isEmpty. Operand has 569 states, 567 states have (on average 1.5008818342151675) internal successors, (851), 568 states have internal predecessors, (851), 0 states have call successors, (0), 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-02-08 00:15:53,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2025-02-08 00:15:53,460 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 00:15:53,460 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-08 00:15:53,461 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 00:15:53,464 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:15:53,465 INFO L85 PathProgramCache]: Analyzing trace with hash 1340588866, now seen corresponding path program 1 times [2025-02-08 00:15:53,470 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 00:15:53,470 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1234432313] [2025-02-08 00:15:53,470 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:15:53,470 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 00:15:53,548 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 60 statements into 1 equivalence classes. [2025-02-08 00:15:53,638 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 60 of 60 statements. [2025-02-08 00:15:53,639 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:15:53,639 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:15:54,121 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 00:15:54,123 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 00:15:54,123 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1234432313] [2025-02-08 00:15:54,123 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1234432313] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 00:15:54,124 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 00:15:54,124 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 00:15:54,125 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [486931108] [2025-02-08 00:15:54,126 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 00:15:54,128 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 00:15:54,128 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 00:15:54,141 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 00:15:54,142 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 00:15:54,144 INFO L87 Difference]: Start difference. First operand has 569 states, 567 states have (on average 1.5008818342151675) internal successors, (851), 568 states have internal predecessors, (851), 0 states have call successors, (0), 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 15.0) internal successors, (60), 4 states have internal predecessors, (60), 0 states have call successors, (0), 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-02-08 00:15:54,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 00:15:54,455 INFO L93 Difference]: Finished difference Result 1085 states and 1625 transitions. [2025-02-08 00:15:54,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 00:15:54,457 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 0 states have call successors, (0), 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 60 [2025-02-08 00:15:54,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 00:15:54,469 INFO L225 Difference]: With dead ends: 1085 [2025-02-08 00:15:54,469 INFO L226 Difference]: Without dead ends: 569 [2025-02-08 00:15:54,474 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-02-08 00:15:54,476 INFO L435 NwaCegarLoop]: 706 mSDtfsCounter, 0 mSDsluCounter, 1407 mSDsCounter, 0 mSdLazyCounter, 430 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2113 SdHoareTripleChecker+Invalid, 430 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 430 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-08 00:15:54,478 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2113 Invalid, 430 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 430 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-08 00:15:54,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 569 states. [2025-02-08 00:15:54,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 569 to 569. [2025-02-08 00:15:54,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 569 states, 568 states have (on average 1.4964788732394365) internal successors, (850), 568 states have internal predecessors, (850), 0 states have call successors, (0), 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-02-08 00:15:54,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 569 states to 569 states and 850 transitions. [2025-02-08 00:15:54,537 INFO L78 Accepts]: Start accepts. Automaton has 569 states and 850 transitions. Word has length 60 [2025-02-08 00:15:54,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 00:15:54,538 INFO L471 AbstractCegarLoop]: Abstraction has 569 states and 850 transitions. [2025-02-08 00:15:54,538 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 0 states have call successors, (0), 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-02-08 00:15:54,538 INFO L276 IsEmpty]: Start isEmpty. Operand 569 states and 850 transitions. [2025-02-08 00:15:54,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2025-02-08 00:15:54,539 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 00:15:54,539 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-08 00:15:54,540 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-08 00:15:54,540 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 00:15:54,540 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:15:54,540 INFO L85 PathProgramCache]: Analyzing trace with hash -1386738185, now seen corresponding path program 1 times [2025-02-08 00:15:54,540 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 00:15:54,540 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [487762569] [2025-02-08 00:15:54,540 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:15:54,540 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 00:15:54,569 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 61 statements into 1 equivalence classes. [2025-02-08 00:15:54,598 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 61 of 61 statements. [2025-02-08 00:15:54,599 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:15:54,599 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:15:54,752 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 00:15:54,753 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 00:15:54,753 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [487762569] [2025-02-08 00:15:54,753 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [487762569] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 00:15:54,753 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 00:15:54,753 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 00:15:54,754 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [176061967] [2025-02-08 00:15:54,754 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 00:15:54,754 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 00:15:54,755 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 00:15:54,755 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 00:15:54,755 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 00:15:54,756 INFO L87 Difference]: Start difference. First operand 569 states and 850 transitions. Second operand has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 0 states have call successors, (0), 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-02-08 00:15:55,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 00:15:55,021 INFO L93 Difference]: Finished difference Result 1087 states and 1624 transitions. [2025-02-08 00:15:55,021 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 00:15:55,021 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 0 states have call successors, (0), 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 61 [2025-02-08 00:15:55,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 00:15:55,024 INFO L225 Difference]: With dead ends: 1087 [2025-02-08 00:15:55,024 INFO L226 Difference]: Without dead ends: 571 [2025-02-08 00:15:55,025 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-02-08 00:15:55,026 INFO L435 NwaCegarLoop]: 706 mSDtfsCounter, 0 mSDsluCounter, 1404 mSDsCounter, 0 mSdLazyCounter, 433 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2110 SdHoareTripleChecker+Invalid, 433 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 433 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-08 00:15:55,026 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2110 Invalid, 433 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 433 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-08 00:15:55,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 571 states. [2025-02-08 00:15:55,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 571 to 571. [2025-02-08 00:15:55,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 571 states, 570 states have (on average 1.4947368421052631) internal successors, (852), 570 states have internal predecessors, (852), 0 states have call successors, (0), 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-02-08 00:15:55,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 571 states to 571 states and 852 transitions. [2025-02-08 00:15:55,040 INFO L78 Accepts]: Start accepts. Automaton has 571 states and 852 transitions. Word has length 61 [2025-02-08 00:15:55,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 00:15:55,040 INFO L471 AbstractCegarLoop]: Abstraction has 571 states and 852 transitions. [2025-02-08 00:15:55,041 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 0 states have call successors, (0), 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-02-08 00:15:55,041 INFO L276 IsEmpty]: Start isEmpty. Operand 571 states and 852 transitions. [2025-02-08 00:15:55,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2025-02-08 00:15:55,042 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 00:15:55,042 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-08 00:15:55,042 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-08 00:15:55,042 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 00:15:55,043 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:15:55,043 INFO L85 PathProgramCache]: Analyzing trace with hash 1892299229, now seen corresponding path program 1 times [2025-02-08 00:15:55,043 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 00:15:55,043 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [500157871] [2025-02-08 00:15:55,043 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:15:55,043 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 00:15:55,069 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-02-08 00:15:55,126 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-02-08 00:15:55,126 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:15:55,126 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:15:55,455 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 00:15:55,456 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 00:15:55,457 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [500157871] [2025-02-08 00:15:55,457 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [500157871] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 00:15:55,457 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 00:15:55,457 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-08 00:15:55,457 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1199989139] [2025-02-08 00:15:55,457 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 00:15:55,457 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-08 00:15:55,457 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 00:15:55,458 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-08 00:15:55,458 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-02-08 00:15:55,458 INFO L87 Difference]: Start difference. First operand 571 states and 852 transitions. Second operand has 7 states, 7 states have (on average 8.857142857142858) internal successors, (62), 6 states have internal predecessors, (62), 0 states have call successors, (0), 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-02-08 00:15:55,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 00:15:55,847 INFO L93 Difference]: Finished difference Result 1096 states and 1636 transitions. [2025-02-08 00:15:55,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-08 00:15:55,848 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.857142857142858) internal successors, (62), 6 states have internal predecessors, (62), 0 states have call successors, (0), 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 62 [2025-02-08 00:15:55,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 00:15:55,850 INFO L225 Difference]: With dead ends: 1096 [2025-02-08 00:15:55,850 INFO L226 Difference]: Without dead ends: 578 [2025-02-08 00:15:55,850 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2025-02-08 00:15:55,851 INFO L435 NwaCegarLoop]: 699 mSDtfsCounter, 804 mSDsluCounter, 2785 mSDsCounter, 0 mSdLazyCounter, 755 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 804 SdHoareTripleChecker+Valid, 3484 SdHoareTripleChecker+Invalid, 757 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 755 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-08 00:15:55,851 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [804 Valid, 3484 Invalid, 757 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 755 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-08 00:15:55,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 578 states. [2025-02-08 00:15:55,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 578 to 577. [2025-02-08 00:15:55,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 577 states, 576 states have (on average 1.4913194444444444) internal successors, (859), 576 states have internal predecessors, (859), 0 states have call successors, (0), 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-02-08 00:15:55,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 577 states to 577 states and 859 transitions. [2025-02-08 00:15:55,870 INFO L78 Accepts]: Start accepts. Automaton has 577 states and 859 transitions. Word has length 62 [2025-02-08 00:15:55,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 00:15:55,871 INFO L471 AbstractCegarLoop]: Abstraction has 577 states and 859 transitions. [2025-02-08 00:15:55,871 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.857142857142858) internal successors, (62), 6 states have internal predecessors, (62), 0 states have call successors, (0), 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-02-08 00:15:55,871 INFO L276 IsEmpty]: Start isEmpty. Operand 577 states and 859 transitions. [2025-02-08 00:15:55,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2025-02-08 00:15:55,873 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 00:15:55,874 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-08 00:15:55,874 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-08 00:15:55,874 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 00:15:55,874 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:15:55,875 INFO L85 PathProgramCache]: Analyzing trace with hash 1905777089, now seen corresponding path program 1 times [2025-02-08 00:15:55,875 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 00:15:55,875 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [740853144] [2025-02-08 00:15:55,875 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:15:55,875 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 00:15:55,898 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-02-08 00:15:55,913 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-02-08 00:15:55,913 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:15:55,913 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:15:56,041 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 00:15:56,042 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 00:15:56,043 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [740853144] [2025-02-08 00:15:56,043 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [740853144] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 00:15:56,043 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 00:15:56,043 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 00:15:56,043 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [953734862] [2025-02-08 00:15:56,043 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 00:15:56,043 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 00:15:56,043 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 00:15:56,044 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 00:15:56,044 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-08 00:15:56,044 INFO L87 Difference]: Start difference. First operand 577 states and 859 transitions. Second operand has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 0 states have call successors, (0), 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-02-08 00:15:56,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 00:15:56,311 INFO L93 Difference]: Finished difference Result 1115 states and 1660 transitions. [2025-02-08 00:15:56,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 00:15:56,312 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 0 states have call successors, (0), 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 63 [2025-02-08 00:15:56,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 00:15:56,314 INFO L225 Difference]: With dead ends: 1115 [2025-02-08 00:15:56,316 INFO L226 Difference]: Without dead ends: 591 [2025-02-08 00:15:56,317 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-08 00:15:56,319 INFO L435 NwaCegarLoop]: 705 mSDtfsCounter, 12 mSDsluCounter, 2105 mSDsCounter, 0 mSdLazyCounter, 581 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 2810 SdHoareTripleChecker+Invalid, 581 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 581 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-08 00:15:56,319 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 2810 Invalid, 581 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 581 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-08 00:15:56,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 591 states. [2025-02-08 00:15:56,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 591 to 591. [2025-02-08 00:15:56,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 591 states, 590 states have (on average 1.4898305084745762) internal successors, (879), 590 states have internal predecessors, (879), 0 states have call successors, (0), 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-02-08 00:15:56,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 591 states to 591 states and 879 transitions. [2025-02-08 00:15:56,334 INFO L78 Accepts]: Start accepts. Automaton has 591 states and 879 transitions. Word has length 63 [2025-02-08 00:15:56,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 00:15:56,335 INFO L471 AbstractCegarLoop]: Abstraction has 591 states and 879 transitions. [2025-02-08 00:15:56,335 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 0 states have call successors, (0), 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-02-08 00:15:56,335 INFO L276 IsEmpty]: Start isEmpty. Operand 591 states and 879 transitions. [2025-02-08 00:15:56,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2025-02-08 00:15:56,339 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 00:15:56,339 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-08 00:15:56,339 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-08 00:15:56,339 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 00:15:56,340 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:15:56,340 INFO L85 PathProgramCache]: Analyzing trace with hash -759992993, now seen corresponding path program 1 times [2025-02-08 00:15:56,340 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 00:15:56,340 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [167842512] [2025-02-08 00:15:56,340 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:15:56,340 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 00:15:56,367 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-02-08 00:15:56,406 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-02-08 00:15:56,409 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:15:56,410 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:15:56,919 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 00:15:56,919 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 00:15:56,919 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [167842512] [2025-02-08 00:15:56,919 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [167842512] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 00:15:56,919 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 00:15:56,919 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-08 00:15:56,919 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1064610221] [2025-02-08 00:15:56,920 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 00:15:56,920 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-08 00:15:56,920 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 00:15:56,920 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-08 00:15:56,923 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-02-08 00:15:56,924 INFO L87 Difference]: Start difference. First operand 591 states and 879 transitions. Second operand has 7 states, 7 states have (on average 9.0) internal successors, (63), 7 states have internal predecessors, (63), 0 states have call successors, (0), 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-02-08 00:15:57,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 00:15:57,346 INFO L93 Difference]: Finished difference Result 1191 states and 1770 transitions. [2025-02-08 00:15:57,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-08 00:15:57,347 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.0) internal successors, (63), 7 states have internal predecessors, (63), 0 states have call successors, (0), 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 63 [2025-02-08 00:15:57,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 00:15:57,349 INFO L225 Difference]: With dead ends: 1191 [2025-02-08 00:15:57,349 INFO L226 Difference]: Without dead ends: 653 [2025-02-08 00:15:57,350 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-02-08 00:15:57,350 INFO L435 NwaCegarLoop]: 700 mSDtfsCounter, 47 mSDsluCounter, 2842 mSDsCounter, 0 mSdLazyCounter, 760 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 3542 SdHoareTripleChecker+Invalid, 760 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 760 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-08 00:15:57,350 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 3542 Invalid, 760 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 760 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-08 00:15:57,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 653 states. [2025-02-08 00:15:57,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 653 to 649. [2025-02-08 00:15:57,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 649 states, 648 states have (on average 1.4876543209876543) internal successors, (964), 648 states have internal predecessors, (964), 0 states have call successors, (0), 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-02-08 00:15:57,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 649 states to 649 states and 964 transitions. [2025-02-08 00:15:57,361 INFO L78 Accepts]: Start accepts. Automaton has 649 states and 964 transitions. Word has length 63 [2025-02-08 00:15:57,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 00:15:57,361 INFO L471 AbstractCegarLoop]: Abstraction has 649 states and 964 transitions. [2025-02-08 00:15:57,361 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.0) internal successors, (63), 7 states have internal predecessors, (63), 0 states have call successors, (0), 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-02-08 00:15:57,361 INFO L276 IsEmpty]: Start isEmpty. Operand 649 states and 964 transitions. [2025-02-08 00:15:57,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2025-02-08 00:15:57,362 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 00:15:57,362 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-08 00:15:57,362 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-08 00:15:57,362 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 00:15:57,362 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:15:57,362 INFO L85 PathProgramCache]: Analyzing trace with hash 420097244, now seen corresponding path program 1 times [2025-02-08 00:15:57,363 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 00:15:57,363 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [24653355] [2025-02-08 00:15:57,363 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:15:57,363 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 00:15:57,382 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-02-08 00:15:57,401 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-02-08 00:15:57,401 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:15:57,402 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:15:57,774 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 00:15:57,775 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 00:15:57,775 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [24653355] [2025-02-08 00:15:57,775 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [24653355] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 00:15:57,775 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 00:15:57,775 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-02-08 00:15:57,775 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [471548655] [2025-02-08 00:15:57,775 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 00:15:57,776 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-08 00:15:57,776 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 00:15:57,776 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-08 00:15:57,776 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2025-02-08 00:15:57,777 INFO L87 Difference]: Start difference. First operand 649 states and 964 transitions. Second operand has 10 states, 10 states have (on average 6.3) internal successors, (63), 9 states have internal predecessors, (63), 0 states have call successors, (0), 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-02-08 00:15:58,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 00:15:58,602 INFO L93 Difference]: Finished difference Result 1557 states and 2308 transitions. [2025-02-08 00:15:58,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-08 00:15:58,603 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.3) internal successors, (63), 9 states have internal predecessors, (63), 0 states have call successors, (0), 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 63 [2025-02-08 00:15:58,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 00:15:58,606 INFO L225 Difference]: With dead ends: 1557 [2025-02-08 00:15:58,606 INFO L226 Difference]: Without dead ends: 961 [2025-02-08 00:15:58,607 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=215, Unknown=0, NotChecked=0, Total=272 [2025-02-08 00:15:58,608 INFO L435 NwaCegarLoop]: 681 mSDtfsCounter, 1669 mSDsluCounter, 4757 mSDsCounter, 0 mSdLazyCounter, 1357 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1669 SdHoareTripleChecker+Valid, 5438 SdHoareTripleChecker+Invalid, 1360 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 1357 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-02-08 00:15:58,608 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1669 Valid, 5438 Invalid, 1360 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 1357 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-02-08 00:15:58,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 961 states. [2025-02-08 00:15:58,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 961 to 718. [2025-02-08 00:15:58,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 718 states, 717 states have (on average 1.483960948396095) internal successors, (1064), 717 states have internal predecessors, (1064), 0 states have call successors, (0), 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-02-08 00:15:58,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 718 states to 718 states and 1064 transitions. [2025-02-08 00:15:58,625 INFO L78 Accepts]: Start accepts. Automaton has 718 states and 1064 transitions. Word has length 63 [2025-02-08 00:15:58,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 00:15:58,626 INFO L471 AbstractCegarLoop]: Abstraction has 718 states and 1064 transitions. [2025-02-08 00:15:58,626 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.3) internal successors, (63), 9 states have internal predecessors, (63), 0 states have call successors, (0), 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-02-08 00:15:58,626 INFO L276 IsEmpty]: Start isEmpty. Operand 718 states and 1064 transitions. [2025-02-08 00:15:58,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2025-02-08 00:15:58,626 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 00:15:58,627 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-08 00:15:58,627 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-08 00:15:58,627 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 00:15:58,627 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:15:58,627 INFO L85 PathProgramCache]: Analyzing trace with hash -265905788, now seen corresponding path program 1 times [2025-02-08 00:15:58,627 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 00:15:58,628 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [191333036] [2025-02-08 00:15:58,628 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:15:58,628 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 00:15:58,646 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-02-08 00:15:58,665 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-02-08 00:15:58,665 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:15:58,665 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:15:58,776 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 00:15:58,777 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 00:15:58,777 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [191333036] [2025-02-08 00:15:58,777 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [191333036] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 00:15:58,777 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 00:15:58,777 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 00:15:58,777 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1595737750] [2025-02-08 00:15:58,778 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 00:15:58,778 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 00:15:58,778 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 00:15:58,778 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 00:15:58,778 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-08 00:15:58,778 INFO L87 Difference]: Start difference. First operand 718 states and 1064 transitions. Second operand has 5 states, 5 states have (on average 12.8) internal successors, (64), 4 states have internal predecessors, (64), 0 states have call successors, (0), 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-02-08 00:15:59,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 00:15:59,112 INFO L93 Difference]: Finished difference Result 1489 states and 2207 transitions. [2025-02-08 00:15:59,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 00:15:59,112 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.8) internal successors, (64), 4 states have internal predecessors, (64), 0 states have call successors, (0), 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 64 [2025-02-08 00:15:59,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 00:15:59,115 INFO L225 Difference]: With dead ends: 1489 [2025-02-08 00:15:59,115 INFO L226 Difference]: Without dead ends: 892 [2025-02-08 00:15:59,116 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 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-02-08 00:15:59,117 INFO L435 NwaCegarLoop]: 691 mSDtfsCounter, 1475 mSDsluCounter, 1377 mSDsCounter, 0 mSdLazyCounter, 475 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1475 SdHoareTripleChecker+Valid, 2068 SdHoareTripleChecker+Invalid, 475 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 475 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-08 00:15:59,118 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1475 Valid, 2068 Invalid, 475 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 475 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-08 00:15:59,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 892 states. [2025-02-08 00:15:59,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 892 to 717. [2025-02-08 00:15:59,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 717 states, 716 states have (on average 1.4832402234636872) internal successors, (1062), 716 states have internal predecessors, (1062), 0 states have call successors, (0), 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-02-08 00:15:59,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 717 states to 717 states and 1062 transitions. [2025-02-08 00:15:59,132 INFO L78 Accepts]: Start accepts. Automaton has 717 states and 1062 transitions. Word has length 64 [2025-02-08 00:15:59,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 00:15:59,133 INFO L471 AbstractCegarLoop]: Abstraction has 717 states and 1062 transitions. [2025-02-08 00:15:59,133 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.8) internal successors, (64), 4 states have internal predecessors, (64), 0 states have call successors, (0), 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-02-08 00:15:59,133 INFO L276 IsEmpty]: Start isEmpty. Operand 717 states and 1062 transitions. [2025-02-08 00:15:59,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2025-02-08 00:15:59,134 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 00:15:59,134 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-08 00:15:59,134 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-08 00:15:59,134 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 00:15:59,135 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:15:59,135 INFO L85 PathProgramCache]: Analyzing trace with hash -581597733, now seen corresponding path program 1 times [2025-02-08 00:15:59,135 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 00:15:59,136 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [808046289] [2025-02-08 00:15:59,136 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:15:59,136 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 00:15:59,155 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-02-08 00:15:59,208 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-02-08 00:15:59,208 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:15:59,208 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:16:00,144 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 00:16:00,145 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 00:16:00,145 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [808046289] [2025-02-08 00:16:00,146 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [808046289] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 00:16:00,146 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 00:16:00,146 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2025-02-08 00:16:00,146 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [400739578] [2025-02-08 00:16:00,146 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 00:16:00,146 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-02-08 00:16:00,146 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 00:16:00,146 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-02-08 00:16:00,147 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=336, Unknown=0, NotChecked=0, Total=380 [2025-02-08 00:16:00,147 INFO L87 Difference]: Start difference. First operand 717 states and 1062 transitions. Second operand has 20 states, 20 states have (on average 3.3) internal successors, (66), 19 states have internal predecessors, (66), 0 states have call successors, (0), 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-02-08 00:16:01,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 00:16:01,751 INFO L93 Difference]: Finished difference Result 1530 states and 2267 transitions. [2025-02-08 00:16:01,751 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-02-08 00:16:01,752 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 3.3) internal successors, (66), 19 states have internal predecessors, (66), 0 states have call successors, (0), 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 66 [2025-02-08 00:16:01,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 00:16:01,754 INFO L225 Difference]: With dead ends: 1530 [2025-02-08 00:16:01,754 INFO L226 Difference]: Without dead ends: 932 [2025-02-08 00:16:01,757 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 159 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=159, Invalid=1101, Unknown=0, NotChecked=0, Total=1260 [2025-02-08 00:16:01,757 INFO L435 NwaCegarLoop]: 684 mSDtfsCounter, 1658 mSDsluCounter, 8323 mSDsCounter, 0 mSdLazyCounter, 2521 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1658 SdHoareTripleChecker+Valid, 9007 SdHoareTripleChecker+Invalid, 2523 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 2521 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-02-08 00:16:01,757 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1658 Valid, 9007 Invalid, 2523 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 2521 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-02-08 00:16:01,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 932 states. [2025-02-08 00:16:01,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 932 to 753. [2025-02-08 00:16:01,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 753 states, 752 states have (on average 1.4827127659574468) internal successors, (1115), 752 states have internal predecessors, (1115), 0 states have call successors, (0), 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-02-08 00:16:01,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 753 states to 753 states and 1115 transitions. [2025-02-08 00:16:01,768 INFO L78 Accepts]: Start accepts. Automaton has 753 states and 1115 transitions. Word has length 66 [2025-02-08 00:16:01,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 00:16:01,769 INFO L471 AbstractCegarLoop]: Abstraction has 753 states and 1115 transitions. [2025-02-08 00:16:01,769 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 3.3) internal successors, (66), 19 states have internal predecessors, (66), 0 states have call successors, (0), 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-02-08 00:16:01,769 INFO L276 IsEmpty]: Start isEmpty. Operand 753 states and 1115 transitions. [2025-02-08 00:16:01,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2025-02-08 00:16:01,769 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 00:16:01,769 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-08 00:16:01,770 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-08 00:16:01,771 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 00:16:01,772 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:16:01,772 INFO L85 PathProgramCache]: Analyzing trace with hash -1094044503, now seen corresponding path program 1 times [2025-02-08 00:16:01,772 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 00:16:01,772 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2049728925] [2025-02-08 00:16:01,772 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:16:01,772 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 00:16:01,791 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-02-08 00:16:01,831 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-02-08 00:16:01,833 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:16:01,833 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:16:02,223 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 00:16:02,224 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 00:16:02,224 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2049728925] [2025-02-08 00:16:02,224 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2049728925] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 00:16:02,224 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 00:16:02,224 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-02-08 00:16:02,224 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [686832477] [2025-02-08 00:16:02,224 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 00:16:02,225 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-02-08 00:16:02,225 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 00:16:02,225 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-02-08 00:16:02,225 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2025-02-08 00:16:02,226 INFO L87 Difference]: Start difference. First operand 753 states and 1115 transitions. Second operand has 12 states, 12 states have (on average 5.583333333333333) internal successors, (67), 12 states have internal predecessors, (67), 0 states have call successors, (0), 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-02-08 00:16:02,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 00:16:02,954 INFO L93 Difference]: Finished difference Result 1439 states and 2131 transitions. [2025-02-08 00:16:02,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-02-08 00:16:02,955 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 5.583333333333333) internal successors, (67), 12 states have internal predecessors, (67), 0 states have call successors, (0), 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 67 [2025-02-08 00:16:02,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 00:16:02,957 INFO L225 Difference]: With dead ends: 1439 [2025-02-08 00:16:02,957 INFO L226 Difference]: Without dead ends: 837 [2025-02-08 00:16:02,958 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2025-02-08 00:16:02,958 INFO L435 NwaCegarLoop]: 690 mSDtfsCounter, 16 mSDsluCounter, 6882 mSDsCounter, 0 mSdLazyCounter, 1751 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 7572 SdHoareTripleChecker+Invalid, 1754 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 1751 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-02-08 00:16:02,959 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 7572 Invalid, 1754 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 1751 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-02-08 00:16:02,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 837 states. [2025-02-08 00:16:02,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 837 to 819. [2025-02-08 00:16:02,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 819 states, 818 states have (on average 1.482885085574572) internal successors, (1213), 818 states have internal predecessors, (1213), 0 states have call successors, (0), 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-02-08 00:16:02,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 819 states to 819 states and 1213 transitions. [2025-02-08 00:16:02,971 INFO L78 Accepts]: Start accepts. Automaton has 819 states and 1213 transitions. Word has length 67 [2025-02-08 00:16:02,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 00:16:02,972 INFO L471 AbstractCegarLoop]: Abstraction has 819 states and 1213 transitions. [2025-02-08 00:16:02,972 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 5.583333333333333) internal successors, (67), 12 states have internal predecessors, (67), 0 states have call successors, (0), 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-02-08 00:16:02,972 INFO L276 IsEmpty]: Start isEmpty. Operand 819 states and 1213 transitions. [2025-02-08 00:16:02,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2025-02-08 00:16:02,975 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 00:16:02,975 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-08 00:16:02,975 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-08 00:16:02,975 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 00:16:02,978 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:16:02,978 INFO L85 PathProgramCache]: Analyzing trace with hash -141387487, now seen corresponding path program 1 times [2025-02-08 00:16:02,978 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 00:16:02,978 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1772977090] [2025-02-08 00:16:02,978 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:16:02,978 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 00:16:02,999 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-02-08 00:16:03,033 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-02-08 00:16:03,034 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:16:03,034 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 00:16:03,034 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 00:16:03,042 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-02-08 00:16:03,082 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-02-08 00:16:03,083 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:16:03,083 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 00:16:03,129 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 00:16:03,129 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-08 00:16:03,130 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-02-08 00:16:03,132 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-08 00:16:03,134 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 00:16:03,186 WARN L310 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2025-02-08 00:16:03,207 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-08 00:16:03,212 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.02 12:16:03 BoogieIcfgContainer [2025-02-08 00:16:03,212 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-08 00:16:03,212 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-08 00:16:03,214 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-08 00:16:03,214 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-08 00:16:03,214 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 12:15:53" (3/4) ... [2025-02-08 00:16:03,216 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-02-08 00:16:03,217 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-08 00:16:03,217 INFO L158 Benchmark]: Toolchain (without parser) took 12849.12ms. Allocated memory was 167.8MB in the beginning and 570.4MB in the end (delta: 402.7MB). Free memory was 122.0MB in the beginning and 196.7MB in the end (delta: -74.7MB). Peak memory consumption was 332.1MB. Max. memory is 16.1GB. [2025-02-08 00:16:03,217 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 201.3MB. Free memory is still 119.2MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 00:16:03,218 INFO L158 Benchmark]: CACSL2BoogieTranslator took 463.92ms. Allocated memory is still 167.8MB. Free memory was 122.0MB in the beginning and 77.4MB in the end (delta: 44.6MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. [2025-02-08 00:16:03,218 INFO L158 Benchmark]: Boogie Procedure Inliner took 254.41ms. Allocated memory was 167.8MB in the beginning and 176.2MB in the end (delta: 8.4MB). Free memory was 77.4MB in the beginning and 98.9MB in the end (delta: -21.4MB). Peak memory consumption was 79.4MB. Max. memory is 16.1GB. [2025-02-08 00:16:03,218 INFO L158 Benchmark]: Boogie Preprocessor took 239.92ms. Allocated memory is still 176.2MB. Free memory was 98.9MB in the beginning and 82.1MB in the end (delta: 16.8MB). Peak memory consumption was 24.7MB. Max. memory is 16.1GB. [2025-02-08 00:16:03,218 INFO L158 Benchmark]: IcfgBuilder took 2023.91ms. Allocated memory was 176.2MB in the beginning and 469.8MB in the end (delta: 293.6MB). Free memory was 82.1MB in the beginning and 163.4MB in the end (delta: -81.4MB). Peak memory consumption was 223.5MB. Max. memory is 16.1GB. [2025-02-08 00:16:03,218 INFO L158 Benchmark]: TraceAbstraction took 9852.59ms. Allocated memory was 469.8MB in the beginning and 570.4MB in the end (delta: 100.7MB). Free memory was 162.6MB in the beginning and 196.7MB in the end (delta: -34.1MB). Peak memory consumption was 61.5MB. Max. memory is 16.1GB. [2025-02-08 00:16:03,218 INFO L158 Benchmark]: Witness Printer took 4.40ms. Allocated memory is still 570.4MB. Free memory was 196.7MB in the beginning and 196.7MB in the end (delta: 48.3kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-08 00:16:03,219 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.12ms. Allocated memory is still 201.3MB. Free memory is still 119.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 463.92ms. Allocated memory is still 167.8MB. Free memory was 122.0MB in the beginning and 77.4MB in the end (delta: 44.6MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 254.41ms. Allocated memory was 167.8MB in the beginning and 176.2MB in the end (delta: 8.4MB). Free memory was 77.4MB in the beginning and 98.9MB in the end (delta: -21.4MB). Peak memory consumption was 79.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 239.92ms. Allocated memory is still 176.2MB. Free memory was 98.9MB in the beginning and 82.1MB in the end (delta: 16.8MB). Peak memory consumption was 24.7MB. Max. memory is 16.1GB. * IcfgBuilder took 2023.91ms. Allocated memory was 176.2MB in the beginning and 469.8MB in the end (delta: 293.6MB). Free memory was 82.1MB in the beginning and 163.4MB in the end (delta: -81.4MB). Peak memory consumption was 223.5MB. Max. memory is 16.1GB. * TraceAbstraction took 9852.59ms. Allocated memory was 469.8MB in the beginning and 570.4MB in the end (delta: 100.7MB). Free memory was 162.6MB in the beginning and 196.7MB in the end (delta: -34.1MB). Peak memory consumption was 61.5MB. Max. memory is 16.1GB. * Witness Printer took 4.40ms. Allocated memory is still 570.4MB. Free memory was 196.7MB in the beginning and 196.7MB in the end (delta: 48.3kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 21]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of bitwiseOr at line 205, overapproximation of bitwiseAnd at line 210. 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_3 mask_SORT_3 = (SORT_3)-1 >> (sizeof(SORT_3) * 8 - 5); [L30] const SORT_3 msb_SORT_3 = (SORT_3)1 << (5 - 1); [L32] const SORT_5 mask_SORT_5 = (SORT_5)-1 >> (sizeof(SORT_5) * 8 - 12); [L33] const SORT_5 msb_SORT_5 = (SORT_5)1 << (12 - 1); [L35] const SORT_7 mask_SORT_7 = (SORT_7)-1 >> (sizeof(SORT_7) * 8 - 3); [L36] const SORT_7 msb_SORT_7 = (SORT_7)1 << (3 - 1); [L38] const SORT_26 mask_SORT_26 = (SORT_26)-1 >> (sizeof(SORT_26) * 8 - 2); [L39] const SORT_26 msb_SORT_26 = (SORT_26)1 << (2 - 1); [L41] const SORT_108 mask_SORT_108 = (SORT_108)-1 >> (sizeof(SORT_108) * 8 - 4); [L42] const SORT_108 msb_SORT_108 = (SORT_108)1 << (4 - 1); [L44] const SORT_165 mask_SORT_165 = (SORT_165)-1 >> (sizeof(SORT_165) * 8 - 32); [L45] const SORT_165 msb_SORT_165 = (SORT_165)1 << (32 - 1); [L47] const SORT_7 var_8 = 0; [L48] const SORT_3 var_15 = 0; [L49] const SORT_1 var_41 = 1; [L50] const SORT_1 var_51 = 0; [L51] const SORT_5 var_54 = 0; [L52] const SORT_7 var_68 = 2; [L53] const SORT_7 var_72 = 1; [L54] const SORT_7 var_77 = 4; [L55] const SORT_7 var_79 = 5; [L56] const SORT_7 var_83 = 3; [L57] const SORT_3 var_95 = 2; [L58] const SORT_7 var_125 = 7; [L59] const SORT_7 var_130 = 6; [L60] const SORT_165 var_167 = 0; [L61] const SORT_3 var_197 = 31; [L63] SORT_1 input_2; [L64] SORT_3 input_4; [L65] SORT_5 input_6; [L66] SORT_3 input_186; [L67] SORT_3 input_187; [L68] SORT_3 input_188; [L69] SORT_3 input_196; [L70] SORT_3 input_206; [L71] SORT_3 input_207; [L72] SORT_3 input_208; [L73] SORT_3 input_211; [L74] SORT_3 input_230; [L75] SORT_3 input_231; [L76] SORT_3 input_232; [L77] SORT_3 input_235; [L78] SORT_3 input_237; [L79] SORT_26 input_251; [L80] SORT_26 input_252; [L81] SORT_26 input_253; [L83] EXPR __VERIFIER_nondet_uchar() & mask_SORT_7 VAL [mask_SORT_108=15, mask_SORT_1=1, mask_SORT_26=3, mask_SORT_3=31, mask_SORT_5=4095, mask_SORT_7=7, var_125=7, var_130=6, var_15=0, var_167=0, var_197=31, var_41=1, var_51=0, var_54=0, var_68=2, var_72=1, var_77=4, var_79=5, var_83=3, var_8=0, var_95=2] [L83] SORT_7 state_9 = __VERIFIER_nondet_uchar() & mask_SORT_7; [L84] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_108=15, mask_SORT_1=1, mask_SORT_26=3, mask_SORT_3=31, mask_SORT_5=4095, mask_SORT_7=7, var_125=7, var_130=6, var_15=0, var_167=0, var_197=31, var_41=1, var_51=0, var_54=0, var_68=2, var_72=1, var_77=4, var_79=5, var_83=3, var_8=0, var_95=2] [L84] SORT_3 state_16 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L85] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_108=15, mask_SORT_1=1, mask_SORT_26=3, mask_SORT_3=31, mask_SORT_5=4095, mask_SORT_7=7, var_125=7, var_130=6, var_15=0, var_167=0, var_197=31, var_41=1, var_51=0, var_54=0, var_68=2, var_72=1, var_77=4, var_79=5, var_83=3, var_8=0, var_95=2] [L85] SORT_3 state_19 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L86] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_108=15, mask_SORT_1=1, mask_SORT_26=3, mask_SORT_3=31, mask_SORT_5=4095, mask_SORT_7=7, var_125=7, var_130=6, var_15=0, var_167=0, var_197=31, var_41=1, var_51=0, var_54=0, var_68=2, var_72=1, var_77=4, var_79=5, var_83=3, var_8=0, var_95=2] [L86] SORT_3 state_45 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L87] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_108=15, mask_SORT_1=1, mask_SORT_26=3, mask_SORT_3=31, mask_SORT_5=4095, mask_SORT_7=7, var_125=7, var_130=6, var_15=0, var_167=0, var_197=31, var_41=1, var_51=0, var_54=0, var_68=2, var_72=1, var_77=4, var_79=5, var_83=3, var_8=0, var_95=2] [L87] SORT_3 state_47 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L88] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_108=15, mask_SORT_1=1, mask_SORT_26=3, mask_SORT_3=31, mask_SORT_5=4095, mask_SORT_7=7, var_125=7, var_130=6, var_15=0, var_167=0, var_197=31, var_41=1, var_51=0, var_54=0, var_68=2, var_72=1, var_77=4, var_79=5, var_83=3, var_8=0, var_95=2] [L88] SORT_3 state_49 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L89] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_108=15, mask_SORT_1=1, mask_SORT_26=3, mask_SORT_3=31, mask_SORT_5=4095, mask_SORT_7=7, var_125=7, var_130=6, var_15=0, var_167=0, var_197=31, var_41=1, var_51=0, var_54=0, var_68=2, var_72=1, var_77=4, var_79=5, var_83=3, var_8=0, var_95=2] [L89] SORT_1 state_52 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L90] EXPR __VERIFIER_nondet_ushort() & mask_SORT_5 VAL [mask_SORT_108=15, mask_SORT_1=1, mask_SORT_26=3, mask_SORT_3=31, mask_SORT_7=7, var_125=7, var_130=6, var_15=0, var_167=0, var_197=31, var_41=1, var_51=0, var_54=0, var_68=2, var_72=1, var_77=4, var_79=5, var_83=3, var_8=0, var_95=2] [L90] SORT_5 state_55 = __VERIFIER_nondet_ushort() & mask_SORT_5; [L91] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_108=15, mask_SORT_1=1, mask_SORT_26=3, mask_SORT_3=31, mask_SORT_7=7, var_125=7, var_130=6, var_15=0, var_167=0, var_197=31, var_41=1, var_51=0, var_54=0, var_68=2, var_72=1, var_77=4, var_79=5, var_83=3, var_8=0, var_95=2] [L91] SORT_3 state_57 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L92] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_108=15, mask_SORT_1=1, mask_SORT_26=3, mask_SORT_3=31, mask_SORT_7=7, var_125=7, var_130=6, var_15=0, var_167=0, var_197=31, var_41=1, var_51=0, var_54=0, var_68=2, var_72=1, var_77=4, var_79=5, var_83=3, var_8=0, var_95=2] [L92] SORT_3 state_59 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L93] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_108=15, mask_SORT_1=1, mask_SORT_26=3, mask_SORT_3=31, mask_SORT_7=7, var_125=7, var_130=6, var_15=0, var_167=0, var_197=31, var_41=1, var_51=0, var_54=0, var_68=2, var_72=1, var_77=4, var_79=5, var_83=3, var_8=0, var_95=2] [L93] SORT_3 state_61 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L94] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_108=15, mask_SORT_1=1, mask_SORT_26=3, mask_SORT_3=31, mask_SORT_7=7, var_125=7, var_130=6, var_15=0, var_167=0, var_197=31, var_41=1, var_51=0, var_54=0, var_68=2, var_72=1, var_77=4, var_79=5, var_83=3, var_8=0, var_95=2] [L94] SORT_3 state_63 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L95] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_108=15, mask_SORT_1=1, mask_SORT_26=3, mask_SORT_3=31, mask_SORT_7=7, var_125=7, var_130=6, var_15=0, var_167=0, var_197=31, var_41=1, var_51=0, var_54=0, var_68=2, var_72=1, var_77=4, var_79=5, var_83=3, var_8=0, var_95=2] [L95] SORT_3 state_65 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L97] SORT_7 init_10_arg_1 = var_8; [L98] state_9 = init_10_arg_1 [L99] SORT_3 init_17_arg_1 = var_15; [L100] state_16 = init_17_arg_1 [L101] SORT_3 init_20_arg_1 = var_15; [L102] state_19 = init_20_arg_1 [L103] SORT_3 init_46_arg_1 = var_15; [L104] state_45 = init_46_arg_1 [L105] SORT_3 init_48_arg_1 = var_15; [L106] state_47 = init_48_arg_1 [L107] SORT_3 init_50_arg_1 = var_15; [L108] state_49 = init_50_arg_1 [L109] SORT_1 init_53_arg_1 = var_51; [L110] state_52 = init_53_arg_1 [L111] SORT_5 init_56_arg_1 = var_54; [L112] state_55 = init_56_arg_1 [L113] SORT_3 init_58_arg_1 = var_15; [L114] state_57 = init_58_arg_1 [L115] SORT_3 init_60_arg_1 = var_15; [L116] state_59 = init_60_arg_1 [L117] SORT_3 init_62_arg_1 = var_15; [L118] state_61 = init_62_arg_1 [L119] SORT_3 init_64_arg_1 = var_15; [L120] state_63 = init_64_arg_1 [L121] SORT_3 init_66_arg_1 = var_15; [L122] state_65 = init_66_arg_1 VAL [mask_SORT_108=15, mask_SORT_1=1, mask_SORT_26=3, mask_SORT_3=31, mask_SORT_7=7, state_16=0, state_19=0, state_45=0, state_47=0, state_49=0, state_52=0, state_55=0, state_57=0, state_59=0, state_61=0, state_63=0, state_65=0, state_9=0, var_125=7, var_130=6, var_15=0, var_167=0, var_197=31, var_41=1, var_51=0, var_68=2, var_72=1, var_77=4, var_79=5, var_83=3, var_8=0, var_95=2] [L125] input_2 = __VERIFIER_nondet_uchar() [L126] input_4 = __VERIFIER_nondet_uchar() [L127] input_6 = __VERIFIER_nondet_ushort() [L128] input_186 = __VERIFIER_nondet_uchar() [L129] input_187 = __VERIFIER_nondet_uchar() [L130] input_188 = __VERIFIER_nondet_uchar() [L131] input_196 = __VERIFIER_nondet_uchar() [L132] input_206 = __VERIFIER_nondet_uchar() [L133] input_207 = __VERIFIER_nondet_uchar() [L134] input_208 = __VERIFIER_nondet_uchar() [L135] input_211 = __VERIFIER_nondet_uchar() [L136] input_230 = __VERIFIER_nondet_uchar() [L137] input_231 = __VERIFIER_nondet_uchar() [L138] input_232 = __VERIFIER_nondet_uchar() [L139] input_235 = __VERIFIER_nondet_uchar() [L140] input_237 = __VERIFIER_nondet_uchar() [L141] input_251 = __VERIFIER_nondet_uchar() [L142] input_252 = __VERIFIER_nondet_uchar() [L143] input_253 = __VERIFIER_nondet_uchar() [L146] SORT_7 var_11_arg_0 = state_9; [L147] SORT_1 var_11 = var_11_arg_0 >> 0; [L148] SORT_7 var_12_arg_0 = state_9; [L149] SORT_1 var_12 = var_12_arg_0 >> 1; [L150] SORT_1 var_13_arg_0 = var_11; [L151] SORT_1 var_13_arg_1 = var_12; VAL [mask_SORT_108=15, mask_SORT_1=1, mask_SORT_26=3, mask_SORT_3=31, mask_SORT_7=7, state_16=0, state_19=0, state_45=0, state_47=0, state_49=0, state_52=0, state_55=0, state_57=0, state_59=0, state_61=0, state_63=0, state_65=0, state_9=0, var_125=7, var_130=6, var_13_arg_0=0, var_13_arg_1=0, var_15=0, var_167=0, var_197=31, var_41=1, var_51=0, var_68=2, var_72=1, var_77=4, var_79=5, var_83=3, var_8=0, var_95=2] [L152] EXPR var_13_arg_0 | var_13_arg_1 VAL [mask_SORT_108=15, mask_SORT_1=1, mask_SORT_26=3, mask_SORT_3=31, mask_SORT_7=7, state_16=0, state_19=0, state_45=0, state_47=0, state_49=0, state_52=0, state_55=0, state_57=0, state_59=0, state_61=0, state_63=0, state_65=0, state_9=0, var_125=7, var_130=6, var_15=0, var_167=0, var_197=31, var_41=1, var_51=0, var_68=2, var_72=1, var_77=4, var_79=5, var_83=3, var_8=0, var_95=2] [L152] SORT_1 var_13 = var_13_arg_0 | var_13_arg_1; [L153] SORT_1 var_14_arg_0 = var_13; [L154] SORT_1 var_14 = ~var_14_arg_0; [L155] SORT_3 var_18_arg_0 = state_16; [L156] SORT_1 var_18 = var_18_arg_0 >> 1; [L157] SORT_3 var_21_arg_0 = state_19; [L158] SORT_7 var_21 = var_21_arg_0 >> 2; VAL [mask_SORT_108=15, mask_SORT_1=1, mask_SORT_26=3, mask_SORT_3=31, mask_SORT_7=7, state_16=0, state_19=0, state_45=0, state_47=0, state_49=0, state_52=0, state_55=0, state_57=0, state_59=0, state_61=0, state_63=0, state_65=0, state_9=0, var_125=7, var_130=6, var_14=-1, var_15=0, var_167=0, var_18=0, var_197=31, var_21=0, var_41=1, var_51=0, var_68=2, var_72=1, var_77=4, var_79=5, var_83=3, var_8=0, var_95=2] [L159] EXPR var_21 & mask_SORT_7 VAL [mask_SORT_108=15, mask_SORT_1=1, mask_SORT_26=3, mask_SORT_3=31, mask_SORT_7=7, state_16=0, state_19=0, state_45=0, state_47=0, state_49=0, state_52=0, state_55=0, state_57=0, state_59=0, state_61=0, state_63=0, state_65=0, state_9=0, var_125=7, var_130=6, var_14=-1, var_15=0, var_167=0, var_18=0, var_197=31, var_41=1, var_51=0, var_68=2, var_72=1, var_77=4, var_79=5, var_83=3, var_8=0, var_95=2] [L159] var_21 = var_21 & mask_SORT_7 [L160] SORT_3 var_22_arg_0 = state_16; [L161] SORT_7 var_22 = var_22_arg_0 >> 2; VAL [mask_SORT_108=15, mask_SORT_1=1, mask_SORT_26=3, mask_SORT_3=31, mask_SORT_7=7, state_16=0, state_19=0, state_45=0, state_47=0, state_49=0, state_52=0, state_55=0, state_57=0, state_59=0, state_61=0, state_63=0, state_65=0, state_9=0, var_125=7, var_130=6, var_14=-1, var_15=0, var_167=0, var_18=0, var_197=31, var_21=0, var_22=0, var_41=1, var_51=0, var_68=2, var_72=1, var_77=4, var_79=5, var_83=3, var_8=0, var_95=2] [L162] EXPR var_22 & mask_SORT_7 VAL [mask_SORT_108=15, mask_SORT_1=1, mask_SORT_26=3, mask_SORT_3=31, mask_SORT_7=7, state_16=0, state_19=0, state_45=0, state_47=0, state_49=0, state_52=0, state_55=0, state_57=0, state_59=0, state_61=0, state_63=0, state_65=0, state_9=0, var_125=7, var_130=6, var_14=-1, var_15=0, var_167=0, var_18=0, var_197=31, var_21=0, var_41=1, var_51=0, var_68=2, var_72=1, var_77=4, var_79=5, var_83=3, var_8=0, var_95=2] [L162] var_22 = var_22 & mask_SORT_7 [L163] SORT_7 var_23_arg_0 = var_21; [L164] SORT_7 var_23_arg_1 = var_22; [L165] SORT_1 var_23 = var_23_arg_0 == var_23_arg_1; [L166] SORT_1 var_24_arg_0 = var_18; [L167] SORT_1 var_24_arg_1 = var_23; VAL [mask_SORT_108=15, mask_SORT_1=1, mask_SORT_26=3, mask_SORT_3=31, mask_SORT_7=7, state_16=0, state_19=0, state_45=0, state_47=0, state_49=0, state_52=0, state_55=0, state_57=0, state_59=0, state_61=0, state_63=0, state_65=0, state_9=0, var_125=7, var_130=6, var_14=-1, var_15=0, var_167=0, var_197=31, var_24_arg_0=0, var_24_arg_1=1, var_41=1, var_51=0, var_68=2, var_72=1, var_77=4, var_79=5, var_83=3, var_8=0, var_95=2] [L168] EXPR var_24_arg_0 | var_24_arg_1 VAL [mask_SORT_108=15, mask_SORT_1=1, mask_SORT_26=3, mask_SORT_3=31, mask_SORT_7=7, state_16=0, state_19=0, state_45=0, state_47=0, state_49=0, state_52=0, state_55=0, state_57=0, state_59=0, state_61=0, state_63=0, state_65=0, state_9=0, var_125=7, var_130=6, var_14=-1, var_15=0, var_167=0, var_197=31, var_41=1, var_51=0, var_68=2, var_72=1, var_77=4, var_79=5, var_83=3, var_8=0, var_95=2] [L168] SORT_1 var_24 = var_24_arg_0 | var_24_arg_1; [L169] SORT_3 var_25_arg_0 = state_16; [L170] SORT_1 var_25 = var_25_arg_0 >> 2; [L171] SORT_3 var_27_arg_0 = state_19; [L172] SORT_26 var_27 = var_27_arg_0 >> 3; VAL [mask_SORT_108=15, mask_SORT_1=1, mask_SORT_26=3, mask_SORT_3=31, mask_SORT_7=7, state_16=0, state_19=0, state_45=0, state_47=0, state_49=0, state_52=0, state_55=0, state_57=0, state_59=0, state_61=0, state_63=0, state_65=0, state_9=0, var_125=7, var_130=6, var_14=-1, var_15=0, var_167=0, var_197=31, var_24=1, var_25=0, var_27=0, var_41=1, var_51=0, var_68=2, var_72=1, var_77=4, var_79=5, var_83=3, var_8=0, var_95=2] [L173] EXPR var_27 & mask_SORT_26 VAL [mask_SORT_108=15, mask_SORT_1=1, mask_SORT_26=3, mask_SORT_3=31, mask_SORT_7=7, state_16=0, state_19=0, state_45=0, state_47=0, state_49=0, state_52=0, state_55=0, state_57=0, state_59=0, state_61=0, state_63=0, state_65=0, state_9=0, var_125=7, var_130=6, var_14=-1, var_15=0, var_167=0, var_197=31, var_24=1, var_25=0, var_41=1, var_51=0, var_68=2, var_72=1, var_77=4, var_79=5, var_83=3, var_8=0, var_95=2] [L173] var_27 = var_27 & mask_SORT_26 [L174] SORT_3 var_28_arg_0 = state_16; [L175] SORT_26 var_28 = var_28_arg_0 >> 3; VAL [mask_SORT_108=15, mask_SORT_1=1, mask_SORT_26=3, mask_SORT_3=31, mask_SORT_7=7, state_16=0, state_19=0, state_45=0, state_47=0, state_49=0, state_52=0, state_55=0, state_57=0, state_59=0, state_61=0, state_63=0, state_65=0, state_9=0, var_125=7, var_130=6, var_14=-1, var_15=0, var_167=0, var_197=31, var_24=1, var_25=0, var_27=0, var_28=0, var_41=1, var_51=0, var_68=2, var_72=1, var_77=4, var_79=5, var_83=3, var_8=0, var_95=2] [L176] EXPR var_28 & mask_SORT_26 VAL [mask_SORT_108=15, mask_SORT_1=1, mask_SORT_26=3, mask_SORT_3=31, mask_SORT_7=7, state_16=0, state_19=0, state_45=0, state_47=0, state_49=0, state_52=0, state_55=0, state_57=0, state_59=0, state_61=0, state_63=0, state_65=0, state_9=0, var_125=7, var_130=6, var_14=-1, var_15=0, var_167=0, var_197=31, var_24=1, var_25=0, var_27=0, var_41=1, var_51=0, var_68=2, var_72=1, var_77=4, var_79=5, var_83=3, var_8=0, var_95=2] [L176] var_28 = var_28 & mask_SORT_26 [L177] SORT_26 var_29_arg_0 = var_27; [L178] SORT_26 var_29_arg_1 = var_28; [L179] SORT_1 var_29 = var_29_arg_0 == var_29_arg_1; [L180] SORT_1 var_30_arg_0 = var_25; [L181] SORT_1 var_30_arg_1 = var_29; VAL [mask_SORT_108=15, mask_SORT_1=1, mask_SORT_26=3, mask_SORT_3=31, mask_SORT_7=7, state_16=0, state_19=0, state_45=0, state_47=0, state_49=0, state_52=0, state_55=0, state_57=0, state_59=0, state_61=0, state_63=0, state_65=0, state_9=0, var_125=7, var_130=6, var_14=-1, var_15=0, var_167=0, var_197=31, var_24=1, var_30_arg_0=0, var_30_arg_1=1, var_41=1, var_51=0, var_68=2, var_72=1, var_77=4, var_79=5, var_83=3, var_8=0, var_95=2] [L182] EXPR var_30_arg_0 | var_30_arg_1 VAL [mask_SORT_108=15, mask_SORT_1=1, mask_SORT_26=3, mask_SORT_3=31, mask_SORT_7=7, state_16=0, state_19=0, state_45=0, state_47=0, state_49=0, state_52=0, state_55=0, state_57=0, state_59=0, state_61=0, state_63=0, state_65=0, state_9=0, var_125=7, var_130=6, var_14=-1, var_15=0, var_167=0, var_197=31, var_24=1, var_41=1, var_51=0, var_68=2, var_72=1, var_77=4, var_79=5, var_83=3, var_8=0, var_95=2] [L182] SORT_1 var_30 = var_30_arg_0 | var_30_arg_1; [L183] SORT_1 var_31_arg_0 = var_24; [L184] SORT_1 var_31_arg_1 = var_30; VAL [mask_SORT_108=15, mask_SORT_1=1, mask_SORT_26=3, mask_SORT_3=31, mask_SORT_7=7, state_16=0, state_19=0, state_45=0, state_47=0, state_49=0, state_52=0, state_55=0, state_57=0, state_59=0, state_61=0, state_63=0, state_65=0, state_9=0, var_125=7, var_130=6, var_14=-1, var_15=0, var_167=0, var_197=31, var_31_arg_0=1, var_31_arg_1=1, var_41=1, var_51=0, var_68=2, var_72=1, var_77=4, var_79=5, var_83=3, var_8=0, var_95=2] [L185] EXPR var_31_arg_0 & var_31_arg_1 VAL [mask_SORT_108=15, mask_SORT_1=1, mask_SORT_26=3, mask_SORT_3=31, mask_SORT_7=7, state_16=0, state_19=0, state_45=0, state_47=0, state_49=0, state_52=0, state_55=0, state_57=0, state_59=0, state_61=0, state_63=0, state_65=0, state_9=0, var_125=7, var_130=6, var_14=-1, var_15=0, var_167=0, var_197=31, var_41=1, var_51=0, var_68=2, var_72=1, var_77=4, var_79=5, var_83=3, var_8=0, var_95=2] [L185] SORT_1 var_31 = var_31_arg_0 & var_31_arg_1; [L186] SORT_3 var_32_arg_0 = state_16; [L187] SORT_1 var_32 = var_32_arg_0 >> 3; [L188] SORT_3 var_33_arg_0 = state_19; [L189] SORT_1 var_33 = var_33_arg_0 >> 4; VAL [mask_SORT_108=15, mask_SORT_1=1, mask_SORT_26=3, mask_SORT_3=31, mask_SORT_7=7, state_16=0, state_19=0, state_45=0, state_47=0, state_49=0, state_52=0, state_55=0, state_57=0, state_59=0, state_61=0, state_63=0, state_65=0, state_9=0, var_125=7, var_130=6, var_14=-1, var_15=0, var_167=0, var_197=31, var_31=1, var_32=0, var_33=0, var_41=1, var_51=0, var_68=2, var_72=1, var_77=4, var_79=5, var_83=3, var_8=0, var_95=2] [L190] EXPR var_33 & mask_SORT_1 VAL [mask_SORT_108=15, mask_SORT_1=1, mask_SORT_26=3, mask_SORT_3=31, mask_SORT_7=7, state_16=0, state_19=0, state_45=0, state_47=0, state_49=0, state_52=0, state_55=0, state_57=0, state_59=0, state_61=0, state_63=0, state_65=0, state_9=0, var_125=7, var_130=6, var_14=-1, var_15=0, var_167=0, var_197=31, var_31=1, var_32=0, var_41=1, var_51=0, var_68=2, var_72=1, var_77=4, var_79=5, var_83=3, var_8=0, var_95=2] [L190] var_33 = var_33 & mask_SORT_1 [L191] SORT_3 var_34_arg_0 = state_16; [L192] SORT_1 var_34 = var_34_arg_0 >> 4; VAL [mask_SORT_108=15, mask_SORT_1=1, mask_SORT_26=3, mask_SORT_3=31, mask_SORT_7=7, state_16=0, state_19=0, state_45=0, state_47=0, state_49=0, state_52=0, state_55=0, state_57=0, state_59=0, state_61=0, state_63=0, state_65=0, state_9=0, var_125=7, var_130=6, var_14=-1, var_15=0, var_167=0, var_197=31, var_31=1, var_32=0, var_33=0, var_34=0, var_41=1, var_51=0, var_68=2, var_72=1, var_77=4, var_79=5, var_83=3, var_8=0, var_95=2] [L193] EXPR var_34 & mask_SORT_1 VAL [mask_SORT_108=15, mask_SORT_1=1, mask_SORT_26=3, mask_SORT_3=31, mask_SORT_7=7, state_16=0, state_19=0, state_45=0, state_47=0, state_49=0, state_52=0, state_55=0, state_57=0, state_59=0, state_61=0, state_63=0, state_65=0, state_9=0, var_125=7, var_130=6, var_14=-1, var_15=0, var_167=0, var_197=31, var_31=1, var_32=0, var_33=0, var_41=1, var_51=0, var_68=2, var_72=1, var_77=4, var_79=5, var_83=3, var_8=0, var_95=2] [L193] var_34 = var_34 & mask_SORT_1 [L194] SORT_1 var_35_arg_0 = var_33; [L195] SORT_1 var_35_arg_1 = var_34; [L196] SORT_1 var_35 = var_35_arg_0 == var_35_arg_1; [L197] SORT_1 var_36_arg_0 = var_32; [L198] SORT_1 var_36_arg_1 = var_35; VAL [mask_SORT_108=15, mask_SORT_1=1, mask_SORT_26=3, mask_SORT_3=31, mask_SORT_7=7, state_16=0, state_19=0, state_45=0, state_47=0, state_49=0, state_52=0, state_55=0, state_57=0, state_59=0, state_61=0, state_63=0, state_65=0, state_9=0, var_125=7, var_130=6, var_14=-1, var_15=0, var_167=0, var_197=31, var_31=1, var_36_arg_0=0, var_36_arg_1=1, var_41=1, var_51=0, var_68=2, var_72=1, var_77=4, var_79=5, var_83=3, var_8=0, var_95=2] [L199] EXPR var_36_arg_0 | var_36_arg_1 VAL [mask_SORT_108=15, mask_SORT_1=1, mask_SORT_26=3, mask_SORT_3=31, mask_SORT_7=7, state_16=0, state_19=0, state_45=0, state_47=0, state_49=0, state_52=0, state_55=0, state_57=0, state_59=0, state_61=0, state_63=0, state_65=0, state_9=0, var_125=7, var_130=6, var_14=-1, var_15=0, var_167=0, var_197=31, var_31=1, var_41=1, var_51=0, var_68=2, var_72=1, var_77=4, var_79=5, var_83=3, var_8=0, var_95=2] [L199] SORT_1 var_36 = var_36_arg_0 | var_36_arg_1; [L200] SORT_1 var_37_arg_0 = var_31; [L201] SORT_1 var_37_arg_1 = var_36; VAL [mask_SORT_108=15, mask_SORT_1=1, mask_SORT_26=3, mask_SORT_3=31, mask_SORT_7=7, state_16=0, state_19=0, state_45=0, state_47=0, state_49=0, state_52=0, state_55=0, state_57=0, state_59=0, state_61=0, state_63=0, state_65=0, state_9=0, var_125=7, var_130=6, var_14=-1, var_15=0, var_167=0, var_197=31, var_37_arg_0=1, var_37_arg_1=1, var_41=1, var_51=0, var_68=2, var_72=1, var_77=4, var_79=5, var_83=3, var_8=0, var_95=2] [L202] EXPR var_37_arg_0 & var_37_arg_1 VAL [mask_SORT_108=15, mask_SORT_1=1, mask_SORT_26=3, mask_SORT_3=31, mask_SORT_7=7, state_16=0, state_19=0, state_45=0, state_47=0, state_49=0, state_52=0, state_55=0, state_57=0, state_59=0, state_61=0, state_63=0, state_65=0, state_9=0, var_125=7, var_130=6, var_14=-1, var_15=0, var_167=0, var_197=31, var_41=1, var_51=0, var_68=2, var_72=1, var_77=4, var_79=5, var_83=3, var_8=0, var_95=2] [L202] SORT_1 var_37 = var_37_arg_0 & var_37_arg_1; [L203] SORT_1 var_38_arg_0 = var_14; [L204] SORT_1 var_38_arg_1 = var_37; VAL [mask_SORT_108=15, mask_SORT_1=1, mask_SORT_26=3, mask_SORT_3=31, mask_SORT_7=7, state_16=0, state_19=0, state_45=0, state_47=0, state_49=0, state_52=0, state_55=0, state_57=0, state_59=0, state_61=0, state_63=0, state_65=0, state_9=0, var_125=7, var_130=6, var_15=0, var_167=0, var_197=31, var_38_arg_0=-1, var_38_arg_1=1, var_41=1, var_51=0, var_68=2, var_72=1, var_77=4, var_79=5, var_83=3, var_8=0, var_95=2] [L205] EXPR var_38_arg_0 | var_38_arg_1 VAL [mask_SORT_108=15, mask_SORT_1=1, mask_SORT_26=3, mask_SORT_3=31, mask_SORT_7=7, state_16=0, state_19=0, state_45=0, state_47=0, state_49=0, state_52=0, state_55=0, state_57=0, state_59=0, state_61=0, state_63=0, state_65=0, state_9=0, var_125=7, var_130=6, var_15=0, var_167=0, var_197=31, var_41=1, var_51=0, var_68=2, var_72=1, var_77=4, var_79=5, var_83=3, var_8=0, var_95=2] [L205] SORT_1 var_38 = var_38_arg_0 | var_38_arg_1; [L206] SORT_1 var_42_arg_0 = var_38; [L207] SORT_1 var_42 = ~var_42_arg_0; [L208] SORT_1 var_43_arg_0 = var_41; [L209] SORT_1 var_43_arg_1 = var_42; VAL [mask_SORT_108=15, mask_SORT_1=1, mask_SORT_26=3, mask_SORT_3=31, mask_SORT_7=7, state_16=0, state_19=0, state_45=0, state_47=0, state_49=0, state_52=0, state_55=0, state_57=0, state_59=0, state_61=0, state_63=0, state_65=0, state_9=0, var_125=7, var_130=6, var_15=0, var_167=0, var_197=31, var_41=1, var_43_arg_0=1, var_43_arg_1=-1, var_51=0, var_68=2, var_72=1, var_77=4, var_79=5, var_83=3, var_8=0, var_95=2] [L210] EXPR var_43_arg_0 & var_43_arg_1 VAL [mask_SORT_108=15, mask_SORT_1=1, mask_SORT_26=3, mask_SORT_3=31, mask_SORT_7=7, state_16=0, state_19=0, state_45=0, state_47=0, state_49=0, state_52=0, state_55=0, state_57=0, state_59=0, state_61=0, state_63=0, state_65=0, state_9=0, var_125=7, var_130=6, var_15=0, var_167=0, var_197=31, var_41=1, var_51=0, var_68=2, var_72=1, var_77=4, var_79=5, var_83=3, var_8=0, var_95=2] [L210] SORT_1 var_43 = var_43_arg_0 & var_43_arg_1; [L211] EXPR var_43 & mask_SORT_1 VAL [mask_SORT_108=15, mask_SORT_1=1, mask_SORT_26=3, mask_SORT_3=31, mask_SORT_7=7, state_16=0, state_19=0, state_45=0, state_47=0, state_49=0, state_52=0, state_55=0, state_57=0, state_59=0, state_61=0, state_63=0, state_65=0, state_9=0, var_125=7, var_130=6, var_15=0, var_167=0, var_197=31, var_41=1, var_51=0, var_68=2, var_72=1, var_77=4, var_79=5, var_83=3, var_8=0, var_95=2] [L211] var_43 = var_43 & mask_SORT_1 [L212] SORT_1 bad_44_arg_0 = var_43; [L213] CALL __VERIFIER_assert(!(bad_44_arg_0)) [L21] COND TRUE !(cond) [L21] reach_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 569 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 9.7s, OverallIterations: 10, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 5.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 5681 SdHoareTripleChecker+Valid, 4.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 5681 mSDsluCounter, 38144 SdHoareTripleChecker+Invalid, 3.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 31882 mSDsCounter, 10 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 9063 IncrementalHoareTripleChecker+Invalid, 9073 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 10 mSolverCounterUnsat, 6262 mSDtfsCounter, 9063 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 102 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 188 ImplicationChecksByTransitivity, 0.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=819occurred in iteration=9, InterpolantAutomatonStates: 72, 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, 9 MinimizatonAttempts, 620 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 3.4s InterpolantComputationTime, 636 NumberOfCodeBlocks, 636 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 560 ConstructedInterpolants, 0 QuantifiedInterpolants, 2414 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2025-02-08 00:16:03,246 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/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-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_arrays_vsaR_p12.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/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 d570de8a468b2e5d7e18a67170da2d8f06202ccdf10baa0799e3c0763140866e --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-08 00:16:05,221 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-08 00:16:05,292 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Bitvector.epf [2025-02-08 00:16:05,296 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-08 00:16:05,296 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-08 00:16:05,338 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-08 00:16:05,339 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-08 00:16:05,339 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-08 00:16:05,340 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-08 00:16:05,340 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-08 00:16:05,340 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-08 00:16:05,340 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-08 00:16:05,340 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-08 00:16:05,340 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-08 00:16:05,340 INFO L153 SettingsManager]: * Use SBE=true [2025-02-08 00:16:05,340 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-08 00:16:05,340 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-08 00:16:05,340 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-08 00:16:05,340 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-08 00:16:05,340 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-08 00:16:05,340 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-08 00:16:05,340 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-02-08 00:16:05,341 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-02-08 00:16:05,341 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-02-08 00:16:05,341 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-08 00:16:05,341 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-08 00:16:05,341 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-08 00:16:05,341 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-08 00:16:05,341 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-08 00:16:05,341 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-08 00:16:05,341 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-08 00:16:05,341 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 00:16:05,341 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-08 00:16:05,341 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-08 00:16:05,341 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-08 00:16:05,341 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-08 00:16:05,341 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-02-08 00:16:05,344 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-02-08 00:16:05,344 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-08 00:16:05,344 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-08 00:16:05,344 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-08 00:16:05,344 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-08 00:16:05,344 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-jdk21/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 -> d570de8a468b2e5d7e18a67170da2d8f06202ccdf10baa0799e3c0763140866e [2025-02-08 00:16:05,602 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-08 00:16:05,612 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-08 00:16:05,614 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-08 00:16:05,616 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-08 00:16:05,616 INFO L274 PluginConnector]: CDTParser initialized [2025-02-08 00:16:05,618 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_arrays_vsaR_p12.c [2025-02-08 00:16:06,849 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/816eb3d99/1c532877f6134105b434f5ee2cba2a01/FLAG4e399242b [2025-02-08 00:16:07,183 INFO L384 CDTParser]: Found 1 translation units. [2025-02-08 00:16:07,183 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_arrays_vsaR_p12.c [2025-02-08 00:16:07,197 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/816eb3d99/1c532877f6134105b434f5ee2cba2a01/FLAG4e399242b [2025-02-08 00:16:07,211 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/816eb3d99/1c532877f6134105b434f5ee2cba2a01 [2025-02-08 00:16:07,214 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-08 00:16:07,215 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-08 00:16:07,217 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-08 00:16:07,217 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-08 00:16:07,221 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-08 00:16:07,221 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 12:16:07" (1/1) ... [2025-02-08 00:16:07,223 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@109d9063 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:16:07, skipping insertion in model container [2025-02-08 00:16:07,223 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 12:16:07" (1/1) ... [2025-02-08 00:16:07,258 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-08 00:16:07,391 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_arrays_vsaR_p12.c[1259,1272] [2025-02-08 00:16:07,581 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 00:16:07,595 INFO L200 MainTranslator]: Completed pre-run [2025-02-08 00:16:07,602 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_arrays_vsaR_p12.c[1259,1272] [2025-02-08 00:16:07,706 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 00:16:07,719 INFO L204 MainTranslator]: Completed translation [2025-02-08 00:16:07,720 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:16:07 WrapperNode [2025-02-08 00:16:07,720 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-08 00:16:07,721 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-08 00:16:07,721 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-08 00:16:07,721 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-08 00:16:07,728 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:16:07" (1/1) ... [2025-02-08 00:16:07,749 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:16:07" (1/1) ... [2025-02-08 00:16:07,803 INFO L138 Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 1116 [2025-02-08 00:16:07,804 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-08 00:16:07,805 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-08 00:16:07,805 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-08 00:16:07,805 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-08 00:16:07,810 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:16:07" (1/1) ... [2025-02-08 00:16:07,810 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:16:07" (1/1) ... [2025-02-08 00:16:07,816 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:16:07" (1/1) ... [2025-02-08 00:16:07,834 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-02-08 00:16:07,834 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:16:07" (1/1) ... [2025-02-08 00:16:07,837 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:16:07" (1/1) ... [2025-02-08 00:16:07,859 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:16:07" (1/1) ... [2025-02-08 00:16:07,861 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:16:07" (1/1) ... [2025-02-08 00:16:07,867 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:16:07" (1/1) ... [2025-02-08 00:16:07,872 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:16:07" (1/1) ... [2025-02-08 00:16:07,882 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-08 00:16:07,883 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-08 00:16:07,883 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-08 00:16:07,883 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-08 00:16:07,884 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:16:07" (1/1) ... [2025-02-08 00:16:07,892 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 00:16:07,908 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 00:16:07,921 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-08 00:16:07,923 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-08 00:16:07,939 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-08 00:16:07,939 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-02-08 00:16:07,939 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-08 00:16:07,939 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-08 00:16:08,152 INFO L257 CfgBuilder]: Building ICFG [2025-02-08 00:16:08,153 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-08 00:16:09,330 INFO L? ?]: Removed 104 outVars from TransFormulas that were not future-live. [2025-02-08 00:16:09,330 INFO L308 CfgBuilder]: Performing block encoding [2025-02-08 00:16:09,336 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-08 00:16:09,337 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-08 00:16:09,337 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 12:16:09 BoogieIcfgContainer [2025-02-08 00:16:09,337 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-08 00:16:09,339 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-08 00:16:09,339 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-08 00:16:09,342 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-08 00:16:09,342 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.02 12:16:07" (1/3) ... [2025-02-08 00:16:09,343 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3d83ca0a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 12:16:09, skipping insertion in model container [2025-02-08 00:16:09,343 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:16:07" (2/3) ... [2025-02-08 00:16:09,343 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3d83ca0a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 12:16:09, skipping insertion in model container [2025-02-08 00:16:09,343 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 12:16:09" (3/3) ... [2025-02-08 00:16:09,345 INFO L128 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.vis_arrays_vsaR_p12.c [2025-02-08 00:16:09,355 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-08 00:16:09,356 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG btor2c-lazyMod.vis_arrays_vsaR_p12.c that has 1 procedures, 8 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-08 00:16:09,397 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 00:16:09,405 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;@227cb61f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 00:16:09,405 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-08 00:16:09,407 INFO L276 IsEmpty]: Start isEmpty. Operand has 8 states, 6 states have (on average 1.5) internal successors, (9), 7 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-02-08 00:16:09,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2025-02-08 00:16:09,412 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 00:16:09,413 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2025-02-08 00:16:09,414 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 00:16:09,418 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:16:09,419 INFO L85 PathProgramCache]: Analyzing trace with hash 1137951, now seen corresponding path program 1 times [2025-02-08 00:16:09,427 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-08 00:16:09,428 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1625554840] [2025-02-08 00:16:09,429 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:16:09,429 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 00:16:09,429 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 00:16:09,432 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 00:16:09,434 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-08 00:16:09,643 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-08 00:16:09,661 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-08 00:16:09,661 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:16:09,661 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:16:09,664 INFO L256 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-02-08 00:16:09,671 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 00:16:09,817 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 00:16:09,817 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 00:16:09,818 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-08 00:16:09,819 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1625554840] [2025-02-08 00:16:09,819 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1625554840] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 00:16:09,819 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 00:16:09,820 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 00:16:09,821 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [343034534] [2025-02-08 00:16:09,821 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 00:16:09,823 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 00:16:09,823 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-08 00:16:09,835 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 00:16:09,835 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 00:16:09,837 INFO L87 Difference]: Start difference. First operand has 8 states, 6 states have (on average 1.5) internal successors, (9), 7 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) Second operand has 4 states, 4 states have (on average 1.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 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-02-08 00:16:09,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 00:16:09,891 INFO L93 Difference]: Finished difference Result 16 states and 21 transitions. [2025-02-08 00:16:09,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 00:16:09,894 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 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 4 [2025-02-08 00:16:09,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 00:16:09,899 INFO L225 Difference]: With dead ends: 16 [2025-02-08 00:16:09,899 INFO L226 Difference]: Without dead ends: 9 [2025-02-08 00:16:09,901 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 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-02-08 00:16:09,902 INFO L435 NwaCegarLoop]: 3 mSDtfsCounter, 2 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 8 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-02-08 00:16:09,902 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 8 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 00:16:09,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2025-02-08 00:16:09,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 8. [2025-02-08 00:16:09,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 7 states have internal predecessors, (8), 0 states have call successors, (0), 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-02-08 00:16:09,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 8 transitions. [2025-02-08 00:16:09,920 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 8 transitions. Word has length 4 [2025-02-08 00:16:09,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 00:16:09,920 INFO L471 AbstractCegarLoop]: Abstraction has 8 states and 8 transitions. [2025-02-08 00:16:09,920 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 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-02-08 00:16:09,920 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2025-02-08 00:16:09,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-02-08 00:16:09,921 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 00:16:09,921 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1] [2025-02-08 00:16:09,929 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-02-08 00:16:10,125 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 00:16:10,126 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 00:16:10,127 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:16:10,127 INFO L85 PathProgramCache]: Analyzing trace with hash -458170295, now seen corresponding path program 1 times [2025-02-08 00:16:10,128 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-08 00:16:10,129 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [42686923] [2025-02-08 00:16:10,129 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:16:10,129 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 00:16:10,129 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 00:16:10,132 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 00:16:10,133 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-02-08 00:16:10,381 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-02-08 00:16:10,424 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-02-08 00:16:10,424 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:16:10,424 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:16:10,433 INFO L256 TraceCheckSpWp]: Trace formula consists of 207 conjuncts, 59 conjuncts are in the unsatisfiable core [2025-02-08 00:16:10,441 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 00:16:10,865 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 00:16:10,866 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 00:16:26,332 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 00:16:26,334 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-08 00:16:26,334 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [42686923] [2025-02-08 00:16:26,334 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [42686923] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 00:16:26,334 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-08 00:16:26,334 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 9 [2025-02-08 00:16:26,334 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [514295236] [2025-02-08 00:16:26,334 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-08 00:16:26,335 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-08 00:16:26,336 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-08 00:16:26,337 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-08 00:16:26,337 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=64, Unknown=1, NotChecked=0, Total=90 [2025-02-08 00:16:26,337 INFO L87 Difference]: Start difference. First operand 8 states and 8 transitions. Second operand has 10 states, 10 states have (on average 1.3) internal successors, (13), 9 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:16:27,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 00:16:27,156 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2025-02-08 00:16:27,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 00:16:27,157 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 1.3) internal successors, (13), 9 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2025-02-08 00:16:27,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 00:16:27,157 INFO L225 Difference]: With dead ends: 14 [2025-02-08 00:16:27,157 INFO L226 Difference]: Without dead ends: 12 [2025-02-08 00:16:27,157 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 11.0s TimeCoverageRelationStatistics Valid=47, Invalid=108, Unknown=1, NotChecked=0, Total=156 [2025-02-08 00:16:27,158 INFO L435 NwaCegarLoop]: 3 mSDtfsCounter, 4 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 13 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-08 00:16:27,158 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 13 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-08 00:16:27,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2025-02-08 00:16:27,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 11. [2025-02-08 00:16:27,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 10 states have (on average 1.1) internal successors, (11), 10 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-02-08 00:16:27,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 11 transitions. [2025-02-08 00:16:27,165 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 11 transitions. Word has length 7 [2025-02-08 00:16:27,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 00:16:27,165 INFO L471 AbstractCegarLoop]: Abstraction has 11 states and 11 transitions. [2025-02-08 00:16:27,166 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 1.3) internal successors, (13), 9 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:16:27,166 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 11 transitions. [2025-02-08 00:16:27,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-02-08 00:16:27,166 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 00:16:27,166 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1] [2025-02-08 00:16:27,173 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-02-08 00:16:27,367 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 00:16:27,367 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 00:16:27,371 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:16:27,372 INFO L85 PathProgramCache]: Analyzing trace with hash 55678175, now seen corresponding path program 2 times [2025-02-08 00:16:27,372 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-08 00:16:27,372 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1508419866] [2025-02-08 00:16:27,372 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 00:16:27,373 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 00:16:27,373 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 00:16:27,377 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 00:16:27,379 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-02-08 00:16:27,621 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 10 statements into 2 equivalence classes. [2025-02-08 00:16:27,689 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 10 of 10 statements. [2025-02-08 00:16:27,689 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-08 00:16:27,689 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:16:27,695 INFO L256 TraceCheckSpWp]: Trace formula consists of 283 conjuncts, 61 conjuncts are in the unsatisfiable core [2025-02-08 00:16:27,704 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 00:16:28,068 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 00:16:28,068 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 00:16:34,074 WARN L249 Executor]: External (MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) stderr output: (error "out of memory") [2025-02-08 00:16:34,075 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 101 [2025-02-08 00:16:34,075 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-08 00:16:34,075 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1508419866] [2025-02-08 00:16:34,076 WARN L320 FreeRefinementEngine]: Global settings require throwing the following exception [2025-02-08 00:16:34,084 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-02-08 00:16:34,276 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 00:16:34,277 FATAL L? ?]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: External (MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:262) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parseCheckSatResult(Executor.java:281) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.checkSat(Scriptor.java:155) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.checkSat(WrapperScript.java:163) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.checkSat(WrapperScript.java:163) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.ManagedScript.checkSat(ManagedScript.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.MonolithicImplicationChecker.checkImplication(MonolithicImplicationChecker.java:85) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier$PredicateComparison.compare(PredicateUnifier.java:912) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier$PredicateComparison.(PredicateUnifier.java:786) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:374) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:323) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp$UnifyPostprocessor.postprocess(TraceCheckSpWp.java:555) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:416) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeBackwardSequence(IterativePredicateTransformer.java:395) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeWeakestPreconditionSequence(IterativePredicateTransformer.java:267) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:325) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:181) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:160) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:106) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.isCorrect(IpTcStrategyModuleBase.java:57) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.checkFeasibility(AutomatonFreeRefinementEngine.java:210) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:121) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:317) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:407) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:342) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:324) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:428) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:314) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:275) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:167) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:132) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) Caused by: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: EOF at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser$Action$.CUP$do_action(Parser.java:1518) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser.do_action(Parser.java:701) at com.github.jhoenicke.javacup.runtime.LRParser.parse(LRParser.java:383) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:258) ... 45 more [2025-02-08 00:16:34,285 INFO L158 Benchmark]: Toolchain (without parser) took 27070.03ms. Allocated memory was 117.4MB in the beginning and 864.0MB in the end (delta: 746.6MB). Free memory was 89.3MB in the beginning and 356.6MB in the end (delta: -267.3MB). Peak memory consumption was 482.2MB. Max. memory is 16.1GB. [2025-02-08 00:16:34,286 INFO L158 Benchmark]: CDTParser took 0.23ms. Allocated memory is still 117.4MB. Free memory is still 82.5MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 00:16:34,286 INFO L158 Benchmark]: CACSL2BoogieTranslator took 503.06ms. Allocated memory is still 117.4MB. Free memory was 89.1MB in the beginning and 51.1MB in the end (delta: 38.0MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2025-02-08 00:16:34,289 INFO L158 Benchmark]: Boogie Procedure Inliner took 83.55ms. Allocated memory is still 117.4MB. Free memory was 51.1MB in the beginning and 84.5MB in the end (delta: -33.4MB). Peak memory consumption was 16.7MB. Max. memory is 16.1GB. [2025-02-08 00:16:34,289 INFO L158 Benchmark]: Boogie Preprocessor took 77.96ms. Allocated memory is still 117.4MB. Free memory was 84.5MB in the beginning and 74.9MB in the end (delta: 9.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-08 00:16:34,289 INFO L158 Benchmark]: IcfgBuilder took 1453.91ms. Allocated memory was 117.4MB in the beginning and 234.9MB in the end (delta: 117.4MB). Free memory was 74.9MB in the beginning and 102.4MB in the end (delta: -27.5MB). Peak memory consumption was 125.3MB. Max. memory is 16.1GB. [2025-02-08 00:16:34,289 INFO L158 Benchmark]: TraceAbstraction took 24945.84ms. Allocated memory was 234.9MB in the beginning and 864.0MB in the end (delta: 629.1MB). Free memory was 102.4MB in the beginning and 356.6MB in the end (delta: -254.2MB). Peak memory consumption was 375.2MB. Max. memory is 16.1GB. [2025-02-08 00:16:34,290 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.23ms. Allocated memory is still 117.4MB. Free memory is still 82.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 503.06ms. Allocated memory is still 117.4MB. Free memory was 89.1MB in the beginning and 51.1MB in the end (delta: 38.0MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 83.55ms. Allocated memory is still 117.4MB. Free memory was 51.1MB in the beginning and 84.5MB in the end (delta: -33.4MB). Peak memory consumption was 16.7MB. Max. memory is 16.1GB. * Boogie Preprocessor took 77.96ms. Allocated memory is still 117.4MB. Free memory was 84.5MB in the beginning and 74.9MB in the end (delta: 9.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 1453.91ms. Allocated memory was 117.4MB in the beginning and 234.9MB in the end (delta: 117.4MB). Free memory was 74.9MB in the beginning and 102.4MB in the end (delta: -27.5MB). Peak memory consumption was 125.3MB. Max. memory is 16.1GB. * TraceAbstraction took 24945.84ms. Allocated memory was 234.9MB in the beginning and 864.0MB in the end (delta: 629.1MB). Free memory was 102.4MB in the beginning and 356.6MB in the end (delta: -254.2MB). Peak memory consumption was 375.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: SMTLIBException: External (MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: External (MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") : de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:262) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: SMTLIBException: External (MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory")