./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.v_Unidec.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.v_Unidec.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 c14eea1490451e84235fd4f93f05fdff3c411b2c5f93e6c8c24af5ce00f88831 --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-08 00:08:21,172 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-08 00:08:21,258 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:08:21,263 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-08 00:08:21,264 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-08 00:08:21,292 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-08 00:08:21,294 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-08 00:08:21,294 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-08 00:08:21,294 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-08 00:08:21,294 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-08 00:08:21,295 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-08 00:08:21,295 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-08 00:08:21,295 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-08 00:08:21,296 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-08 00:08:21,296 INFO L153 SettingsManager]: * Use SBE=true [2025-02-08 00:08:21,296 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-08 00:08:21,297 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-08 00:08:21,297 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-08 00:08:21,297 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-08 00:08:21,297 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-08 00:08:21,297 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-08 00:08:21,297 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-08 00:08:21,297 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-08 00:08:21,298 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-08 00:08:21,298 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-08 00:08:21,298 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-08 00:08:21,298 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-08 00:08:21,298 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-08 00:08:21,298 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-08 00:08:21,298 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 00:08:21,298 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-08 00:08:21,299 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-08 00:08:21,299 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-08 00:08:21,299 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-08 00:08:21,299 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-08 00:08:21,299 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-08 00:08:21,299 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-08 00:08:21,299 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-08 00:08:21,299 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-08 00:08:21,299 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-08 00:08:21,299 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 -> c14eea1490451e84235fd4f93f05fdff3c411b2c5f93e6c8c24af5ce00f88831 [2025-02-08 00:08:21,602 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-08 00:08:21,615 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-08 00:08:21,617 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-08 00:08:21,619 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-08 00:08:21,619 INFO L274 PluginConnector]: CDTParser initialized [2025-02-08 00:08:21,620 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.v_Unidec.c [2025-02-08 00:08:23,105 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/84558c6a6/9b5931b120f14da6afd791b0157b88c9/FLAG62d673ff0 [2025-02-08 00:08:23,505 INFO L384 CDTParser]: Found 1 translation units. [2025-02-08 00:08:23,509 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.v_Unidec.c [2025-02-08 00:08:23,533 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/84558c6a6/9b5931b120f14da6afd791b0157b88c9/FLAG62d673ff0 [2025-02-08 00:08:23,558 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/84558c6a6/9b5931b120f14da6afd791b0157b88c9 [2025-02-08 00:08:23,561 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-08 00:08:23,563 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-08 00:08:23,566 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-08 00:08:23,567 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-08 00:08:23,571 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-08 00:08:23,572 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 12:08:23" (1/1) ... [2025-02-08 00:08:23,573 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@60e8eac8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:08:23, skipping insertion in model container [2025-02-08 00:08:23,573 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 12:08:23" (1/1) ... [2025-02-08 00:08:23,613 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-08 00:08:23,777 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.v_Unidec.c[1248,1261] [2025-02-08 00:08:23,939 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 00:08:23,954 INFO L200 MainTranslator]: Completed pre-run [2025-02-08 00:08:23,962 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.v_Unidec.c[1248,1261] [2025-02-08 00:08:24,051 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 00:08:24,064 INFO L204 MainTranslator]: Completed translation [2025-02-08 00:08:24,065 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:08:24 WrapperNode [2025-02-08 00:08:24,065 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-08 00:08:24,066 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-08 00:08:24,066 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-08 00:08:24,066 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-08 00:08:24,074 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:08:24" (1/1) ... [2025-02-08 00:08:24,101 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:08:24" (1/1) ... [2025-02-08 00:08:24,238 INFO L138 Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 1219 [2025-02-08 00:08:24,239 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-08 00:08:24,240 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-08 00:08:24,240 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-08 00:08:24,240 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-08 00:08:24,248 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:08:24" (1/1) ... [2025-02-08 00:08:24,249 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:08:24" (1/1) ... [2025-02-08 00:08:24,279 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:08:24" (1/1) ... [2025-02-08 00:08:24,338 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:08:24,339 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:08:24" (1/1) ... [2025-02-08 00:08:24,339 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:08:24" (1/1) ... [2025-02-08 00:08:24,389 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:08:24" (1/1) ... [2025-02-08 00:08:24,399 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:08:24" (1/1) ... [2025-02-08 00:08:24,410 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:08:24" (1/1) ... [2025-02-08 00:08:24,424 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:08:24" (1/1) ... [2025-02-08 00:08:24,449 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-08 00:08:24,451 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-08 00:08:24,452 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-08 00:08:24,452 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-08 00:08:24,453 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:08:24" (1/1) ... [2025-02-08 00:08:24,458 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 00:08:24,471 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 00:08:24,486 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:08:24,490 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:08:24,516 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-08 00:08:24,516 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-08 00:08:24,516 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-08 00:08:24,516 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-08 00:08:24,760 INFO L257 CfgBuilder]: Building ICFG [2025-02-08 00:08:24,762 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-08 00:08:26,439 INFO L? ?]: Removed 730 outVars from TransFormulas that were not future-live. [2025-02-08 00:08:26,440 INFO L308 CfgBuilder]: Performing block encoding [2025-02-08 00:08:26,514 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-08 00:08:26,514 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-08 00:08:26,515 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 12:08:26 BoogieIcfgContainer [2025-02-08 00:08:26,515 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-08 00:08:26,517 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-08 00:08:26,517 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-08 00:08:26,521 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-08 00:08:26,522 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.02 12:08:23" (1/3) ... [2025-02-08 00:08:26,523 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2cbb534c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 12:08:26, skipping insertion in model container [2025-02-08 00:08:26,523 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:08:24" (2/3) ... [2025-02-08 00:08:26,523 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2cbb534c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 12:08:26, skipping insertion in model container [2025-02-08 00:08:26,523 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 12:08:26" (3/3) ... [2025-02-08 00:08:26,524 INFO L128 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.v_Unidec.c [2025-02-08 00:08:26,539 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-08 00:08:26,541 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG btor2c-lazyMod.v_Unidec.c that has 1 procedures, 284 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-08 00:08:26,619 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 00:08:26,632 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;@4f959b6d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 00:08:26,633 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-08 00:08:26,639 INFO L276 IsEmpty]: Start isEmpty. Operand has 284 states, 282 states have (on average 1.5) internal successors, (423), 283 states have internal predecessors, (423), 0 states have call successors, (0), 0 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:08:26,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-02-08 00:08:26,644 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 00:08:26,645 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 00:08:26,645 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 00:08:26,651 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:08:26,652 INFO L85 PathProgramCache]: Analyzing trace with hash -183048120, now seen corresponding path program 1 times [2025-02-08 00:08:26,659 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 00:08:26,660 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [262077869] [2025-02-08 00:08:26,660 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:08:26,661 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 00:08:26,751 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-02-08 00:08:26,815 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-02-08 00:08:26,815 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:08:26,816 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:08:27,295 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:08:27,298 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 00:08:27,298 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [262077869] [2025-02-08 00:08:27,299 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [262077869] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 00:08:27,299 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 00:08:27,299 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 00:08:27,302 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [651590466] [2025-02-08 00:08:27,302 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 00:08:27,307 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 00:08:27,307 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 00:08:27,327 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 00:08:27,327 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 00:08:27,332 INFO L87 Difference]: Start difference. First operand has 284 states, 282 states have (on average 1.5) internal successors, (423), 283 states have internal predecessors, (423), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:08:27,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 00:08:27,619 INFO L93 Difference]: Finished difference Result 555 states and 829 transitions. [2025-02-08 00:08:27,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 00:08:27,623 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2025-02-08 00:08:27,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 00:08:27,636 INFO L225 Difference]: With dead ends: 555 [2025-02-08 00:08:27,636 INFO L226 Difference]: Without dead ends: 284 [2025-02-08 00:08:27,642 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:08:27,648 INFO L435 NwaCegarLoop]: 349 mSDtfsCounter, 0 mSDsluCounter, 693 mSDsCounter, 0 mSdLazyCounter, 217 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1042 SdHoareTripleChecker+Invalid, 217 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 217 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-08 00:08:27,651 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1042 Invalid, 217 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 217 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-08 00:08:27,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 284 states. [2025-02-08 00:08:27,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 284 to 284. [2025-02-08 00:08:27,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 284 states, 283 states have (on average 1.4911660777385158) internal successors, (422), 283 states have internal predecessors, (422), 0 states have call successors, (0), 0 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:08:27,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 284 states to 284 states and 422 transitions. [2025-02-08 00:08:27,696 INFO L78 Accepts]: Start accepts. Automaton has 284 states and 422 transitions. Word has length 20 [2025-02-08 00:08:27,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 00:08:27,697 INFO L471 AbstractCegarLoop]: Abstraction has 284 states and 422 transitions. [2025-02-08 00:08:27,697 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:08:27,698 INFO L276 IsEmpty]: Start isEmpty. Operand 284 states and 422 transitions. [2025-02-08 00:08:27,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-02-08 00:08:27,699 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 00:08:27,699 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 00:08:27,700 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-08 00:08:27,701 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 00:08:27,702 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:08:27,702 INFO L85 PathProgramCache]: Analyzing trace with hash -1374844854, now seen corresponding path program 1 times [2025-02-08 00:08:27,702 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 00:08:27,702 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1397073732] [2025-02-08 00:08:27,702 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:08:27,702 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 00:08:27,726 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-02-08 00:08:27,739 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-02-08 00:08:27,739 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:08:27,739 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:08:27,877 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:08:27,877 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 00:08:27,877 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1397073732] [2025-02-08 00:08:27,878 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1397073732] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 00:08:27,878 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 00:08:27,879 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 00:08:27,879 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1393742982] [2025-02-08 00:08:27,879 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 00:08:27,880 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 00:08:27,880 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 00:08:27,880 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 00:08:27,881 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 00:08:27,881 INFO L87 Difference]: Start difference. First operand 284 states and 422 transitions. Second operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:08:28,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 00:08:28,106 INFO L93 Difference]: Finished difference Result 557 states and 828 transitions. [2025-02-08 00:08:28,106 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 00:08:28,106 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2025-02-08 00:08:28,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 00:08:28,108 INFO L225 Difference]: With dead ends: 557 [2025-02-08 00:08:28,109 INFO L226 Difference]: Without dead ends: 286 [2025-02-08 00:08:28,109 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:08:28,110 INFO L435 NwaCegarLoop]: 349 mSDtfsCounter, 0 mSDsluCounter, 690 mSDsCounter, 0 mSdLazyCounter, 220 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1039 SdHoareTripleChecker+Invalid, 220 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 220 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-08 00:08:28,110 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1039 Invalid, 220 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 220 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-08 00:08:28,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 286 states. [2025-02-08 00:08:28,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 286 to 286. [2025-02-08 00:08:28,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 286 states, 285 states have (on average 1.487719298245614) internal successors, (424), 285 states have internal predecessors, (424), 0 states have call successors, (0), 0 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:08:28,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 286 states to 286 states and 424 transitions. [2025-02-08 00:08:28,129 INFO L78 Accepts]: Start accepts. Automaton has 286 states and 424 transitions. Word has length 21 [2025-02-08 00:08:28,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 00:08:28,129 INFO L471 AbstractCegarLoop]: Abstraction has 286 states and 424 transitions. [2025-02-08 00:08:28,129 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:08:28,129 INFO L276 IsEmpty]: Start isEmpty. Operand 286 states and 424 transitions. [2025-02-08 00:08:28,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-02-08 00:08:28,130 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 00:08:28,130 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 00:08:28,130 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-08 00:08:28,130 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 00:08:28,131 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:08:28,134 INFO L85 PathProgramCache]: Analyzing trace with hash -2033975165, now seen corresponding path program 1 times [2025-02-08 00:08:28,135 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 00:08:28,135 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [120260193] [2025-02-08 00:08:28,135 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:08:28,135 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 00:08:28,156 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-02-08 00:08:28,210 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-02-08 00:08:28,210 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:08:28,210 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:08:28,432 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:08:28,432 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 00:08:28,432 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [120260193] [2025-02-08 00:08:28,432 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [120260193] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 00:08:28,433 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 00:08:28,433 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 00:08:28,433 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [519123196] [2025-02-08 00:08:28,433 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 00:08:28,433 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 00:08:28,433 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 00:08:28,434 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 00:08:28,434 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 00:08:28,434 INFO L87 Difference]: Start difference. First operand 286 states and 424 transitions. Second operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:08:28,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 00:08:28,614 INFO L93 Difference]: Finished difference Result 557 states and 827 transitions. [2025-02-08 00:08:28,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 00:08:28,616 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2025-02-08 00:08:28,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 00:08:28,619 INFO L225 Difference]: With dead ends: 557 [2025-02-08 00:08:28,619 INFO L226 Difference]: Without dead ends: 284 [2025-02-08 00:08:28,620 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-08 00:08:28,620 INFO L435 NwaCegarLoop]: 345 mSDtfsCounter, 406 mSDsluCounter, 343 mSDsCounter, 0 mSdLazyCounter, 145 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 406 SdHoareTripleChecker+Valid, 688 SdHoareTripleChecker+Invalid, 146 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 145 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-08 00:08:28,623 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [406 Valid, 688 Invalid, 146 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 145 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-08 00:08:28,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 284 states. [2025-02-08 00:08:28,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 284 to 284. [2025-02-08 00:08:28,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 284 states, 283 states have (on average 1.4840989399293287) internal successors, (420), 283 states have internal predecessors, (420), 0 states have call successors, (0), 0 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:08:28,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 284 states to 284 states and 420 transitions. [2025-02-08 00:08:28,647 INFO L78 Accepts]: Start accepts. Automaton has 284 states and 420 transitions. Word has length 22 [2025-02-08 00:08:28,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 00:08:28,648 INFO L471 AbstractCegarLoop]: Abstraction has 284 states and 420 transitions. [2025-02-08 00:08:28,648 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:08:28,648 INFO L276 IsEmpty]: Start isEmpty. Operand 284 states and 420 transitions. [2025-02-08 00:08:28,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-02-08 00:08:28,648 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 00:08:28,648 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 00:08:28,649 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-08 00:08:28,649 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 00:08:28,649 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:08:28,649 INFO L85 PathProgramCache]: Analyzing trace with hash -1769327925, now seen corresponding path program 1 times [2025-02-08 00:08:28,649 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 00:08:28,649 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1932463772] [2025-02-08 00:08:28,649 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:08:28,649 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 00:08:28,665 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-02-08 00:08:28,733 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-02-08 00:08:28,737 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:08:28,738 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 00:08:28,738 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 00:08:28,750 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-02-08 00:08:28,793 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-02-08 00:08:28,794 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:08:28,794 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 00:08:28,848 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 00:08:28,848 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-08 00:08:28,849 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-02-08 00:08:28,851 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-08 00:08:28,854 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2025-02-08 00:08:28,901 WARN L310 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2025-02-08 00:08:28,918 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-08 00:08:28,921 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.02 12:08:28 BoogieIcfgContainer [2025-02-08 00:08:28,923 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-08 00:08:28,924 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-08 00:08:28,924 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-08 00:08:28,924 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-08 00:08:28,925 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 12:08:26" (3/4) ... [2025-02-08 00:08:28,927 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-02-08 00:08:28,929 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-08 00:08:28,930 INFO L158 Benchmark]: Toolchain (without parser) took 5366.53ms. Allocated memory is still 167.8MB. Free memory was 132.1MB in the beginning and 40.3MB in the end (delta: 91.8MB). Peak memory consumption was 94.4MB. Max. memory is 16.1GB. [2025-02-08 00:08:28,931 INFO L158 Benchmark]: CDTParser took 0.40ms. Allocated memory is still 201.3MB. Free memory is still 127.4MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 00:08:28,931 INFO L158 Benchmark]: CACSL2BoogieTranslator took 499.37ms. Allocated memory is still 167.8MB. Free memory was 132.1MB in the beginning and 101.7MB in the end (delta: 30.3MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2025-02-08 00:08:28,932 INFO L158 Benchmark]: Boogie Procedure Inliner took 172.91ms. Allocated memory is still 167.8MB. Free memory was 101.7MB in the beginning and 75.1MB in the end (delta: 26.6MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-02-08 00:08:28,932 INFO L158 Benchmark]: Boogie Preprocessor took 210.11ms. Allocated memory is still 167.8MB. Free memory was 75.1MB in the beginning and 60.0MB in the end (delta: 15.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-08 00:08:28,933 INFO L158 Benchmark]: IcfgBuilder took 2063.69ms. Allocated memory is still 167.8MB. Free memory was 60.0MB in the beginning and 86.3MB in the end (delta: -26.3MB). Peak memory consumption was 45.7MB. Max. memory is 16.1GB. [2025-02-08 00:08:28,933 INFO L158 Benchmark]: TraceAbstraction took 2406.32ms. Allocated memory is still 167.8MB. Free memory was 86.3MB in the beginning and 40.3MB in the end (delta: 45.9MB). Peak memory consumption was 45.6MB. Max. memory is 16.1GB. [2025-02-08 00:08:28,934 INFO L158 Benchmark]: Witness Printer took 4.98ms. Allocated memory is still 167.8MB. Free memory was 40.3MB in the beginning and 40.3MB in the end (delta: 27.0kB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 00:08:28,936 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.40ms. Allocated memory is still 201.3MB. Free memory is still 127.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 499.37ms. Allocated memory is still 167.8MB. Free memory was 132.1MB in the beginning and 101.7MB in the end (delta: 30.3MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 172.91ms. Allocated memory is still 167.8MB. Free memory was 101.7MB in the beginning and 75.1MB in the end (delta: 26.6MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 210.11ms. Allocated memory is still 167.8MB. Free memory was 75.1MB in the beginning and 60.0MB in the end (delta: 15.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 2063.69ms. Allocated memory is still 167.8MB. Free memory was 60.0MB in the beginning and 86.3MB in the end (delta: -26.3MB). Peak memory consumption was 45.7MB. Max. memory is 16.1GB. * TraceAbstraction took 2406.32ms. Allocated memory is still 167.8MB. Free memory was 86.3MB in the beginning and 40.3MB in the end (delta: 45.9MB). Peak memory consumption was 45.6MB. Max. memory is 16.1GB. * Witness Printer took 4.98ms. Allocated memory is still 167.8MB. Free memory was 40.3MB in the beginning and 40.3MB in the end (delta: 27.0kB). 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 161. Possible FailurePath: [L26] const SORT_1 mask_SORT_1 = (SORT_1)-1 >> (sizeof(SORT_1) * 8 - 1); [L27] const SORT_1 msb_SORT_1 = (SORT_1)1 << (1 - 1); [L29] const SORT_3 mask_SORT_3 = (SORT_3)-1 >> (sizeof(SORT_3) * 8 - 3); [L30] const SORT_3 msb_SORT_3 = (SORT_3)1 << (3 - 1); [L32] const SORT_5 mask_SORT_5 = (SORT_5)-1 >> (sizeof(SORT_5) * 8 - 2); [L33] const SORT_5 msb_SORT_5 = (SORT_5)1 << (2 - 1); [L35] const SORT_10 mask_SORT_10 = (SORT_10)-1 >> (sizeof(SORT_10) * 8 - 32); [L36] const SORT_10 msb_SORT_10 = (SORT_10)1 << (32 - 1); [L38] const SORT_22 mask_SORT_22 = (SORT_22)-1 >> (sizeof(SORT_22) * 8 - 16); [L39] const SORT_22 msb_SORT_22 = (SORT_22)1 << (16 - 1); [L41] const SORT_68 mask_SORT_68 = (SORT_68)-1 >> (sizeof(SORT_68) * 8 - 13); [L42] const SORT_68 msb_SORT_68 = (SORT_68)1 << (13 - 1); [L44] const SORT_71 mask_SORT_71 = (SORT_71)-1 >> (sizeof(SORT_71) * 8 - 6); [L45] const SORT_71 msb_SORT_71 = (SORT_71)1 << (6 - 1); [L47] const SORT_73 mask_SORT_73 = (SORT_73)-1 >> (sizeof(SORT_73) * 8 - 10); [L48] const SORT_73 msb_SORT_73 = (SORT_73)1 << (10 - 1); [L50] const SORT_79 mask_SORT_79 = (SORT_79)-1 >> (sizeof(SORT_79) * 8 - 9); [L51] const SORT_79 msb_SORT_79 = (SORT_79)1 << (9 - 1); [L53] const SORT_81 mask_SORT_81 = (SORT_81)-1 >> (sizeof(SORT_81) * 8 - 7); [L54] const SORT_81 msb_SORT_81 = (SORT_81)1 << (7 - 1); [L56] const SORT_84 mask_SORT_84 = (SORT_84)-1 >> (sizeof(SORT_84) * 8 - 12); [L57] const SORT_84 msb_SORT_84 = (SORT_84)1 << (12 - 1); [L59] const SORT_86 mask_SORT_86 = (SORT_86)-1 >> (sizeof(SORT_86) * 8 - 4); [L60] const SORT_86 msb_SORT_86 = (SORT_86)1 << (4 - 1); [L62] const SORT_1 var_7 = 0; [L63] const SORT_10 var_12 = 0; [L64] const SORT_1 var_16 = 1; [L65] const SORT_22 var_23 = 8; [L66] const SORT_22 var_24 = 10; [L67] const SORT_3 var_25 = 1; [L68] const SORT_22 var_28 = 88; [L69] const SORT_22 var_29 = 584; [L70] const SORT_3 var_30 = 3; [L71] const SORT_3 var_33 = 2; [L72] const SORT_22 var_37 = 705; [L73] const SORT_22 var_38 = 611; [L74] const SORT_3 var_39 = 5; [L75] const SORT_22 var_42 = 50825; [L76] const SORT_3 var_43 = 7; [L77] const SORT_3 var_46 = 6; [L78] const SORT_3 var_50 = 4; [L79] const SORT_22 var_65 = 0; [L80] const SORT_3 var_67 = 0; [L81] const SORT_71 var_72 = 0; [L82] const SORT_5 var_76 = 1; [L83] const SORT_79 var_80 = 0; [L84] const SORT_84 var_85 = 0; [L85] const SORT_5 var_89 = 3; [L86] const SORT_5 var_92 = 2; [L87] const SORT_68 var_97 = 1; [L88] const SORT_22 var_100 = 32767; [L89] const SORT_5 var_105 = 0; [L90] const SORT_73 var_119 = 1; [L91] const SORT_81 var_131 = 1; [L92] const SORT_86 var_141 = 1; [L94] SORT_1 input_2; [L95] SORT_3 input_4; [L96] SORT_5 input_6; [L97] SORT_22 input_66; [L98] SORT_22 input_96; [L99] SORT_22 input_108; [L100] SORT_22 input_109; [L101] SORT_22 input_118; [L102] SORT_22 input_130; [L103] SORT_22 input_140; [L104] SORT_22 input_157; [L105] SORT_22 input_166; [L106] SORT_22 input_170; [L107] SORT_22 input_179; [L108] SORT_22 input_181; [L109] SORT_22 input_190; [L110] SORT_22 input_197; [L111] SORT_22 input_201; [L112] SORT_22 input_204; [L113] SORT_22 input_206; [L115] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_22=65535, mask_SORT_3=7, mask_SORT_5=3, mask_SORT_68=8191, mask_SORT_71=63, mask_SORT_73=1023, mask_SORT_79=511, mask_SORT_81=127, mask_SORT_84=4095, mask_SORT_86=15, var_100=32767, var_105=0, var_119=1, var_12=0, var_131=1, var_141=1, var_16=1, var_23=8, var_24=10, var_25=1, var_28=88, var_29=584, var_30=3, var_33=2, var_37=705, var_38=611, var_39=5, var_42=50825, var_43=7, var_46=6, var_50=4, var_65=0, var_67=0, var_72=0, var_76=1, var_7=0, var_80=0, var_85=0, var_89=3, var_92=2, var_97=1] [L115] SORT_1 state_8 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L116] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_22=65535, mask_SORT_3=7, mask_SORT_5=3, mask_SORT_68=8191, mask_SORT_71=63, mask_SORT_73=1023, mask_SORT_79=511, mask_SORT_81=127, mask_SORT_84=4095, mask_SORT_86=15, var_100=32767, var_105=0, var_119=1, var_12=0, var_131=1, var_141=1, var_16=1, var_23=8, var_24=10, var_25=1, var_28=88, var_29=584, var_30=3, var_33=2, var_37=705, var_38=611, var_39=5, var_42=50825, var_43=7, var_46=6, var_50=4, var_65=0, var_67=0, var_72=0, var_76=1, var_7=0, var_80=0, var_85=0, var_89=3, var_92=2, var_97=1] [L116] SORT_1 state_20 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L117] EXPR __VERIFIER_nondet_ushort() & mask_SORT_22 VAL [mask_SORT_1=1, mask_SORT_22=65535, mask_SORT_3=7, mask_SORT_5=3, mask_SORT_68=8191, mask_SORT_71=63, mask_SORT_73=1023, mask_SORT_79=511, mask_SORT_81=127, mask_SORT_84=4095, mask_SORT_86=15, var_100=32767, var_105=0, var_119=1, var_12=0, var_131=1, var_141=1, var_16=1, var_23=8, var_24=10, var_25=1, var_28=88, var_29=584, var_30=3, var_33=2, var_37=705, var_38=611, var_39=5, var_42=50825, var_43=7, var_46=6, var_50=4, var_65=0, var_67=0, var_72=0, var_76=1, var_7=0, var_80=0, var_85=0, var_89=3, var_92=2, var_97=1] [L117] SORT_22 state_58 = __VERIFIER_nondet_ushort() & mask_SORT_22; [L119] SORT_1 init_9_arg_1 = var_7; [L120] state_8 = init_9_arg_1 [L121] SORT_1 init_21_arg_1 = var_16; [L122] state_20 = init_21_arg_1 [L123] SORT_22 init_59_arg_1 = var_23; [L124] state_58 = init_59_arg_1 VAL [mask_SORT_1=1, mask_SORT_22=65535, mask_SORT_3=7, mask_SORT_5=3, mask_SORT_68=8191, mask_SORT_71=63, mask_SORT_73=1023, mask_SORT_79=511, mask_SORT_81=127, mask_SORT_84=4095, mask_SORT_86=15, state_20=1, state_58=8, state_8=0, var_100=32767, var_105=0, var_119=1, var_12=0, var_131=1, var_141=1, var_16=1, var_23=8, var_24=10, var_25=1, var_28=88, var_29=584, var_30=3, var_33=2, var_37=705, var_38=611, var_39=5, var_42=50825, var_43=7, var_46=6, var_50=4, var_65=0, var_67=0, var_72=0, var_76=1, var_7=0, var_80=0, var_85=0, var_89=3, var_92=2, var_97=1] [L127] input_2 = __VERIFIER_nondet_uchar() [L128] input_4 = __VERIFIER_nondet_uchar() [L129] EXPR input_4 & mask_SORT_3 VAL [mask_SORT_1=1, mask_SORT_22=65535, mask_SORT_3=7, mask_SORT_5=3, mask_SORT_68=8191, mask_SORT_71=63, mask_SORT_73=1023, mask_SORT_79=511, mask_SORT_81=127, mask_SORT_84=4095, mask_SORT_86=15, state_20=1, state_58=8, state_8=0, var_100=32767, var_105=0, var_119=1, var_12=0, var_131=1, var_141=1, var_16=1, var_23=8, var_24=10, var_25=1, var_28=88, var_29=584, var_30=3, var_33=2, var_37=705, var_38=611, var_39=5, var_42=50825, var_43=7, var_46=6, var_50=4, var_65=0, var_67=0, var_72=0, var_76=1, var_7=0, var_80=0, var_85=0, var_89=3, var_92=2, var_97=1] [L129] input_4 = input_4 & mask_SORT_3 [L130] input_6 = __VERIFIER_nondet_uchar() [L131] EXPR input_6 & mask_SORT_5 VAL [input_4=0, mask_SORT_1=1, mask_SORT_22=65535, mask_SORT_3=7, mask_SORT_5=3, mask_SORT_68=8191, mask_SORT_71=63, mask_SORT_73=1023, mask_SORT_79=511, mask_SORT_81=127, mask_SORT_84=4095, mask_SORT_86=15, state_20=1, state_58=8, state_8=0, var_100=32767, var_105=0, var_119=1, var_12=0, var_131=1, var_141=1, var_16=1, var_23=8, var_24=10, var_25=1, var_28=88, var_29=584, var_30=3, var_33=2, var_37=705, var_38=611, var_39=5, var_42=50825, var_43=7, var_46=6, var_50=4, var_65=0, var_67=0, var_72=0, var_76=1, var_7=0, var_80=0, var_85=0, var_89=3, var_92=2, var_97=1] [L131] input_6 = input_6 & mask_SORT_5 [L132] input_66 = __VERIFIER_nondet_ushort() [L133] input_96 = __VERIFIER_nondet_ushort() [L134] input_108 = __VERIFIER_nondet_ushort() [L135] input_109 = __VERIFIER_nondet_ushort() [L136] input_118 = __VERIFIER_nondet_ushort() [L137] input_130 = __VERIFIER_nondet_ushort() [L138] input_140 = __VERIFIER_nondet_ushort() [L139] input_157 = __VERIFIER_nondet_ushort() [L140] input_166 = __VERIFIER_nondet_ushort() [L141] input_170 = __VERIFIER_nondet_ushort() [L142] input_179 = __VERIFIER_nondet_ushort() [L143] input_181 = __VERIFIER_nondet_ushort() [L144] input_190 = __VERIFIER_nondet_ushort() [L145] input_197 = __VERIFIER_nondet_ushort() [L146] input_201 = __VERIFIER_nondet_ushort() [L147] input_204 = __VERIFIER_nondet_ushort() [L148] input_206 = __VERIFIER_nondet_ushort() [L151] SORT_1 var_11_arg_0 = state_8; VAL [input_4=0, input_6=0, mask_SORT_1=1, mask_SORT_22=65535, mask_SORT_3=7, mask_SORT_5=3, mask_SORT_68=8191, mask_SORT_71=63, mask_SORT_73=1023, mask_SORT_79=511, mask_SORT_81=127, mask_SORT_84=4095, mask_SORT_86=15, state_20=1, state_58=8, var_100=32767, var_105=0, var_119=1, var_11_arg_0=0, var_12=0, var_131=1, var_141=1, var_16=1, var_23=8, var_24=10, var_25=1, var_28=88, var_29=584, var_30=3, var_33=2, var_37=705, var_38=611, var_39=5, var_42=50825, var_43=7, var_46=6, var_50=4, var_65=0, var_67=0, var_72=0, var_76=1, var_7=0, var_80=0, var_85=0, var_89=3, var_92=2, var_97=1] [L152] EXPR var_11_arg_0 & mask_SORT_1 VAL [input_4=0, input_6=0, mask_SORT_1=1, mask_SORT_22=65535, mask_SORT_3=7, mask_SORT_5=3, mask_SORT_68=8191, mask_SORT_71=63, mask_SORT_73=1023, mask_SORT_79=511, mask_SORT_81=127, mask_SORT_84=4095, mask_SORT_86=15, state_20=1, state_58=8, var_100=32767, var_105=0, var_119=1, var_12=0, var_131=1, var_141=1, var_16=1, var_23=8, var_24=10, var_25=1, var_28=88, var_29=584, var_30=3, var_33=2, var_37=705, var_38=611, var_39=5, var_42=50825, var_43=7, var_46=6, var_50=4, var_65=0, var_67=0, var_72=0, var_76=1, var_7=0, var_80=0, var_85=0, var_89=3, var_92=2, var_97=1] [L152] var_11_arg_0 = var_11_arg_0 & mask_SORT_1 [L153] SORT_10 var_11 = var_11_arg_0; [L154] SORT_10 var_13_arg_0 = var_11; [L155] SORT_10 var_13_arg_1 = var_12; [L156] SORT_1 var_13 = var_13_arg_0 == var_13_arg_1; [L157] SORT_1 var_17_arg_0 = var_13; [L158] SORT_1 var_17 = ~var_17_arg_0; [L159] SORT_1 var_18_arg_0 = var_16; [L160] SORT_1 var_18_arg_1 = var_17; VAL [input_4=0, input_6=0, mask_SORT_1=1, mask_SORT_22=65535, mask_SORT_3=7, mask_SORT_5=3, mask_SORT_68=8191, mask_SORT_71=63, mask_SORT_73=1023, mask_SORT_79=511, mask_SORT_81=127, mask_SORT_84=4095, mask_SORT_86=15, state_20=1, state_58=8, var_100=32767, var_105=0, var_119=1, var_12=0, var_131=1, var_141=1, var_16=1, var_18_arg_0=1, var_18_arg_1=-2, var_23=8, var_24=10, var_25=1, var_28=88, var_29=584, var_30=3, var_33=2, var_37=705, var_38=611, var_39=5, var_42=50825, var_43=7, var_46=6, var_50=4, var_65=0, var_67=0, var_72=0, var_76=1, var_7=0, var_80=0, var_85=0, var_89=3, var_92=2, var_97=1] [L161] EXPR var_18_arg_0 & var_18_arg_1 VAL [input_4=0, input_6=0, mask_SORT_1=1, mask_SORT_22=65535, mask_SORT_3=7, mask_SORT_5=3, mask_SORT_68=8191, mask_SORT_71=63, mask_SORT_73=1023, mask_SORT_79=511, mask_SORT_81=127, mask_SORT_84=4095, mask_SORT_86=15, state_20=1, state_58=8, var_100=32767, var_105=0, var_119=1, var_12=0, var_131=1, var_141=1, var_16=1, var_23=8, var_24=10, var_25=1, var_28=88, var_29=584, var_30=3, var_33=2, var_37=705, var_38=611, var_39=5, var_42=50825, var_43=7, var_46=6, var_50=4, var_65=0, var_67=0, var_72=0, var_76=1, var_7=0, var_80=0, var_85=0, var_89=3, var_92=2, var_97=1] [L161] SORT_1 var_18 = var_18_arg_0 & var_18_arg_1; [L162] EXPR var_18 & mask_SORT_1 VAL [input_4=0, input_6=0, mask_SORT_1=1, mask_SORT_22=65535, mask_SORT_3=7, mask_SORT_5=3, mask_SORT_68=8191, mask_SORT_71=63, mask_SORT_73=1023, mask_SORT_79=511, mask_SORT_81=127, mask_SORT_84=4095, mask_SORT_86=15, state_20=1, state_58=8, var_100=32767, var_105=0, var_119=1, var_12=0, var_131=1, var_141=1, var_16=1, var_23=8, var_24=10, var_25=1, var_28=88, var_29=584, var_30=3, var_33=2, var_37=705, var_38=611, var_39=5, var_42=50825, var_43=7, var_46=6, var_50=4, var_65=0, var_67=0, var_72=0, var_76=1, var_7=0, var_80=0, var_85=0, var_89=3, var_92=2, var_97=1] [L162] var_18 = var_18 & mask_SORT_1 [L163] SORT_1 bad_19_arg_0 = var_18; [L164] CALL __VERIFIER_assert(!(bad_19_arg_0)) [L21] COND TRUE !(cond) [L21] reach_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 284 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 2.3s, OverallIterations: 4, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 406 SdHoareTripleChecker+Valid, 0.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 406 mSDsluCounter, 2769 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1726 mSDsCounter, 1 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 582 IncrementalHoareTripleChecker+Invalid, 583 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1 mSolverCounterUnsat, 1043 mSDtfsCounter, 582 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 13 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=286occurred in iteration=2, InterpolantAutomatonStates: 12, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 3 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 86 NumberOfCodeBlocks, 86 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 60 ConstructedInterpolants, 0 QuantifiedInterpolants, 125 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 3 InterpolantComputations, 3 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:08:28,961 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.v_Unidec.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 c14eea1490451e84235fd4f93f05fdff3c411b2c5f93e6c8c24af5ce00f88831 --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-08 00:08:31,303 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-08 00:08:31,412 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:08:31,419 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-08 00:08:31,419 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-08 00:08:31,439 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-08 00:08:31,441 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-08 00:08:31,442 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-08 00:08:31,442 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-08 00:08:31,442 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-08 00:08:31,443 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-08 00:08:31,443 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-08 00:08:31,444 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-08 00:08:31,444 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-08 00:08:31,444 INFO L153 SettingsManager]: * Use SBE=true [2025-02-08 00:08:31,445 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-08 00:08:31,445 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-08 00:08:31,445 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-08 00:08:31,445 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-08 00:08:31,445 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-08 00:08:31,445 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-08 00:08:31,446 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-02-08 00:08:31,446 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-02-08 00:08:31,446 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-02-08 00:08:31,446 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-08 00:08:31,446 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-08 00:08:31,446 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-08 00:08:31,446 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-08 00:08:31,446 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-08 00:08:31,447 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-08 00:08:31,447 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-08 00:08:31,447 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 00:08:31,447 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-08 00:08:31,447 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-08 00:08:31,448 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-08 00:08:31,448 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-08 00:08:31,448 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-02-08 00:08:31,448 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-02-08 00:08:31,448 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-08 00:08:31,448 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-08 00:08:31,448 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-08 00:08:31,448 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-08 00:08:31,448 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 -> c14eea1490451e84235fd4f93f05fdff3c411b2c5f93e6c8c24af5ce00f88831 [2025-02-08 00:08:31,755 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-08 00:08:31,764 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-08 00:08:31,767 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-08 00:08:31,770 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-08 00:08:31,770 INFO L274 PluginConnector]: CDTParser initialized [2025-02-08 00:08:31,772 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.v_Unidec.c [2025-02-08 00:08:33,233 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/2e8e54660/9441541b354d4548abbab428be11c805/FLAGf54178672 [2025-02-08 00:08:33,542 INFO L384 CDTParser]: Found 1 translation units. [2025-02-08 00:08:33,545 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.v_Unidec.c [2025-02-08 00:08:33,562 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/2e8e54660/9441541b354d4548abbab428be11c805/FLAGf54178672 [2025-02-08 00:08:33,582 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/2e8e54660/9441541b354d4548abbab428be11c805 [2025-02-08 00:08:33,587 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-08 00:08:33,588 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-08 00:08:33,590 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-08 00:08:33,590 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-08 00:08:33,595 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-08 00:08:33,596 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 12:08:33" (1/1) ... [2025-02-08 00:08:33,597 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6099603d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:08:33, skipping insertion in model container [2025-02-08 00:08:33,597 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 12:08:33" (1/1) ... [2025-02-08 00:08:33,633 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-08 00:08:33,793 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.v_Unidec.c[1248,1261] [2025-02-08 00:08:33,983 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 00:08:33,994 INFO L200 MainTranslator]: Completed pre-run [2025-02-08 00:08:34,004 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.v_Unidec.c[1248,1261] [2025-02-08 00:08:34,109 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 00:08:34,122 INFO L204 MainTranslator]: Completed translation [2025-02-08 00:08:34,122 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:08:34 WrapperNode [2025-02-08 00:08:34,123 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-08 00:08:34,124 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-08 00:08:34,124 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-08 00:08:34,124 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-08 00:08:34,130 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:08:34" (1/1) ... [2025-02-08 00:08:34,157 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:08:34" (1/1) ... [2025-02-08 00:08:34,209 INFO L138 Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 667 [2025-02-08 00:08:34,211 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-08 00:08:34,211 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-08 00:08:34,212 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-08 00:08:34,212 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-08 00:08:34,221 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:08:34" (1/1) ... [2025-02-08 00:08:34,222 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:08:34" (1/1) ... [2025-02-08 00:08:34,231 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:08:34" (1/1) ... [2025-02-08 00:08:34,255 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:08:34,256 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:08:34" (1/1) ... [2025-02-08 00:08:34,256 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:08:34" (1/1) ... [2025-02-08 00:08:34,277 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:08:34" (1/1) ... [2025-02-08 00:08:34,279 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:08:34" (1/1) ... [2025-02-08 00:08:34,282 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:08:34" (1/1) ... [2025-02-08 00:08:34,285 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:08:34" (1/1) ... [2025-02-08 00:08:34,290 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-08 00:08:34,291 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-08 00:08:34,291 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-08 00:08:34,292 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-08 00:08:34,293 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:08:34" (1/1) ... [2025-02-08 00:08:34,297 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 00:08:34,316 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 00:08:34,334 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:08:34,338 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:08:34,365 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-08 00:08:34,365 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-02-08 00:08:34,365 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-08 00:08:34,366 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-08 00:08:34,590 INFO L257 CfgBuilder]: Building ICFG [2025-02-08 00:08:34,592 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-08 00:08:35,538 INFO L? ?]: Removed 50 outVars from TransFormulas that were not future-live. [2025-02-08 00:08:35,539 INFO L308 CfgBuilder]: Performing block encoding [2025-02-08 00:08:35,549 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-08 00:08:35,549 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-08 00:08:35,550 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 12:08:35 BoogieIcfgContainer [2025-02-08 00:08:35,550 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-08 00:08:35,554 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-08 00:08:35,554 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-08 00:08:35,559 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-08 00:08:35,559 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.02 12:08:33" (1/3) ... [2025-02-08 00:08:35,560 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@875b266 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 12:08:35, skipping insertion in model container [2025-02-08 00:08:35,560 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:08:34" (2/3) ... [2025-02-08 00:08:35,561 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@875b266 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 12:08:35, skipping insertion in model container [2025-02-08 00:08:35,561 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 12:08:35" (3/3) ... [2025-02-08 00:08:35,563 INFO L128 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.v_Unidec.c [2025-02-08 00:08:35,577 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-08 00:08:35,579 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG btor2c-lazyMod.v_Unidec.c that has 1 procedures, 8 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-08 00:08:35,623 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 00:08:35,634 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;@2be7248f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 00:08:35,635 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-08 00:08:35,640 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:08:35,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2025-02-08 00:08:35,645 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 00:08:35,646 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2025-02-08 00:08:35,647 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 00:08:35,651 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:08:35,651 INFO L85 PathProgramCache]: Analyzing trace with hash 1137951, now seen corresponding path program 1 times [2025-02-08 00:08:35,659 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-08 00:08:35,659 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [885770370] [2025-02-08 00:08:35,660 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:08:35,660 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 00:08:35,660 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 00:08:35,663 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:08:35,664 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:08:35,882 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-08 00:08:35,909 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-08 00:08:35,910 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:08:35,910 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:08:35,916 INFO L256 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-02-08 00:08:35,926 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 00:08:36,124 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:08:36,124 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 00:08:36,125 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-08 00:08:36,126 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [885770370] [2025-02-08 00:08:36,126 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [885770370] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 00:08:36,126 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 00:08:36,126 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 00:08:36,128 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [788842572] [2025-02-08 00:08:36,128 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 00:08:36,132 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 00:08:36,132 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-08 00:08:36,151 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 00:08:36,153 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 00:08:36,156 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:08:36,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 00:08:36,227 INFO L93 Difference]: Finished difference Result 15 states and 20 transitions. [2025-02-08 00:08:36,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 00:08:36,230 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:08:36,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 00:08:36,236 INFO L225 Difference]: With dead ends: 15 [2025-02-08 00:08:36,236 INFO L226 Difference]: Without dead ends: 8 [2025-02-08 00:08:36,239 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 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:08:36,242 INFO L435 NwaCegarLoop]: 4 mSDtfsCounter, 0 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 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:08:36,244 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 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:08:36,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2025-02-08 00:08:36,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2025-02-08 00:08:36,266 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:08:36,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 8 transitions. [2025-02-08 00:08:36,273 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 8 transitions. Word has length 4 [2025-02-08 00:08:36,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 00:08:36,274 INFO L471 AbstractCegarLoop]: Abstraction has 8 states and 8 transitions. [2025-02-08 00:08:36,274 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:08:36,274 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2025-02-08 00:08:36,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-02-08 00:08:36,275 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 00:08:36,275 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1] [2025-02-08 00:08:36,285 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:08:36,476 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:08:36,476 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 00:08:36,477 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:08:36,477 INFO L85 PathProgramCache]: Analyzing trace with hash -458170295, now seen corresponding path program 1 times [2025-02-08 00:08:36,478 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-08 00:08:36,478 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1027572837] [2025-02-08 00:08:36,478 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:08:36,478 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 00:08:36,478 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 00:08:36,480 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:08:36,482 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:08:36,676 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-02-08 00:08:36,711 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-02-08 00:08:36,711 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:08:36,711 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:08:36,716 INFO L256 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 22 conjuncts are in the unsatisfiable core [2025-02-08 00:08:36,724 INFO L279 TraceCheckSpWp]: Computing forward predicates...