./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_arrays_vsa16a_p2.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_arrays_vsa16a_p2.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 5b0af5d1e81b8ef08a8c715e25cc88665897ce7d17ecd1eab38dd9c44cbe0a9d --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 08:21:05,041 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 08:21:05,084 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2025-01-09 08:21:05,087 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 08:21:05,087 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 08:21:05,101 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 08:21:05,102 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 08:21:05,102 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 08:21:05,102 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 08:21:05,102 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 08:21:05,102 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 08:21:05,102 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 08:21:05,103 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 08:21:05,103 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 08:21:05,103 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 08:21:05,103 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 08:21:05,103 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 08:21:05,103 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 08:21:05,103 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 08:21:05,103 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 08:21:05,103 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 08:21:05,103 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 08:21:05,104 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 08:21:05,104 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 08:21:05,104 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 08:21:05,104 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 08:21:05,104 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 08:21:05,104 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 08:21:05,104 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 08:21:05,104 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 08:21:05,104 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 08:21:05,104 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 08:21:05,104 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 08:21:05,105 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 08:21:05,105 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 08:21:05,105 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 08:21:05,105 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 08:21:05,105 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 08:21:05,105 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 08:21:05,105 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 08:21:05,105 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 08:21:05,105 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 08:21:05,105 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 08:21:05,105 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 08:21:05,105 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 08:21:05,106 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 -> 5b0af5d1e81b8ef08a8c715e25cc88665897ce7d17ecd1eab38dd9c44cbe0a9d [2025-01-09 08:21:05,298 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 08:21:05,303 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 08:21:05,304 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 08:21:05,305 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 08:21:05,305 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 08:21:05,306 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_arrays_vsa16a_p2.c [2025-01-09 08:21:06,515 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/9a0540896/3ca04f4536c04967960718cd51fd1ee1/FLAG002e0bfbb [2025-01-09 08:21:06,797 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 08:21:06,797 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_arrays_vsa16a_p2.c [2025-01-09 08:21:06,812 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/9a0540896/3ca04f4536c04967960718cd51fd1ee1/FLAG002e0bfbb [2025-01-09 08:21:06,824 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/9a0540896/3ca04f4536c04967960718cd51fd1ee1 [2025-01-09 08:21:06,826 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 08:21:06,828 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 08:21:06,829 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 08:21:06,829 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 08:21:06,831 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 08:21:06,832 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 08:21:06" (1/1) ... [2025-01-09 08:21:06,832 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@11a304ab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:21:06, skipping insertion in model container [2025-01-09 08:21:06,833 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 08:21:06" (1/1) ... [2025-01-09 08:21:06,866 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 08:21:06,977 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_arrays_vsa16a_p2.c[1260,1273] [2025-01-09 08:21:07,226 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 08:21:07,236 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 08:21:07,243 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_arrays_vsa16a_p2.c[1260,1273] [2025-01-09 08:21:07,365 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 08:21:07,376 INFO L204 MainTranslator]: Completed translation [2025-01-09 08:21:07,379 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:21:07 WrapperNode [2025-01-09 08:21:07,379 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 08:21:07,380 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 08:21:07,380 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 08:21:07,380 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 08:21:07,386 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:21:07" (1/1) ... [2025-01-09 08:21:07,425 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:21:07" (1/1) ... [2025-01-09 08:21:07,769 INFO L138 Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 4466 [2025-01-09 08:21:07,770 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 08:21:07,771 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 08:21:07,771 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 08:21:07,771 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 08:21:07,778 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:21:07" (1/1) ... [2025-01-09 08:21:07,779 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:21:07" (1/1) ... [2025-01-09 08:21:07,878 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:21:07" (1/1) ... [2025-01-09 08:21:07,988 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-01-09 08:21:07,989 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:21:07" (1/1) ... [2025-01-09 08:21:07,989 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:21:07" (1/1) ... [2025-01-09 08:21:08,081 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:21:07" (1/1) ... [2025-01-09 08:21:08,107 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:21:07" (1/1) ... [2025-01-09 08:21:08,165 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:21:07" (1/1) ... [2025-01-09 08:21:08,201 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:21:07" (1/1) ... [2025-01-09 08:21:08,245 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:21:07" (1/1) ... [2025-01-09 08:21:08,325 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 08:21:08,326 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 08:21:08,327 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 08:21:08,327 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 08:21:08,330 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:21:07" (1/1) ... [2025-01-09 08:21:08,338 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 08:21:08,350 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 08:21:08,363 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-01-09 08:21:08,366 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-01-09 08:21:08,384 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 08:21:08,384 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 08:21:08,384 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 08:21:08,384 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 08:21:08,656 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 08:21:08,657 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 08:21:11,906 INFO L? ?]: Removed 2655 outVars from TransFormulas that were not future-live. [2025-01-09 08:21:11,907 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 08:21:11,939 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 08:21:11,939 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 08:21:11,939 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 08:21:11 BoogieIcfgContainer [2025-01-09 08:21:11,940 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 08:21:11,941 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 08:21:11,941 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 08:21:11,945 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 08:21:11,945 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 08:21:06" (1/3) ... [2025-01-09 08:21:11,946 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3791f99b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 08:21:11, skipping insertion in model container [2025-01-09 08:21:11,946 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:21:07" (2/3) ... [2025-01-09 08:21:11,946 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3791f99b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 08:21:11, skipping insertion in model container [2025-01-09 08:21:11,946 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 08:21:11" (3/3) ... [2025-01-09 08:21:11,947 INFO L128 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.vis_arrays_vsa16a_p2.c [2025-01-09 08:21:11,958 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 08:21:11,960 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG btor2c-lazyMod.vis_arrays_vsa16a_p2.c that has 1 procedures, 1335 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 08:21:12,020 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 08:21:12,028 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;@4322f742, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 08:21:12,029 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 08:21:12,035 INFO L276 IsEmpty]: Start isEmpty. Operand has 1335 states, 1333 states have (on average 1.4996249062265565) internal successors, (1999), 1334 states have internal predecessors, (1999), 0 states have call successors, (0), 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-01-09 08:21:12,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2025-01-09 08:21:12,039 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 08:21:12,040 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 08:21:12,040 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 08:21:12,043 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 08:21:12,044 INFO L85 PathProgramCache]: Analyzing trace with hash 328805578, now seen corresponding path program 1 times [2025-01-09 08:21:12,049 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 08:21:12,049 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1136930510] [2025-01-09 08:21:12,050 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 08:21:12,050 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 08:21:12,140 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-01-09 08:21:12,204 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-01-09 08:21:12,205 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 08:21:12,205 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 08:21:12,558 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 08:21:12,559 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 08:21:12,560 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1136930510] [2025-01-09 08:21:12,561 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1136930510] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 08:21:12,562 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 08:21:12,562 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 08:21:12,563 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1952251410] [2025-01-09 08:21:12,563 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 08:21:12,566 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 08:21:12,566 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 08:21:12,579 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 08:21:12,580 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 08:21:12,585 INFO L87 Difference]: Start difference. First operand has 1335 states, 1333 states have (on average 1.4996249062265565) internal successors, (1999), 1334 states have internal predecessors, (1999), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:21:12,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 08:21:12,711 INFO L93 Difference]: Finished difference Result 2615 states and 3919 transitions. [2025-01-09 08:21:12,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 08:21:12,717 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2025-01-09 08:21:12,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 08:21:12,741 INFO L225 Difference]: With dead ends: 2615 [2025-01-09 08:21:12,741 INFO L226 Difference]: Without dead ends: 1334 [2025-01-09 08:21:12,748 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-01-09 08:21:12,754 INFO L435 NwaCegarLoop]: 1993 mSDtfsCounter, 0 mSDsluCounter, 3980 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 5973 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 08:21:12,754 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 5973 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 08:21:12,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1334 states. [2025-01-09 08:21:12,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1334 to 1334. [2025-01-09 08:21:12,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1334 states, 1333 states have (on average 1.498124531132783) internal successors, (1997), 1333 states have internal predecessors, (1997), 0 states have call successors, (0), 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-01-09 08:21:12,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1334 states to 1334 states and 1997 transitions. [2025-01-09 08:21:12,839 INFO L78 Accepts]: Start accepts. Automaton has 1334 states and 1997 transitions. Word has length 37 [2025-01-09 08:21:12,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 08:21:12,839 INFO L471 AbstractCegarLoop]: Abstraction has 1334 states and 1997 transitions. [2025-01-09 08:21:12,839 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:21:12,839 INFO L276 IsEmpty]: Start isEmpty. Operand 1334 states and 1997 transitions. [2025-01-09 08:21:12,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2025-01-09 08:21:12,840 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 08:21:12,840 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 08:21:12,841 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 08:21:12,842 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 08:21:12,842 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 08:21:12,842 INFO L85 PathProgramCache]: Analyzing trace with hash 1604733687, now seen corresponding path program 1 times [2025-01-09 08:21:12,845 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 08:21:12,846 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [962122124] [2025-01-09 08:21:12,846 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 08:21:12,846 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 08:21:12,884 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-01-09 08:21:12,906 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-01-09 08:21:12,906 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 08:21:12,906 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 08:21:13,032 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 08:21:13,032 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 08:21:13,032 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [962122124] [2025-01-09 08:21:13,033 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [962122124] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 08:21:13,033 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 08:21:13,033 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 08:21:13,033 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [780406485] [2025-01-09 08:21:13,033 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 08:21:13,035 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 08:21:13,035 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 08:21:13,035 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 08:21:13,035 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 08:21:13,035 INFO L87 Difference]: Start difference. First operand 1334 states and 1997 transitions. Second operand has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:21:13,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 08:21:13,096 INFO L93 Difference]: Finished difference Result 2616 states and 3917 transitions. [2025-01-09 08:21:13,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 08:21:13,097 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2025-01-09 08:21:13,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 08:21:13,102 INFO L225 Difference]: With dead ends: 2616 [2025-01-09 08:21:13,102 INFO L226 Difference]: Without dead ends: 1336 [2025-01-09 08:21:13,104 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-01-09 08:21:13,104 INFO L435 NwaCegarLoop]: 1993 mSDtfsCounter, 0 mSDsluCounter, 3976 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 5969 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 08:21:13,105 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 5969 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 08:21:13,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1336 states. [2025-01-09 08:21:13,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1336 to 1336. [2025-01-09 08:21:13,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1336 states, 1335 states have (on average 1.497378277153558) internal successors, (1999), 1335 states have internal predecessors, (1999), 0 states have call successors, (0), 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-01-09 08:21:13,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1336 states to 1336 states and 1999 transitions. [2025-01-09 08:21:13,129 INFO L78 Accepts]: Start accepts. Automaton has 1336 states and 1999 transitions. Word has length 38 [2025-01-09 08:21:13,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 08:21:13,129 INFO L471 AbstractCegarLoop]: Abstraction has 1336 states and 1999 transitions. [2025-01-09 08:21:13,129 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:21:13,129 INFO L276 IsEmpty]: Start isEmpty. Operand 1336 states and 1999 transitions. [2025-01-09 08:21:13,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2025-01-09 08:21:13,130 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 08:21:13,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 08:21:13,130 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 08:21:13,131 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 08:21:13,131 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 08:21:13,131 INFO L85 PathProgramCache]: Analyzing trace with hash 1404138307, now seen corresponding path program 1 times [2025-01-09 08:21:13,131 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 08:21:13,131 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [789121682] [2025-01-09 08:21:13,131 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 08:21:13,132 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 08:21:13,186 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-01-09 08:21:13,210 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-01-09 08:21:13,210 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 08:21:13,210 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 08:21:13,486 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 08:21:13,486 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 08:21:13,486 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [789121682] [2025-01-09 08:21:13,486 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [789121682] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 08:21:13,486 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 08:21:13,487 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 08:21:13,487 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1904362871] [2025-01-09 08:21:13,487 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 08:21:13,487 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 08:21:13,487 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 08:21:13,487 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 08:21:13,487 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-09 08:21:13,488 INFO L87 Difference]: Start difference. First operand 1336 states and 1999 transitions. Second operand has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:21:13,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 08:21:13,558 INFO L93 Difference]: Finished difference Result 2616 states and 3916 transitions. [2025-01-09 08:21:13,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 08:21:13,563 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 39 [2025-01-09 08:21:13,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 08:21:13,570 INFO L225 Difference]: With dead ends: 2616 [2025-01-09 08:21:13,570 INFO L226 Difference]: Without dead ends: 1334 [2025-01-09 08:21:13,572 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-01-09 08:21:13,573 INFO L435 NwaCegarLoop]: 1987 mSDtfsCounter, 1966 mSDsluCounter, 1986 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1966 SdHoareTripleChecker+Valid, 3973 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 08:21:13,574 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1966 Valid, 3973 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 08:21:13,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1334 states. [2025-01-09 08:21:13,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1334 to 1334. [2025-01-09 08:21:13,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1334 states, 1333 states have (on average 1.4966241560390097) internal successors, (1995), 1333 states have internal predecessors, (1995), 0 states have call successors, (0), 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-01-09 08:21:13,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1334 states to 1334 states and 1995 transitions. [2025-01-09 08:21:13,596 INFO L78 Accepts]: Start accepts. Automaton has 1334 states and 1995 transitions. Word has length 39 [2025-01-09 08:21:13,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 08:21:13,597 INFO L471 AbstractCegarLoop]: Abstraction has 1334 states and 1995 transitions. [2025-01-09 08:21:13,597 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:21:13,597 INFO L276 IsEmpty]: Start isEmpty. Operand 1334 states and 1995 transitions. [2025-01-09 08:21:13,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-01-09 08:21:13,599 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 08:21:13,599 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 08:21:13,599 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 08:21:13,599 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 08:21:13,600 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 08:21:13,600 INFO L85 PathProgramCache]: Analyzing trace with hash 2143159866, now seen corresponding path program 1 times [2025-01-09 08:21:13,601 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 08:21:13,601 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [150138747] [2025-01-09 08:21:13,601 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 08:21:13,601 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 08:21:13,629 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-01-09 08:21:13,665 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-01-09 08:21:13,665 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 08:21:13,665 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 08:21:13,665 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-09 08:21:13,677 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-01-09 08:21:13,709 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-01-09 08:21:13,710 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 08:21:13,711 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 08:21:13,755 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-09 08:21:13,756 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-09 08:21:13,756 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-01-09 08:21:13,758 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 08:21:13,760 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2025-01-09 08:21:13,801 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-09 08:21:13,804 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.01 08:21:13 BoogieIcfgContainer [2025-01-09 08:21:13,804 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-09 08:21:13,805 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-09 08:21:13,805 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-09 08:21:13,805 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-09 08:21:13,806 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 08:21:11" (3/4) ... [2025-01-09 08:21:13,807 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-01-09 08:21:13,808 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-09 08:21:13,809 INFO L158 Benchmark]: Toolchain (without parser) took 6981.02ms. Allocated memory was 167.8MB in the beginning and 620.8MB in the end (delta: 453.0MB). Free memory was 117.5MB in the beginning and 344.9MB in the end (delta: -227.4MB). Peak memory consumption was 225.0MB. Max. memory is 16.1GB. [2025-01-09 08:21:13,811 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 201.3MB. Free memory is still 118.7MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 08:21:13,811 INFO L158 Benchmark]: CACSL2BoogieTranslator took 551.02ms. Allocated memory is still 167.8MB. Free memory was 117.5MB in the beginning and 44.7MB in the end (delta: 72.8MB). Peak memory consumption was 75.5MB. Max. memory is 16.1GB. [2025-01-09 08:21:13,811 INFO L158 Benchmark]: Boogie Procedure Inliner took 390.16ms. Allocated memory was 167.8MB in the beginning and 176.2MB in the end (delta: 8.4MB). Free memory was 44.7MB in the beginning and 61.1MB in the end (delta: -16.3MB). Peak memory consumption was 52.7MB. Max. memory is 16.1GB. [2025-01-09 08:21:13,811 INFO L158 Benchmark]: Boogie Preprocessor took 554.90ms. Allocated memory was 176.2MB in the beginning and 419.4MB in the end (delta: 243.3MB). Free memory was 61.1MB in the beginning and 286.2MB in the end (delta: -225.2MB). Peak memory consumption was 61.0MB. Max. memory is 16.1GB. [2025-01-09 08:21:13,812 INFO L158 Benchmark]: RCFGBuilder took 3613.22ms. Allocated memory is still 419.4MB. Free memory was 286.2MB in the beginning and 248.5MB in the end (delta: 37.7MB). Peak memory consumption was 230.8MB. Max. memory is 16.1GB. [2025-01-09 08:21:13,812 INFO L158 Benchmark]: TraceAbstraction took 1863.00ms. Allocated memory was 419.4MB in the beginning and 620.8MB in the end (delta: 201.3MB). Free memory was 248.5MB in the beginning and 345.0MB in the end (delta: -96.5MB). Peak memory consumption was 100.4MB. Max. memory is 16.1GB. [2025-01-09 08:21:13,813 INFO L158 Benchmark]: Witness Printer took 3.20ms. Allocated memory is still 620.8MB. Free memory was 345.0MB in the beginning and 344.9MB in the end (delta: 48.7kB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 08:21:13,814 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.15ms. Allocated memory is still 201.3MB. Free memory is still 118.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 551.02ms. Allocated memory is still 167.8MB. Free memory was 117.5MB in the beginning and 44.7MB in the end (delta: 72.8MB). Peak memory consumption was 75.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 390.16ms. Allocated memory was 167.8MB in the beginning and 176.2MB in the end (delta: 8.4MB). Free memory was 44.7MB in the beginning and 61.1MB in the end (delta: -16.3MB). Peak memory consumption was 52.7MB. Max. memory is 16.1GB. * Boogie Preprocessor took 554.90ms. Allocated memory was 176.2MB in the beginning and 419.4MB in the end (delta: 243.3MB). Free memory was 61.1MB in the beginning and 286.2MB in the end (delta: -225.2MB). Peak memory consumption was 61.0MB. Max. memory is 16.1GB. * RCFGBuilder took 3613.22ms. Allocated memory is still 419.4MB. Free memory was 286.2MB in the beginning and 248.5MB in the end (delta: 37.7MB). Peak memory consumption was 230.8MB. Max. memory is 16.1GB. * TraceAbstraction took 1863.00ms. Allocated memory was 419.4MB in the beginning and 620.8MB in the end (delta: 201.3MB). Free memory was 248.5MB in the beginning and 345.0MB in the end (delta: -96.5MB). Peak memory consumption was 100.4MB. Max. memory is 16.1GB. * Witness Printer took 3.20ms. Allocated memory is still 620.8MB. Free memory was 345.0MB in the beginning and 344.9MB in the end (delta: 48.7kB). 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 201. 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 - 16); [L30] const SORT_3 msb_SORT_3 = (SORT_3)1 << (16 - 1); [L32] const SORT_38 mask_SORT_38 = (SORT_38)-1 >> (sizeof(SORT_38) * 8 - 12); [L33] const SORT_38 msb_SORT_38 = (SORT_38)1 << (12 - 1); [L35] const SORT_44 mask_SORT_44 = (SORT_44)-1 >> (sizeof(SORT_44) * 8 - 3); [L36] const SORT_44 msb_SORT_44 = (SORT_44)1 << (3 - 1); [L38] const SORT_71 mask_SORT_71 = (SORT_71)-1 >> (sizeof(SORT_71) * 8 - 2); [L39] const SORT_71 msb_SORT_71 = (SORT_71)1 << (2 - 1); [L41] const SORT_230 mask_SORT_230 = (SORT_230)-1 >> (sizeof(SORT_230) * 8 - 4); [L42] const SORT_230 msb_SORT_230 = (SORT_230)1 << (4 - 1); [L44] const SORT_232 mask_SORT_232 = (SORT_232)-1 >> (sizeof(SORT_232) * 8 - 5); [L45] const SORT_232 msb_SORT_232 = (SORT_232)1 << (5 - 1); [L47] const SORT_234 mask_SORT_234 = (SORT_234)-1 >> (sizeof(SORT_234) * 8 - 6); [L48] const SORT_234 msb_SORT_234 = (SORT_234)1 << (6 - 1); [L50] const SORT_236 mask_SORT_236 = (SORT_236)-1 >> (sizeof(SORT_236) * 8 - 7); [L51] const SORT_236 msb_SORT_236 = (SORT_236)1 << (7 - 1); [L53] const SORT_238 mask_SORT_238 = (SORT_238)-1 >> (sizeof(SORT_238) * 8 - 8); [L54] const SORT_238 msb_SORT_238 = (SORT_238)1 << (8 - 1); [L56] const SORT_240 mask_SORT_240 = (SORT_240)-1 >> (sizeof(SORT_240) * 8 - 9); [L57] const SORT_240 msb_SORT_240 = (SORT_240)1 << (9 - 1); [L59] const SORT_242 mask_SORT_242 = (SORT_242)-1 >> (sizeof(SORT_242) * 8 - 10); [L60] const SORT_242 msb_SORT_242 = (SORT_242)1 << (10 - 1); [L62] const SORT_244 mask_SORT_244 = (SORT_244)-1 >> (sizeof(SORT_244) * 8 - 11); [L63] const SORT_244 msb_SORT_244 = (SORT_244)1 << (11 - 1); [L65] const SORT_247 mask_SORT_247 = (SORT_247)-1 >> (sizeof(SORT_247) * 8 - 13); [L66] const SORT_247 msb_SORT_247 = (SORT_247)1 << (13 - 1); [L68] const SORT_249 mask_SORT_249 = (SORT_249)-1 >> (sizeof(SORT_249) * 8 - 14); [L69] const SORT_249 msb_SORT_249 = (SORT_249)1 << (14 - 1); [L71] const SORT_251 mask_SORT_251 = (SORT_251)-1 >> (sizeof(SORT_251) * 8 - 15); [L72] const SORT_251 msb_SORT_251 = (SORT_251)1 << (15 - 1); [L74] const SORT_460 mask_SORT_460 = (SORT_460)-1 >> (sizeof(SORT_460) * 8 - 17); [L75] const SORT_460 msb_SORT_460 = (SORT_460)1 << (17 - 1); [L77] const SORT_3 var_6 = 0; [L78] const SORT_1 var_11 = 0; [L79] const SORT_1 var_22 = 1; [L80] const SORT_38 var_39 = 0; [L81] const SORT_44 var_45 = 0; [L82] const SORT_44 var_49 = 2; [L83] const SORT_44 var_53 = 1; [L84] const SORT_44 var_58 = 4; [L85] const SORT_44 var_60 = 5; [L86] const SORT_44 var_64 = 3; [L87] const SORT_71 var_73 = 0; [L88] const SORT_3 var_80 = 65535; [L89] const SORT_232 var_461 = 0; [L90] const SORT_236 var_507 = 5; [L91] const SORT_236 var_511 = 4; [L92] const SORT_236 var_515 = 3; [L93] const SORT_236 var_519 = 2; [L94] const SORT_236 var_523 = 1; [L95] const SORT_236 var_527 = 0; [L96] const SORT_38 var_561 = 2; [L98] SORT_1 input_2; [L99] SORT_3 input_4; [L100] SORT_3 input_5; [L101] SORT_3 input_68; [L102] SORT_3 input_69; [L103] SORT_3 input_70; [L104] SORT_3 input_79; [L105] SORT_3 input_88; [L106] SORT_3 input_89; [L107] SORT_3 input_90; [L108] SORT_3 input_93; [L109] SORT_3 input_111; [L110] SORT_3 input_112; [L111] SORT_3 input_113; [L112] SORT_3 input_116; [L113] SORT_3 input_118; [L114] SORT_71 input_132; [L115] SORT_71 input_133; [L116] SORT_71 input_134; [L118] EXPR __VERIFIER_nondet_ushort() & mask_SORT_3 VAL [mask_SORT_1=1, mask_SORT_230=15, mask_SORT_232=31, mask_SORT_234=63, mask_SORT_236=127, mask_SORT_238=255, mask_SORT_240=511, mask_SORT_242=1023, mask_SORT_244=2047, mask_SORT_247=8191, mask_SORT_249=16383, mask_SORT_251=32767, mask_SORT_38=4095, mask_SORT_3=65535, mask_SORT_44=7, mask_SORT_71=3, var_11=0, var_22=1, var_39=0, var_45=0, var_461=0, var_49=2, var_507=5, var_511=4, var_515=3, var_519=2, var_523=1, var_527=0, var_53=1, var_561=2, var_58=4, var_60=5, var_64=3, var_6=0, var_73=0, var_80=65535] [L118] SORT_3 state_7 = __VERIFIER_nondet_ushort() & mask_SORT_3; [L119] EXPR __VERIFIER_nondet_ushort() & mask_SORT_3 VAL [mask_SORT_1=1, mask_SORT_230=15, mask_SORT_232=31, mask_SORT_234=63, mask_SORT_236=127, mask_SORT_238=255, mask_SORT_240=511, mask_SORT_242=1023, mask_SORT_244=2047, mask_SORT_247=8191, mask_SORT_249=16383, mask_SORT_251=32767, mask_SORT_38=4095, mask_SORT_3=65535, mask_SORT_44=7, mask_SORT_71=3, var_11=0, var_22=1, var_39=0, var_45=0, var_461=0, var_49=2, var_507=5, var_511=4, var_515=3, var_519=2, var_523=1, var_527=0, var_53=1, var_561=2, var_58=4, var_60=5, var_64=3, var_6=0, var_73=0, var_80=65535] [L119] SORT_3 state_9 = __VERIFIER_nondet_ushort() & mask_SORT_3; [L120] EXPR __VERIFIER_nondet_ushort() & mask_SORT_3 VAL [mask_SORT_1=1, mask_SORT_230=15, mask_SORT_232=31, mask_SORT_234=63, mask_SORT_236=127, mask_SORT_238=255, mask_SORT_240=511, mask_SORT_242=1023, mask_SORT_244=2047, mask_SORT_247=8191, mask_SORT_249=16383, mask_SORT_251=32767, mask_SORT_38=4095, mask_SORT_3=65535, mask_SORT_44=7, mask_SORT_71=3, var_11=0, var_22=1, var_39=0, var_45=0, var_461=0, var_49=2, var_507=5, var_511=4, var_515=3, var_519=2, var_523=1, var_527=0, var_53=1, var_561=2, var_58=4, var_60=5, var_64=3, var_6=0, var_73=0, var_80=65535] [L120] SORT_3 state_13 = __VERIFIER_nondet_ushort() & mask_SORT_3; [L121] EXPR __VERIFIER_nondet_ushort() & mask_SORT_3 VAL [mask_SORT_1=1, mask_SORT_230=15, mask_SORT_232=31, mask_SORT_234=63, mask_SORT_236=127, mask_SORT_238=255, mask_SORT_240=511, mask_SORT_242=1023, mask_SORT_244=2047, mask_SORT_247=8191, mask_SORT_249=16383, mask_SORT_251=32767, mask_SORT_38=4095, mask_SORT_3=65535, mask_SORT_44=7, mask_SORT_71=3, var_11=0, var_22=1, var_39=0, var_45=0, var_461=0, var_49=2, var_507=5, var_511=4, var_515=3, var_519=2, var_523=1, var_527=0, var_53=1, var_561=2, var_58=4, var_60=5, var_64=3, var_6=0, var_73=0, var_80=65535] [L121] SORT_3 state_15 = __VERIFIER_nondet_ushort() & mask_SORT_3; [L122] EXPR __VERIFIER_nondet_ushort() & mask_SORT_3 VAL [mask_SORT_1=1, mask_SORT_230=15, mask_SORT_232=31, mask_SORT_234=63, mask_SORT_236=127, mask_SORT_238=255, mask_SORT_240=511, mask_SORT_242=1023, mask_SORT_244=2047, mask_SORT_247=8191, mask_SORT_249=16383, mask_SORT_251=32767, mask_SORT_38=4095, mask_SORT_3=65535, mask_SORT_44=7, mask_SORT_71=3, var_11=0, var_22=1, var_39=0, var_45=0, var_461=0, var_49=2, var_507=5, var_511=4, var_515=3, var_519=2, var_523=1, var_527=0, var_53=1, var_561=2, var_58=4, var_60=5, var_64=3, var_6=0, var_73=0, var_80=65535] [L122] SORT_3 state_26 = __VERIFIER_nondet_ushort() & mask_SORT_3; [L123] EXPR __VERIFIER_nondet_ushort() & mask_SORT_3 VAL [mask_SORT_1=1, mask_SORT_230=15, mask_SORT_232=31, mask_SORT_234=63, mask_SORT_236=127, mask_SORT_238=255, mask_SORT_240=511, mask_SORT_242=1023, mask_SORT_244=2047, mask_SORT_247=8191, mask_SORT_249=16383, mask_SORT_251=32767, mask_SORT_38=4095, mask_SORT_3=65535, mask_SORT_44=7, mask_SORT_71=3, var_11=0, var_22=1, var_39=0, var_45=0, var_461=0, var_49=2, var_507=5, var_511=4, var_515=3, var_519=2, var_523=1, var_527=0, var_53=1, var_561=2, var_58=4, var_60=5, var_64=3, var_6=0, var_73=0, var_80=65535] [L123] SORT_3 state_28 = __VERIFIER_nondet_ushort() & mask_SORT_3; [L124] EXPR __VERIFIER_nondet_ushort() & mask_SORT_3 VAL [mask_SORT_1=1, mask_SORT_230=15, mask_SORT_232=31, mask_SORT_234=63, mask_SORT_236=127, mask_SORT_238=255, mask_SORT_240=511, mask_SORT_242=1023, mask_SORT_244=2047, mask_SORT_247=8191, mask_SORT_249=16383, mask_SORT_251=32767, mask_SORT_38=4095, mask_SORT_3=65535, mask_SORT_44=7, mask_SORT_71=3, var_11=0, var_22=1, var_39=0, var_45=0, var_461=0, var_49=2, var_507=5, var_511=4, var_515=3, var_519=2, var_523=1, var_527=0, var_53=1, var_561=2, var_58=4, var_60=5, var_64=3, var_6=0, var_73=0, var_80=65535] [L124] SORT_3 state_30 = __VERIFIER_nondet_ushort() & mask_SORT_3; [L125] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_230=15, mask_SORT_232=31, mask_SORT_234=63, mask_SORT_236=127, mask_SORT_238=255, mask_SORT_240=511, mask_SORT_242=1023, mask_SORT_244=2047, mask_SORT_247=8191, mask_SORT_249=16383, mask_SORT_251=32767, mask_SORT_38=4095, mask_SORT_3=65535, mask_SORT_44=7, mask_SORT_71=3, var_11=0, var_22=1, var_39=0, var_45=0, var_461=0, var_49=2, var_507=5, var_511=4, var_515=3, var_519=2, var_523=1, var_527=0, var_53=1, var_561=2, var_58=4, var_60=5, var_64=3, var_6=0, var_73=0, var_80=65535] [L125] SORT_1 state_32 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L126] EXPR __VERIFIER_nondet_ushort() & mask_SORT_3 VAL [mask_SORT_1=1, mask_SORT_230=15, mask_SORT_232=31, mask_SORT_234=63, mask_SORT_236=127, mask_SORT_238=255, mask_SORT_240=511, mask_SORT_242=1023, mask_SORT_244=2047, mask_SORT_247=8191, mask_SORT_249=16383, mask_SORT_251=32767, mask_SORT_38=4095, mask_SORT_3=65535, mask_SORT_44=7, mask_SORT_71=3, var_11=0, var_22=1, var_39=0, var_45=0, var_461=0, var_49=2, var_507=5, var_511=4, var_515=3, var_519=2, var_523=1, var_527=0, var_53=1, var_561=2, var_58=4, var_60=5, var_64=3, var_6=0, var_73=0, var_80=65535] [L126] SORT_3 state_34 = __VERIFIER_nondet_ushort() & mask_SORT_3; [L127] EXPR __VERIFIER_nondet_ushort() & mask_SORT_3 VAL [mask_SORT_1=1, mask_SORT_230=15, mask_SORT_232=31, mask_SORT_234=63, mask_SORT_236=127, mask_SORT_238=255, mask_SORT_240=511, mask_SORT_242=1023, mask_SORT_244=2047, mask_SORT_247=8191, mask_SORT_249=16383, mask_SORT_251=32767, mask_SORT_38=4095, mask_SORT_3=65535, mask_SORT_44=7, mask_SORT_71=3, var_11=0, var_22=1, var_39=0, var_45=0, var_461=0, var_49=2, var_507=5, var_511=4, var_515=3, var_519=2, var_523=1, var_527=0, var_53=1, var_561=2, var_58=4, var_60=5, var_64=3, var_6=0, var_73=0, var_80=65535] [L127] SORT_3 state_36 = __VERIFIER_nondet_ushort() & mask_SORT_3; [L128] EXPR __VERIFIER_nondet_ushort() & mask_SORT_38 VAL [mask_SORT_1=1, mask_SORT_230=15, mask_SORT_232=31, mask_SORT_234=63, mask_SORT_236=127, mask_SORT_238=255, mask_SORT_240=511, mask_SORT_242=1023, mask_SORT_244=2047, mask_SORT_247=8191, mask_SORT_249=16383, mask_SORT_251=32767, mask_SORT_38=4095, mask_SORT_3=65535, mask_SORT_44=7, mask_SORT_71=3, var_11=0, var_22=1, var_39=0, var_45=0, var_461=0, var_49=2, var_507=5, var_511=4, var_515=3, var_519=2, var_523=1, var_527=0, var_53=1, var_561=2, var_58=4, var_60=5, var_64=3, var_6=0, var_73=0, var_80=65535] [L128] SORT_38 state_40 = __VERIFIER_nondet_ushort() & mask_SORT_38; [L129] EXPR __VERIFIER_nondet_ushort() & mask_SORT_38 VAL [mask_SORT_1=1, mask_SORT_230=15, mask_SORT_232=31, mask_SORT_234=63, mask_SORT_236=127, mask_SORT_238=255, mask_SORT_240=511, mask_SORT_242=1023, mask_SORT_244=2047, mask_SORT_247=8191, mask_SORT_249=16383, mask_SORT_251=32767, mask_SORT_38=4095, mask_SORT_3=65535, mask_SORT_44=7, mask_SORT_71=3, var_11=0, var_22=1, var_39=0, var_45=0, var_461=0, var_49=2, var_507=5, var_511=4, var_515=3, var_519=2, var_523=1, var_527=0, var_53=1, var_561=2, var_58=4, var_60=5, var_64=3, var_6=0, var_73=0, var_80=65535] [L129] SORT_38 state_42 = __VERIFIER_nondet_ushort() & mask_SORT_38; [L130] EXPR __VERIFIER_nondet_uchar() & mask_SORT_44 VAL [mask_SORT_1=1, mask_SORT_230=15, mask_SORT_232=31, mask_SORT_234=63, mask_SORT_236=127, mask_SORT_238=255, mask_SORT_240=511, mask_SORT_242=1023, mask_SORT_244=2047, mask_SORT_247=8191, mask_SORT_249=16383, mask_SORT_251=32767, mask_SORT_38=4095, mask_SORT_3=65535, mask_SORT_44=7, mask_SORT_71=3, var_11=0, var_22=1, var_39=0, var_45=0, var_461=0, var_49=2, var_507=5, var_511=4, var_515=3, var_519=2, var_523=1, var_527=0, var_53=1, var_561=2, var_58=4, var_60=5, var_64=3, var_6=0, var_73=0, var_80=65535] [L130] SORT_44 state_46 = __VERIFIER_nondet_uchar() & mask_SORT_44; [L132] SORT_3 init_8_arg_1 = var_6; [L133] state_7 = init_8_arg_1 [L134] SORT_3 init_10_arg_1 = var_6; [L135] state_9 = init_10_arg_1 [L136] SORT_3 init_14_arg_1 = var_6; [L137] state_13 = init_14_arg_1 [L138] SORT_3 init_16_arg_1 = var_6; [L139] state_15 = init_16_arg_1 [L140] SORT_3 init_27_arg_1 = var_6; [L141] state_26 = init_27_arg_1 [L142] SORT_3 init_29_arg_1 = var_6; [L143] state_28 = init_29_arg_1 [L144] SORT_3 init_31_arg_1 = var_6; [L145] state_30 = init_31_arg_1 [L146] SORT_1 init_33_arg_1 = var_11; [L147] state_32 = init_33_arg_1 [L148] SORT_3 init_35_arg_1 = var_6; [L149] state_34 = init_35_arg_1 [L150] SORT_3 init_37_arg_1 = var_6; [L151] state_36 = init_37_arg_1 [L152] SORT_38 init_41_arg_1 = var_39; [L153] state_40 = init_41_arg_1 [L154] SORT_38 init_43_arg_1 = var_39; [L155] state_42 = init_43_arg_1 [L156] SORT_44 init_47_arg_1 = var_45; [L157] state_46 = init_47_arg_1 VAL [mask_SORT_1=1, mask_SORT_230=15, mask_SORT_232=31, mask_SORT_234=63, mask_SORT_236=127, mask_SORT_238=255, mask_SORT_240=511, mask_SORT_242=1023, mask_SORT_244=2047, mask_SORT_247=8191, mask_SORT_249=16383, mask_SORT_251=32767, mask_SORT_38=4095, mask_SORT_3=65535, mask_SORT_44=7, mask_SORT_71=3, state_13=0, state_15=0, state_26=0, state_28=0, state_30=0, state_32=0, state_34=0, state_36=0, state_40=0, state_42=0, state_46=0, state_7=0, state_9=0, var_11=0, var_22=1, var_45=0, var_461=0, var_49=2, var_507=5, var_511=4, var_515=3, var_519=2, var_523=1, var_527=0, var_53=1, var_561=2, var_58=4, var_60=5, var_64=3, var_6=0, var_73=0, var_80=65535] [L160] input_2 = __VERIFIER_nondet_uchar() [L161] input_4 = __VERIFIER_nondet_ushort() [L162] input_5 = __VERIFIER_nondet_ushort() [L163] input_68 = __VERIFIER_nondet_ushort() [L164] input_69 = __VERIFIER_nondet_ushort() [L165] input_70 = __VERIFIER_nondet_ushort() [L166] input_79 = __VERIFIER_nondet_ushort() [L167] input_88 = __VERIFIER_nondet_ushort() [L168] input_89 = __VERIFIER_nondet_ushort() [L169] input_90 = __VERIFIER_nondet_ushort() [L170] input_93 = __VERIFIER_nondet_ushort() [L171] input_111 = __VERIFIER_nondet_ushort() [L172] input_112 = __VERIFIER_nondet_ushort() [L173] input_113 = __VERIFIER_nondet_ushort() [L174] input_116 = __VERIFIER_nondet_ushort() [L175] input_118 = __VERIFIER_nondet_ushort() [L176] input_132 = __VERIFIER_nondet_uchar() [L177] input_133 = __VERIFIER_nondet_uchar() [L178] input_134 = __VERIFIER_nondet_uchar() [L181] SORT_1 var_17_arg_0 = var_11; [L182] SORT_3 var_17_arg_1 = state_15; [L183] SORT_3 var_17_arg_2 = state_13; [L184] SORT_3 var_17 = var_17_arg_0 ? var_17_arg_1 : var_17_arg_2; [L185] SORT_1 var_12_arg_0 = var_11; [L186] SORT_3 var_12_arg_1 = state_9; [L187] SORT_3 var_12_arg_2 = state_7; [L188] SORT_3 var_12 = var_12_arg_0 ? var_12_arg_1 : var_12_arg_2; [L189] SORT_1 var_18_arg_0 = var_11; [L190] SORT_3 var_18_arg_1 = var_17; [L191] SORT_3 var_18_arg_2 = var_12; [L192] SORT_3 var_18 = var_18_arg_0 ? var_18_arg_1 : var_18_arg_2; VAL [mask_SORT_1=1, mask_SORT_230=15, mask_SORT_232=31, mask_SORT_234=63, mask_SORT_236=127, mask_SORT_238=255, mask_SORT_240=511, mask_SORT_242=1023, mask_SORT_244=2047, mask_SORT_247=8191, mask_SORT_249=16383, mask_SORT_251=32767, mask_SORT_38=4095, mask_SORT_3=65535, mask_SORT_44=7, mask_SORT_71=3, state_13=0, state_15=0, state_26=0, state_28=0, state_30=0, state_32=0, state_34=0, state_36=0, state_40=0, state_42=0, state_46=0, state_7=0, state_9=0, var_11=0, var_18=0, var_22=1, var_45=0, var_461=0, var_49=2, var_507=5, var_511=4, var_515=3, var_519=2, var_523=1, var_527=0, var_53=1, var_561=2, var_58=4, var_60=5, var_64=3, var_6=0, var_73=0, var_80=65535] [L193] EXPR var_18 & mask_SORT_3 VAL [mask_SORT_1=1, mask_SORT_230=15, mask_SORT_232=31, mask_SORT_234=63, mask_SORT_236=127, mask_SORT_238=255, mask_SORT_240=511, mask_SORT_242=1023, mask_SORT_244=2047, mask_SORT_247=8191, mask_SORT_249=16383, mask_SORT_251=32767, mask_SORT_38=4095, mask_SORT_3=65535, mask_SORT_44=7, mask_SORT_71=3, state_13=0, state_15=0, state_26=0, state_28=0, state_30=0, state_32=0, state_34=0, state_36=0, state_40=0, state_42=0, state_46=0, state_7=0, state_9=0, var_11=0, var_22=1, var_45=0, var_461=0, var_49=2, var_507=5, var_511=4, var_515=3, var_519=2, var_523=1, var_527=0, var_53=1, var_561=2, var_58=4, var_60=5, var_64=3, var_6=0, var_73=0, var_80=65535] [L193] var_18 = var_18 & mask_SORT_3 [L194] SORT_3 var_19_arg_0 = var_18; [L195] SORT_3 var_19_arg_1 = var_6; [L196] SORT_1 var_19 = var_19_arg_0 == var_19_arg_1; [L197] SORT_1 var_23_arg_0 = var_19; [L198] SORT_1 var_23 = ~var_23_arg_0; [L199] SORT_1 var_24_arg_0 = var_22; [L200] SORT_1 var_24_arg_1 = var_23; VAL [mask_SORT_1=1, mask_SORT_230=15, mask_SORT_232=31, mask_SORT_234=63, mask_SORT_236=127, mask_SORT_238=255, mask_SORT_240=511, mask_SORT_242=1023, mask_SORT_244=2047, mask_SORT_247=8191, mask_SORT_249=16383, mask_SORT_251=32767, mask_SORT_38=4095, mask_SORT_3=65535, mask_SORT_44=7, mask_SORT_71=3, state_13=0, state_15=0, state_26=0, state_28=0, state_30=0, state_32=0, state_34=0, state_36=0, state_40=0, state_42=0, state_46=0, state_7=0, state_9=0, var_11=0, var_22=1, var_24_arg_0=1, var_24_arg_1=-2, var_45=0, var_461=0, var_49=2, var_507=5, var_511=4, var_515=3, var_519=2, var_523=1, var_527=0, var_53=1, var_561=2, var_58=4, var_60=5, var_64=3, var_6=0, var_73=0, var_80=65535] [L201] EXPR var_24_arg_0 & var_24_arg_1 VAL [mask_SORT_1=1, mask_SORT_230=15, mask_SORT_232=31, mask_SORT_234=63, mask_SORT_236=127, mask_SORT_238=255, mask_SORT_240=511, mask_SORT_242=1023, mask_SORT_244=2047, mask_SORT_247=8191, mask_SORT_249=16383, mask_SORT_251=32767, mask_SORT_38=4095, mask_SORT_3=65535, mask_SORT_44=7, mask_SORT_71=3, state_13=0, state_15=0, state_26=0, state_28=0, state_30=0, state_32=0, state_34=0, state_36=0, state_40=0, state_42=0, state_46=0, state_7=0, state_9=0, var_11=0, var_22=1, var_45=0, var_461=0, var_49=2, var_507=5, var_511=4, var_515=3, var_519=2, var_523=1, var_527=0, var_53=1, var_561=2, var_58=4, var_60=5, var_64=3, var_6=0, var_73=0, var_80=65535] [L201] SORT_1 var_24 = var_24_arg_0 & var_24_arg_1; [L202] EXPR var_24 & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_230=15, mask_SORT_232=31, mask_SORT_234=63, mask_SORT_236=127, mask_SORT_238=255, mask_SORT_240=511, mask_SORT_242=1023, mask_SORT_244=2047, mask_SORT_247=8191, mask_SORT_249=16383, mask_SORT_251=32767, mask_SORT_38=4095, mask_SORT_3=65535, mask_SORT_44=7, mask_SORT_71=3, state_13=0, state_15=0, state_26=0, state_28=0, state_30=0, state_32=0, state_34=0, state_36=0, state_40=0, state_42=0, state_46=0, state_7=0, state_9=0, var_11=0, var_22=1, var_45=0, var_461=0, var_49=2, var_507=5, var_511=4, var_515=3, var_519=2, var_523=1, var_527=0, var_53=1, var_561=2, var_58=4, var_60=5, var_64=3, var_6=0, var_73=0, var_80=65535] [L202] var_24 = var_24 & mask_SORT_1 [L203] SORT_1 bad_25_arg_0 = var_24; [L204] CALL __VERIFIER_assert(!(bad_25_arg_0)) [L21] COND TRUE !(cond) [L21] reach_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 1335 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.8s, OverallIterations: 4, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1966 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1966 mSDsluCounter, 15915 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 9942 mSDsCounter, 1 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 37 IncrementalHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1 mSolverCounterUnsat, 5973 mSDtfsCounter, 37 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 15 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1336occurred 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.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 154 NumberOfCodeBlocks, 154 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 111 ConstructedInterpolants, 0 QuantifiedInterpolants, 200 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-01-09 08:21:13,834 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_arrays_vsa16a_p2.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 5b0af5d1e81b8ef08a8c715e25cc88665897ce7d17ecd1eab38dd9c44cbe0a9d --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 08:21:15,584 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 08:21:15,654 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Bitvector.epf [2025-01-09 08:21:15,658 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 08:21:15,659 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 08:21:15,678 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 08:21:15,678 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 08:21:15,678 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 08:21:15,679 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 08:21:15,679 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 08:21:15,679 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 08:21:15,679 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 08:21:15,679 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 08:21:15,679 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 08:21:15,679 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 08:21:15,679 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 08:21:15,679 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 08:21:15,679 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 08:21:15,681 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 08:21:15,681 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 08:21:15,681 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 08:21:15,681 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-01-09 08:21:15,682 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-01-09 08:21:15,682 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-01-09 08:21:15,682 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 08:21:15,682 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 08:21:15,682 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 08:21:15,682 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 08:21:15,682 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 08:21:15,682 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 08:21:15,683 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 08:21:15,683 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 08:21:15,683 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 08:21:15,683 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 08:21:15,683 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 08:21:15,683 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 08:21:15,683 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 08:21:15,683 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 08:21:15,683 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 08:21:15,683 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 08:21:15,683 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 08:21:15,683 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-01-09 08:21:15,683 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-01-09 08:21:15,683 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 08:21:15,684 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 08:21:15,684 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 08:21:15,684 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 08:21:15,684 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 -> 5b0af5d1e81b8ef08a8c715e25cc88665897ce7d17ecd1eab38dd9c44cbe0a9d [2025-01-09 08:21:15,909 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 08:21:15,916 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 08:21:15,918 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 08:21:15,919 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 08:21:15,919 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 08:21:15,920 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_arrays_vsa16a_p2.c [2025-01-09 08:21:17,082 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/6f6dad8f4/c4e82bd01649429996145e3564305dce/FLAG34871f081 [2025-01-09 08:21:17,384 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 08:21:17,385 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_arrays_vsa16a_p2.c [2025-01-09 08:21:17,405 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/6f6dad8f4/c4e82bd01649429996145e3564305dce/FLAG34871f081 [2025-01-09 08:21:17,418 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/6f6dad8f4/c4e82bd01649429996145e3564305dce [2025-01-09 08:21:17,421 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 08:21:17,422 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 08:21:17,423 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 08:21:17,423 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 08:21:17,426 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 08:21:17,426 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 08:21:17" (1/1) ... [2025-01-09 08:21:17,427 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@220ae2c2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:21:17, skipping insertion in model container [2025-01-09 08:21:17,427 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 08:21:17" (1/1) ... [2025-01-09 08:21:17,465 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 08:21:17,582 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_arrays_vsa16a_p2.c[1260,1273] [2025-01-09 08:21:17,793 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 08:21:17,801 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 08:21:17,809 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_arrays_vsa16a_p2.c[1260,1273] [2025-01-09 08:21:17,927 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 08:21:17,938 INFO L204 MainTranslator]: Completed translation [2025-01-09 08:21:17,940 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:21:17 WrapperNode [2025-01-09 08:21:17,941 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 08:21:17,941 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 08:21:17,941 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 08:21:17,941 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 08:21:17,945 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:21:17" (1/1) ... [2025-01-09 08:21:17,972 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:21:17" (1/1) ... [2025-01-09 08:21:18,038 INFO L138 Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 1816 [2025-01-09 08:21:18,039 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 08:21:18,039 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 08:21:18,039 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 08:21:18,039 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 08:21:18,045 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:21:17" (1/1) ... [2025-01-09 08:21:18,045 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:21:17" (1/1) ... [2025-01-09 08:21:18,056 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:21:17" (1/1) ... [2025-01-09 08:21:18,091 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-01-09 08:21:18,095 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:21:17" (1/1) ... [2025-01-09 08:21:18,096 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:21:17" (1/1) ... [2025-01-09 08:21:18,132 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:21:17" (1/1) ... [2025-01-09 08:21:18,135 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:21:17" (1/1) ... [2025-01-09 08:21:18,141 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:21:17" (1/1) ... [2025-01-09 08:21:18,145 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:21:17" (1/1) ... [2025-01-09 08:21:18,151 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:21:17" (1/1) ... [2025-01-09 08:21:18,159 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 08:21:18,160 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 08:21:18,160 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 08:21:18,160 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 08:21:18,161 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:21:17" (1/1) ... [2025-01-09 08:21:18,165 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 08:21:18,176 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 08:21:18,185 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-01-09 08:21:18,188 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-01-09 08:21:18,206 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 08:21:18,206 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-01-09 08:21:18,206 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 08:21:18,206 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 08:21:18,451 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 08:21:18,453 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 08:21:20,059 INFO L? ?]: Removed 76 outVars from TransFormulas that were not future-live. [2025-01-09 08:21:20,060 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 08:21:20,065 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 08:21:20,066 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 08:21:20,066 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 08:21:20 BoogieIcfgContainer [2025-01-09 08:21:20,066 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 08:21:20,068 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 08:21:20,068 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 08:21:20,071 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 08:21:20,072 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 08:21:17" (1/3) ... [2025-01-09 08:21:20,072 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5301476e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 08:21:20, skipping insertion in model container [2025-01-09 08:21:20,072 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:21:17" (2/3) ... [2025-01-09 08:21:20,073 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5301476e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 08:21:20, skipping insertion in model container [2025-01-09 08:21:20,074 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 08:21:20" (3/3) ... [2025-01-09 08:21:20,074 INFO L128 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.vis_arrays_vsa16a_p2.c [2025-01-09 08:21:20,085 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 08:21:20,087 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG btor2c-lazyMod.vis_arrays_vsa16a_p2.c that has 1 procedures, 10 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 08:21:20,141 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 08:21:20,152 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;@1795c768, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 08:21:20,152 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 08:21:20,155 INFO L276 IsEmpty]: Start isEmpty. Operand has 10 states, 8 states have (on average 1.375) internal successors, (11), 9 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:21:20,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2025-01-09 08:21:20,158 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 08:21:20,158 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2025-01-09 08:21:20,158 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 08:21:20,162 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 08:21:20,162 INFO L85 PathProgramCache]: Analyzing trace with hash 28694789, now seen corresponding path program 1 times [2025-01-09 08:21:20,169 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 08:21:20,171 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [88066517] [2025-01-09 08:21:20,171 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 08:21:20,172 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 08:21:20,172 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 08:21:20,174 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-01-09 08:21:20,176 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-01-09 08:21:20,478 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-01-09 08:21:20,495 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-01-09 08:21:20,496 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 08:21:20,496 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 08:21:20,500 INFO L256 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 22 conjuncts are in the unsatisfiable core [2025-01-09 08:21:20,507 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 08:21:20,643 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 08:21:20,643 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 08:21:20,644 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 08:21:20,644 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [88066517] [2025-01-09 08:21:20,644 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [88066517] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 08:21:20,644 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 08:21:20,645 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 08:21:20,646 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2043804788] [2025-01-09 08:21:20,647 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 08:21:20,649 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 08:21:20,649 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 08:21:20,661 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 08:21:20,662 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 08:21:20,663 INFO L87 Difference]: Start difference. First operand has 10 states, 8 states have (on average 1.375) internal successors, (11), 9 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 4 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:21:20,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 08:21:20,761 INFO L93 Difference]: Finished difference Result 18 states and 23 transitions. [2025-01-09 08:21:20,762 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 08:21:20,763 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2025-01-09 08:21:20,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 08:21:20,767 INFO L225 Difference]: With dead ends: 18 [2025-01-09 08:21:20,767 INFO L226 Difference]: Without dead ends: 10 [2025-01-09 08:21:20,769 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 08:21:20,772 INFO L435 NwaCegarLoop]: 4 mSDtfsCounter, 2 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 11 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 08:21:20,772 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 11 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 08:21:20,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2025-01-09 08:21:20,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 9. [2025-01-09 08:21:20,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 1.125) internal successors, (9), 8 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:21:20,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2025-01-09 08:21:20,793 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 5 [2025-01-09 08:21:20,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 08:21:20,793 INFO L471 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2025-01-09 08:21:20,793 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:21:20,793 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2025-01-09 08:21:20,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-01-09 08:21:20,793 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 08:21:20,794 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2025-01-09 08:21:20,802 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-01-09 08:21:20,994 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-01-09 08:21:20,994 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 08:21:20,995 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 08:21:20,995 INFO L85 PathProgramCache]: Analyzing trace with hash 152739811, now seen corresponding path program 1 times [2025-01-09 08:21:20,997 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 08:21:20,997 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [263862562] [2025-01-09 08:21:20,997 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 08:21:20,997 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 08:21:20,997 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 08:21:20,999 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-01-09 08:21:21,000 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-01-09 08:21:21,324 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-01-09 08:21:21,405 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-01-09 08:21:21,405 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 08:21:21,405 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 08:21:21,416 INFO L256 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 42 conjuncts are in the unsatisfiable core [2025-01-09 08:21:21,431 INFO L279 TraceCheckSpWp]: Computing forward predicates...