./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_arrays_am2910_p1.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_am2910_p1.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 e3ac6f8d68dfadee83df50cc30cff5b03f705d6e7b992071314ad032158be302 --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-08 00:12:36,413 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-08 00:12:36,485 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:12:36,491 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-08 00:12:36,491 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-08 00:12:36,523 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-08 00:12:36,525 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-08 00:12:36,525 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-08 00:12:36,526 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-08 00:12:36,526 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-08 00:12:36,526 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-08 00:12:36,527 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-08 00:12:36,527 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-08 00:12:36,527 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-08 00:12:36,527 INFO L153 SettingsManager]: * Use SBE=true [2025-02-08 00:12:36,528 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-08 00:12:36,528 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-08 00:12:36,528 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-08 00:12:36,528 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-08 00:12:36,529 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-08 00:12:36,529 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-08 00:12:36,529 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-08 00:12:36,529 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-08 00:12:36,529 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-08 00:12:36,529 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-08 00:12:36,529 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-08 00:12:36,529 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-08 00:12:36,529 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-08 00:12:36,530 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-08 00:12:36,530 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 00:12:36,530 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-08 00:12:36,530 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-08 00:12:36,530 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-08 00:12:36,530 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-08 00:12:36,531 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-08 00:12:36,531 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-08 00:12:36,531 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-08 00:12:36,531 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-08 00:12:36,531 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-08 00:12:36,531 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-08 00:12:36,531 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 -> e3ac6f8d68dfadee83df50cc30cff5b03f705d6e7b992071314ad032158be302 [2025-02-08 00:12:36,823 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-08 00:12:36,833 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-08 00:12:36,837 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-08 00:12:36,839 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-08 00:12:36,839 INFO L274 PluginConnector]: CDTParser initialized [2025-02-08 00:12:36,840 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_am2910_p1.c [2025-02-08 00:12:38,149 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/97bff593c/633d3bc7f5c14d6990cfa684646dae58/FLAGa7fe6efc6 [2025-02-08 00:12:38,507 INFO L384 CDTParser]: Found 1 translation units. [2025-02-08 00:12:38,508 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_arrays_am2910_p1.c [2025-02-08 00:12:38,522 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/97bff593c/633d3bc7f5c14d6990cfa684646dae58/FLAGa7fe6efc6 [2025-02-08 00:12:38,540 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/97bff593c/633d3bc7f5c14d6990cfa684646dae58 [2025-02-08 00:12:38,543 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-08 00:12:38,544 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-08 00:12:38,546 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-08 00:12:38,546 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-08 00:12:38,551 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-08 00:12:38,552 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 12:12:38" (1/1) ... [2025-02-08 00:12:38,553 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@77a1a9c8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:12:38, skipping insertion in model container [2025-02-08 00:12:38,553 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 12:12:38" (1/1) ... [2025-02-08 00:12:38,604 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-08 00:12:38,788 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_am2910_p1.c[1260,1273] [2025-02-08 00:12:39,173 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 00:12:39,180 INFO L200 MainTranslator]: Completed pre-run [2025-02-08 00:12:39,188 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_am2910_p1.c[1260,1273] [2025-02-08 00:12:39,410 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 00:12:39,423 INFO L204 MainTranslator]: Completed translation [2025-02-08 00:12:39,424 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:12:39 WrapperNode [2025-02-08 00:12:39,425 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-08 00:12:39,426 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-08 00:12:39,426 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-08 00:12:39,426 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-08 00:12:39,433 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:12:39" (1/1) ... [2025-02-08 00:12:39,486 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:12:39" (1/1) ... [2025-02-08 00:12:40,061 INFO L138 Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 4782 [2025-02-08 00:12:40,062 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-08 00:12:40,063 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-08 00:12:40,063 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-08 00:12:40,063 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-08 00:12:40,070 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:12:39" (1/1) ... [2025-02-08 00:12:40,070 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:12:39" (1/1) ... [2025-02-08 00:12:40,148 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:12:39" (1/1) ... [2025-02-08 00:12:40,328 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:12:40,329 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:12:39" (1/1) ... [2025-02-08 00:12:40,329 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:12:39" (1/1) ... [2025-02-08 00:12:40,428 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:12:39" (1/1) ... [2025-02-08 00:12:40,443 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:12:39" (1/1) ... [2025-02-08 00:12:40,464 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:12:39" (1/1) ... [2025-02-08 00:12:40,486 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:12:39" (1/1) ... [2025-02-08 00:12:40,546 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-08 00:12:40,547 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-08 00:12:40,548 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-08 00:12:40,548 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-08 00:12:40,549 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:12:39" (1/1) ... [2025-02-08 00:12:40,554 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 00:12:40,565 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 00:12:40,577 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:12:40,584 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:12:40,601 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-08 00:12:40,601 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-08 00:12:40,601 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-08 00:12:40,601 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-08 00:12:40,954 INFO L257 CfgBuilder]: Building ICFG [2025-02-08 00:12:40,956 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-08 00:12:45,992 INFO L? ?]: Removed 2811 outVars from TransFormulas that were not future-live. [2025-02-08 00:12:45,992 INFO L308 CfgBuilder]: Performing block encoding [2025-02-08 00:12:46,213 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-08 00:12:46,214 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-08 00:12:46,214 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 12:12:46 BoogieIcfgContainer [2025-02-08 00:12:46,214 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-08 00:12:46,220 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-08 00:12:46,220 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-08 00:12:46,225 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-08 00:12:46,225 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.02 12:12:38" (1/3) ... [2025-02-08 00:12:46,225 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@27534c18 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 12:12:46, skipping insertion in model container [2025-02-08 00:12:46,226 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:12:39" (2/3) ... [2025-02-08 00:12:46,226 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@27534c18 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 12:12:46, skipping insertion in model container [2025-02-08 00:12:46,226 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 12:12:46" (3/3) ... [2025-02-08 00:12:46,228 INFO L128 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.vis_arrays_am2910_p1.c [2025-02-08 00:12:46,241 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-08 00:12:46,243 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG btor2c-lazyMod.vis_arrays_am2910_p1.c that has 1 procedures, 1508 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-08 00:12:46,340 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 00:12:46,351 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;@54782792, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 00:12:46,351 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-08 00:12:46,361 INFO L276 IsEmpty]: Start isEmpty. Operand has 1508 states, 1506 states have (on average 1.5) internal successors, (2259), 1507 states have internal predecessors, (2259), 0 states have call successors, (0), 0 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:12:46,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2025-02-08 00:12:46,367 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 00:12:46,368 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] [2025-02-08 00:12:46,368 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 00:12:46,373 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:12:46,373 INFO L85 PathProgramCache]: Analyzing trace with hash -2132139934, now seen corresponding path program 1 times [2025-02-08 00:12:46,380 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 00:12:46,380 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1071786582] [2025-02-08 00:12:46,380 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:12:46,381 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 00:12:46,494 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-02-08 00:12:46,606 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-02-08 00:12:46,607 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:12:46,607 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:12:47,194 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:12:47,194 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 00:12:47,195 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1071786582] [2025-02-08 00:12:47,196 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1071786582] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 00:12:47,196 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 00:12:47,196 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 00:12:47,198 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [795176665] [2025-02-08 00:12:47,199 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 00:12:47,202 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 00:12:47,202 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 00:12:47,219 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 00:12:47,219 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 00:12:47,223 INFO L87 Difference]: Start difference. First operand has 1508 states, 1506 states have (on average 1.5) internal successors, (2259), 1507 states have internal predecessors, (2259), 0 states have call successors, (0), 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 9.0) internal successors, (36), 4 states have internal predecessors, (36), 0 states have call successors, (0), 0 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:12:48,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 00:12:48,161 INFO L93 Difference]: Finished difference Result 2979 states and 4465 transitions. [2025-02-08 00:12:48,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 00:12:48,163 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 0 states have call successors, (0), 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 36 [2025-02-08 00:12:48,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 00:12:48,186 INFO L225 Difference]: With dead ends: 2979 [2025-02-08 00:12:48,186 INFO L226 Difference]: Without dead ends: 1508 [2025-02-08 00:12:48,197 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:12:48,202 INFO L435 NwaCegarLoop]: 1879 mSDtfsCounter, 0 mSDsluCounter, 3753 mSDsCounter, 0 mSdLazyCounter, 1135 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 5632 SdHoareTripleChecker+Invalid, 1135 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1135 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-02-08 00:12:48,203 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 5632 Invalid, 1135 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1135 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-02-08 00:12:48,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1508 states. [2025-02-08 00:12:48,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1508 to 1508. [2025-02-08 00:12:48,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1508 states, 1507 states have (on average 1.4983410749834107) internal successors, (2258), 1507 states have internal predecessors, (2258), 0 states have call successors, (0), 0 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:12:48,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1508 states to 1508 states and 2258 transitions. [2025-02-08 00:12:48,302 INFO L78 Accepts]: Start accepts. Automaton has 1508 states and 2258 transitions. Word has length 36 [2025-02-08 00:12:48,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 00:12:48,302 INFO L471 AbstractCegarLoop]: Abstraction has 1508 states and 2258 transitions. [2025-02-08 00:12:48,302 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 0 states have call successors, (0), 0 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:12:48,303 INFO L276 IsEmpty]: Start isEmpty. Operand 1508 states and 2258 transitions. [2025-02-08 00:12:48,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2025-02-08 00:12:48,304 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 00:12:48,304 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] [2025-02-08 00:12:48,304 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-08 00:12:48,304 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 00:12:48,305 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:12:48,305 INFO L85 PathProgramCache]: Analyzing trace with hash -1667146858, now seen corresponding path program 1 times [2025-02-08 00:12:48,305 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 00:12:48,305 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [819501545] [2025-02-08 00:12:48,305 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:12:48,305 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 00:12:48,346 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-02-08 00:12:48,376 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-02-08 00:12:48,376 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:12:48,376 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:12:48,573 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:12:48,573 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 00:12:48,573 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [819501545] [2025-02-08 00:12:48,573 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [819501545] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 00:12:48,574 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 00:12:48,574 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 00:12:48,574 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [256770267] [2025-02-08 00:12:48,574 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 00:12:48,575 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 00:12:48,575 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 00:12:48,576 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 00:12:48,576 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 00:12:48,576 INFO L87 Difference]: Start difference. First operand 1508 states and 2258 transitions. Second operand has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 0 states have call successors, (0), 0 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:12:49,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 00:12:49,334 INFO L93 Difference]: Finished difference Result 2981 states and 4464 transitions. [2025-02-08 00:12:49,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 00:12:49,334 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 0 states have call successors, (0), 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 37 [2025-02-08 00:12:49,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 00:12:49,340 INFO L225 Difference]: With dead ends: 2981 [2025-02-08 00:12:49,341 INFO L226 Difference]: Without dead ends: 1510 [2025-02-08 00:12:49,344 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:12:49,344 INFO L435 NwaCegarLoop]: 1879 mSDtfsCounter, 0 mSDsluCounter, 3750 mSDsCounter, 0 mSdLazyCounter, 1138 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 5629 SdHoareTripleChecker+Invalid, 1138 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1138 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-02-08 00:12:49,345 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 5629 Invalid, 1138 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1138 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-02-08 00:12:49,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1510 states. [2025-02-08 00:12:49,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1510 to 1510. [2025-02-08 00:12:49,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1510 states, 1509 states have (on average 1.4976805831676607) internal successors, (2260), 1509 states have internal predecessors, (2260), 0 states have call successors, (0), 0 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:12:49,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1510 states to 1510 states and 2260 transitions. [2025-02-08 00:12:49,380 INFO L78 Accepts]: Start accepts. Automaton has 1510 states and 2260 transitions. Word has length 37 [2025-02-08 00:12:49,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 00:12:49,380 INFO L471 AbstractCegarLoop]: Abstraction has 1510 states and 2260 transitions. [2025-02-08 00:12:49,381 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 0 states have call successors, (0), 0 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:12:49,381 INFO L276 IsEmpty]: Start isEmpty. Operand 1510 states and 2260 transitions. [2025-02-08 00:12:49,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2025-02-08 00:12:49,382 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 00:12:49,383 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] [2025-02-08 00:12:49,383 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-08 00:12:49,383 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 00:12:49,385 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:12:49,385 INFO L85 PathProgramCache]: Analyzing trace with hash 1789566685, now seen corresponding path program 1 times [2025-02-08 00:12:49,385 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 00:12:49,385 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [559185016] [2025-02-08 00:12:49,385 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:12:49,385 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 00:12:49,424 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-02-08 00:12:49,490 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-02-08 00:12:49,490 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:12:49,490 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:12:49,811 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:12:49,811 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 00:12:49,811 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [559185016] [2025-02-08 00:12:49,811 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [559185016] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 00:12:49,812 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 00:12:49,812 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 00:12:49,812 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1549524469] [2025-02-08 00:12:49,812 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 00:12:49,812 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 00:12:49,812 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 00:12:49,813 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 00:12:49,813 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-08 00:12:49,813 INFO L87 Difference]: Start difference. First operand 1510 states and 2260 transitions. Second operand has 5 states, 5 states have (on average 7.6) internal successors, (38), 4 states have internal predecessors, (38), 0 states have call successors, (0), 0 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:12:50,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 00:12:50,653 INFO L93 Difference]: Finished difference Result 2987 states and 4471 transitions. [2025-02-08 00:12:50,655 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 00:12:50,656 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 4 states have internal predecessors, (38), 0 states have call successors, (0), 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 38 [2025-02-08 00:12:50,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 00:12:50,662 INFO L225 Difference]: With dead ends: 2987 [2025-02-08 00:12:50,663 INFO L226 Difference]: Without dead ends: 1514 [2025-02-08 00:12:50,666 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-02-08 00:12:50,669 INFO L435 NwaCegarLoop]: 1875 mSDtfsCounter, 2232 mSDsluCounter, 3743 mSDsCounter, 0 mSdLazyCounter, 1149 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2232 SdHoareTripleChecker+Valid, 5618 SdHoareTripleChecker+Invalid, 1150 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1149 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-02-08 00:12:50,670 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2232 Valid, 5618 Invalid, 1150 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1149 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-02-08 00:12:50,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1514 states. [2025-02-08 00:12:50,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1514 to 1513. [2025-02-08 00:12:50,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1513 states, 1512 states have (on average 1.4966931216931216) internal successors, (2263), 1512 states have internal predecessors, (2263), 0 states have call successors, (0), 0 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:12:50,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1513 states to 1513 states and 2263 transitions. [2025-02-08 00:12:50,703 INFO L78 Accepts]: Start accepts. Automaton has 1513 states and 2263 transitions. Word has length 38 [2025-02-08 00:12:50,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 00:12:50,703 INFO L471 AbstractCegarLoop]: Abstraction has 1513 states and 2263 transitions. [2025-02-08 00:12:50,704 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 4 states have internal predecessors, (38), 0 states have call successors, (0), 0 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:12:50,704 INFO L276 IsEmpty]: Start isEmpty. Operand 1513 states and 2263 transitions. [2025-02-08 00:12:50,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2025-02-08 00:12:50,707 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 00:12:50,707 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] [2025-02-08 00:12:50,707 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-08 00:12:50,707 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 00:12:50,708 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:12:50,709 INFO L85 PathProgramCache]: Analyzing trace with hash 157085004, now seen corresponding path program 1 times [2025-02-08 00:12:50,709 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 00:12:50,709 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1092175116] [2025-02-08 00:12:50,709 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:12:50,709 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 00:12:50,747 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-02-08 00:12:50,876 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-02-08 00:12:50,876 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:12:50,876 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:12:51,683 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:12:51,684 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 00:12:51,684 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1092175116] [2025-02-08 00:12:51,684 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1092175116] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 00:12:51,684 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 00:12:51,684 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-08 00:12:51,684 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1787625454] [2025-02-08 00:12:51,684 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 00:12:51,684 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-08 00:12:51,684 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 00:12:51,685 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-08 00:12:51,685 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-02-08 00:12:51,685 INFO L87 Difference]: Start difference. First operand 1513 states and 2263 transitions. Second operand has 8 states, 8 states have (on average 4.875) internal successors, (39), 7 states have internal predecessors, (39), 0 states have call successors, (0), 0 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:12:53,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 00:12:53,622 INFO L93 Difference]: Finished difference Result 4465 states and 6679 transitions. [2025-02-08 00:12:53,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-08 00:12:53,623 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.875) internal successors, (39), 7 states have internal predecessors, (39), 0 states have call successors, (0), 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 39 [2025-02-08 00:12:53,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 00:12:53,635 INFO L225 Difference]: With dead ends: 4465 [2025-02-08 00:12:53,635 INFO L226 Difference]: Without dead ends: 2989 [2025-02-08 00:12:53,639 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2025-02-08 00:12:53,640 INFO L435 NwaCegarLoop]: 1865 mSDtfsCounter, 6633 mSDsluCounter, 9264 mSDsCounter, 0 mSdLazyCounter, 2338 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6633 SdHoareTripleChecker+Valid, 11129 SdHoareTripleChecker+Invalid, 2339 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 2338 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2025-02-08 00:12:53,641 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6633 Valid, 11129 Invalid, 2339 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 2338 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2025-02-08 00:12:53,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2989 states. [2025-02-08 00:12:53,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2989 to 1528. [2025-02-08 00:12:53,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1528 states, 1527 states have (on average 1.495743287491814) internal successors, (2284), 1527 states have internal predecessors, (2284), 0 states have call successors, (0), 0 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:12:53,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1528 states to 1528 states and 2284 transitions. [2025-02-08 00:12:53,685 INFO L78 Accepts]: Start accepts. Automaton has 1528 states and 2284 transitions. Word has length 39 [2025-02-08 00:12:53,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 00:12:53,686 INFO L471 AbstractCegarLoop]: Abstraction has 1528 states and 2284 transitions. [2025-02-08 00:12:53,686 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.875) internal successors, (39), 7 states have internal predecessors, (39), 0 states have call successors, (0), 0 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:12:53,686 INFO L276 IsEmpty]: Start isEmpty. Operand 1528 states and 2284 transitions. [2025-02-08 00:12:53,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2025-02-08 00:12:53,687 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 00:12:53,687 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] [2025-02-08 00:12:53,687 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-08 00:12:53,687 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 00:12:53,688 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:12:53,688 INFO L85 PathProgramCache]: Analyzing trace with hash 1530357403, now seen corresponding path program 1 times [2025-02-08 00:12:53,688 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 00:12:53,688 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [606759881] [2025-02-08 00:12:53,688 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:12:53,688 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 00:12:53,717 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-02-08 00:12:53,742 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-02-08 00:12:53,743 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:12:53,743 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:12:54,096 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:12:54,097 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 00:12:54,097 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [606759881] [2025-02-08 00:12:54,097 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [606759881] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 00:12:54,097 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 00:12:54,097 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-08 00:12:54,097 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1315047473] [2025-02-08 00:12:54,098 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 00:12:54,098 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-08 00:12:54,098 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 00:12:54,098 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-08 00:12:54,098 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-02-08 00:12:54,099 INFO L87 Difference]: Start difference. First operand 1528 states and 2284 transitions. Second operand has 7 states, 7 states have (on average 5.571428571428571) internal successors, (39), 6 states have internal predecessors, (39), 0 states have call successors, (0), 0 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:12:55,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 00:12:55,445 INFO L93 Difference]: Finished difference Result 3002 states and 4490 transitions. [2025-02-08 00:12:55,445 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-08 00:12:55,445 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.571428571428571) internal successors, (39), 6 states have internal predecessors, (39), 0 states have call successors, (0), 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 39 [2025-02-08 00:12:55,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 00:12:55,452 INFO L225 Difference]: With dead ends: 3002 [2025-02-08 00:12:55,452 INFO L226 Difference]: Without dead ends: 1526 [2025-02-08 00:12:55,454 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 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:12:55,456 INFO L435 NwaCegarLoop]: 1868 mSDtfsCounter, 2230 mSDsluCounter, 7460 mSDsCounter, 0 mSdLazyCounter, 1927 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2230 SdHoareTripleChecker+Valid, 9328 SdHoareTripleChecker+Invalid, 1930 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 1927 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-02-08 00:12:55,457 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2230 Valid, 9328 Invalid, 1930 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 1927 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-02-08 00:12:55,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1526 states. [2025-02-08 00:12:55,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1526 to 1523. [2025-02-08 00:12:55,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1523 states, 1522 states have (on average 1.4960578186596583) internal successors, (2277), 1522 states have internal predecessors, (2277), 0 states have call successors, (0), 0 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:12:55,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1523 states to 1523 states and 2277 transitions. [2025-02-08 00:12:55,489 INFO L78 Accepts]: Start accepts. Automaton has 1523 states and 2277 transitions. Word has length 39 [2025-02-08 00:12:55,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 00:12:55,490 INFO L471 AbstractCegarLoop]: Abstraction has 1523 states and 2277 transitions. [2025-02-08 00:12:55,490 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.571428571428571) internal successors, (39), 6 states have internal predecessors, (39), 0 states have call successors, (0), 0 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:12:55,490 INFO L276 IsEmpty]: Start isEmpty. Operand 1523 states and 2277 transitions. [2025-02-08 00:12:55,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-02-08 00:12:55,491 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 00:12:55,492 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] [2025-02-08 00:12:55,492 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-08 00:12:55,492 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 00:12:55,492 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:12:55,493 INFO L85 PathProgramCache]: Analyzing trace with hash 711531854, now seen corresponding path program 1 times [2025-02-08 00:12:55,493 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 00:12:55,493 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [725868391] [2025-02-08 00:12:55,493 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:12:55,493 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 00:12:55,522 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-02-08 00:12:55,568 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-02-08 00:12:55,568 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:12:55,568 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 00:12:55,568 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 00:12:55,584 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-02-08 00:12:55,632 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-02-08 00:12:55,633 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:12:55,633 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 00:12:55,694 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 00:12:55,695 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-08 00:12:55,696 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-02-08 00:12:55,698 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-08 00:12:55,700 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2025-02-08 00:12:55,748 WARN L310 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2025-02-08 00:12:55,764 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-08 00:12:55,767 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.02 12:12:55 BoogieIcfgContainer [2025-02-08 00:12:55,768 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-08 00:12:55,769 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-08 00:12:55,769 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-08 00:12:55,769 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-08 00:12:55,770 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 12:12:46" (3/4) ... [2025-02-08 00:12:55,772 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-02-08 00:12:55,772 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-08 00:12:55,775 INFO L158 Benchmark]: Toolchain (without parser) took 17229.34ms. Allocated memory was 142.6MB in the beginning and 478.2MB in the end (delta: 335.5MB). Free memory was 110.1MB in the beginning and 197.3MB in the end (delta: -87.2MB). Peak memory consumption was 246.0MB. Max. memory is 16.1GB. [2025-02-08 00:12:55,775 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 201.3MB. Free memory is still 123.6MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 00:12:55,775 INFO L158 Benchmark]: CACSL2BoogieTranslator took 879.57ms. Allocated memory is still 142.6MB. Free memory was 110.1MB in the beginning and 88.3MB in the end (delta: 21.8MB). Peak memory consumption was 98.4MB. Max. memory is 16.1GB. [2025-02-08 00:12:55,777 INFO L158 Benchmark]: Boogie Procedure Inliner took 636.34ms. Allocated memory was 142.6MB in the beginning and 369.1MB in the end (delta: 226.5MB). Free memory was 88.3MB in the beginning and 237.8MB in the end (delta: -149.5MB). Peak memory consumption was 106.1MB. Max. memory is 16.1GB. [2025-02-08 00:12:55,777 INFO L158 Benchmark]: Boogie Preprocessor took 483.89ms. Allocated memory is still 369.1MB. Free memory was 237.7MB in the beginning and 207.5MB in the end (delta: 30.2MB). Peak memory consumption was 48.7MB. Max. memory is 16.1GB. [2025-02-08 00:12:55,777 INFO L158 Benchmark]: IcfgBuilder took 5666.67ms. Allocated memory was 369.1MB in the beginning and 704.6MB in the end (delta: 335.5MB). Free memory was 207.5MB in the beginning and 355.4MB in the end (delta: -147.9MB). Peak memory consumption was 203.3MB. Max. memory is 16.1GB. [2025-02-08 00:12:55,777 INFO L158 Benchmark]: TraceAbstraction took 9548.19ms. Allocated memory was 704.6MB in the beginning and 478.2MB in the end (delta: -226.5MB). Free memory was 355.4MB in the beginning and 201.5MB in the end (delta: 153.9MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 00:12:55,778 INFO L158 Benchmark]: Witness Printer took 4.00ms. Allocated memory is still 478.2MB. Free memory was 201.5MB in the beginning and 197.3MB in the end (delta: 4.2MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 00:12:55,780 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.21ms. Allocated memory is still 201.3MB. Free memory is still 123.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 879.57ms. Allocated memory is still 142.6MB. Free memory was 110.1MB in the beginning and 88.3MB in the end (delta: 21.8MB). Peak memory consumption was 98.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 636.34ms. Allocated memory was 142.6MB in the beginning and 369.1MB in the end (delta: 226.5MB). Free memory was 88.3MB in the beginning and 237.8MB in the end (delta: -149.5MB). Peak memory consumption was 106.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 483.89ms. Allocated memory is still 369.1MB. Free memory was 237.7MB in the beginning and 207.5MB in the end (delta: 30.2MB). Peak memory consumption was 48.7MB. Max. memory is 16.1GB. * IcfgBuilder took 5666.67ms. Allocated memory was 369.1MB in the beginning and 704.6MB in the end (delta: 335.5MB). Free memory was 207.5MB in the beginning and 355.4MB in the end (delta: -147.9MB). Peak memory consumption was 203.3MB. Max. memory is 16.1GB. * TraceAbstraction took 9548.19ms. Allocated memory was 704.6MB in the beginning and 478.2MB in the end (delta: -226.5MB). Free memory was 355.4MB in the beginning and 201.5MB in the end (delta: 153.9MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 4.00ms. Allocated memory is still 478.2MB. Free memory was 201.5MB in the beginning and 197.3MB in the end (delta: 4.2MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 21]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of bitwiseAnd at line 207. Possible FailurePath: [L26] const SORT_1 mask_SORT_1 = (SORT_1)-1 >> (sizeof(SORT_1) * 8 - 12); [L27] const SORT_1 msb_SORT_1 = (SORT_1)1 << (12 - 1); [L29] const SORT_6 mask_SORT_6 = (SORT_6)-1 >> (sizeof(SORT_6) * 8 - 1); [L30] const SORT_6 msb_SORT_6 = (SORT_6)1 << (1 - 1); [L32] const SORT_11 mask_SORT_11 = (SORT_11)-1 >> (sizeof(SORT_11) * 8 - 4); [L33] const SORT_11 msb_SORT_11 = (SORT_11)1 << (4 - 1); [L35] const SORT_37 mask_SORT_37 = (SORT_37)-1 >> (sizeof(SORT_37) * 8 - 32); [L36] const SORT_37 msb_SORT_37 = (SORT_37)1 << (32 - 1); [L38] const SORT_41 mask_SORT_41 = (SORT_41)-1 >> (sizeof(SORT_41) * 8 - 3); [L39] const SORT_41 msb_SORT_41 = (SORT_41)1 << (3 - 1); [L41] const SORT_289 mask_SORT_289 = (SORT_289)-1 >> (sizeof(SORT_289) * 8 - 2); [L42] const SORT_289 msb_SORT_289 = (SORT_289)1 << (2 - 1); [L44] const SORT_293 mask_SORT_293 = (SORT_293)-1 >> (sizeof(SORT_293) * 8 - 5); [L45] const SORT_293 msb_SORT_293 = (SORT_293)1 << (5 - 1); [L47] const SORT_295 mask_SORT_295 = (SORT_295)-1 >> (sizeof(SORT_295) * 8 - 6); [L48] const SORT_295 msb_SORT_295 = (SORT_295)1 << (6 - 1); [L50] const SORT_297 mask_SORT_297 = (SORT_297)-1 >> (sizeof(SORT_297) * 8 - 7); [L51] const SORT_297 msb_SORT_297 = (SORT_297)1 << (7 - 1); [L53] const SORT_299 mask_SORT_299 = (SORT_299)-1 >> (sizeof(SORT_299) * 8 - 8); [L54] const SORT_299 msb_SORT_299 = (SORT_299)1 << (8 - 1); [L56] const SORT_301 mask_SORT_301 = (SORT_301)-1 >> (sizeof(SORT_301) * 8 - 9); [L57] const SORT_301 msb_SORT_301 = (SORT_301)1 << (9 - 1); [L59] const SORT_303 mask_SORT_303 = (SORT_303)-1 >> (sizeof(SORT_303) * 8 - 10); [L60] const SORT_303 msb_SORT_303 = (SORT_303)1 << (10 - 1); [L62] const SORT_305 mask_SORT_305 = (SORT_305)-1 >> (sizeof(SORT_305) * 8 - 11); [L63] const SORT_305 msb_SORT_305 = (SORT_305)1 << (11 - 1); [L65] const SORT_1 var_16 = 0; [L66] const SORT_6 var_21 = 0; [L67] const SORT_37 var_39 = 0; [L68] const SORT_41 var_42 = 0; [L69] const SORT_41 var_45 = 6; [L70] const SORT_41 var_47 = 7; [L71] const SORT_6 var_53 = 1; [L72] const SORT_11 var_57 = 2; [L73] const SORT_11 var_62 = 9; [L74] const SORT_11 var_70 = 15; [L75] const SORT_11 var_75 = 1; [L76] const SORT_11 var_77 = 3; [L77] const SORT_11 var_80 = 5; [L78] const SORT_11 var_83 = 7; [L79] const SORT_11 var_86 = 11; [L80] const SORT_11 var_108 = 8; [L81] const SORT_11 var_112 = 10; [L82] const SORT_11 var_116 = 13; [L83] const SORT_11 var_127 = 4; [L84] const SORT_11 var_129 = 12; [L85] const SORT_11 var_132 = 14; [L86] const SORT_11 var_138 = 6; [L87] const SORT_11 var_165 = 0; [L88] const SORT_41 var_209 = 1; [L89] const SORT_41 var_211 = 5; [L90] const SORT_1 var_229 = 4095; [L91] const SORT_1 var_569 = 1; [L92] const SORT_305 var_577 = 0; [L94] SORT_1 input_2; [L95] SORT_1 input_3; [L96] SORT_1 input_4; [L97] SORT_1 input_5; [L98] SORT_6 input_7; [L99] SORT_6 input_8; [L100] SORT_6 input_9; [L101] SORT_1 input_10; [L102] SORT_11 input_12; [L103] SORT_6 input_13; [L104] SORT_6 input_14; [L105] SORT_6 input_15; [L106] SORT_1 input_216; [L107] SORT_41 input_219; [L109] EXPR __VERIFIER_nondet_ushort() & mask_SORT_1 VAL [mask_SORT_11=15, mask_SORT_1=4095, mask_SORT_289=3, mask_SORT_293=31, mask_SORT_295=63, mask_SORT_297=127, mask_SORT_299=255, mask_SORT_301=511, mask_SORT_303=1023, mask_SORT_305=2047, mask_SORT_41=7, mask_SORT_6=1, var_108=8, var_112=10, var_116=13, var_127=4, var_129=12, var_132=14, var_138=6, var_165=0, var_16=0, var_209=1, var_211=5, var_21=0, var_229=4095, var_39=0, var_42=0, var_45=6, var_47=7, var_53=1, var_569=1, var_577=0, var_57=2, var_62=9, var_70=15, var_75=1, var_77=3, var_80=5, var_83=7, var_86=11] [L109] SORT_1 state_17 = __VERIFIER_nondet_ushort() & mask_SORT_1; [L110] EXPR __VERIFIER_nondet_ushort() & mask_SORT_1 VAL [mask_SORT_11=15, mask_SORT_1=4095, mask_SORT_289=3, mask_SORT_293=31, mask_SORT_295=63, mask_SORT_297=127, mask_SORT_299=255, mask_SORT_301=511, mask_SORT_303=1023, mask_SORT_305=2047, mask_SORT_41=7, mask_SORT_6=1, var_108=8, var_112=10, var_116=13, var_127=4, var_129=12, var_132=14, var_138=6, var_165=0, var_16=0, var_209=1, var_211=5, var_21=0, var_229=4095, var_39=0, var_42=0, var_45=6, var_47=7, var_53=1, var_569=1, var_577=0, var_57=2, var_62=9, var_70=15, var_75=1, var_77=3, var_80=5, var_83=7, var_86=11] [L110] SORT_1 state_19 = __VERIFIER_nondet_ushort() & mask_SORT_1; [L111] EXPR __VERIFIER_nondet_ushort() & mask_SORT_1 VAL [mask_SORT_11=15, mask_SORT_1=4095, mask_SORT_289=3, mask_SORT_293=31, mask_SORT_295=63, mask_SORT_297=127, mask_SORT_299=255, mask_SORT_301=511, mask_SORT_303=1023, mask_SORT_305=2047, mask_SORT_41=7, mask_SORT_6=1, var_108=8, var_112=10, var_116=13, var_127=4, var_129=12, var_132=14, var_138=6, var_165=0, var_16=0, var_209=1, var_211=5, var_21=0, var_229=4095, var_39=0, var_42=0, var_45=6, var_47=7, var_53=1, var_569=1, var_577=0, var_57=2, var_62=9, var_70=15, var_75=1, var_77=3, var_80=5, var_83=7, var_86=11] [L111] SORT_1 state_23 = __VERIFIER_nondet_ushort() & mask_SORT_1; [L112] EXPR __VERIFIER_nondet_ushort() & mask_SORT_1 VAL [mask_SORT_11=15, mask_SORT_1=4095, mask_SORT_289=3, mask_SORT_293=31, mask_SORT_295=63, mask_SORT_297=127, mask_SORT_299=255, mask_SORT_301=511, mask_SORT_303=1023, mask_SORT_305=2047, mask_SORT_41=7, mask_SORT_6=1, var_108=8, var_112=10, var_116=13, var_127=4, var_129=12, var_132=14, var_138=6, var_165=0, var_16=0, var_209=1, var_211=5, var_21=0, var_229=4095, var_39=0, var_42=0, var_45=6, var_47=7, var_53=1, var_569=1, var_577=0, var_57=2, var_62=9, var_70=15, var_75=1, var_77=3, var_80=5, var_83=7, var_86=11] [L112] SORT_1 state_25 = __VERIFIER_nondet_ushort() & mask_SORT_1; [L113] EXPR __VERIFIER_nondet_ushort() & mask_SORT_1 VAL [mask_SORT_11=15, mask_SORT_1=4095, mask_SORT_289=3, mask_SORT_293=31, mask_SORT_295=63, mask_SORT_297=127, mask_SORT_299=255, mask_SORT_301=511, mask_SORT_303=1023, mask_SORT_305=2047, mask_SORT_41=7, mask_SORT_6=1, var_108=8, var_112=10, var_116=13, var_127=4, var_129=12, var_132=14, var_138=6, var_165=0, var_16=0, var_209=1, var_211=5, var_21=0, var_229=4095, var_39=0, var_42=0, var_45=6, var_47=7, var_53=1, var_569=1, var_577=0, var_57=2, var_62=9, var_70=15, var_75=1, var_77=3, var_80=5, var_83=7, var_86=11] [L113] SORT_1 state_29 = __VERIFIER_nondet_ushort() & mask_SORT_1; [L114] EXPR __VERIFIER_nondet_ushort() & mask_SORT_1 VAL [mask_SORT_11=15, mask_SORT_1=4095, mask_SORT_289=3, mask_SORT_293=31, mask_SORT_295=63, mask_SORT_297=127, mask_SORT_299=255, mask_SORT_301=511, mask_SORT_303=1023, mask_SORT_305=2047, mask_SORT_41=7, mask_SORT_6=1, var_108=8, var_112=10, var_116=13, var_127=4, var_129=12, var_132=14, var_138=6, var_165=0, var_16=0, var_209=1, var_211=5, var_21=0, var_229=4095, var_39=0, var_42=0, var_45=6, var_47=7, var_53=1, var_569=1, var_577=0, var_57=2, var_62=9, var_70=15, var_75=1, var_77=3, var_80=5, var_83=7, var_86=11] [L114] SORT_1 state_31 = __VERIFIER_nondet_ushort() & mask_SORT_1; [L115] EXPR __VERIFIER_nondet_uchar() & mask_SORT_41 VAL [mask_SORT_11=15, mask_SORT_1=4095, mask_SORT_289=3, mask_SORT_293=31, mask_SORT_295=63, mask_SORT_297=127, mask_SORT_299=255, mask_SORT_301=511, mask_SORT_303=1023, mask_SORT_305=2047, mask_SORT_41=7, mask_SORT_6=1, var_108=8, var_112=10, var_116=13, var_127=4, var_129=12, var_132=14, var_138=6, var_165=0, var_16=0, var_209=1, var_211=5, var_21=0, var_229=4095, var_39=0, var_42=0, var_45=6, var_47=7, var_53=1, var_569=1, var_577=0, var_57=2, var_62=9, var_70=15, var_75=1, var_77=3, var_80=5, var_83=7, var_86=11] [L115] SORT_41 state_43 = __VERIFIER_nondet_uchar() & mask_SORT_41; [L116] EXPR __VERIFIER_nondet_ushort() & mask_SORT_1 VAL [mask_SORT_11=15, mask_SORT_1=4095, mask_SORT_289=3, mask_SORT_293=31, mask_SORT_295=63, mask_SORT_297=127, mask_SORT_299=255, mask_SORT_301=511, mask_SORT_303=1023, mask_SORT_305=2047, mask_SORT_41=7, mask_SORT_6=1, var_108=8, var_112=10, var_116=13, var_127=4, var_129=12, var_132=14, var_138=6, var_165=0, var_16=0, var_209=1, var_211=5, var_21=0, var_229=4095, var_39=0, var_42=0, var_45=6, var_47=7, var_53=1, var_569=1, var_577=0, var_57=2, var_62=9, var_70=15, var_75=1, var_77=3, var_80=5, var_83=7, var_86=11] [L116] SORT_1 state_59 = __VERIFIER_nondet_ushort() & mask_SORT_1; [L117] EXPR __VERIFIER_nondet_ushort() & mask_SORT_1 VAL [mask_SORT_11=15, mask_SORT_1=4095, mask_SORT_289=3, mask_SORT_293=31, mask_SORT_295=63, mask_SORT_297=127, mask_SORT_299=255, mask_SORT_301=511, mask_SORT_303=1023, mask_SORT_305=2047, mask_SORT_41=7, mask_SORT_6=1, var_108=8, var_112=10, var_116=13, var_127=4, var_129=12, var_132=14, var_138=6, var_165=0, var_16=0, var_209=1, var_211=5, var_21=0, var_229=4095, var_39=0, var_42=0, var_45=6, var_47=7, var_53=1, var_569=1, var_577=0, var_57=2, var_62=9, var_70=15, var_75=1, var_77=3, var_80=5, var_83=7, var_86=11] [L117] SORT_1 state_125 = __VERIFIER_nondet_ushort() & mask_SORT_1; [L119] SORT_1 init_18_arg_1 = var_16; [L120] state_17 = init_18_arg_1 [L121] SORT_1 init_20_arg_1 = var_16; [L122] state_19 = init_20_arg_1 [L123] SORT_1 init_24_arg_1 = var_16; [L124] state_23 = init_24_arg_1 [L125] SORT_1 init_26_arg_1 = var_16; [L126] state_25 = init_26_arg_1 [L127] SORT_1 init_30_arg_1 = var_16; [L128] state_29 = init_30_arg_1 [L129] SORT_1 init_32_arg_1 = var_16; [L130] state_31 = init_32_arg_1 [L131] SORT_41 init_44_arg_1 = var_42; [L132] state_43 = init_44_arg_1 [L133] SORT_1 init_60_arg_1 = var_16; [L134] state_59 = init_60_arg_1 [L135] SORT_1 init_126_arg_1 = var_16; [L136] state_125 = init_126_arg_1 VAL [mask_SORT_11=15, mask_SORT_1=4095, mask_SORT_289=3, mask_SORT_293=31, mask_SORT_295=63, mask_SORT_297=127, mask_SORT_299=255, mask_SORT_301=511, mask_SORT_303=1023, mask_SORT_305=2047, mask_SORT_41=7, mask_SORT_6=1, state_125=0, state_17=0, state_19=0, state_23=0, state_25=0, state_29=0, state_31=0, state_43=0, state_59=0, var_108=8, var_112=10, var_116=13, var_127=4, var_129=12, var_132=14, var_138=6, var_165=0, var_16=0, var_209=1, var_211=5, var_21=0, var_229=4095, var_39=0, var_42=0, var_45=6, var_47=7, var_53=1, var_569=1, var_577=0, var_57=2, var_62=9, var_70=15, var_75=1, var_77=3, var_80=5, var_83=7, var_86=11] [L139] input_2 = __VERIFIER_nondet_ushort() [L140] input_3 = __VERIFIER_nondet_ushort() [L141] input_4 = __VERIFIER_nondet_ushort() [L142] input_5 = __VERIFIER_nondet_ushort() [L143] input_7 = __VERIFIER_nondet_uchar() [L144] input_8 = __VERIFIER_nondet_uchar() [L145] input_9 = __VERIFIER_nondet_uchar() [L146] EXPR input_9 & mask_SORT_6 VAL [mask_SORT_11=15, mask_SORT_1=4095, mask_SORT_289=3, mask_SORT_293=31, mask_SORT_295=63, mask_SORT_297=127, mask_SORT_299=255, mask_SORT_301=511, mask_SORT_303=1023, mask_SORT_305=2047, mask_SORT_41=7, mask_SORT_6=1, state_125=0, state_17=0, state_19=0, state_23=0, state_25=0, state_29=0, state_31=0, state_43=0, state_59=0, var_108=8, var_112=10, var_116=13, var_127=4, var_129=12, var_132=14, var_138=6, var_165=0, var_16=0, var_209=1, var_211=5, var_21=0, var_229=4095, var_39=0, var_42=0, var_45=6, var_47=7, var_53=1, var_569=1, var_577=0, var_57=2, var_62=9, var_70=15, var_75=1, var_77=3, var_80=5, var_83=7, var_86=11] [L146] input_9 = input_9 & mask_SORT_6 [L147] input_10 = __VERIFIER_nondet_ushort() [L148] input_12 = __VERIFIER_nondet_uchar() [L149] EXPR input_12 & mask_SORT_11 VAL [input_9=0, mask_SORT_11=15, mask_SORT_1=4095, mask_SORT_289=3, mask_SORT_293=31, mask_SORT_295=63, mask_SORT_297=127, mask_SORT_299=255, mask_SORT_301=511, mask_SORT_303=1023, mask_SORT_305=2047, mask_SORT_41=7, mask_SORT_6=1, state_125=0, state_17=0, state_19=0, state_23=0, state_25=0, state_29=0, state_31=0, state_43=0, state_59=0, var_108=8, var_112=10, var_116=13, var_127=4, var_129=12, var_132=14, var_138=6, var_165=0, var_16=0, var_209=1, var_211=5, var_21=0, var_229=4095, var_39=0, var_42=0, var_45=6, var_47=7, var_53=1, var_569=1, var_577=0, var_57=2, var_62=9, var_70=15, var_75=1, var_77=3, var_80=5, var_83=7, var_86=11] [L149] input_12 = input_12 & mask_SORT_11 [L150] input_13 = __VERIFIER_nondet_uchar() [L151] input_14 = __VERIFIER_nondet_uchar() [L152] input_15 = __VERIFIER_nondet_uchar() [L153] input_216 = __VERIFIER_nondet_ushort() [L154] input_219 = __VERIFIER_nondet_uchar() [L157] SORT_6 var_34_arg_0 = var_21; [L158] SORT_1 var_34_arg_1 = input_5; [L159] SORT_1 var_34_arg_2 = input_4; [L160] SORT_1 var_34 = var_34_arg_0 ? var_34_arg_1 : var_34_arg_2; [L161] SORT_6 var_33_arg_0 = var_21; [L162] SORT_1 var_33_arg_1 = state_31; [L163] SORT_1 var_33_arg_2 = state_29; [L164] SORT_1 var_33 = var_33_arg_0 ? var_33_arg_1 : var_33_arg_2; [L165] SORT_6 var_35_arg_0 = var_21; [L166] SORT_1 var_35_arg_1 = var_34; [L167] SORT_1 var_35_arg_2 = var_33; [L168] SORT_1 var_35 = var_35_arg_0 ? var_35_arg_1 : var_35_arg_2; [L169] SORT_6 var_27_arg_0 = var_21; [L170] SORT_1 var_27_arg_1 = state_25; [L171] SORT_1 var_27_arg_2 = state_23; [L172] SORT_1 var_27 = var_27_arg_0 ? var_27_arg_1 : var_27_arg_2; [L173] SORT_6 var_22_arg_0 = var_21; [L174] SORT_1 var_22_arg_1 = state_19; [L175] SORT_1 var_22_arg_2 = state_17; [L176] SORT_1 var_22 = var_22_arg_0 ? var_22_arg_1 : var_22_arg_2; [L177] SORT_6 var_28_arg_0 = var_21; [L178] SORT_1 var_28_arg_1 = var_27; [L179] SORT_1 var_28_arg_2 = var_22; [L180] SORT_1 var_28 = var_28_arg_0 ? var_28_arg_1 : var_28_arg_2; [L181] SORT_6 var_36_arg_0 = var_21; [L182] SORT_1 var_36_arg_1 = var_35; [L183] SORT_1 var_36_arg_2 = var_28; [L184] SORT_1 var_36 = var_36_arg_0 ? var_36_arg_1 : var_36_arg_2; [L185] SORT_1 var_38_arg_0 = var_36; VAL [input_12=0, input_9=0, mask_SORT_11=15, mask_SORT_1=4095, mask_SORT_289=3, mask_SORT_293=31, mask_SORT_295=63, mask_SORT_297=127, mask_SORT_299=255, mask_SORT_301=511, mask_SORT_303=1023, mask_SORT_305=2047, mask_SORT_41=7, mask_SORT_6=1, state_125=0, state_17=0, state_19=0, state_23=0, state_25=0, state_29=0, state_31=0, state_43=0, state_59=0, var_108=8, var_112=10, var_116=13, var_127=4, var_129=12, var_132=14, var_138=6, var_165=0, var_16=0, var_209=1, var_211=5, var_21=0, var_229=4095, var_38_arg_0=0, var_39=0, var_42=0, var_45=6, var_47=7, var_53=1, var_569=1, var_577=0, var_57=2, var_62=9, var_70=15, var_75=1, var_77=3, var_80=5, var_83=7, var_86=11] [L186] EXPR var_38_arg_0 & mask_SORT_1 VAL [input_12=0, input_9=0, mask_SORT_11=15, mask_SORT_1=4095, mask_SORT_289=3, mask_SORT_293=31, mask_SORT_295=63, mask_SORT_297=127, mask_SORT_299=255, mask_SORT_301=511, mask_SORT_303=1023, mask_SORT_305=2047, mask_SORT_41=7, mask_SORT_6=1, state_125=0, state_17=0, state_19=0, state_23=0, state_25=0, state_29=0, state_31=0, state_43=0, state_59=0, var_108=8, var_112=10, var_116=13, var_127=4, var_129=12, var_132=14, var_138=6, var_165=0, var_16=0, var_209=1, var_211=5, var_21=0, var_229=4095, var_39=0, var_42=0, var_45=6, var_47=7, var_53=1, var_569=1, var_577=0, var_57=2, var_62=9, var_70=15, var_75=1, var_77=3, var_80=5, var_83=7, var_86=11] [L186] var_38_arg_0 = var_38_arg_0 & mask_SORT_1 [L187] SORT_37 var_38 = var_38_arg_0; [L188] SORT_37 var_40_arg_0 = var_38; [L189] SORT_37 var_40_arg_1 = var_39; [L190] SORT_6 var_40 = var_40_arg_0 == var_40_arg_1; [L191] SORT_41 var_46_arg_0 = state_43; [L192] SORT_41 var_46_arg_1 = var_45; [L193] SORT_6 var_46 = var_46_arg_0 != var_46_arg_1; [L194] SORT_41 var_48_arg_0 = state_43; [L195] SORT_41 var_48_arg_1 = var_47; [L196] SORT_6 var_48 = var_48_arg_0 != var_48_arg_1; [L197] SORT_6 var_49_arg_0 = var_46; [L198] SORT_6 var_49_arg_1 = var_48; VAL [input_12=0, input_9=0, mask_SORT_11=15, mask_SORT_1=4095, mask_SORT_289=3, mask_SORT_293=31, mask_SORT_295=63, mask_SORT_297=127, mask_SORT_299=255, mask_SORT_301=511, mask_SORT_303=1023, mask_SORT_305=2047, mask_SORT_41=7, mask_SORT_6=1, state_125=0, state_17=0, state_19=0, state_23=0, state_25=0, state_29=0, state_31=0, state_43=0, state_59=0, var_108=8, var_112=10, var_116=13, var_127=4, var_129=12, var_132=14, var_138=6, var_165=0, var_16=0, var_209=1, var_211=5, var_21=0, var_229=4095, var_39=0, var_40=1, var_42=0, var_45=6, var_47=7, var_49_arg_0=1, var_49_arg_1=1, var_53=1, var_569=1, var_577=0, var_57=2, var_62=9, var_70=15, var_75=1, var_77=3, var_80=5, var_83=7, var_86=11] [L199] EXPR var_49_arg_0 | var_49_arg_1 VAL [input_12=0, input_9=0, mask_SORT_11=15, mask_SORT_1=4095, mask_SORT_289=3, mask_SORT_293=31, mask_SORT_295=63, mask_SORT_297=127, mask_SORT_299=255, mask_SORT_301=511, mask_SORT_303=1023, mask_SORT_305=2047, mask_SORT_41=7, mask_SORT_6=1, state_125=0, state_17=0, state_19=0, state_23=0, state_25=0, state_29=0, state_31=0, state_43=0, state_59=0, var_108=8, var_112=10, var_116=13, var_127=4, var_129=12, var_132=14, var_138=6, var_165=0, var_16=0, var_209=1, var_211=5, var_21=0, var_229=4095, var_39=0, var_40=1, var_42=0, var_45=6, var_47=7, var_53=1, var_569=1, var_577=0, var_57=2, var_62=9, var_70=15, var_75=1, var_77=3, var_80=5, var_83=7, var_86=11] [L199] SORT_6 var_49 = var_49_arg_0 | var_49_arg_1; [L200] SORT_6 var_50_arg_0 = var_40; [L201] SORT_6 var_50_arg_1 = var_49; VAL [input_12=0, input_9=0, mask_SORT_11=15, mask_SORT_1=4095, mask_SORT_289=3, mask_SORT_293=31, mask_SORT_295=63, mask_SORT_297=127, mask_SORT_299=255, mask_SORT_301=511, mask_SORT_303=1023, mask_SORT_305=2047, mask_SORT_41=7, mask_SORT_6=1, state_125=0, state_17=0, state_19=0, state_23=0, state_25=0, state_29=0, state_31=0, state_43=0, state_59=0, var_108=8, var_112=10, var_116=13, var_127=4, var_129=12, var_132=14, var_138=6, var_165=0, var_16=0, var_209=1, var_211=5, var_21=0, var_229=4095, var_39=0, var_42=0, var_45=6, var_47=7, var_50_arg_0=1, var_50_arg_1=1, var_53=1, var_569=1, var_577=0, var_57=2, var_62=9, var_70=15, var_75=1, var_77=3, var_80=5, var_83=7, var_86=11] [L202] EXPR var_50_arg_0 & var_50_arg_1 VAL [input_12=0, input_9=0, mask_SORT_11=15, mask_SORT_1=4095, mask_SORT_289=3, mask_SORT_293=31, mask_SORT_295=63, mask_SORT_297=127, mask_SORT_299=255, mask_SORT_301=511, mask_SORT_303=1023, mask_SORT_305=2047, mask_SORT_41=7, mask_SORT_6=1, state_125=0, state_17=0, state_19=0, state_23=0, state_25=0, state_29=0, state_31=0, state_43=0, state_59=0, var_108=8, var_112=10, var_116=13, var_127=4, var_129=12, var_132=14, var_138=6, var_165=0, var_16=0, var_209=1, var_211=5, var_21=0, var_229=4095, var_39=0, var_42=0, var_45=6, var_47=7, var_53=1, var_569=1, var_577=0, var_57=2, var_62=9, var_70=15, var_75=1, var_77=3, var_80=5, var_83=7, var_86=11] [L202] SORT_6 var_50 = var_50_arg_0 & var_50_arg_1; [L203] SORT_6 var_54_arg_0 = var_50; [L204] SORT_6 var_54 = ~var_54_arg_0; [L205] SORT_6 var_55_arg_0 = var_53; [L206] SORT_6 var_55_arg_1 = var_54; VAL [input_12=0, input_9=0, mask_SORT_11=15, mask_SORT_1=4095, mask_SORT_289=3, mask_SORT_293=31, mask_SORT_295=63, mask_SORT_297=127, mask_SORT_299=255, mask_SORT_301=511, mask_SORT_303=1023, mask_SORT_305=2047, mask_SORT_41=7, mask_SORT_6=1, state_125=0, state_17=0, state_19=0, state_23=0, state_25=0, state_29=0, state_31=0, state_43=0, state_59=0, var_108=8, var_112=10, var_116=13, var_127=4, var_129=12, var_132=14, var_138=6, var_165=0, var_16=0, var_209=1, var_211=5, var_21=0, var_229=4095, var_39=0, var_42=0, var_45=6, var_47=7, var_53=1, var_55_arg_0=1, var_55_arg_1=-2, var_569=1, var_577=0, var_57=2, var_62=9, var_70=15, var_75=1, var_77=3, var_80=5, var_83=7, var_86=11] [L207] EXPR var_55_arg_0 & var_55_arg_1 VAL [input_12=0, input_9=0, mask_SORT_11=15, mask_SORT_1=4095, mask_SORT_289=3, mask_SORT_293=31, mask_SORT_295=63, mask_SORT_297=127, mask_SORT_299=255, mask_SORT_301=511, mask_SORT_303=1023, mask_SORT_305=2047, mask_SORT_41=7, mask_SORT_6=1, state_125=0, state_17=0, state_19=0, state_23=0, state_25=0, state_29=0, state_31=0, state_43=0, state_59=0, var_108=8, var_112=10, var_116=13, var_127=4, var_129=12, var_132=14, var_138=6, var_165=0, var_16=0, var_209=1, var_211=5, var_21=0, var_229=4095, var_39=0, var_42=0, var_45=6, var_47=7, var_53=1, var_569=1, var_577=0, var_57=2, var_62=9, var_70=15, var_75=1, var_77=3, var_80=5, var_83=7, var_86=11] [L207] SORT_6 var_55 = var_55_arg_0 & var_55_arg_1; [L208] EXPR var_55 & mask_SORT_6 VAL [input_12=0, input_9=0, mask_SORT_11=15, mask_SORT_1=4095, mask_SORT_289=3, mask_SORT_293=31, mask_SORT_295=63, mask_SORT_297=127, mask_SORT_299=255, mask_SORT_301=511, mask_SORT_303=1023, mask_SORT_305=2047, mask_SORT_41=7, mask_SORT_6=1, state_125=0, state_17=0, state_19=0, state_23=0, state_25=0, state_29=0, state_31=0, state_43=0, state_59=0, var_108=8, var_112=10, var_116=13, var_127=4, var_129=12, var_132=14, var_138=6, var_165=0, var_16=0, var_209=1, var_211=5, var_21=0, var_229=4095, var_39=0, var_42=0, var_45=6, var_47=7, var_53=1, var_569=1, var_577=0, var_57=2, var_62=9, var_70=15, var_75=1, var_77=3, var_80=5, var_83=7, var_86=11] [L208] var_55 = var_55 & mask_SORT_6 [L209] SORT_6 bad_56_arg_0 = var_55; [L210] CALL __VERIFIER_assert(!(bad_56_arg_0)) [L21] COND TRUE !(cond) [L21] reach_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 1508 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 9.4s, OverallIterations: 6, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 5.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 11095 SdHoareTripleChecker+Valid, 5.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 11095 mSDsluCounter, 37336 SdHoareTripleChecker+Invalid, 4.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 27970 mSDsCounter, 5 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 7687 IncrementalHoareTripleChecker+Invalid, 7692 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 5 mSolverCounterUnsat, 9366 mSDtfsCounter, 7687 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 36 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1528occurred in iteration=4, InterpolantAutomatonStates: 28, 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, 5 MinimizatonAttempts, 1465 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 2.3s InterpolantComputationTime, 229 NumberOfCodeBlocks, 229 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 184 ConstructedInterpolants, 0 QuantifiedInterpolants, 620 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 5 InterpolantComputations, 5 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:12:55,806 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, 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_am2910_p1.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 e3ac6f8d68dfadee83df50cc30cff5b03f705d6e7b992071314ad032158be302 --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-08 00:12:58,126 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-08 00:12:58,231 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:12:58,237 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-08 00:12:58,237 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-08 00:12:58,273 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-08 00:12:58,274 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-08 00:12:58,274 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-08 00:12:58,274 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-08 00:12:58,274 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-08 00:12:58,274 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-08 00:12:58,274 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-08 00:12:58,275 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-08 00:12:58,275 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-08 00:12:58,275 INFO L153 SettingsManager]: * Use SBE=true [2025-02-08 00:12:58,275 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-08 00:12:58,275 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-08 00:12:58,275 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-08 00:12:58,275 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-08 00:12:58,275 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-08 00:12:58,275 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-08 00:12:58,277 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-02-08 00:12:58,277 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-02-08 00:12:58,277 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-02-08 00:12:58,277 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-08 00:12:58,277 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-08 00:12:58,277 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-08 00:12:58,277 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-08 00:12:58,277 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-08 00:12:58,277 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-08 00:12:58,277 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-08 00:12:58,278 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 00:12:58,278 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-08 00:12:58,278 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-08 00:12:58,278 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-08 00:12:58,278 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-08 00:12:58,278 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-02-08 00:12:58,278 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-02-08 00:12:58,278 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-08 00:12:58,278 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-08 00:12:58,278 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-08 00:12:58,278 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-08 00:12:58,278 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 -> e3ac6f8d68dfadee83df50cc30cff5b03f705d6e7b992071314ad032158be302 [2025-02-08 00:12:58,561 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-08 00:12:58,569 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-08 00:12:58,571 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-08 00:12:58,572 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-08 00:12:58,573 INFO L274 PluginConnector]: CDTParser initialized [2025-02-08 00:12:58,574 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_am2910_p1.c [2025-02-08 00:12:59,923 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/42a3e8a71/178543798ddf4028ab9a12610c2061c7/FLAG2c4d334ff [2025-02-08 00:13:00,273 INFO L384 CDTParser]: Found 1 translation units. [2025-02-08 00:13:00,277 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_arrays_am2910_p1.c [2025-02-08 00:13:00,300 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/42a3e8a71/178543798ddf4028ab9a12610c2061c7/FLAG2c4d334ff [2025-02-08 00:13:00,324 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/42a3e8a71/178543798ddf4028ab9a12610c2061c7 [2025-02-08 00:13:00,327 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-08 00:13:00,328 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-08 00:13:00,329 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-08 00:13:00,330 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-08 00:13:00,334 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-08 00:13:00,335 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 12:13:00" (1/1) ... [2025-02-08 00:13:00,336 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1885dd4f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:13:00, skipping insertion in model container [2025-02-08 00:13:00,336 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 12:13:00" (1/1) ... [2025-02-08 00:13:00,402 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-08 00:13:00,591 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_am2910_p1.c[1260,1273] [2025-02-08 00:13:00,904 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 00:13:00,915 INFO L200 MainTranslator]: Completed pre-run [2025-02-08 00:13:00,923 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_am2910_p1.c[1260,1273] [2025-02-08 00:13:01,078 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 00:13:01,092 INFO L204 MainTranslator]: Completed translation [2025-02-08 00:13:01,093 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:13:01 WrapperNode [2025-02-08 00:13:01,094 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-08 00:13:01,095 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-08 00:13:01,095 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-08 00:13:01,095 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-08 00:13:01,101 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:13:01" (1/1) ... [2025-02-08 00:13:01,141 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:13:01" (1/1) ... [2025-02-08 00:13:01,220 INFO L138 Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 1782 [2025-02-08 00:13:01,221 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-08 00:13:01,222 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-08 00:13:01,222 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-08 00:13:01,222 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-08 00:13:01,229 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:13:01" (1/1) ... [2025-02-08 00:13:01,230 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:13:01" (1/1) ... [2025-02-08 00:13:01,243 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:13:01" (1/1) ... [2025-02-08 00:13:01,314 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:13:01,314 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:13:01" (1/1) ... [2025-02-08 00:13:01,315 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:13:01" (1/1) ... [2025-02-08 00:13:01,363 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:13:01" (1/1) ... [2025-02-08 00:13:01,371 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:13:01" (1/1) ... [2025-02-08 00:13:01,377 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:13:01" (1/1) ... [2025-02-08 00:13:01,384 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:13:01" (1/1) ... [2025-02-08 00:13:01,396 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-08 00:13:01,401 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-08 00:13:01,401 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-08 00:13:01,402 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-08 00:13:01,403 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:13:01" (1/1) ... [2025-02-08 00:13:01,408 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 00:13:01,421 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 00:13:01,434 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:13:01,439 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:13:01,466 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-08 00:13:01,467 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-02-08 00:13:01,467 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-08 00:13:01,467 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-08 00:13:01,804 INFO L257 CfgBuilder]: Building ICFG [2025-02-08 00:13:01,806 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-08 00:13:03,948 INFO L? ?]: Removed 89 outVars from TransFormulas that were not future-live. [2025-02-08 00:13:03,949 INFO L308 CfgBuilder]: Performing block encoding [2025-02-08 00:13:03,957 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-08 00:13:03,957 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-08 00:13:03,957 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 12:13:03 BoogieIcfgContainer [2025-02-08 00:13:03,957 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-08 00:13:03,961 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-08 00:13:03,961 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-08 00:13:03,966 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-08 00:13:03,967 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.02 12:13:00" (1/3) ... [2025-02-08 00:13:03,968 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@678951db and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 12:13:03, skipping insertion in model container [2025-02-08 00:13:03,968 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:13:01" (2/3) ... [2025-02-08 00:13:03,969 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@678951db and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 12:13:03, skipping insertion in model container [2025-02-08 00:13:03,969 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 12:13:03" (3/3) ... [2025-02-08 00:13:03,971 INFO L128 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.vis_arrays_am2910_p1.c [2025-02-08 00:13:03,983 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-08 00:13:03,985 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG btor2c-lazyMod.vis_arrays_am2910_p1.c that has 1 procedures, 8 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-08 00:13:04,027 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 00:13:04,036 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;@eed5ee, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 00:13:04,037 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-08 00:13:04,040 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:13:04,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2025-02-08 00:13:04,045 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 00:13:04,045 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2025-02-08 00:13:04,046 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 00:13:04,050 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:13:04,051 INFO L85 PathProgramCache]: Analyzing trace with hash 1137951, now seen corresponding path program 1 times [2025-02-08 00:13:04,058 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-08 00:13:04,059 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1684143922] [2025-02-08 00:13:04,059 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:13:04,059 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 00:13:04,060 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 00:13:04,062 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:13:04,063 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:13:04,472 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-08 00:13:04,508 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-08 00:13:04,509 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:13:04,509 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:13:04,514 INFO L256 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 41 conjuncts are in the unsatisfiable core [2025-02-08 00:13:04,529 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 00:13:04,906 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:13:04,906 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 00:13:04,907 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-08 00:13:04,907 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1684143922] [2025-02-08 00:13:04,908 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1684143922] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 00:13:04,908 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 00:13:04,908 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 00:13:04,910 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [883745039] [2025-02-08 00:13:04,910 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 00:13:04,914 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 00:13:04,914 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-08 00:13:04,929 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 00:13:04,929 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 00:13:04,931 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:13:05,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 00:13:05,088 INFO L93 Difference]: Finished difference Result 16 states and 21 transitions. [2025-02-08 00:13:05,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 00:13:05,091 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:13:05,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 00:13:05,097 INFO L225 Difference]: With dead ends: 16 [2025-02-08 00:13:05,098 INFO L226 Difference]: Without dead ends: 9 [2025-02-08 00:13:05,100 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-08 00:13:05,103 INFO L435 NwaCegarLoop]: 3 mSDtfsCounter, 2 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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.1s IncrementalHoareTripleChecker+Time [2025-02-08 00:13:05,105 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.1s Time] [2025-02-08 00:13:05,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2025-02-08 00:13:05,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 8. [2025-02-08 00:13:05,128 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:13:05,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 8 transitions. [2025-02-08 00:13:05,132 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 8 transitions. Word has length 4 [2025-02-08 00:13:05,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 00:13:05,132 INFO L471 AbstractCegarLoop]: Abstraction has 8 states and 8 transitions. [2025-02-08 00:13:05,132 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:13:05,133 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2025-02-08 00:13:05,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-02-08 00:13:05,133 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 00:13:05,133 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1] [2025-02-08 00:13:05,143 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:13:05,338 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:13:05,338 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 00:13:05,339 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:13:05,339 INFO L85 PathProgramCache]: Analyzing trace with hash -458170295, now seen corresponding path program 1 times [2025-02-08 00:13:05,340 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-08 00:13:05,341 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2010358864] [2025-02-08 00:13:05,341 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:13:05,341 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 00:13:05,341 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 00:13:05,343 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:13:05,344 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:13:05,810 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-02-08 00:13:05,905 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-02-08 00:13:05,905 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:13:05,905 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:13:05,920 INFO L256 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 61 conjuncts are in the unsatisfiable core [2025-02-08 00:13:05,935 INFO L279 TraceCheckSpWp]: Computing forward predicates...