./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_arrays_vsaR_p12.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_arrays_vsaR_p12.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash d570de8a468b2e5d7e18a67170da2d8f06202ccdf10baa0799e3c0763140866e --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 18:33:04,256 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 18:33:04,297 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2025-03-03 18:33:04,303 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 18:33:04,303 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 18:33:04,322 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 18:33:04,323 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 18:33:04,323 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 18:33:04,324 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 18:33:04,324 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 18:33:04,324 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 18:33:04,324 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 18:33:04,324 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 18:33:04,325 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 18:33:04,325 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 18:33:04,325 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 18:33:04,325 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 18:33:04,325 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 18:33:04,325 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 18:33:04,325 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 18:33:04,326 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 18:33:04,326 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 18:33:04,326 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 18:33:04,326 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 18:33:04,326 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 18:33:04,326 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 18:33:04,326 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 18:33:04,326 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 18:33:04,326 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 18:33:04,326 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 18:33:04,326 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 18:33:04,326 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 18:33:04,326 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 18:33:04,326 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 18:33:04,326 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 18:33:04,326 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 18:33:04,326 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 18:33:04,326 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 18:33:04,326 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 18:33:04,326 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 18:33:04,326 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> d570de8a468b2e5d7e18a67170da2d8f06202ccdf10baa0799e3c0763140866e [2025-03-03 18:33:04,525 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 18:33:04,531 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 18:33:04,532 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 18:33:04,532 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 18:33:04,533 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 18:33:04,533 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_arrays_vsaR_p12.c [2025-03-03 18:33:05,667 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c750f3903/e00d09b0abb34f359d6579917e980eff/FLAG4778f2676 [2025-03-03 18:33:05,965 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 18:33:05,967 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_arrays_vsaR_p12.c [2025-03-03 18:33:05,980 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c750f3903/e00d09b0abb34f359d6579917e980eff/FLAG4778f2676 [2025-03-03 18:33:06,242 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c750f3903/e00d09b0abb34f359d6579917e980eff [2025-03-03 18:33:06,243 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 18:33:06,244 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 18:33:06,245 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 18:33:06,245 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 18:33:06,248 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 18:33:06,248 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 06:33:06" (1/1) ... [2025-03-03 18:33:06,249 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@19688109 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:33:06, skipping insertion in model container [2025-03-03 18:33:06,249 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 06:33:06" (1/1) ... [2025-03-03 18:33:06,281 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 18:33:06,403 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_arrays_vsaR_p12.c[1259,1272] [2025-03-03 18:33:06,615 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 18:33:06,629 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 18:33:06,637 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_arrays_vsaR_p12.c[1259,1272] [2025-03-03 18:33:06,747 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 18:33:06,762 INFO L204 MainTranslator]: Completed translation [2025-03-03 18:33:06,763 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:33:06 WrapperNode [2025-03-03 18:33:06,763 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 18:33:06,764 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 18:33:06,764 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 18:33:06,764 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 18:33:06,770 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:33:06" (1/1) ... [2025-03-03 18:33:06,797 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:33:06" (1/1) ... [2025-03-03 18:33:06,979 INFO L138 Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 2238 [2025-03-03 18:33:06,979 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 18:33:06,980 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 18:33:06,980 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 18:33:06,980 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 18:33:06,987 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:33:06" (1/1) ... [2025-03-03 18:33:06,987 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:33:06" (1/1) ... [2025-03-03 18:33:07,058 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:33:06" (1/1) ... [2025-03-03 18:33:07,121 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-03-03 18:33:07,121 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:33:06" (1/1) ... [2025-03-03 18:33:07,122 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:33:06" (1/1) ... [2025-03-03 18:33:07,174 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:33:06" (1/1) ... [2025-03-03 18:33:07,183 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:33:06" (1/1) ... [2025-03-03 18:33:07,198 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:33:06" (1/1) ... [2025-03-03 18:33:07,210 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:33:06" (1/1) ... [2025-03-03 18:33:07,239 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 18:33:07,240 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 18:33:07,240 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 18:33:07,240 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 18:33:07,241 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:33:06" (1/1) ... [2025-03-03 18:33:07,245 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 18:33:07,254 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 18:33:07,266 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-03 18:33:07,268 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-03 18:33:07,284 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 18:33:07,284 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 18:33:07,284 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 18:33:07,284 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 18:33:07,511 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 18:33:07,513 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 18:33:09,298 INFO L? ?]: Removed 1401 outVars from TransFormulas that were not future-live. [2025-03-03 18:33:09,298 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 18:33:09,385 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 18:33:09,385 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 18:33:09,386 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 06:33:09 BoogieIcfgContainer [2025-03-03 18:33:09,386 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 18:33:09,388 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 18:33:09,388 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 18:33:09,391 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 18:33:09,391 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 06:33:06" (1/3) ... [2025-03-03 18:33:09,391 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@43ff46b6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 06:33:09, skipping insertion in model container [2025-03-03 18:33:09,391 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:33:06" (2/3) ... [2025-03-03 18:33:09,391 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@43ff46b6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 06:33:09, skipping insertion in model container [2025-03-03 18:33:09,391 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 06:33:09" (3/3) ... [2025-03-03 18:33:09,392 INFO L128 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.vis_arrays_vsaR_p12.c [2025-03-03 18:33:09,404 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 18:33:09,406 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG btor2c-lazyMod.vis_arrays_vsaR_p12.c that has 1 procedures, 571 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 18:33:09,458 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 18:33:09,467 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;@4607e1e1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 18:33:09,468 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 18:33:09,473 INFO L276 IsEmpty]: Start isEmpty. Operand has 571 states, 569 states have (on average 1.4991212653778558) internal successors, (853), 570 states have internal predecessors, (853), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:33:09,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2025-03-03 18:33:09,480 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 18:33:09,480 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 18:33:09,481 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 18:33:09,485 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 18:33:09,486 INFO L85 PathProgramCache]: Analyzing trace with hash 1468423616, now seen corresponding path program 1 times [2025-03-03 18:33:09,491 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 18:33:09,492 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1657573498] [2025-03-03 18:33:09,493 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:33:09,494 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 18:33:09,579 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 61 statements into 1 equivalence classes. [2025-03-03 18:33:09,685 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 61 of 61 statements. [2025-03-03 18:33:09,686 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:33:09,687 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:33:10,154 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 18:33:10,155 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 18:33:10,155 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1657573498] [2025-03-03 18:33:10,156 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1657573498] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 18:33:10,156 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 18:33:10,156 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 18:33:10,157 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [839725267] [2025-03-03 18:33:10,157 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 18:33:10,160 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 18:33:10,160 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 18:33:10,173 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 18:33:10,173 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 18:33:10,175 INFO L87 Difference]: Start difference. First operand has 571 states, 569 states have (on average 1.4991212653778558) internal successors, (853), 570 states have internal predecessors, (853), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:33:10,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 18:33:10,474 INFO L93 Difference]: Finished difference Result 1087 states and 1627 transitions. [2025-03-03 18:33:10,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 18:33:10,476 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 61 [2025-03-03 18:33:10,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 18:33:10,487 INFO L225 Difference]: With dead ends: 1087 [2025-03-03 18:33:10,487 INFO L226 Difference]: Without dead ends: 570 [2025-03-03 18:33:10,492 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 18:33:10,494 INFO L435 NwaCegarLoop]: 707 mSDtfsCounter, 0 mSDsluCounter, 1409 mSDsCounter, 0 mSdLazyCounter, 430 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2116 SdHoareTripleChecker+Invalid, 430 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 430 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 18:33:10,494 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2116 Invalid, 430 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 430 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 18:33:10,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 570 states. [2025-03-03 18:33:10,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 570 to 570. [2025-03-03 18:33:10,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 570 states, 569 states have (on average 1.4956063268892794) internal successors, (851), 569 states have internal predecessors, (851), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:33:10,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 570 states to 570 states and 851 transitions. [2025-03-03 18:33:10,540 INFO L78 Accepts]: Start accepts. Automaton has 570 states and 851 transitions. Word has length 61 [2025-03-03 18:33:10,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 18:33:10,542 INFO L471 AbstractCegarLoop]: Abstraction has 570 states and 851 transitions. [2025-03-03 18:33:10,542 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:33:10,543 INFO L276 IsEmpty]: Start isEmpty. Operand 570 states and 851 transitions. [2025-03-03 18:33:10,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2025-03-03 18:33:10,546 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 18:33:10,546 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 18:33:10,546 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-03 18:33:10,546 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 18:33:10,547 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 18:33:10,547 INFO L85 PathProgramCache]: Analyzing trace with hash -1718828229, now seen corresponding path program 1 times [2025-03-03 18:33:10,547 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 18:33:10,547 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [849853405] [2025-03-03 18:33:10,547 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:33:10,547 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 18:33:10,580 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-03-03 18:33:10,606 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-03-03 18:33:10,606 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:33:10,606 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:33:10,742 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 18:33:10,742 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 18:33:10,742 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [849853405] [2025-03-03 18:33:10,742 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [849853405] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 18:33:10,743 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 18:33:10,743 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 18:33:10,743 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [166153777] [2025-03-03 18:33:10,743 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 18:33:10,744 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 18:33:10,744 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 18:33:10,745 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 18:33:10,745 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 18:33:10,745 INFO L87 Difference]: Start difference. First operand 570 states and 851 transitions. Second operand has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:33:11,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 18:33:11,008 INFO L93 Difference]: Finished difference Result 1088 states and 1625 transitions. [2025-03-03 18:33:11,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 18:33:11,009 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 62 [2025-03-03 18:33:11,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 18:33:11,011 INFO L225 Difference]: With dead ends: 1088 [2025-03-03 18:33:11,011 INFO L226 Difference]: Without dead ends: 572 [2025-03-03 18:33:11,012 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 18:33:11,015 INFO L435 NwaCegarLoop]: 707 mSDtfsCounter, 0 mSDsluCounter, 1406 mSDsCounter, 0 mSdLazyCounter, 433 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2113 SdHoareTripleChecker+Invalid, 433 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 433 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 18:33:11,015 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2113 Invalid, 433 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 433 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 18:33:11,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 572 states. [2025-03-03 18:33:11,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 572 to 572. [2025-03-03 18:33:11,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 572 states, 571 states have (on average 1.4938704028021015) internal successors, (853), 571 states have internal predecessors, (853), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:33:11,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 572 states to 572 states and 853 transitions. [2025-03-03 18:33:11,033 INFO L78 Accepts]: Start accepts. Automaton has 572 states and 853 transitions. Word has length 62 [2025-03-03 18:33:11,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 18:33:11,033 INFO L471 AbstractCegarLoop]: Abstraction has 572 states and 853 transitions. [2025-03-03 18:33:11,033 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:33:11,033 INFO L276 IsEmpty]: Start isEmpty. Operand 572 states and 853 transitions. [2025-03-03 18:33:11,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2025-03-03 18:33:11,034 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 18:33:11,035 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 18:33:11,035 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-03 18:33:11,035 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 18:33:11,035 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 18:33:11,035 INFO L85 PathProgramCache]: Analyzing trace with hash 187442459, now seen corresponding path program 1 times [2025-03-03 18:33:11,035 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 18:33:11,035 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1669485915] [2025-03-03 18:33:11,035 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:33:11,036 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 18:33:11,056 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-03-03 18:33:11,103 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-03-03 18:33:11,103 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:33:11,103 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:33:11,407 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 18:33:11,408 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 18:33:11,408 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1669485915] [2025-03-03 18:33:11,408 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1669485915] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 18:33:11,408 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 18:33:11,408 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-03 18:33:11,408 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1412640663] [2025-03-03 18:33:11,408 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 18:33:11,409 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 18:33:11,409 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 18:33:11,409 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 18:33:11,409 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-03-03 18:33:11,410 INFO L87 Difference]: Start difference. First operand 572 states and 853 transitions. Second operand has 7 states, 7 states have (on average 9.0) internal successors, (63), 7 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:33:11,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 18:33:11,811 INFO L93 Difference]: Finished difference Result 1097 states and 1637 transitions. [2025-03-03 18:33:11,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-03 18:33:11,812 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.0) internal successors, (63), 7 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 63 [2025-03-03 18:33:11,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 18:33:11,814 INFO L225 Difference]: With dead ends: 1097 [2025-03-03 18:33:11,814 INFO L226 Difference]: Without dead ends: 579 [2025-03-03 18:33:11,815 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2025-03-03 18:33:11,815 INFO L435 NwaCegarLoop]: 700 mSDtfsCounter, 804 mSDsluCounter, 2788 mSDsCounter, 0 mSdLazyCounter, 755 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 804 SdHoareTripleChecker+Valid, 3488 SdHoareTripleChecker+Invalid, 757 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 755 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 18:33:11,815 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [804 Valid, 3488 Invalid, 757 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 755 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 18:33:11,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 579 states. [2025-03-03 18:33:11,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 579 to 578. [2025-03-03 18:33:11,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 578 states, 577 states have (on average 1.490467937608319) internal successors, (860), 577 states have internal predecessors, (860), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:33:11,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 578 states to 578 states and 860 transitions. [2025-03-03 18:33:11,836 INFO L78 Accepts]: Start accepts. Automaton has 578 states and 860 transitions. Word has length 63 [2025-03-03 18:33:11,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 18:33:11,836 INFO L471 AbstractCegarLoop]: Abstraction has 578 states and 860 transitions. [2025-03-03 18:33:11,836 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.0) internal successors, (63), 7 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:33:11,837 INFO L276 IsEmpty]: Start isEmpty. Operand 578 states and 860 transitions. [2025-03-03 18:33:11,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2025-03-03 18:33:11,839 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 18:33:11,839 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 18:33:11,839 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-03 18:33:11,839 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 18:33:11,839 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 18:33:11,840 INFO L85 PathProgramCache]: Analyzing trace with hash -1183441628, now seen corresponding path program 1 times [2025-03-03 18:33:11,840 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 18:33:11,840 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1070242] [2025-03-03 18:33:11,840 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:33:11,840 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 18:33:11,865 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-03-03 18:33:11,901 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-03-03 18:33:11,901 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:33:11,901 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:33:12,318 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 18:33:12,318 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 18:33:12,318 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1070242] [2025-03-03 18:33:12,318 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1070242] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 18:33:12,318 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 18:33:12,318 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-03 18:33:12,318 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [666109467] [2025-03-03 18:33:12,318 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 18:33:12,319 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 18:33:12,319 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 18:33:12,319 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 18:33:12,319 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-03 18:33:12,319 INFO L87 Difference]: Start difference. First operand 578 states and 860 transitions. Second operand has 7 states, 7 states have (on average 9.142857142857142) internal successors, (64), 7 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:33:12,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 18:33:12,696 INFO L93 Difference]: Finished difference Result 1150 states and 1711 transitions. [2025-03-03 18:33:12,696 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-03 18:33:12,696 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.142857142857142) internal successors, (64), 7 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 64 [2025-03-03 18:33:12,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 18:33:12,699 INFO L225 Difference]: With dead ends: 1150 [2025-03-03 18:33:12,699 INFO L226 Difference]: Without dead ends: 626 [2025-03-03 18:33:12,699 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-03 18:33:12,700 INFO L435 NwaCegarLoop]: 701 mSDtfsCounter, 47 mSDsluCounter, 2846 mSDsCounter, 0 mSdLazyCounter, 760 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 3547 SdHoareTripleChecker+Invalid, 760 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 760 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 18:33:12,700 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 3547 Invalid, 760 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 760 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 18:33:12,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 626 states. [2025-03-03 18:33:12,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 626 to 622. [2025-03-03 18:33:12,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 622 states, 621 states have (on average 1.4895330112721417) internal successors, (925), 621 states have internal predecessors, (925), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:33:12,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 622 states to 622 states and 925 transitions. [2025-03-03 18:33:12,711 INFO L78 Accepts]: Start accepts. Automaton has 622 states and 925 transitions. Word has length 64 [2025-03-03 18:33:12,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 18:33:12,711 INFO L471 AbstractCegarLoop]: Abstraction has 622 states and 925 transitions. [2025-03-03 18:33:12,711 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.142857142857142) internal successors, (64), 7 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:33:12,711 INFO L276 IsEmpty]: Start isEmpty. Operand 622 states and 925 transitions. [2025-03-03 18:33:12,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2025-03-03 18:33:12,716 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 18:33:12,716 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 18:33:12,716 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-03 18:33:12,716 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 18:33:12,717 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 18:33:12,717 INFO L85 PathProgramCache]: Analyzing trace with hash -890855072, now seen corresponding path program 1 times [2025-03-03 18:33:12,717 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 18:33:12,717 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1967015585] [2025-03-03 18:33:12,717 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:33:12,717 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 18:33:12,737 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-03-03 18:33:12,780 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-03-03 18:33:12,780 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:33:12,780 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:33:13,166 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 18:33:13,166 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 18:33:13,166 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1967015585] [2025-03-03 18:33:13,166 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1967015585] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 18:33:13,166 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 18:33:13,166 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-03 18:33:13,166 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1182598542] [2025-03-03 18:33:13,167 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 18:33:13,168 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-03 18:33:13,168 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 18:33:13,168 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-03 18:33:13,168 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2025-03-03 18:33:13,168 INFO L87 Difference]: Start difference. First operand 622 states and 925 transitions. Second operand has 10 states, 10 states have (on average 6.4) internal successors, (64), 10 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:33:14,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 18:33:14,031 INFO L93 Difference]: Finished difference Result 1474 states and 2189 transitions. [2025-03-03 18:33:14,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-03 18:33:14,032 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.4) internal successors, (64), 10 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 64 [2025-03-03 18:33:14,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 18:33:14,035 INFO L225 Difference]: With dead ends: 1474 [2025-03-03 18:33:14,035 INFO L226 Difference]: Without dead ends: 906 [2025-03-03 18:33:14,036 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=215, Unknown=0, NotChecked=0, Total=272 [2025-03-03 18:33:14,036 INFO L435 NwaCegarLoop]: 682 mSDtfsCounter, 1669 mSDsluCounter, 4765 mSDsCounter, 0 mSdLazyCounter, 1357 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1669 SdHoareTripleChecker+Valid, 5447 SdHoareTripleChecker+Invalid, 1360 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 1357 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-03 18:33:14,037 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1669 Valid, 5447 Invalid, 1360 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 1357 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-03 18:33:14,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 906 states. [2025-03-03 18:33:14,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 906 to 677. [2025-03-03 18:33:14,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 677 states, 676 states have (on average 1.4866863905325445) internal successors, (1005), 676 states have internal predecessors, (1005), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:33:14,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 677 states to 677 states and 1005 transitions. [2025-03-03 18:33:14,051 INFO L78 Accepts]: Start accepts. Automaton has 677 states and 1005 transitions. Word has length 64 [2025-03-03 18:33:14,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 18:33:14,051 INFO L471 AbstractCegarLoop]: Abstraction has 677 states and 1005 transitions. [2025-03-03 18:33:14,052 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.4) internal successors, (64), 10 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:33:14,052 INFO L276 IsEmpty]: Start isEmpty. Operand 677 states and 1005 transitions. [2025-03-03 18:33:14,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2025-03-03 18:33:14,053 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 18:33:14,053 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 18:33:14,053 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-03 18:33:14,053 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 18:33:14,053 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 18:33:14,053 INFO L85 PathProgramCache]: Analyzing trace with hash -1363218237, now seen corresponding path program 1 times [2025-03-03 18:33:14,053 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 18:33:14,053 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1266657480] [2025-03-03 18:33:14,053 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:33:14,053 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 18:33:14,075 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-03-03 18:33:14,094 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-03-03 18:33:14,095 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:33:14,095 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:33:14,216 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 18:33:14,216 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 18:33:14,216 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1266657480] [2025-03-03 18:33:14,216 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1266657480] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 18:33:14,216 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 18:33:14,216 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 18:33:14,217 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1506477319] [2025-03-03 18:33:14,217 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 18:33:14,217 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 18:33:14,217 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 18:33:14,217 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 18:33:14,217 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 18:33:14,218 INFO L87 Difference]: Start difference. First operand 677 states and 1005 transitions. Second operand has 5 states, 5 states have (on average 13.0) internal successors, (65), 5 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:33:14,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 18:33:14,555 INFO L93 Difference]: Finished difference Result 1420 states and 2108 transitions. [2025-03-03 18:33:14,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 18:33:14,556 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.0) internal successors, (65), 5 states have internal predecessors, (65), 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 65 [2025-03-03 18:33:14,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 18:33:14,559 INFO L225 Difference]: With dead ends: 1420 [2025-03-03 18:33:14,559 INFO L226 Difference]: Without dead ends: 851 [2025-03-03 18:33:14,560 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-03 18:33:14,560 INFO L435 NwaCegarLoop]: 692 mSDtfsCounter, 1475 mSDsluCounter, 1380 mSDsCounter, 0 mSdLazyCounter, 475 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1475 SdHoareTripleChecker+Valid, 2072 SdHoareTripleChecker+Invalid, 475 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 475 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 18:33:14,560 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1475 Valid, 2072 Invalid, 475 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 475 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 18:33:14,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 851 states. [2025-03-03 18:33:14,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 851 to 676. [2025-03-03 18:33:14,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 676 states, 675 states have (on average 1.4859259259259259) internal successors, (1003), 675 states have internal predecessors, (1003), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:33:14,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 676 states to 676 states and 1003 transitions. [2025-03-03 18:33:14,571 INFO L78 Accepts]: Start accepts. Automaton has 676 states and 1003 transitions. Word has length 65 [2025-03-03 18:33:14,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 18:33:14,572 INFO L471 AbstractCegarLoop]: Abstraction has 676 states and 1003 transitions. [2025-03-03 18:33:14,572 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.0) internal successors, (65), 5 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:33:14,572 INFO L276 IsEmpty]: Start isEmpty. Operand 676 states and 1003 transitions. [2025-03-03 18:33:14,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2025-03-03 18:33:14,572 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 18:33:14,572 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 18:33:14,572 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-03 18:33:14,573 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 18:33:14,573 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 18:33:14,573 INFO L85 PathProgramCache]: Analyzing trace with hash -1637587786, now seen corresponding path program 1 times [2025-03-03 18:33:14,573 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 18:33:14,573 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1714344951] [2025-03-03 18:33:14,573 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:33:14,573 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 18:33:14,591 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-03-03 18:33:14,602 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-03-03 18:33:14,603 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:33:14,603 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:33:14,691 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 18:33:14,691 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 18:33:14,692 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1714344951] [2025-03-03 18:33:14,692 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1714344951] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 18:33:14,692 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 18:33:14,692 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 18:33:14,692 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1856546485] [2025-03-03 18:33:14,692 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 18:33:14,692 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 18:33:14,693 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 18:33:14,693 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 18:33:14,693 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 18:33:14,693 INFO L87 Difference]: Start difference. First operand 676 states and 1003 transitions. Second operand has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:33:14,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 18:33:14,953 INFO L93 Difference]: Finished difference Result 1293 states and 1921 transitions. [2025-03-03 18:33:14,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 18:33:14,953 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 66 [2025-03-03 18:33:14,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 18:33:14,955 INFO L225 Difference]: With dead ends: 1293 [2025-03-03 18:33:14,955 INFO L226 Difference]: Without dead ends: 718 [2025-03-03 18:33:14,956 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 18:33:14,957 INFO L435 NwaCegarLoop]: 706 mSDtfsCounter, 12 mSDsluCounter, 2108 mSDsCounter, 0 mSdLazyCounter, 581 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 2814 SdHoareTripleChecker+Invalid, 581 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 581 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 18:33:14,957 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 2814 Invalid, 581 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 581 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 18:33:14,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 718 states. [2025-03-03 18:33:14,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 718 to 718. [2025-03-03 18:33:14,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 718 states, 717 states have (on average 1.4825662482566249) internal successors, (1063), 717 states have internal predecessors, (1063), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:33:14,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 718 states to 718 states and 1063 transitions. [2025-03-03 18:33:14,971 INFO L78 Accepts]: Start accepts. Automaton has 718 states and 1063 transitions. Word has length 66 [2025-03-03 18:33:14,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 18:33:14,971 INFO L471 AbstractCegarLoop]: Abstraction has 718 states and 1063 transitions. [2025-03-03 18:33:14,971 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:33:14,971 INFO L276 IsEmpty]: Start isEmpty. Operand 718 states and 1063 transitions. [2025-03-03 18:33:14,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2025-03-03 18:33:14,972 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 18:33:14,972 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 18:33:14,972 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-03 18:33:14,973 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 18:33:14,973 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 18:33:14,973 INFO L85 PathProgramCache]: Analyzing trace with hash -1220932680, now seen corresponding path program 1 times [2025-03-03 18:33:14,973 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 18:33:14,974 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1606193088] [2025-03-03 18:33:14,974 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:33:14,974 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 18:33:14,992 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-03-03 18:33:15,040 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-03-03 18:33:15,040 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:33:15,040 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:33:15,721 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 18:33:15,721 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 18:33:15,721 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1606193088] [2025-03-03 18:33:15,721 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1606193088] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 18:33:15,721 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 18:33:15,721 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2025-03-03 18:33:15,721 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1479731571] [2025-03-03 18:33:15,721 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 18:33:15,721 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-03-03 18:33:15,722 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 18:33:15,722 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-03-03 18:33:15,722 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=273, Unknown=0, NotChecked=0, Total=306 [2025-03-03 18:33:15,722 INFO L87 Difference]: Start difference. First operand 718 states and 1063 transitions. Second operand has 18 states, 18 states have (on average 3.7222222222222223) internal successors, (67), 18 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:33:17,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 18:33:17,299 INFO L93 Difference]: Finished difference Result 1531 states and 2268 transitions. [2025-03-03 18:33:17,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-03-03 18:33:17,300 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 3.7222222222222223) internal successors, (67), 18 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 67 [2025-03-03 18:33:17,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 18:33:17,302 INFO L225 Difference]: With dead ends: 1531 [2025-03-03 18:33:17,302 INFO L226 Difference]: Without dead ends: 935 [2025-03-03 18:33:17,304 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=137, Invalid=919, Unknown=0, NotChecked=0, Total=1056 [2025-03-03 18:33:17,304 INFO L435 NwaCegarLoop]: 664 mSDtfsCounter, 1732 mSDsluCounter, 9969 mSDsCounter, 0 mSdLazyCounter, 2951 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1732 SdHoareTripleChecker+Valid, 10633 SdHoareTripleChecker+Invalid, 2959 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 2951 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-03-03 18:33:17,304 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1732 Valid, 10633 Invalid, 2959 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 2951 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-03-03 18:33:17,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 935 states. [2025-03-03 18:33:17,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 935 to 756. [2025-03-03 18:33:17,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 756 states, 755 states have (on average 1.4834437086092715) internal successors, (1120), 755 states have internal predecessors, (1120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:33:17,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 756 states to 756 states and 1120 transitions. [2025-03-03 18:33:17,316 INFO L78 Accepts]: Start accepts. Automaton has 756 states and 1120 transitions. Word has length 67 [2025-03-03 18:33:17,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 18:33:17,316 INFO L471 AbstractCegarLoop]: Abstraction has 756 states and 1120 transitions. [2025-03-03 18:33:17,316 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 3.7222222222222223) internal successors, (67), 18 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:33:17,317 INFO L276 IsEmpty]: Start isEmpty. Operand 756 states and 1120 transitions. [2025-03-03 18:33:17,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2025-03-03 18:33:17,317 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 18:33:17,317 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 18:33:17,317 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-03 18:33:17,317 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 18:33:17,318 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 18:33:17,318 INFO L85 PathProgramCache]: Analyzing trace with hash -1893397977, now seen corresponding path program 1 times [2025-03-03 18:33:17,318 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 18:33:17,318 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [39778802] [2025-03-03 18:33:17,318 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:33:17,318 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 18:33:17,336 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-03-03 18:33:17,360 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-03-03 18:33:17,360 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:33:17,360 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-03 18:33:17,360 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-03 18:33:17,369 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-03-03 18:33:17,414 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-03-03 18:33:17,414 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:33:17,414 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-03 18:33:17,456 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-03 18:33:17,456 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-03 18:33:17,457 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-03 18:33:17,458 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-03 18:33:17,461 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 18:33:17,497 WARN L310 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2025-03-03 18:33:17,512 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-03 18:33:17,514 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.03 06:33:17 BoogieIcfgContainer [2025-03-03 18:33:17,514 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-03 18:33:17,515 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-03 18:33:17,515 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-03 18:33:17,515 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-03 18:33:17,516 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 06:33:09" (3/4) ... [2025-03-03 18:33:17,517 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-03 18:33:17,518 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-03 18:33:17,518 INFO L158 Benchmark]: Toolchain (without parser) took 11273.86ms. Allocated memory was 167.8MB in the beginning and 570.4MB in the end (delta: 402.7MB). Free memory was 123.1MB in the beginning and 254.7MB in the end (delta: -131.6MB). Peak memory consumption was 275.6MB. Max. memory is 16.1GB. [2025-03-03 18:33:17,518 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 201.3MB. Free memory is still 116.5MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 18:33:17,518 INFO L158 Benchmark]: CACSL2BoogieTranslator took 518.61ms. Allocated memory is still 167.8MB. Free memory was 123.1MB in the beginning and 78.4MB in the end (delta: 44.7MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. [2025-03-03 18:33:17,518 INFO L158 Benchmark]: Boogie Procedure Inliner took 215.46ms. Allocated memory was 167.8MB in the beginning and 176.2MB in the end (delta: 8.4MB). Free memory was 78.4MB in the beginning and 99.3MB in the end (delta: -20.9MB). Peak memory consumption was 80.4MB. Max. memory is 16.1GB. [2025-03-03 18:33:17,519 INFO L158 Benchmark]: Boogie Preprocessor took 258.73ms. Allocated memory is still 176.2MB. Free memory was 99.3MB in the beginning and 81.4MB in the end (delta: 17.9MB). Peak memory consumption was 26.7MB. Max. memory is 16.1GB. [2025-03-03 18:33:17,519 INFO L158 Benchmark]: IcfgBuilder took 2146.22ms. Allocated memory was 176.2MB in the beginning and 469.8MB in the end (delta: 293.6MB). Free memory was 81.4MB in the beginning and 159.8MB in the end (delta: -78.4MB). Peak memory consumption was 225.9MB. Max. memory is 16.1GB. [2025-03-03 18:33:17,519 INFO L158 Benchmark]: TraceAbstraction took 8126.98ms. Allocated memory was 469.8MB in the beginning and 570.4MB in the end (delta: 100.7MB). Free memory was 159.8MB in the beginning and 254.7MB in the end (delta: -94.9MB). Peak memory consumption was 661.9kB. Max. memory is 16.1GB. [2025-03-03 18:33:17,519 INFO L158 Benchmark]: Witness Printer took 2.64ms. Allocated memory is still 570.4MB. Free memory was 254.7MB in the beginning and 254.7MB in the end (delta: 48.3kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-03 18:33:17,520 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.13ms. Allocated memory is still 201.3MB. Free memory is still 116.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 518.61ms. Allocated memory is still 167.8MB. Free memory was 123.1MB in the beginning and 78.4MB in the end (delta: 44.7MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 215.46ms. Allocated memory was 167.8MB in the beginning and 176.2MB in the end (delta: 8.4MB). Free memory was 78.4MB in the beginning and 99.3MB in the end (delta: -20.9MB). Peak memory consumption was 80.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 258.73ms. Allocated memory is still 176.2MB. Free memory was 99.3MB in the beginning and 81.4MB in the end (delta: 17.9MB). Peak memory consumption was 26.7MB. Max. memory is 16.1GB. * IcfgBuilder took 2146.22ms. Allocated memory was 176.2MB in the beginning and 469.8MB in the end (delta: 293.6MB). Free memory was 81.4MB in the beginning and 159.8MB in the end (delta: -78.4MB). Peak memory consumption was 225.9MB. Max. memory is 16.1GB. * TraceAbstraction took 8126.98ms. Allocated memory was 469.8MB in the beginning and 570.4MB in the end (delta: 100.7MB). Free memory was 159.8MB in the beginning and 254.7MB in the end (delta: -94.9MB). Peak memory consumption was 661.9kB. Max. memory is 16.1GB. * Witness Printer took 2.64ms. Allocated memory is still 570.4MB. Free memory was 254.7MB in the beginning and 254.7MB in the end (delta: 48.3kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 21]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of bitwiseOr at line 205, overapproximation of bitwiseAnd at line 210. Possible FailurePath: [L26] const SORT_1 mask_SORT_1 = (SORT_1)-1 >> (sizeof(SORT_1) * 8 - 1); [L27] const SORT_1 msb_SORT_1 = (SORT_1)1 << (1 - 1); [L29] const SORT_3 mask_SORT_3 = (SORT_3)-1 >> (sizeof(SORT_3) * 8 - 5); [L30] const SORT_3 msb_SORT_3 = (SORT_3)1 << (5 - 1); [L32] const SORT_5 mask_SORT_5 = (SORT_5)-1 >> (sizeof(SORT_5) * 8 - 12); [L33] const SORT_5 msb_SORT_5 = (SORT_5)1 << (12 - 1); [L35] const SORT_7 mask_SORT_7 = (SORT_7)-1 >> (sizeof(SORT_7) * 8 - 3); [L36] const SORT_7 msb_SORT_7 = (SORT_7)1 << (3 - 1); [L38] const SORT_26 mask_SORT_26 = (SORT_26)-1 >> (sizeof(SORT_26) * 8 - 2); [L39] const SORT_26 msb_SORT_26 = (SORT_26)1 << (2 - 1); [L41] const SORT_108 mask_SORT_108 = (SORT_108)-1 >> (sizeof(SORT_108) * 8 - 4); [L42] const SORT_108 msb_SORT_108 = (SORT_108)1 << (4 - 1); [L44] const SORT_165 mask_SORT_165 = (SORT_165)-1 >> (sizeof(SORT_165) * 8 - 32); [L45] const SORT_165 msb_SORT_165 = (SORT_165)1 << (32 - 1); [L47] const SORT_7 var_8 = 0; [L48] const SORT_3 var_15 = 0; [L49] const SORT_1 var_41 = 1; [L50] const SORT_1 var_51 = 0; [L51] const SORT_5 var_54 = 0; [L52] const SORT_7 var_68 = 2; [L53] const SORT_7 var_72 = 1; [L54] const SORT_7 var_77 = 4; [L55] const SORT_7 var_79 = 5; [L56] const SORT_7 var_83 = 3; [L57] const SORT_3 var_95 = 2; [L58] const SORT_7 var_125 = 7; [L59] const SORT_7 var_130 = 6; [L60] const SORT_165 var_167 = 0; [L61] const SORT_3 var_197 = 31; [L63] SORT_1 input_2; [L64] SORT_3 input_4; [L65] SORT_5 input_6; [L66] SORT_3 input_186; [L67] SORT_3 input_187; [L68] SORT_3 input_188; [L69] SORT_3 input_196; [L70] SORT_3 input_206; [L71] SORT_3 input_207; [L72] SORT_3 input_208; [L73] SORT_3 input_211; [L74] SORT_3 input_230; [L75] SORT_3 input_231; [L76] SORT_3 input_232; [L77] SORT_3 input_235; [L78] SORT_3 input_237; [L79] SORT_26 input_251; [L80] SORT_26 input_252; [L81] SORT_26 input_253; [L83] EXPR __VERIFIER_nondet_uchar() & mask_SORT_7 VAL [mask_SORT_108=15, mask_SORT_1=1, mask_SORT_26=3, mask_SORT_3=31, mask_SORT_5=4095, mask_SORT_7=7, var_125=7, var_130=6, var_15=0, var_167=0, var_197=31, var_41=1, var_51=0, var_54=0, var_68=2, var_72=1, var_77=4, var_79=5, var_83=3, var_8=0, var_95=2] [L83] SORT_7 state_9 = __VERIFIER_nondet_uchar() & mask_SORT_7; [L84] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_108=15, mask_SORT_1=1, mask_SORT_26=3, mask_SORT_3=31, mask_SORT_5=4095, mask_SORT_7=7, var_125=7, var_130=6, var_15=0, var_167=0, var_197=31, var_41=1, var_51=0, var_54=0, var_68=2, var_72=1, var_77=4, var_79=5, var_83=3, var_8=0, var_95=2] [L84] SORT_3 state_16 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L85] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_108=15, mask_SORT_1=1, mask_SORT_26=3, mask_SORT_3=31, mask_SORT_5=4095, mask_SORT_7=7, var_125=7, var_130=6, var_15=0, var_167=0, var_197=31, var_41=1, var_51=0, var_54=0, var_68=2, var_72=1, var_77=4, var_79=5, var_83=3, var_8=0, var_95=2] [L85] SORT_3 state_19 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L86] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_108=15, mask_SORT_1=1, mask_SORT_26=3, mask_SORT_3=31, mask_SORT_5=4095, mask_SORT_7=7, var_125=7, var_130=6, var_15=0, var_167=0, var_197=31, var_41=1, var_51=0, var_54=0, var_68=2, var_72=1, var_77=4, var_79=5, var_83=3, var_8=0, var_95=2] [L86] SORT_3 state_45 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L87] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_108=15, mask_SORT_1=1, mask_SORT_26=3, mask_SORT_3=31, mask_SORT_5=4095, mask_SORT_7=7, var_125=7, var_130=6, var_15=0, var_167=0, var_197=31, var_41=1, var_51=0, var_54=0, var_68=2, var_72=1, var_77=4, var_79=5, var_83=3, var_8=0, var_95=2] [L87] SORT_3 state_47 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L88] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_108=15, mask_SORT_1=1, mask_SORT_26=3, mask_SORT_3=31, mask_SORT_5=4095, mask_SORT_7=7, var_125=7, var_130=6, var_15=0, var_167=0, var_197=31, var_41=1, var_51=0, var_54=0, var_68=2, var_72=1, var_77=4, var_79=5, var_83=3, var_8=0, var_95=2] [L88] SORT_3 state_49 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L89] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_108=15, mask_SORT_1=1, mask_SORT_26=3, mask_SORT_3=31, mask_SORT_5=4095, mask_SORT_7=7, var_125=7, var_130=6, var_15=0, var_167=0, var_197=31, var_41=1, var_51=0, var_54=0, var_68=2, var_72=1, var_77=4, var_79=5, var_83=3, var_8=0, var_95=2] [L89] SORT_1 state_52 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L90] EXPR __VERIFIER_nondet_ushort() & mask_SORT_5 VAL [mask_SORT_108=15, mask_SORT_1=1, mask_SORT_26=3, mask_SORT_3=31, mask_SORT_7=7, var_125=7, var_130=6, var_15=0, var_167=0, var_197=31, var_41=1, var_51=0, var_54=0, var_68=2, var_72=1, var_77=4, var_79=5, var_83=3, var_8=0, var_95=2] [L90] SORT_5 state_55 = __VERIFIER_nondet_ushort() & mask_SORT_5; [L91] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_108=15, mask_SORT_1=1, mask_SORT_26=3, mask_SORT_3=31, mask_SORT_7=7, var_125=7, var_130=6, var_15=0, var_167=0, var_197=31, var_41=1, var_51=0, var_54=0, var_68=2, var_72=1, var_77=4, var_79=5, var_83=3, var_8=0, var_95=2] [L91] SORT_3 state_57 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L92] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_108=15, mask_SORT_1=1, mask_SORT_26=3, mask_SORT_3=31, mask_SORT_7=7, var_125=7, var_130=6, var_15=0, var_167=0, var_197=31, var_41=1, var_51=0, var_54=0, var_68=2, var_72=1, var_77=4, var_79=5, var_83=3, var_8=0, var_95=2] [L92] SORT_3 state_59 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L93] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_108=15, mask_SORT_1=1, mask_SORT_26=3, mask_SORT_3=31, mask_SORT_7=7, var_125=7, var_130=6, var_15=0, var_167=0, var_197=31, var_41=1, var_51=0, var_54=0, var_68=2, var_72=1, var_77=4, var_79=5, var_83=3, var_8=0, var_95=2] [L93] SORT_3 state_61 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L94] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_108=15, mask_SORT_1=1, mask_SORT_26=3, mask_SORT_3=31, mask_SORT_7=7, var_125=7, var_130=6, var_15=0, var_167=0, var_197=31, var_41=1, var_51=0, var_54=0, var_68=2, var_72=1, var_77=4, var_79=5, var_83=3, var_8=0, var_95=2] [L94] SORT_3 state_63 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L95] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_108=15, mask_SORT_1=1, mask_SORT_26=3, mask_SORT_3=31, mask_SORT_7=7, var_125=7, var_130=6, var_15=0, var_167=0, var_197=31, var_41=1, var_51=0, var_54=0, var_68=2, var_72=1, var_77=4, var_79=5, var_83=3, var_8=0, var_95=2] [L95] SORT_3 state_65 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L97] SORT_7 init_10_arg_1 = var_8; [L98] state_9 = init_10_arg_1 [L99] SORT_3 init_17_arg_1 = var_15; [L100] state_16 = init_17_arg_1 [L101] SORT_3 init_20_arg_1 = var_15; [L102] state_19 = init_20_arg_1 [L103] SORT_3 init_46_arg_1 = var_15; [L104] state_45 = init_46_arg_1 [L105] SORT_3 init_48_arg_1 = var_15; [L106] state_47 = init_48_arg_1 [L107] SORT_3 init_50_arg_1 = var_15; [L108] state_49 = init_50_arg_1 [L109] SORT_1 init_53_arg_1 = var_51; [L110] state_52 = init_53_arg_1 [L111] SORT_5 init_56_arg_1 = var_54; [L112] state_55 = init_56_arg_1 [L113] SORT_3 init_58_arg_1 = var_15; [L114] state_57 = init_58_arg_1 [L115] SORT_3 init_60_arg_1 = var_15; [L116] state_59 = init_60_arg_1 [L117] SORT_3 init_62_arg_1 = var_15; [L118] state_61 = init_62_arg_1 [L119] SORT_3 init_64_arg_1 = var_15; [L120] state_63 = init_64_arg_1 [L121] SORT_3 init_66_arg_1 = var_15; [L122] state_65 = init_66_arg_1 VAL [mask_SORT_108=15, mask_SORT_1=1, mask_SORT_26=3, mask_SORT_3=31, mask_SORT_7=7, state_16=0, state_19=0, state_45=0, state_47=0, state_49=0, state_52=0, state_55=0, state_57=0, state_59=0, state_61=0, state_63=0, state_65=0, state_9=0, var_125=7, var_130=6, var_15=0, var_167=0, var_197=31, var_41=1, var_51=0, var_68=2, var_72=1, var_77=4, var_79=5, var_83=3, var_8=0, var_95=2] [L125] input_2 = __VERIFIER_nondet_uchar() [L126] input_4 = __VERIFIER_nondet_uchar() [L127] input_6 = __VERIFIER_nondet_ushort() [L128] input_186 = __VERIFIER_nondet_uchar() [L129] input_187 = __VERIFIER_nondet_uchar() [L130] input_188 = __VERIFIER_nondet_uchar() [L131] input_196 = __VERIFIER_nondet_uchar() [L132] input_206 = __VERIFIER_nondet_uchar() [L133] input_207 = __VERIFIER_nondet_uchar() [L134] input_208 = __VERIFIER_nondet_uchar() [L135] input_211 = __VERIFIER_nondet_uchar() [L136] input_230 = __VERIFIER_nondet_uchar() [L137] input_231 = __VERIFIER_nondet_uchar() [L138] input_232 = __VERIFIER_nondet_uchar() [L139] input_235 = __VERIFIER_nondet_uchar() [L140] input_237 = __VERIFIER_nondet_uchar() [L141] input_251 = __VERIFIER_nondet_uchar() [L142] input_252 = __VERIFIER_nondet_uchar() [L143] input_253 = __VERIFIER_nondet_uchar() [L146] SORT_7 var_11_arg_0 = state_9; [L147] SORT_1 var_11 = var_11_arg_0 >> 0; [L148] SORT_7 var_12_arg_0 = state_9; [L149] SORT_1 var_12 = var_12_arg_0 >> 1; [L150] SORT_1 var_13_arg_0 = var_11; [L151] SORT_1 var_13_arg_1 = var_12; VAL [mask_SORT_108=15, mask_SORT_1=1, mask_SORT_26=3, mask_SORT_3=31, mask_SORT_7=7, state_16=0, state_19=0, state_45=0, state_47=0, state_49=0, state_52=0, state_55=0, state_57=0, state_59=0, state_61=0, state_63=0, state_65=0, state_9=0, var_125=7, var_130=6, var_13_arg_0=0, var_13_arg_1=0, var_15=0, var_167=0, var_197=31, var_41=1, var_51=0, var_68=2, var_72=1, var_77=4, var_79=5, var_83=3, var_8=0, var_95=2] [L152] EXPR var_13_arg_0 | var_13_arg_1 VAL [mask_SORT_108=15, mask_SORT_1=1, mask_SORT_26=3, mask_SORT_3=31, mask_SORT_7=7, state_16=0, state_19=0, state_45=0, state_47=0, state_49=0, state_52=0, state_55=0, state_57=0, state_59=0, state_61=0, state_63=0, state_65=0, state_9=0, var_125=7, var_130=6, var_15=0, var_167=0, var_197=31, var_41=1, var_51=0, var_68=2, var_72=1, var_77=4, var_79=5, var_83=3, var_8=0, var_95=2] [L152] SORT_1 var_13 = var_13_arg_0 | var_13_arg_1; [L153] SORT_1 var_14_arg_0 = var_13; [L154] SORT_1 var_14 = ~var_14_arg_0; [L155] SORT_3 var_18_arg_0 = state_16; [L156] SORT_1 var_18 = var_18_arg_0 >> 1; [L157] SORT_3 var_21_arg_0 = state_19; [L158] SORT_7 var_21 = var_21_arg_0 >> 2; VAL [mask_SORT_108=15, mask_SORT_1=1, mask_SORT_26=3, mask_SORT_3=31, mask_SORT_7=7, state_16=0, state_19=0, state_45=0, state_47=0, state_49=0, state_52=0, state_55=0, state_57=0, state_59=0, state_61=0, state_63=0, state_65=0, state_9=0, var_125=7, var_130=6, var_14=-1, var_15=0, var_167=0, var_18=0, var_197=31, var_21=0, var_41=1, var_51=0, var_68=2, var_72=1, var_77=4, var_79=5, var_83=3, var_8=0, var_95=2] [L159] EXPR var_21 & mask_SORT_7 VAL [mask_SORT_108=15, mask_SORT_1=1, mask_SORT_26=3, mask_SORT_3=31, mask_SORT_7=7, state_16=0, state_19=0, state_45=0, state_47=0, state_49=0, state_52=0, state_55=0, state_57=0, state_59=0, state_61=0, state_63=0, state_65=0, state_9=0, var_125=7, var_130=6, var_14=-1, var_15=0, var_167=0, var_18=0, var_197=31, var_41=1, var_51=0, var_68=2, var_72=1, var_77=4, var_79=5, var_83=3, var_8=0, var_95=2] [L159] var_21 = var_21 & mask_SORT_7 [L160] SORT_3 var_22_arg_0 = state_16; [L161] SORT_7 var_22 = var_22_arg_0 >> 2; VAL [mask_SORT_108=15, mask_SORT_1=1, mask_SORT_26=3, mask_SORT_3=31, mask_SORT_7=7, state_16=0, state_19=0, state_45=0, state_47=0, state_49=0, state_52=0, state_55=0, state_57=0, state_59=0, state_61=0, state_63=0, state_65=0, state_9=0, var_125=7, var_130=6, var_14=-1, var_15=0, var_167=0, var_18=0, var_197=31, var_21=0, var_22=0, var_41=1, var_51=0, var_68=2, var_72=1, var_77=4, var_79=5, var_83=3, var_8=0, var_95=2] [L162] EXPR var_22 & mask_SORT_7 VAL [mask_SORT_108=15, mask_SORT_1=1, mask_SORT_26=3, mask_SORT_3=31, mask_SORT_7=7, state_16=0, state_19=0, state_45=0, state_47=0, state_49=0, state_52=0, state_55=0, state_57=0, state_59=0, state_61=0, state_63=0, state_65=0, state_9=0, var_125=7, var_130=6, var_14=-1, var_15=0, var_167=0, var_18=0, var_197=31, var_21=0, var_41=1, var_51=0, var_68=2, var_72=1, var_77=4, var_79=5, var_83=3, var_8=0, var_95=2] [L162] var_22 = var_22 & mask_SORT_7 [L163] SORT_7 var_23_arg_0 = var_21; [L164] SORT_7 var_23_arg_1 = var_22; [L165] SORT_1 var_23 = var_23_arg_0 == var_23_arg_1; [L166] SORT_1 var_24_arg_0 = var_18; [L167] SORT_1 var_24_arg_1 = var_23; VAL [mask_SORT_108=15, mask_SORT_1=1, mask_SORT_26=3, mask_SORT_3=31, mask_SORT_7=7, state_16=0, state_19=0, state_45=0, state_47=0, state_49=0, state_52=0, state_55=0, state_57=0, state_59=0, state_61=0, state_63=0, state_65=0, state_9=0, var_125=7, var_130=6, var_14=-1, var_15=0, var_167=0, var_197=31, var_24_arg_0=0, var_24_arg_1=1, var_41=1, var_51=0, var_68=2, var_72=1, var_77=4, var_79=5, var_83=3, var_8=0, var_95=2] [L168] EXPR var_24_arg_0 | var_24_arg_1 VAL [mask_SORT_108=15, mask_SORT_1=1, mask_SORT_26=3, mask_SORT_3=31, mask_SORT_7=7, state_16=0, state_19=0, state_45=0, state_47=0, state_49=0, state_52=0, state_55=0, state_57=0, state_59=0, state_61=0, state_63=0, state_65=0, state_9=0, var_125=7, var_130=6, var_14=-1, var_15=0, var_167=0, var_197=31, var_41=1, var_51=0, var_68=2, var_72=1, var_77=4, var_79=5, var_83=3, var_8=0, var_95=2] [L168] SORT_1 var_24 = var_24_arg_0 | var_24_arg_1; [L169] SORT_3 var_25_arg_0 = state_16; [L170] SORT_1 var_25 = var_25_arg_0 >> 2; [L171] SORT_3 var_27_arg_0 = state_19; [L172] SORT_26 var_27 = var_27_arg_0 >> 3; VAL [mask_SORT_108=15, mask_SORT_1=1, mask_SORT_26=3, mask_SORT_3=31, mask_SORT_7=7, state_16=0, state_19=0, state_45=0, state_47=0, state_49=0, state_52=0, state_55=0, state_57=0, state_59=0, state_61=0, state_63=0, state_65=0, state_9=0, var_125=7, var_130=6, var_14=-1, var_15=0, var_167=0, var_197=31, var_24=1, var_25=0, var_27=0, var_41=1, var_51=0, var_68=2, var_72=1, var_77=4, var_79=5, var_83=3, var_8=0, var_95=2] [L173] EXPR var_27 & mask_SORT_26 VAL [mask_SORT_108=15, mask_SORT_1=1, mask_SORT_26=3, mask_SORT_3=31, mask_SORT_7=7, state_16=0, state_19=0, state_45=0, state_47=0, state_49=0, state_52=0, state_55=0, state_57=0, state_59=0, state_61=0, state_63=0, state_65=0, state_9=0, var_125=7, var_130=6, var_14=-1, var_15=0, var_167=0, var_197=31, var_24=1, var_25=0, var_41=1, var_51=0, var_68=2, var_72=1, var_77=4, var_79=5, var_83=3, var_8=0, var_95=2] [L173] var_27 = var_27 & mask_SORT_26 [L174] SORT_3 var_28_arg_0 = state_16; [L175] SORT_26 var_28 = var_28_arg_0 >> 3; VAL [mask_SORT_108=15, mask_SORT_1=1, mask_SORT_26=3, mask_SORT_3=31, mask_SORT_7=7, state_16=0, state_19=0, state_45=0, state_47=0, state_49=0, state_52=0, state_55=0, state_57=0, state_59=0, state_61=0, state_63=0, state_65=0, state_9=0, var_125=7, var_130=6, var_14=-1, var_15=0, var_167=0, var_197=31, var_24=1, var_25=0, var_27=0, var_28=0, var_41=1, var_51=0, var_68=2, var_72=1, var_77=4, var_79=5, var_83=3, var_8=0, var_95=2] [L176] EXPR var_28 & mask_SORT_26 VAL [mask_SORT_108=15, mask_SORT_1=1, mask_SORT_26=3, mask_SORT_3=31, mask_SORT_7=7, state_16=0, state_19=0, state_45=0, state_47=0, state_49=0, state_52=0, state_55=0, state_57=0, state_59=0, state_61=0, state_63=0, state_65=0, state_9=0, var_125=7, var_130=6, var_14=-1, var_15=0, var_167=0, var_197=31, var_24=1, var_25=0, var_27=0, var_41=1, var_51=0, var_68=2, var_72=1, var_77=4, var_79=5, var_83=3, var_8=0, var_95=2] [L176] var_28 = var_28 & mask_SORT_26 [L177] SORT_26 var_29_arg_0 = var_27; [L178] SORT_26 var_29_arg_1 = var_28; [L179] SORT_1 var_29 = var_29_arg_0 == var_29_arg_1; [L180] SORT_1 var_30_arg_0 = var_25; [L181] SORT_1 var_30_arg_1 = var_29; VAL [mask_SORT_108=15, mask_SORT_1=1, mask_SORT_26=3, mask_SORT_3=31, mask_SORT_7=7, state_16=0, state_19=0, state_45=0, state_47=0, state_49=0, state_52=0, state_55=0, state_57=0, state_59=0, state_61=0, state_63=0, state_65=0, state_9=0, var_125=7, var_130=6, var_14=-1, var_15=0, var_167=0, var_197=31, var_24=1, var_30_arg_0=0, var_30_arg_1=1, var_41=1, var_51=0, var_68=2, var_72=1, var_77=4, var_79=5, var_83=3, var_8=0, var_95=2] [L182] EXPR var_30_arg_0 | var_30_arg_1 VAL [mask_SORT_108=15, mask_SORT_1=1, mask_SORT_26=3, mask_SORT_3=31, mask_SORT_7=7, state_16=0, state_19=0, state_45=0, state_47=0, state_49=0, state_52=0, state_55=0, state_57=0, state_59=0, state_61=0, state_63=0, state_65=0, state_9=0, var_125=7, var_130=6, var_14=-1, var_15=0, var_167=0, var_197=31, var_24=1, var_41=1, var_51=0, var_68=2, var_72=1, var_77=4, var_79=5, var_83=3, var_8=0, var_95=2] [L182] SORT_1 var_30 = var_30_arg_0 | var_30_arg_1; [L183] SORT_1 var_31_arg_0 = var_24; [L184] SORT_1 var_31_arg_1 = var_30; VAL [mask_SORT_108=15, mask_SORT_1=1, mask_SORT_26=3, mask_SORT_3=31, mask_SORT_7=7, state_16=0, state_19=0, state_45=0, state_47=0, state_49=0, state_52=0, state_55=0, state_57=0, state_59=0, state_61=0, state_63=0, state_65=0, state_9=0, var_125=7, var_130=6, var_14=-1, var_15=0, var_167=0, var_197=31, var_31_arg_0=1, var_31_arg_1=1, var_41=1, var_51=0, var_68=2, var_72=1, var_77=4, var_79=5, var_83=3, var_8=0, var_95=2] [L185] EXPR var_31_arg_0 & var_31_arg_1 VAL [mask_SORT_108=15, mask_SORT_1=1, mask_SORT_26=3, mask_SORT_3=31, mask_SORT_7=7, state_16=0, state_19=0, state_45=0, state_47=0, state_49=0, state_52=0, state_55=0, state_57=0, state_59=0, state_61=0, state_63=0, state_65=0, state_9=0, var_125=7, var_130=6, var_14=-1, var_15=0, var_167=0, var_197=31, var_41=1, var_51=0, var_68=2, var_72=1, var_77=4, var_79=5, var_83=3, var_8=0, var_95=2] [L185] SORT_1 var_31 = var_31_arg_0 & var_31_arg_1; [L186] SORT_3 var_32_arg_0 = state_16; [L187] SORT_1 var_32 = var_32_arg_0 >> 3; [L188] SORT_3 var_33_arg_0 = state_19; [L189] SORT_1 var_33 = var_33_arg_0 >> 4; VAL [mask_SORT_108=15, mask_SORT_1=1, mask_SORT_26=3, mask_SORT_3=31, mask_SORT_7=7, state_16=0, state_19=0, state_45=0, state_47=0, state_49=0, state_52=0, state_55=0, state_57=0, state_59=0, state_61=0, state_63=0, state_65=0, state_9=0, var_125=7, var_130=6, var_14=-1, var_15=0, var_167=0, var_197=31, var_31=1, var_32=0, var_33=0, var_41=1, var_51=0, var_68=2, var_72=1, var_77=4, var_79=5, var_83=3, var_8=0, var_95=2] [L190] EXPR var_33 & mask_SORT_1 VAL [mask_SORT_108=15, mask_SORT_1=1, mask_SORT_26=3, mask_SORT_3=31, mask_SORT_7=7, state_16=0, state_19=0, state_45=0, state_47=0, state_49=0, state_52=0, state_55=0, state_57=0, state_59=0, state_61=0, state_63=0, state_65=0, state_9=0, var_125=7, var_130=6, var_14=-1, var_15=0, var_167=0, var_197=31, var_31=1, var_32=0, var_41=1, var_51=0, var_68=2, var_72=1, var_77=4, var_79=5, var_83=3, var_8=0, var_95=2] [L190] var_33 = var_33 & mask_SORT_1 [L191] SORT_3 var_34_arg_0 = state_16; [L192] SORT_1 var_34 = var_34_arg_0 >> 4; VAL [mask_SORT_108=15, mask_SORT_1=1, mask_SORT_26=3, mask_SORT_3=31, mask_SORT_7=7, state_16=0, state_19=0, state_45=0, state_47=0, state_49=0, state_52=0, state_55=0, state_57=0, state_59=0, state_61=0, state_63=0, state_65=0, state_9=0, var_125=7, var_130=6, var_14=-1, var_15=0, var_167=0, var_197=31, var_31=1, var_32=0, var_33=0, var_34=0, var_41=1, var_51=0, var_68=2, var_72=1, var_77=4, var_79=5, var_83=3, var_8=0, var_95=2] [L193] EXPR var_34 & mask_SORT_1 VAL [mask_SORT_108=15, mask_SORT_1=1, mask_SORT_26=3, mask_SORT_3=31, mask_SORT_7=7, state_16=0, state_19=0, state_45=0, state_47=0, state_49=0, state_52=0, state_55=0, state_57=0, state_59=0, state_61=0, state_63=0, state_65=0, state_9=0, var_125=7, var_130=6, var_14=-1, var_15=0, var_167=0, var_197=31, var_31=1, var_32=0, var_33=0, var_41=1, var_51=0, var_68=2, var_72=1, var_77=4, var_79=5, var_83=3, var_8=0, var_95=2] [L193] var_34 = var_34 & mask_SORT_1 [L194] SORT_1 var_35_arg_0 = var_33; [L195] SORT_1 var_35_arg_1 = var_34; [L196] SORT_1 var_35 = var_35_arg_0 == var_35_arg_1; [L197] SORT_1 var_36_arg_0 = var_32; [L198] SORT_1 var_36_arg_1 = var_35; VAL [mask_SORT_108=15, mask_SORT_1=1, mask_SORT_26=3, mask_SORT_3=31, mask_SORT_7=7, state_16=0, state_19=0, state_45=0, state_47=0, state_49=0, state_52=0, state_55=0, state_57=0, state_59=0, state_61=0, state_63=0, state_65=0, state_9=0, var_125=7, var_130=6, var_14=-1, var_15=0, var_167=0, var_197=31, var_31=1, var_36_arg_0=0, var_36_arg_1=1, var_41=1, var_51=0, var_68=2, var_72=1, var_77=4, var_79=5, var_83=3, var_8=0, var_95=2] [L199] EXPR var_36_arg_0 | var_36_arg_1 VAL [mask_SORT_108=15, mask_SORT_1=1, mask_SORT_26=3, mask_SORT_3=31, mask_SORT_7=7, state_16=0, state_19=0, state_45=0, state_47=0, state_49=0, state_52=0, state_55=0, state_57=0, state_59=0, state_61=0, state_63=0, state_65=0, state_9=0, var_125=7, var_130=6, var_14=-1, var_15=0, var_167=0, var_197=31, var_31=1, var_41=1, var_51=0, var_68=2, var_72=1, var_77=4, var_79=5, var_83=3, var_8=0, var_95=2] [L199] SORT_1 var_36 = var_36_arg_0 | var_36_arg_1; [L200] SORT_1 var_37_arg_0 = var_31; [L201] SORT_1 var_37_arg_1 = var_36; VAL [mask_SORT_108=15, mask_SORT_1=1, mask_SORT_26=3, mask_SORT_3=31, mask_SORT_7=7, state_16=0, state_19=0, state_45=0, state_47=0, state_49=0, state_52=0, state_55=0, state_57=0, state_59=0, state_61=0, state_63=0, state_65=0, state_9=0, var_125=7, var_130=6, var_14=-1, var_15=0, var_167=0, var_197=31, var_37_arg_0=1, var_37_arg_1=1, var_41=1, var_51=0, var_68=2, var_72=1, var_77=4, var_79=5, var_83=3, var_8=0, var_95=2] [L202] EXPR var_37_arg_0 & var_37_arg_1 VAL [mask_SORT_108=15, mask_SORT_1=1, mask_SORT_26=3, mask_SORT_3=31, mask_SORT_7=7, state_16=0, state_19=0, state_45=0, state_47=0, state_49=0, state_52=0, state_55=0, state_57=0, state_59=0, state_61=0, state_63=0, state_65=0, state_9=0, var_125=7, var_130=6, var_14=-1, var_15=0, var_167=0, var_197=31, var_41=1, var_51=0, var_68=2, var_72=1, var_77=4, var_79=5, var_83=3, var_8=0, var_95=2] [L202] SORT_1 var_37 = var_37_arg_0 & var_37_arg_1; [L203] SORT_1 var_38_arg_0 = var_14; [L204] SORT_1 var_38_arg_1 = var_37; VAL [mask_SORT_108=15, mask_SORT_1=1, mask_SORT_26=3, mask_SORT_3=31, mask_SORT_7=7, state_16=0, state_19=0, state_45=0, state_47=0, state_49=0, state_52=0, state_55=0, state_57=0, state_59=0, state_61=0, state_63=0, state_65=0, state_9=0, var_125=7, var_130=6, var_15=0, var_167=0, var_197=31, var_38_arg_0=-1, var_38_arg_1=1, var_41=1, var_51=0, var_68=2, var_72=1, var_77=4, var_79=5, var_83=3, var_8=0, var_95=2] [L205] EXPR var_38_arg_0 | var_38_arg_1 VAL [mask_SORT_108=15, mask_SORT_1=1, mask_SORT_26=3, mask_SORT_3=31, mask_SORT_7=7, state_16=0, state_19=0, state_45=0, state_47=0, state_49=0, state_52=0, state_55=0, state_57=0, state_59=0, state_61=0, state_63=0, state_65=0, state_9=0, var_125=7, var_130=6, var_15=0, var_167=0, var_197=31, var_41=1, var_51=0, var_68=2, var_72=1, var_77=4, var_79=5, var_83=3, var_8=0, var_95=2] [L205] SORT_1 var_38 = var_38_arg_0 | var_38_arg_1; [L206] SORT_1 var_42_arg_0 = var_38; [L207] SORT_1 var_42 = ~var_42_arg_0; [L208] SORT_1 var_43_arg_0 = var_41; [L209] SORT_1 var_43_arg_1 = var_42; VAL [mask_SORT_108=15, mask_SORT_1=1, mask_SORT_26=3, mask_SORT_3=31, mask_SORT_7=7, state_16=0, state_19=0, state_45=0, state_47=0, state_49=0, state_52=0, state_55=0, state_57=0, state_59=0, state_61=0, state_63=0, state_65=0, state_9=0, var_125=7, var_130=6, var_15=0, var_167=0, var_197=31, var_41=1, var_43_arg_0=1, var_43_arg_1=-1, var_51=0, var_68=2, var_72=1, var_77=4, var_79=5, var_83=3, var_8=0, var_95=2] [L210] EXPR var_43_arg_0 & var_43_arg_1 VAL [mask_SORT_108=15, mask_SORT_1=1, mask_SORT_26=3, mask_SORT_3=31, mask_SORT_7=7, state_16=0, state_19=0, state_45=0, state_47=0, state_49=0, state_52=0, state_55=0, state_57=0, state_59=0, state_61=0, state_63=0, state_65=0, state_9=0, var_125=7, var_130=6, var_15=0, var_167=0, var_197=31, var_41=1, var_51=0, var_68=2, var_72=1, var_77=4, var_79=5, var_83=3, var_8=0, var_95=2] [L210] SORT_1 var_43 = var_43_arg_0 & var_43_arg_1; [L211] EXPR var_43 & mask_SORT_1 VAL [mask_SORT_108=15, mask_SORT_1=1, mask_SORT_26=3, mask_SORT_3=31, mask_SORT_7=7, state_16=0, state_19=0, state_45=0, state_47=0, state_49=0, state_52=0, state_55=0, state_57=0, state_59=0, state_61=0, state_63=0, state_65=0, state_9=0, var_125=7, var_130=6, var_15=0, var_167=0, var_197=31, var_41=1, var_51=0, var_68=2, var_72=1, var_77=4, var_79=5, var_83=3, var_8=0, var_95=2] [L211] var_43 = var_43 & mask_SORT_1 [L212] SORT_1 bad_44_arg_0 = var_43; [L213] CALL __VERIFIER_assert(!(bad_44_arg_0)) [L21] COND TRUE !(cond) [L21] reach_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 571 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 8.0s, OverallIterations: 9, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 4.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 5739 SdHoareTripleChecker+Valid, 3.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 5739 mSDsluCounter, 32230 SdHoareTripleChecker+Invalid, 3.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 26671 mSDsCounter, 13 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 7742 IncrementalHoareTripleChecker+Invalid, 7755 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 13 mSolverCounterUnsat, 5559 mSDtfsCounter, 7742 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 91 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 102 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=756occurred in iteration=8, InterpolantAutomatonStates: 60, 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, 8 MinimizatonAttempts, 588 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 2.6s InterpolantComputationTime, 580 NumberOfCodeBlocks, 580 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 504 ConstructedInterpolants, 0 QuantifiedInterpolants, 2040 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 8 InterpolantComputations, 8 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-03-03 18:33:17,536 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_arrays_vsaR_p12.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash d570de8a468b2e5d7e18a67170da2d8f06202ccdf10baa0799e3c0763140866e --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 18:33:19,374 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 18:33:19,458 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Bitvector.epf [2025-03-03 18:33:19,464 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 18:33:19,464 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 18:33:19,478 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 18:33:19,479 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 18:33:19,479 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 18:33:19,479 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 18:33:19,479 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 18:33:19,479 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 18:33:19,479 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 18:33:19,480 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 18:33:19,480 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 18:33:19,480 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 18:33:19,480 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 18:33:19,480 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 18:33:19,480 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 18:33:19,480 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 18:33:19,480 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 18:33:19,480 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 18:33:19,481 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-03 18:33:19,481 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-03 18:33:19,481 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-03 18:33:19,481 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 18:33:19,481 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 18:33:19,481 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 18:33:19,481 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 18:33:19,481 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 18:33:19,481 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 18:33:19,481 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 18:33:19,481 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 18:33:19,482 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 18:33:19,482 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 18:33:19,482 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 18:33:19,482 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 18:33:19,482 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-03 18:33:19,482 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-03 18:33:19,482 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 18:33:19,482 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 18:33:19,482 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 18:33:19,482 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 18:33:19,482 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> d570de8a468b2e5d7e18a67170da2d8f06202ccdf10baa0799e3c0763140866e [2025-03-03 18:33:19,735 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 18:33:19,743 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 18:33:19,745 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 18:33:19,748 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 18:33:19,748 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 18:33:19,749 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_arrays_vsaR_p12.c [2025-03-03 18:33:20,950 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a15a1d6e2/496d29543a9745f4a2493034a03d4a79/FLAG247394870 [2025-03-03 18:33:21,186 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 18:33:21,188 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_arrays_vsaR_p12.c [2025-03-03 18:33:21,201 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a15a1d6e2/496d29543a9745f4a2493034a03d4a79/FLAG247394870 [2025-03-03 18:33:21,509 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a15a1d6e2/496d29543a9745f4a2493034a03d4a79 [2025-03-03 18:33:21,510 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 18:33:21,511 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 18:33:21,512 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 18:33:21,512 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 18:33:21,515 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 18:33:21,516 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 06:33:21" (1/1) ... [2025-03-03 18:33:21,516 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@142b5dc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:33:21, skipping insertion in model container [2025-03-03 18:33:21,516 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 06:33:21" (1/1) ... [2025-03-03 18:33:21,544 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 18:33:21,679 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_arrays_vsaR_p12.c[1259,1272] [2025-03-03 18:33:21,849 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 18:33:21,859 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 18:33:21,866 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_arrays_vsaR_p12.c[1259,1272] [2025-03-03 18:33:21,939 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 18:33:21,967 INFO L204 MainTranslator]: Completed translation [2025-03-03 18:33:21,968 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:33:21 WrapperNode [2025-03-03 18:33:21,968 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 18:33:21,969 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 18:33:21,969 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 18:33:21,969 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 18:33:21,973 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:33:21" (1/1) ... [2025-03-03 18:33:21,993 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:33:21" (1/1) ... [2025-03-03 18:33:22,047 INFO L138 Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 1116 [2025-03-03 18:33:22,047 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 18:33:22,048 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 18:33:22,048 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 18:33:22,048 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 18:33:22,056 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:33:21" (1/1) ... [2025-03-03 18:33:22,057 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:33:21" (1/1) ... [2025-03-03 18:33:22,067 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:33:21" (1/1) ... [2025-03-03 18:33:22,097 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-03-03 18:33:22,102 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:33:21" (1/1) ... [2025-03-03 18:33:22,102 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:33:21" (1/1) ... [2025-03-03 18:33:22,117 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:33:21" (1/1) ... [2025-03-03 18:33:22,123 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:33:21" (1/1) ... [2025-03-03 18:33:22,126 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:33:21" (1/1) ... [2025-03-03 18:33:22,130 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:33:21" (1/1) ... [2025-03-03 18:33:22,136 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 18:33:22,139 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 18:33:22,140 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 18:33:22,140 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 18:33:22,140 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:33:21" (1/1) ... [2025-03-03 18:33:22,146 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 18:33:22,157 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 18:33:22,170 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-03 18:33:22,175 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-03 18:33:22,189 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 18:33:22,190 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-03 18:33:22,190 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 18:33:22,190 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 18:33:22,395 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 18:33:22,397 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 18:33:23,473 INFO L? ?]: Removed 106 outVars from TransFormulas that were not future-live. [2025-03-03 18:33:23,474 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 18:33:23,479 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 18:33:23,480 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 18:33:23,480 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 06:33:23 BoogieIcfgContainer [2025-03-03 18:33:23,481 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 18:33:23,483 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 18:33:23,483 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 18:33:23,487 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 18:33:23,487 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 06:33:21" (1/3) ... [2025-03-03 18:33:23,488 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2428c473 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 06:33:23, skipping insertion in model container [2025-03-03 18:33:23,488 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:33:21" (2/3) ... [2025-03-03 18:33:23,488 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2428c473 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 06:33:23, skipping insertion in model container [2025-03-03 18:33:23,488 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 06:33:23" (3/3) ... [2025-03-03 18:33:23,490 INFO L128 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.vis_arrays_vsaR_p12.c [2025-03-03 18:33:23,500 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 18:33:23,501 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG btor2c-lazyMod.vis_arrays_vsaR_p12.c that has 1 procedures, 10 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 18:33:23,536 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 18:33:23,544 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;@4c63584d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 18:33:23,545 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 18:33:23,549 INFO L276 IsEmpty]: Start isEmpty. Operand has 10 states, 8 states have (on average 1.375) internal successors, (11), 9 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:33:23,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2025-03-03 18:33:23,552 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 18:33:23,553 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2025-03-03 18:33:23,553 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 18:33:23,557 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 18:33:23,557 INFO L85 PathProgramCache]: Analyzing trace with hash 38140359, now seen corresponding path program 1 times [2025-03-03 18:33:23,564 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 18:33:23,564 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [4278584] [2025-03-03 18:33:23,564 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:33:23,564 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 18:33:23,565 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 18:33:23,566 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 18:33:23,568 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-03 18:33:23,777 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-03 18:33:23,803 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-03 18:33:23,803 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:33:23,803 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:33:23,806 INFO L256 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-03-03 18:33:23,815 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 18:33:23,962 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 18:33:23,963 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 18:33:23,964 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-03 18:33:23,964 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [4278584] [2025-03-03 18:33:23,964 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [4278584] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 18:33:23,964 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 18:33:23,965 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 18:33:23,966 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1197699554] [2025-03-03 18:33:23,966 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 18:33:23,968 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 18:33:23,968 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-03 18:33:23,981 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 18:33:23,983 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 18:33:23,984 INFO L87 Difference]: Start difference. First operand has 10 states, 8 states have (on average 1.375) internal successors, (11), 9 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 4 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:33:24,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 18:33:24,050 INFO L93 Difference]: Finished difference Result 18 states and 23 transitions. [2025-03-03 18:33:24,052 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 18:33:24,053 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2025-03-03 18:33:24,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 18:33:24,056 INFO L225 Difference]: With dead ends: 18 [2025-03-03 18:33:24,056 INFO L226 Difference]: Without dead ends: 10 [2025-03-03 18:33:24,059 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-03 18:33:24,060 INFO L435 NwaCegarLoop]: 4 mSDtfsCounter, 2 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 11 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 18:33:24,062 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 11 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 18:33:24,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2025-03-03 18:33:24,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 9. [2025-03-03 18:33:24,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 1.125) internal successors, (9), 8 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:33:24,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2025-03-03 18:33:24,082 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 5 [2025-03-03 18:33:24,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 18:33:24,082 INFO L471 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2025-03-03 18:33:24,082 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:33:24,082 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2025-03-03 18:33:24,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-03-03 18:33:24,083 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 18:33:24,083 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2025-03-03 18:33:24,090 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-03 18:33:24,283 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 18:33:24,284 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 18:33:24,286 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 18:33:24,286 INFO L85 PathProgramCache]: Analyzing trace with hash -1926026653, now seen corresponding path program 1 times [2025-03-03 18:33:24,287 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 18:33:24,287 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1335746421] [2025-03-03 18:33:24,287 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:33:24,288 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 18:33:24,288 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 18:33:24,289 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 18:33:24,290 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-03 18:33:24,553 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-03 18:33:24,603 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-03 18:33:24,603 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:33:24,603 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:33:24,613 INFO L256 TraceCheckSpWp]: Trace formula consists of 207 conjuncts, 59 conjuncts are in the unsatisfiable core [2025-03-03 18:33:24,624 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 18:33:24,967 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 18:33:24,968 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 18:33:39,687 WARN L249 Executor]: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) stderr output: (error "out of memory") [2025-03-03 18:33:39,688 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-03 18:33:39,688 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1335746421] [2025-03-03 18:33:39,689 WARN L320 FreeRefinementEngine]: Global settings require throwing the following exception [2025-03-03 18:33:39,693 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 101 [2025-03-03 18:33:39,698 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-03 18:33:39,893 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 18:33:39,894 FATAL L? ?]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:262) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parseCheckSatResult(Executor.java:281) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.checkSat(Scriptor.java:155) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.checkSat(WrapperScript.java:163) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.checkSat(WrapperScript.java:163) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.ManagedScript.checkSat(ManagedScript.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.MonolithicImplicationChecker.checkImplication(MonolithicImplicationChecker.java:85) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier$PredicateComparison.compare(PredicateUnifier.java:912) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier$PredicateComparison.(PredicateUnifier.java:786) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:374) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:323) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp$UnifyPostprocessor.postprocess(TraceCheckSpWp.java:555) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:416) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeBackwardSequence(IterativePredicateTransformer.java:395) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeWeakestPreconditionSequence(IterativePredicateTransformer.java:267) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:325) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:181) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:160) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:106) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.isCorrect(IpTcStrategyModuleBase.java:57) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.checkFeasibility(AutomatonFreeRefinementEngine.java:210) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:121) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:317) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:407) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:342) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:324) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:428) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:314) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:275) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:167) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:132) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) Caused by: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: EOF at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser$Action$.CUP$do_action(Parser.java:1518) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser.do_action(Parser.java:701) at com.github.jhoenicke.javacup.runtime.LRParser.parse(LRParser.java:383) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:258) ... 45 more [2025-03-03 18:33:39,897 INFO L158 Benchmark]: Toolchain (without parser) took 18386.00ms. Allocated memory was 83.9MB in the beginning and 494.9MB in the end (delta: 411.0MB). Free memory was 58.3MB in the beginning and 193.7MB in the end (delta: -135.4MB). Peak memory consumption was 280.0MB. Max. memory is 16.1GB. [2025-03-03 18:33:39,898 INFO L158 Benchmark]: CDTParser took 0.94ms. Allocated memory is still 83.9MB. Free memory was 62.3MB in the beginning and 62.3MB in the end (delta: 34.4kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 18:33:39,898 INFO L158 Benchmark]: CACSL2BoogieTranslator took 456.25ms. Allocated memory is still 83.9MB. Free memory was 58.3MB in the beginning and 54.4MB in the end (delta: 3.9MB). Peak memory consumption was 41.4MB. Max. memory is 16.1GB. [2025-03-03 18:33:39,900 INFO L158 Benchmark]: Boogie Procedure Inliner took 78.15ms. Allocated memory is still 83.9MB. Free memory was 54.4MB in the beginning and 45.9MB in the end (delta: 8.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-03 18:33:39,900 INFO L158 Benchmark]: Boogie Preprocessor took 88.36ms. Allocated memory is still 83.9MB. Free memory was 45.9MB in the beginning and 35.3MB in the end (delta: 10.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-03 18:33:39,902 INFO L158 Benchmark]: IcfgBuilder took 1341.28ms. Allocated memory was 83.9MB in the beginning and 209.7MB in the end (delta: 125.8MB). Free memory was 35.3MB in the beginning and 164.5MB in the end (delta: -129.1MB). Peak memory consumption was 64.8MB. Max. memory is 16.1GB. [2025-03-03 18:33:39,902 INFO L158 Benchmark]: TraceAbstraction took 16414.42ms. Allocated memory was 209.7MB in the beginning and 494.9MB in the end (delta: 285.2MB). Free memory was 164.5MB in the beginning and 193.7MB in the end (delta: -29.2MB). Peak memory consumption was 256.7MB. Max. memory is 16.1GB. [2025-03-03 18:33:39,903 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.94ms. Allocated memory is still 83.9MB. Free memory was 62.3MB in the beginning and 62.3MB in the end (delta: 34.4kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 456.25ms. Allocated memory is still 83.9MB. Free memory was 58.3MB in the beginning and 54.4MB in the end (delta: 3.9MB). Peak memory consumption was 41.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 78.15ms. Allocated memory is still 83.9MB. Free memory was 54.4MB in the beginning and 45.9MB in the end (delta: 8.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 88.36ms. Allocated memory is still 83.9MB. Free memory was 45.9MB in the beginning and 35.3MB in the end (delta: 10.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 1341.28ms. Allocated memory was 83.9MB in the beginning and 209.7MB in the end (delta: 125.8MB). Free memory was 35.3MB in the beginning and 164.5MB in the end (delta: -129.1MB). Peak memory consumption was 64.8MB. Max. memory is 16.1GB. * TraceAbstraction took 16414.42ms. Allocated memory was 209.7MB in the beginning and 494.9MB in the end (delta: 285.2MB). Free memory was 164.5MB in the beginning and 193.7MB in the end (delta: -29.2MB). Peak memory consumption was 256.7MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: SMTLIBException: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") : de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:262) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: SMTLIBException: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory")