./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_arrays_vsa16a_p3.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e2fb8bed 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_vsa16a_p3.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 7c314eef3d472fe4a1a0388d2c5f5a188709ac797267103fd11452d71371ead3 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 09:42:48,330 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 09:42:48,378 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2025-03-08 09:42:48,383 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 09:42:48,384 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 09:42:48,406 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 09:42:48,407 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 09:42:48,407 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 09:42:48,408 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 09:42:48,408 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 09:42:48,408 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 09:42:48,408 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 09:42:48,409 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 09:42:48,409 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 09:42:48,409 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 09:42:48,409 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 09:42:48,409 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 09:42:48,409 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 09:42:48,409 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 09:42:48,409 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 09:42:48,410 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 09:42:48,410 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 09:42:48,410 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 09:42:48,410 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 09:42:48,410 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 09:42:48,410 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 09:42:48,410 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 09:42:48,410 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 09:42:48,410 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 09:42:48,410 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 09:42:48,410 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 09:42:48,410 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 09:42:48,410 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 09:42:48,410 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 09:42:48,410 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 09:42:48,410 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 09:42:48,410 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 09:42:48,410 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 09:42:48,410 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 09:42:48,410 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 09:42:48,410 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 -> 7c314eef3d472fe4a1a0388d2c5f5a188709ac797267103fd11452d71371ead3 [2025-03-08 09:42:48,624 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 09:42:48,632 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 09:42:48,634 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 09:42:48,635 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 09:42:48,635 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 09:42:48,637 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_vsa16a_p3.c [2025-03-08 09:42:49,792 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f3975c9f1/a44c91a660654651bbefe478c4d829d4/FLAG578000ff9 [2025-03-08 09:42:50,052 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 09:42:50,053 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_arrays_vsa16a_p3.c [2025-03-08 09:42:50,065 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f3975c9f1/a44c91a660654651bbefe478c4d829d4/FLAG578000ff9 [2025-03-08 09:42:50,357 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f3975c9f1/a44c91a660654651bbefe478c4d829d4 [2025-03-08 09:42:50,360 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 09:42:50,361 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 09:42:50,362 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 09:42:50,362 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 09:42:50,366 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 09:42:50,366 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 09:42:50" (1/1) ... [2025-03-08 09:42:50,368 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@f3a095d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:42:50, skipping insertion in model container [2025-03-08 09:42:50,368 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 09:42:50" (1/1) ... [2025-03-08 09:42:50,378 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 09:42:50,478 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_vsa16a_p3.c[1260,1273] [2025-03-08 09:42:50,519 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 09:42:50,531 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 09:42:50,539 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_vsa16a_p3.c[1260,1273] [2025-03-08 09:42:50,552 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 09:42:50,563 INFO L204 MainTranslator]: Completed translation [2025-03-08 09:42:50,564 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:42:50 WrapperNode [2025-03-08 09:42:50,564 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 09:42:50,565 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 09:42:50,565 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 09:42:50,565 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 09:42:50,569 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:42:50" (1/1) ... [2025-03-08 09:42:50,575 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:42:50" (1/1) ... [2025-03-08 09:42:50,607 INFO L138 Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 180 [2025-03-08 09:42:50,608 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 09:42:50,608 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 09:42:50,609 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 09:42:50,609 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 09:42:50,614 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:42:50" (1/1) ... [2025-03-08 09:42:50,614 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:42:50" (1/1) ... [2025-03-08 09:42:50,617 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:42:50" (1/1) ... [2025-03-08 09:42:50,629 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-08 09:42:50,630 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:42:50" (1/1) ... [2025-03-08 09:42:50,630 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:42:50" (1/1) ... [2025-03-08 09:42:50,639 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:42:50" (1/1) ... [2025-03-08 09:42:50,642 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:42:50" (1/1) ... [2025-03-08 09:42:50,643 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:42:50" (1/1) ... [2025-03-08 09:42:50,644 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:42:50" (1/1) ... [2025-03-08 09:42:50,649 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 09:42:50,650 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 09:42:50,650 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 09:42:50,650 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 09:42:50,651 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:42:50" (1/1) ... [2025-03-08 09:42:50,658 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 09:42:50,667 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 09:42:50,678 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-08 09:42:50,683 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-08 09:42:50,702 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 09:42:50,702 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 09:42:50,702 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 09:42:50,702 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 09:42:50,764 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 09:42:50,765 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 09:42:50,978 INFO L? ?]: Removed 64 outVars from TransFormulas that were not future-live. [2025-03-08 09:42:50,978 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 09:42:51,000 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 09:42:51,001 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 09:42:51,001 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 09:42:51 BoogieIcfgContainer [2025-03-08 09:42:51,001 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 09:42:51,004 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 09:42:51,004 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 09:42:51,007 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 09:42:51,008 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 09:42:50" (1/3) ... [2025-03-08 09:42:51,008 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@a834fe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 09:42:51, skipping insertion in model container [2025-03-08 09:42:51,009 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:42:50" (2/3) ... [2025-03-08 09:42:51,009 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@a834fe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 09:42:51, skipping insertion in model container [2025-03-08 09:42:51,009 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 09:42:51" (3/3) ... [2025-03-08 09:42:51,010 INFO L128 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.vis_arrays_vsa16a_p3.c [2025-03-08 09:42:51,020 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 09:42:51,022 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG btor2c-lazyMod.vis_arrays_vsa16a_p3.c that has 1 procedures, 34 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-08 09:42:51,058 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 09:42:51,068 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;@398917ab, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 09:42:51,069 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 09:42:51,072 INFO L276 IsEmpty]: Start isEmpty. Operand has 34 states, 32 states have (on average 1.46875) internal successors, (47), 33 states have internal predecessors, (47), 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-08 09:42:51,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-03-08 09:42:51,076 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 09:42:51,076 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 09:42:51,077 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 09:42:51,080 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 09:42:51,080 INFO L85 PathProgramCache]: Analyzing trace with hash -562094457, now seen corresponding path program 1 times [2025-03-08 09:42:51,085 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 09:42:51,085 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1854020151] [2025-03-08 09:42:51,085 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 09:42:51,086 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 09:42:51,144 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-08 09:42:51,184 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-08 09:42:51,184 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 09:42:51,185 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 09:42:51,437 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-08 09:42:51,438 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 09:42:51,438 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1854020151] [2025-03-08 09:42:51,438 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1854020151] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 09:42:51,438 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 09:42:51,439 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 09:42:51,439 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1074863733] [2025-03-08 09:42:51,440 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 09:42:51,442 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 09:42:51,442 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 09:42:51,456 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 09:42:51,457 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 09:42:51,458 INFO L87 Difference]: Start difference. First operand has 34 states, 32 states have (on average 1.46875) internal successors, (47), 33 states have internal predecessors, (47), 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 3.75) internal successors, (15), 4 states have internal predecessors, (15), 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-08 09:42:51,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 09:42:51,502 INFO L93 Difference]: Finished difference Result 61 states and 87 transitions. [2025-03-08 09:42:51,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 09:42:51,504 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 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 15 [2025-03-08 09:42:51,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 09:42:51,508 INFO L225 Difference]: With dead ends: 61 [2025-03-08 09:42:51,509 INFO L226 Difference]: Without dead ends: 33 [2025-03-08 09:42:51,510 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-08 09:42:51,512 INFO L435 NwaCegarLoop]: 35 mSDtfsCounter, 0 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 100 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 09:42:51,513 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 100 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 09:42:51,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2025-03-08 09:42:51,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2025-03-08 09:42:51,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 32 states have (on average 1.40625) internal successors, (45), 32 states have internal predecessors, (45), 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-08 09:42:51,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 45 transitions. [2025-03-08 09:42:51,532 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 45 transitions. Word has length 15 [2025-03-08 09:42:51,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 09:42:51,532 INFO L471 AbstractCegarLoop]: Abstraction has 33 states and 45 transitions. [2025-03-08 09:42:51,532 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 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-08 09:42:51,532 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 45 transitions. [2025-03-08 09:42:51,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-03-08 09:42:51,533 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 09:42:51,533 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 09:42:51,533 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-08 09:42:51,533 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 09:42:51,533 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 09:42:51,534 INFO L85 PathProgramCache]: Analyzing trace with hash -240379831, now seen corresponding path program 1 times [2025-03-08 09:42:51,534 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 09:42:51,534 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1686816241] [2025-03-08 09:42:51,534 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 09:42:51,534 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 09:42:51,543 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-08 09:42:51,551 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-08 09:42:51,552 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 09:42:51,552 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 09:42:51,657 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-08 09:42:51,658 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 09:42:51,658 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1686816241] [2025-03-08 09:42:51,658 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1686816241] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 09:42:51,658 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 09:42:51,659 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 09:42:51,659 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1786698045] [2025-03-08 09:42:51,659 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 09:42:51,659 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 09:42:51,659 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 09:42:51,660 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 09:42:51,661 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 09:42:51,661 INFO L87 Difference]: Start difference. First operand 33 states and 45 transitions. Second operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 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-08 09:42:51,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 09:42:51,698 INFO L93 Difference]: Finished difference Result 62 states and 85 transitions. [2025-03-08 09:42:51,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 09:42:51,699 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 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 16 [2025-03-08 09:42:51,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 09:42:51,700 INFO L225 Difference]: With dead ends: 62 [2025-03-08 09:42:51,700 INFO L226 Difference]: Without dead ends: 35 [2025-03-08 09:42:51,700 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-08 09:42:51,701 INFO L435 NwaCegarLoop]: 35 mSDtfsCounter, 0 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 97 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 09:42:51,701 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 97 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 09:42:51,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2025-03-08 09:42:51,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2025-03-08 09:42:51,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 34 states have (on average 1.3823529411764706) internal successors, (47), 34 states have internal predecessors, (47), 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-08 09:42:51,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 47 transitions. [2025-03-08 09:42:51,704 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 47 transitions. Word has length 16 [2025-03-08 09:42:51,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 09:42:51,704 INFO L471 AbstractCegarLoop]: Abstraction has 35 states and 47 transitions. [2025-03-08 09:42:51,704 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 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-08 09:42:51,704 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 47 transitions. [2025-03-08 09:42:51,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2025-03-08 09:42:51,705 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 09:42:51,705 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 09:42:51,705 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 09:42:51,705 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 09:42:51,706 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 09:42:51,706 INFO L85 PathProgramCache]: Analyzing trace with hash -1225298238, now seen corresponding path program 1 times [2025-03-08 09:42:51,706 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 09:42:51,706 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1977620529] [2025-03-08 09:42:51,706 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 09:42:51,706 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 09:42:51,717 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-08 09:42:51,735 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-08 09:42:51,735 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 09:42:51,735 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 09:42:51,923 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-08 09:42:51,923 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 09:42:51,923 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1977620529] [2025-03-08 09:42:51,923 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1977620529] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 09:42:51,923 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 09:42:51,923 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 09:42:51,923 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1549350737] [2025-03-08 09:42:51,924 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 09:42:51,924 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 09:42:51,924 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 09:42:51,924 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 09:42:51,924 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-08 09:42:51,924 INFO L87 Difference]: Start difference. First operand 35 states and 47 transitions. Second operand has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 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-08 09:42:52,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 09:42:52,003 INFO L93 Difference]: Finished difference Result 68 states and 92 transitions. [2025-03-08 09:42:52,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 09:42:52,004 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 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 17 [2025-03-08 09:42:52,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 09:42:52,004 INFO L225 Difference]: With dead ends: 68 [2025-03-08 09:42:52,004 INFO L226 Difference]: Without dead ends: 39 [2025-03-08 09:42:52,005 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-08 09:42:52,005 INFO L435 NwaCegarLoop]: 30 mSDtfsCounter, 40 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 113 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 09:42:52,005 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 113 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 09:42:52,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2025-03-08 09:42:52,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 38. [2025-03-08 09:42:52,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 37 states have (on average 1.3513513513513513) internal successors, (50), 37 states have internal predecessors, (50), 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-08 09:42:52,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 50 transitions. [2025-03-08 09:42:52,011 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 50 transitions. Word has length 17 [2025-03-08 09:42:52,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 09:42:52,012 INFO L471 AbstractCegarLoop]: Abstraction has 38 states and 50 transitions. [2025-03-08 09:42:52,012 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 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-08 09:42:52,012 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 50 transitions. [2025-03-08 09:42:52,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-03-08 09:42:52,013 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 09:42:52,013 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 09:42:52,013 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 09:42:52,013 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 09:42:52,014 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 09:42:52,015 INFO L85 PathProgramCache]: Analyzing trace with hash -1736144498, now seen corresponding path program 1 times [2025-03-08 09:42:52,015 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 09:42:52,015 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1182813050] [2025-03-08 09:42:52,015 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 09:42:52,016 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 09:42:52,025 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-08 09:42:52,044 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-08 09:42:52,044 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 09:42:52,044 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 09:42:52,259 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-08 09:42:52,260 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 09:42:52,260 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1182813050] [2025-03-08 09:42:52,260 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1182813050] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 09:42:52,260 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 09:42:52,260 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 09:42:52,260 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [746850499] [2025-03-08 09:42:52,261 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 09:42:52,261 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-08 09:42:52,261 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 09:42:52,261 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-08 09:42:52,262 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-08 09:42:52,262 INFO L87 Difference]: Start difference. First operand 38 states and 50 transitions. Second operand has 8 states, 8 states have (on average 2.25) internal successors, (18), 8 states have internal predecessors, (18), 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-08 09:42:52,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 09:42:52,401 INFO L93 Difference]: Finished difference Result 99 states and 130 transitions. [2025-03-08 09:42:52,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-08 09:42:52,401 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.25) internal successors, (18), 8 states have internal predecessors, (18), 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 18 [2025-03-08 09:42:52,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 09:42:52,402 INFO L225 Difference]: With dead ends: 99 [2025-03-08 09:42:52,402 INFO L226 Difference]: Without dead ends: 65 [2025-03-08 09:42:52,402 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2025-03-08 09:42:52,403 INFO L435 NwaCegarLoop]: 28 mSDtfsCounter, 106 mSDsluCounter, 135 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 163 SdHoareTripleChecker+Invalid, 96 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 95 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 09:42:52,403 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [106 Valid, 163 Invalid, 96 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 09:42:52,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2025-03-08 09:42:52,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 47. [2025-03-08 09:42:52,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 46 states have (on average 1.3478260869565217) internal successors, (62), 46 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-08 09:42:52,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 62 transitions. [2025-03-08 09:42:52,411 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 62 transitions. Word has length 18 [2025-03-08 09:42:52,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 09:42:52,412 INFO L471 AbstractCegarLoop]: Abstraction has 47 states and 62 transitions. [2025-03-08 09:42:52,412 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.25) internal successors, (18), 8 states have internal predecessors, (18), 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-08 09:42:52,412 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 62 transitions. [2025-03-08 09:42:52,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-03-08 09:42:52,413 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 09:42:52,413 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 09:42:52,413 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-08 09:42:52,413 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 09:42:52,414 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 09:42:52,415 INFO L85 PathProgramCache]: Analyzing trace with hash -1711444281, now seen corresponding path program 1 times [2025-03-08 09:42:52,415 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 09:42:52,415 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2054311947] [2025-03-08 09:42:52,415 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 09:42:52,415 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 09:42:52,423 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-08 09:42:52,441 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-08 09:42:52,442 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 09:42:52,443 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 09:42:52,798 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-08 09:42:52,799 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 09:42:52,799 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2054311947] [2025-03-08 09:42:52,799 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2054311947] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 09:42:52,799 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 09:42:52,799 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 09:42:52,799 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1991127400] [2025-03-08 09:42:52,799 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 09:42:52,799 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-08 09:42:52,799 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 09:42:52,800 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-08 09:42:52,800 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-08 09:42:52,800 INFO L87 Difference]: Start difference. First operand 47 states and 62 transitions. Second operand has 8 states, 8 states have (on average 2.375) internal successors, (19), 8 states have internal predecessors, (19), 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-08 09:42:52,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 09:42:52,953 INFO L93 Difference]: Finished difference Result 97 states and 126 transitions. [2025-03-08 09:42:52,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-08 09:42:52,954 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.375) internal successors, (19), 8 states have internal predecessors, (19), 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 19 [2025-03-08 09:42:52,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 09:42:52,954 INFO L225 Difference]: With dead ends: 97 [2025-03-08 09:42:52,955 INFO L226 Difference]: Without dead ends: 65 [2025-03-08 09:42:52,955 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2025-03-08 09:42:52,956 INFO L435 NwaCegarLoop]: 26 mSDtfsCounter, 98 mSDsluCounter, 126 mSDsCounter, 0 mSdLazyCounter, 106 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 152 SdHoareTripleChecker+Invalid, 107 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 106 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 09:42:52,956 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [98 Valid, 152 Invalid, 107 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 106 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 09:42:52,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2025-03-08 09:42:52,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 50. [2025-03-08 09:42:52,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 49 states have (on average 1.346938775510204) internal successors, (66), 49 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-08 09:42:52,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 66 transitions. [2025-03-08 09:42:52,961 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 66 transitions. Word has length 19 [2025-03-08 09:42:52,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 09:42:52,961 INFO L471 AbstractCegarLoop]: Abstraction has 50 states and 66 transitions. [2025-03-08 09:42:52,961 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.375) internal successors, (19), 8 states have internal predecessors, (19), 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-08 09:42:52,961 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 66 transitions. [2025-03-08 09:42:52,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-03-08 09:42:52,961 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 09:42:52,961 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 09:42:52,963 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-08 09:42:52,963 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 09:42:52,964 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 09:42:52,964 INFO L85 PathProgramCache]: Analyzing trace with hash -2071418839, now seen corresponding path program 1 times [2025-03-08 09:42:52,964 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 09:42:52,964 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1307481374] [2025-03-08 09:42:52,964 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 09:42:52,965 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 09:42:52,971 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-08 09:42:52,990 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-08 09:42:52,991 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 09:42:52,991 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-08 09:42:52,991 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-08 09:42:52,994 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-08 09:42:53,007 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-08 09:42:53,007 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 09:42:53,008 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-08 09:42:53,022 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-08 09:42:53,023 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-08 09:42:53,023 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-08 09:42:53,025 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-08 09:42:53,026 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2025-03-08 09:42:53,043 WARN L310 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2025-03-08 09:42:53,047 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-08 09:42:53,049 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.03 09:42:53 BoogieIcfgContainer [2025-03-08 09:42:53,049 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-08 09:42:53,049 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-08 09:42:53,050 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-08 09:42:53,050 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-08 09:42:53,050 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 09:42:51" (3/4) ... [2025-03-08 09:42:53,052 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-08 09:42:53,052 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-08 09:42:53,054 INFO L158 Benchmark]: Toolchain (without parser) took 2691.49ms. Allocated memory is still 167.8MB. Free memory was 123.2MB in the beginning and 54.4MB in the end (delta: 68.8MB). Peak memory consumption was 69.1MB. Max. memory is 16.1GB. [2025-03-08 09:42:53,054 INFO L158 Benchmark]: CDTParser took 0.46ms. Allocated memory is still 201.3MB. Free memory is still 116.8MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 09:42:53,054 INFO L158 Benchmark]: CACSL2BoogieTranslator took 202.17ms. Allocated memory is still 167.8MB. Free memory was 123.2MB in the beginning and 110.4MB in the end (delta: 12.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-08 09:42:53,055 INFO L158 Benchmark]: Boogie Procedure Inliner took 43.15ms. Allocated memory is still 167.8MB. Free memory was 110.4MB in the beginning and 106.5MB in the end (delta: 3.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-08 09:42:53,055 INFO L158 Benchmark]: Boogie Preprocessor took 41.08ms. Allocated memory is still 167.8MB. Free memory was 106.5MB in the beginning and 105.0MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 09:42:53,056 INFO L158 Benchmark]: IcfgBuilder took 350.98ms. Allocated memory is still 167.8MB. Free memory was 104.3MB in the beginning and 82.1MB in the end (delta: 22.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-03-08 09:42:53,056 INFO L158 Benchmark]: TraceAbstraction took 2044.77ms. Allocated memory is still 167.8MB. Free memory was 81.4MB in the beginning and 54.4MB in the end (delta: 26.9MB). Peak memory consumption was 27.1MB. Max. memory is 16.1GB. [2025-03-08 09:42:53,056 INFO L158 Benchmark]: Witness Printer took 2.72ms. Allocated memory is still 167.8MB. Free memory was 54.4MB in the beginning and 54.4MB in the end (delta: 33.1kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 09:42:53,057 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.46ms. Allocated memory is still 201.3MB. Free memory is still 116.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 202.17ms. Allocated memory is still 167.8MB. Free memory was 123.2MB in the beginning and 110.4MB in the end (delta: 12.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 43.15ms. Allocated memory is still 167.8MB. Free memory was 110.4MB in the beginning and 106.5MB in the end (delta: 3.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 41.08ms. Allocated memory is still 167.8MB. Free memory was 106.5MB in the beginning and 105.0MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 350.98ms. Allocated memory is still 167.8MB. Free memory was 104.3MB in the beginning and 82.1MB in the end (delta: 22.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 2044.77ms. Allocated memory is still 167.8MB. Free memory was 81.4MB in the beginning and 54.4MB in the end (delta: 26.9MB). Peak memory consumption was 27.1MB. Max. memory is 16.1GB. * Witness Printer took 2.72ms. Allocated memory is still 167.8MB. Free memory was 54.4MB in the beginning and 54.4MB in the end (delta: 33.1kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 21]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of bitwiseOr at line 98, overapproximation of bitwiseAnd at line 103. Possible FailurePath: [L26] const SORT_1 mask_SORT_1 = (SORT_1)-1 >> (sizeof(SORT_1) * 8 - 1); [L27] const SORT_1 msb_SORT_1 = (SORT_1)1 << (1 - 1); [L29] const SORT_3 mask_SORT_3 = (SORT_3)-1 >> (sizeof(SORT_3) * 8 - 16); [L30] const SORT_3 msb_SORT_3 = (SORT_3)1 << (16 - 1); [L32] const SORT_6 mask_SORT_6 = (SORT_6)-1 >> (sizeof(SORT_6) * 8 - 3); [L33] const SORT_6 msb_SORT_6 = (SORT_6)1 << (3 - 1); [L35] const SORT_12 mask_SORT_12 = (SORT_12)-1 >> (sizeof(SORT_12) * 8 - 2); [L36] const SORT_12 msb_SORT_12 = (SORT_12)1 << (2 - 1); [L38] const SORT_35 mask_SORT_35 = (SORT_35)-1 >> (sizeof(SORT_35) * 8 - 12); [L39] const SORT_35 msb_SORT_35 = (SORT_35)1 << (12 - 1); [L41] const SORT_6 var_7 = 0; [L42] const SORT_12 var_14 = 0; [L43] const SORT_1 var_19 = 1; [L44] const SORT_6 var_49 = 1; [L45] const SORT_6 var_51 = 4; [L47] SORT_1 input_2; [L48] SORT_3 input_4; [L49] SORT_3 input_5; [L50] SORT_3 input_23; [L51] SORT_3 input_25; [L52] SORT_3 input_27; [L53] SORT_1 input_29; [L54] SORT_3 input_31; [L55] SORT_3 input_33; [L56] SORT_35 input_36; [L57] SORT_35 input_38; [L58] SORT_3 input_40; [L59] SORT_3 input_42; [L60] SORT_3 input_44; [L61] SORT_3 input_46; [L63] EXPR __VERIFIER_nondet_uchar() & mask_SORT_6 VAL [mask_SORT_12=3, mask_SORT_1=1, mask_SORT_6=7, var_14=0, var_19=1, var_49=1, var_51=4, var_7=0] [L63] SORT_6 state_8 = __VERIFIER_nondet_uchar() & mask_SORT_6; [L65] SORT_6 init_9_arg_1 = var_7; [L66] state_8 = init_9_arg_1 VAL [mask_SORT_12=3, mask_SORT_1=1, mask_SORT_6=7, state_8=0, var_14=0, var_19=1, var_49=1, var_51=4, var_7=0] [L69] input_2 = __VERIFIER_nondet_uchar() [L70] input_4 = __VERIFIER_nondet_ushort() [L71] input_5 = __VERIFIER_nondet_ushort() [L72] input_23 = __VERIFIER_nondet_ushort() [L73] input_25 = __VERIFIER_nondet_ushort() [L74] input_27 = __VERIFIER_nondet_ushort() [L75] input_29 = __VERIFIER_nondet_uchar() [L76] input_31 = __VERIFIER_nondet_ushort() [L77] input_33 = __VERIFIER_nondet_ushort() [L78] input_36 = __VERIFIER_nondet_ushort() [L79] input_38 = __VERIFIER_nondet_ushort() [L80] input_40 = __VERIFIER_nondet_ushort() [L81] input_42 = __VERIFIER_nondet_ushort() [L82] input_44 = __VERIFIER_nondet_ushort() [L83] input_46 = __VERIFIER_nondet_ushort() [L86] SORT_6 var_10_arg_0 = state_8; [L87] SORT_1 var_10 = var_10_arg_0 >> 2; [L88] SORT_1 var_11_arg_0 = var_10; [L89] SORT_1 var_11 = ~var_11_arg_0; [L90] SORT_6 var_13_arg_0 = state_8; [L91] SORT_12 var_13 = var_13_arg_0 >> 0; VAL [mask_SORT_12=3, mask_SORT_1=1, mask_SORT_6=7, state_8=0, var_11=-1, var_13=0, var_14=0, var_19=1, var_49=1, var_51=4, var_7=0] [L92] EXPR var_13 & mask_SORT_12 VAL [mask_SORT_12=3, mask_SORT_1=1, mask_SORT_6=7, state_8=0, var_11=-1, var_14=0, var_19=1, var_49=1, var_51=4, var_7=0] [L92] var_13 = var_13 & mask_SORT_12 [L93] SORT_12 var_15_arg_0 = var_13; [L94] SORT_12 var_15_arg_1 = var_14; [L95] SORT_1 var_15 = var_15_arg_0 == var_15_arg_1; [L96] SORT_1 var_16_arg_0 = var_11; [L97] SORT_1 var_16_arg_1 = var_15; VAL [mask_SORT_12=3, mask_SORT_1=1, mask_SORT_6=7, state_8=0, var_14=0, var_16_arg_0=-1, var_16_arg_1=1, var_19=1, var_49=1, var_51=4, var_7=0] [L98] EXPR var_16_arg_0 | var_16_arg_1 VAL [mask_SORT_12=3, mask_SORT_1=1, mask_SORT_6=7, state_8=0, var_14=0, var_19=1, var_49=1, var_51=4, var_7=0] [L98] SORT_1 var_16 = var_16_arg_0 | var_16_arg_1; [L99] SORT_1 var_20_arg_0 = var_16; [L100] SORT_1 var_20 = ~var_20_arg_0; [L101] SORT_1 var_21_arg_0 = var_19; [L102] SORT_1 var_21_arg_1 = var_20; VAL [mask_SORT_12=3, mask_SORT_1=1, mask_SORT_6=7, state_8=0, var_14=0, var_19=1, var_21_arg_0=1, var_21_arg_1=-1, var_49=1, var_51=4, var_7=0] [L103] EXPR var_21_arg_0 & var_21_arg_1 VAL [mask_SORT_12=3, mask_SORT_1=1, mask_SORT_6=7, state_8=0, var_14=0, var_19=1, var_49=1, var_51=4, var_7=0] [L103] SORT_1 var_21 = var_21_arg_0 & var_21_arg_1; [L104] EXPR var_21 & mask_SORT_1 VAL [mask_SORT_12=3, mask_SORT_1=1, mask_SORT_6=7, state_8=0, var_14=0, var_19=1, var_49=1, var_51=4, var_7=0] [L104] var_21 = var_21 & mask_SORT_1 [L105] SORT_1 bad_22_arg_0 = var_21; [L106] CALL __VERIFIER_assert(!(bad_22_arg_0)) [L21] COND TRUE !(cond) [L21] reach_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 34 locations, 47 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 2.0s, OverallIterations: 6, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 244 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 244 mSDsluCounter, 625 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 471 mSDsCounter, 3 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 316 IncrementalHoareTripleChecker+Invalid, 319 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 3 mSolverCounterUnsat, 154 mSDtfsCounter, 316 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 45 GetRequests, 13 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=50occurred in iteration=5, InterpolantAutomatonStates: 30, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 5 MinimizatonAttempts, 34 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 105 NumberOfCodeBlocks, 105 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 80 ConstructedInterpolants, 0 QuantifiedInterpolants, 379 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 5 InterpolantComputations, 5 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2025-03-08 09:42:53,072 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_vsa16a_p3.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 7c314eef3d472fe4a1a0388d2c5f5a188709ac797267103fd11452d71371ead3 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 09:42:54,927 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 09:42:55,035 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Bitvector.epf [2025-03-08 09:42:55,040 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 09:42:55,040 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 09:42:55,063 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 09:42:55,065 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 09:42:55,065 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 09:42:55,065 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 09:42:55,066 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 09:42:55,066 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 09:42:55,067 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 09:42:55,067 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 09:42:55,067 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 09:42:55,067 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 09:42:55,067 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 09:42:55,067 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 09:42:55,067 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 09:42:55,067 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 09:42:55,068 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 09:42:55,068 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 09:42:55,068 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-08 09:42:55,068 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-08 09:42:55,068 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-08 09:42:55,068 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 09:42:55,068 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 09:42:55,068 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 09:42:55,069 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 09:42:55,069 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 09:42:55,069 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 09:42:55,069 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 09:42:55,069 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 09:42:55,069 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 09:42:55,070 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 09:42:55,070 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 09:42:55,070 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 09:42:55,070 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-08 09:42:55,070 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-08 09:42:55,070 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 09:42:55,070 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 09:42:55,070 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 09:42:55,070 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 09:42:55,070 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 -> 7c314eef3d472fe4a1a0388d2c5f5a188709ac797267103fd11452d71371ead3 [2025-03-08 09:42:55,316 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 09:42:55,327 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 09:42:55,329 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 09:42:55,330 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 09:42:55,330 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 09:42:55,331 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_vsa16a_p3.c [2025-03-08 09:42:56,470 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2ab9a2d28/a87c391246f94c12a1835fce5d4ba4f5/FLAG76926c826 [2025-03-08 09:42:56,649 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 09:42:56,650 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_arrays_vsa16a_p3.c [2025-03-08 09:42:56,655 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2ab9a2d28/a87c391246f94c12a1835fce5d4ba4f5/FLAG76926c826 [2025-03-08 09:42:57,047 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2ab9a2d28/a87c391246f94c12a1835fce5d4ba4f5 [2025-03-08 09:42:57,049 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 09:42:57,050 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 09:42:57,052 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 09:42:57,052 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 09:42:57,055 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 09:42:57,056 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 09:42:57" (1/1) ... [2025-03-08 09:42:57,056 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6df1aeca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:42:57, skipping insertion in model container [2025-03-08 09:42:57,056 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 09:42:57" (1/1) ... [2025-03-08 09:42:57,069 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 09:42:57,155 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_vsa16a_p3.c[1260,1273] [2025-03-08 09:42:57,187 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 09:42:57,193 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 09:42:57,200 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_vsa16a_p3.c[1260,1273] [2025-03-08 09:42:57,215 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 09:42:57,226 INFO L204 MainTranslator]: Completed translation [2025-03-08 09:42:57,227 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:42:57 WrapperNode [2025-03-08 09:42:57,227 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 09:42:57,228 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 09:42:57,228 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 09:42:57,228 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 09:42:57,233 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:42:57" (1/1) ... [2025-03-08 09:42:57,240 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:42:57" (1/1) ... [2025-03-08 09:42:57,256 INFO L138 Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 132 [2025-03-08 09:42:57,258 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 09:42:57,259 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 09:42:57,259 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 09:42:57,260 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 09:42:57,265 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:42:57" (1/1) ... [2025-03-08 09:42:57,266 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:42:57" (1/1) ... [2025-03-08 09:42:57,273 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:42:57" (1/1) ... [2025-03-08 09:42:57,286 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-08 09:42:57,290 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:42:57" (1/1) ... [2025-03-08 09:42:57,291 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:42:57" (1/1) ... [2025-03-08 09:42:57,294 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:42:57" (1/1) ... [2025-03-08 09:42:57,299 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:42:57" (1/1) ... [2025-03-08 09:42:57,300 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:42:57" (1/1) ... [2025-03-08 09:42:57,300 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:42:57" (1/1) ... [2025-03-08 09:42:57,302 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 09:42:57,302 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 09:42:57,302 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 09:42:57,302 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 09:42:57,303 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:42:57" (1/1) ... [2025-03-08 09:42:57,309 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 09:42:57,320 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 09:42:57,331 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-08 09:42:57,334 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-08 09:42:57,354 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 09:42:57,354 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-08 09:42:57,355 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 09:42:57,355 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 09:42:57,426 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 09:42:57,428 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 09:42:57,572 INFO L? ?]: Removed 31 outVars from TransFormulas that were not future-live. [2025-03-08 09:42:57,572 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 09:42:57,580 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 09:42:57,580 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 09:42:57,580 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 09:42:57 BoogieIcfgContainer [2025-03-08 09:42:57,580 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 09:42:57,582 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 09:42:57,582 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 09:42:57,585 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 09:42:57,585 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 09:42:57" (1/3) ... [2025-03-08 09:42:57,586 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6a461569 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 09:42:57, skipping insertion in model container [2025-03-08 09:42:57,586 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:42:57" (2/3) ... [2025-03-08 09:42:57,586 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6a461569 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 09:42:57, skipping insertion in model container [2025-03-08 09:42:57,586 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 09:42:57" (3/3) ... [2025-03-08 09:42:57,587 INFO L128 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.vis_arrays_vsa16a_p3.c [2025-03-08 09:42:57,596 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 09:42:57,598 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG btor2c-lazyMod.vis_arrays_vsa16a_p3.c that has 1 procedures, 10 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-08 09:42:57,631 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 09:42:57,641 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;@327f64c4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 09:42:57,641 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 09:42:57,643 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-08 09:42:57,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2025-03-08 09:42:57,648 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 09:42:57,649 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2025-03-08 09:42:57,649 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 09:42:57,654 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 09:42:57,655 INFO L85 PathProgramCache]: Analyzing trace with hash 38140359, now seen corresponding path program 1 times [2025-03-08 09:42:57,661 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 09:42:57,662 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [844941303] [2025-03-08 09:42:57,663 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 09:42:57,663 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 09:42:57,663 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 09:42:57,666 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-08 09:42:57,667 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-08 09:42:57,750 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-08 09:42:57,761 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-08 09:42:57,762 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 09:42:57,762 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 09:42:57,764 INFO L256 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-03-08 09:42:57,772 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 09:42:57,942 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-08 09:42:57,942 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 09:42:57,944 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 09:42:57,944 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [844941303] [2025-03-08 09:42:57,944 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [844941303] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 09:42:57,944 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 09:42:57,945 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 09:42:57,946 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2077909401] [2025-03-08 09:42:57,946 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 09:42:57,949 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 09:42:57,949 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 09:42:57,966 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 09:42:57,967 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 09:42:57,969 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-08 09:42:58,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 09:42:58,010 INFO L93 Difference]: Finished difference Result 18 states and 23 transitions. [2025-03-08 09:42:58,012 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 09:42:58,013 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-08 09:42:58,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 09:42:58,019 INFO L225 Difference]: With dead ends: 18 [2025-03-08 09:42:58,019 INFO L226 Difference]: Without dead ends: 10 [2025-03-08 09:42:58,021 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-08 09:42:58,023 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-08 09:42:58,024 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-08 09:42:58,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2025-03-08 09:42:58,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 9. [2025-03-08 09:42:58,040 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-08 09:42:58,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2025-03-08 09:42:58,045 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 5 [2025-03-08 09:42:58,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 09:42:58,045 INFO L471 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2025-03-08 09:42:58,046 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-08 09:42:58,046 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2025-03-08 09:42:58,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-03-08 09:42:58,046 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 09:42:58,046 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2025-03-08 09:42:58,054 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-08 09:42:58,246 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-08 09:42:58,247 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 09:42:58,247 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 09:42:58,247 INFO L85 PathProgramCache]: Analyzing trace with hash -1926026653, now seen corresponding path program 1 times [2025-03-08 09:42:58,248 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 09:42:58,248 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [829260987] [2025-03-08 09:42:58,248 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 09:42:58,248 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 09:42:58,248 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 09:42:58,250 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-08 09:42:58,251 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-08 09:42:58,307 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-08 09:42:58,321 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-08 09:42:58,321 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 09:42:58,321 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 09:42:58,323 INFO L256 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 24 conjuncts are in the unsatisfiable core [2025-03-08 09:42:58,327 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 09:42:58,462 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-08 09:42:58,462 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 09:42:58,699 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-08 09:42:58,699 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 09:42:58,699 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [829260987] [2025-03-08 09:42:58,699 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [829260987] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 09:42:58,699 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-08 09:42:58,699 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2025-03-08 09:42:58,700 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [657212365] [2025-03-08 09:42:58,700 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-08 09:42:58,700 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-08 09:42:58,701 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 09:42:58,701 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-08 09:42:58,701 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2025-03-08 09:42:58,701 INFO L87 Difference]: Start difference. First operand 9 states and 9 transitions. Second operand has 10 states, 10 states have (on average 1.4) internal successors, (14), 10 states have internal predecessors, (14), 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-08 09:42:58,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 09:42:58,861 INFO L93 Difference]: Finished difference Result 18 states and 19 transitions. [2025-03-08 09:42:58,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-08 09:42:58,861 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 1.4) internal successors, (14), 10 states have internal predecessors, (14), 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 8 [2025-03-08 09:42:58,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 09:42:58,861 INFO L225 Difference]: With dead ends: 18 [2025-03-08 09:42:58,862 INFO L226 Difference]: Without dead ends: 16 [2025-03-08 09:42:58,862 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=65, Invalid=117, Unknown=0, NotChecked=0, Total=182 [2025-03-08 09:42:58,862 INFO L435 NwaCegarLoop]: 4 mSDtfsCounter, 7 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 19 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 09:42:58,863 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 19 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 09:42:58,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2025-03-08 09:42:58,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 15. [2025-03-08 09:42:58,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 14 states have (on average 1.0714285714285714) internal successors, (15), 14 states have internal predecessors, (15), 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-08 09:42:58,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2025-03-08 09:42:58,866 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 8 [2025-03-08 09:42:58,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 09:42:58,866 INFO L471 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions. [2025-03-08 09:42:58,866 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 1.4) internal successors, (14), 10 states have internal predecessors, (14), 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-08 09:42:58,866 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2025-03-08 09:42:58,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-03-08 09:42:58,866 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 09:42:58,866 INFO L218 NwaCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1] [2025-03-08 09:42:58,873 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-08 09:42:59,067 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-08 09:42:59,067 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 09:42:59,068 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 09:42:59,068 INFO L85 PathProgramCache]: Analyzing trace with hash -506187805, now seen corresponding path program 2 times [2025-03-08 09:42:59,068 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 09:42:59,068 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [341639817] [2025-03-08 09:42:59,068 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 09:42:59,068 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 09:42:59,069 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 09:42:59,070 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 09:42:59,071 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-08 09:42:59,136 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 14 statements into 2 equivalence classes. [2025-03-08 09:42:59,158 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 14 of 14 statements. [2025-03-08 09:42:59,159 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 09:42:59,159 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 09:42:59,161 INFO L256 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 57 conjuncts are in the unsatisfiable core [2025-03-08 09:42:59,169 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 09:42:59,994 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 1 proven. 12 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-08 09:42:59,995 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 09:43:05,496 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse8 ((_ zero_extend 24) |c_ULTIMATE.start_main_~mask_SORT_6~0#1|))) (let ((.cse22 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse8 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) |c_ULTIMATE.start_main_~var_7~0#1|))))))) (.cse4 ((_ zero_extend 24) |c_ULTIMATE.start_main_~mask_SORT_12~0#1|)) (.cse5 ((_ zero_extend 24) |c_ULTIMATE.start_main_~var_14~0#1|))) (let ((.cse32 (= ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) .cse22)) .cse4))) .cse5)) (.cse33 ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) (bvashr .cse22 (_ bv2 32))))))))) (let ((.cse23 ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) (bvor (_ bv1 32) .cse33))))))) (.cse24 (not .cse32)) (.cse2 ((_ zero_extend 24) |c_ULTIMATE.start_main_~mask_SORT_1~0#1|)) (.cse25 ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) (bvor (_ bv0 32) .cse33)))))))) (let ((.cse14 (and (or (forall ((|v_ULTIMATE.start_main_~var_21_arg_0~0#1_18| (_ BitVec 8))) (= (_ bv0 8) ((_ extract 7 0) (bvand .cse2 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse23 ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_21_arg_0~0#1_18|)))))))) .cse24) (or (forall ((|v_ULTIMATE.start_main_~var_21_arg_0~0#1_18| (_ BitVec 8))) (= (_ bv0 8) ((_ extract 7 0) (bvand .cse2 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse25 ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_21_arg_0~0#1_18|)))))))) .cse32))) (.cse7 ((_ zero_extend 24) |c_ULTIMATE.start_main_~var_19~0#1|)) (.cse1 ((_ zero_extend 24) |c_ULTIMATE.start_main_~var_51~0#1|)) (.cse9 ((_ zero_extend 24) |c_ULTIMATE.start_main_~var_49~0#1|))) (and (forall ((|ULTIMATE.start_main_~state_8~0#1| (_ BitVec 8)) (|v_ULTIMATE.start_main_~var_21_arg_0~0#1_18| (_ BitVec 8))) (let ((.cse0 ((_ zero_extend 24) |ULTIMATE.start_main_~state_8~0#1|))) (let ((.cse6 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse8 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse0 .cse9)))))))))) (let ((.cse3 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse8 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse6 .cse9)))))))))) (or (= .cse0 .cse1) (= ((_ extract 7 0) (bvand .cse2 ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) (bvashr .cse3 (_ bv2 32))))))) (_ bv0 32))))))) ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_21_arg_0~0#1_18|)))))) (_ bv0 8)) (= ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse4 ((_ zero_extend 24) ((_ extract 7 0) .cse3))))) .cse5) (= .cse6 .cse1) (not (= (_ bv0 8) ((_ extract 7 0) (bvand .cse2 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse7 ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) (bvashr .cse6 (_ bv2 32))))))) (_ bv0 32))))))))))))))))))) (or (and (forall ((|ULTIMATE.start_main_~state_8~0#1| (_ BitVec 8))) (let ((.cse11 ((_ zero_extend 24) |ULTIMATE.start_main_~state_8~0#1|))) (let ((.cse10 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse8 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse11 .cse9)))))))))) (or (not (= (_ bv0 8) ((_ extract 7 0) (bvand .cse2 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse7 ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) (bvashr .cse10 (_ bv2 32))))))) (_ bv1 32)))))))))))))) (= .cse11 .cse1) (not (= ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse4 ((_ zero_extend 24) ((_ extract 7 0) .cse10))))) .cse5)) (not (= .cse10 .cse1)))))) (forall ((|ULTIMATE.start_main_~state_8~0#1| (_ BitVec 8))) (let ((.cse12 ((_ zero_extend 24) |ULTIMATE.start_main_~state_8~0#1|))) (let ((.cse13 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse8 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse12 .cse9)))))))))) (or (= .cse12 .cse1) (not (= .cse13 .cse1)) (not (= (_ bv0 8) ((_ extract 7 0) (bvand .cse2 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse7 ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) (bvashr .cse13 (_ bv2 32))))))) (_ bv0 32))))))))))))))))))) .cse14) (forall ((|ULTIMATE.start_main_~state_8~0#1| (_ BitVec 8)) (|v_ULTIMATE.start_main_~var_21_arg_0~0#1_18| (_ BitVec 8))) (let ((.cse16 ((_ zero_extend 24) |ULTIMATE.start_main_~state_8~0#1|))) (let ((.cse17 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse8 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse16 .cse9)))))))))) (let ((.cse15 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse8 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse17 .cse9)))))))))) (or (= (_ bv0 8) ((_ extract 7 0) (bvand .cse2 ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) (bvashr .cse15 (_ bv2 32))))))) (_ bv1 32))))))) ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_21_arg_0~0#1_18|))))))) (= .cse16 .cse1) (not (= ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse4 ((_ zero_extend 24) ((_ extract 7 0) .cse15))))) .cse5)) (= .cse17 .cse1) (not (= (_ bv0 8) ((_ extract 7 0) (bvand .cse2 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse7 ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) (bvashr .cse17 (_ bv2 32))))))) (_ bv0 32))))))))))))))))))) (or (let ((.cse18 (= .cse22 .cse1))) (and (or (not .cse18) .cse14) (or .cse18 (let ((.cse21 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse8 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse22 .cse9)))))))))) (let ((.cse20 (= .cse5 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse4 ((_ zero_extend 24) ((_ extract 7 0) .cse21))))))) (.cse19 ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) (bvashr .cse21 (_ bv2 32))))))))) (and (or (forall ((|v_ULTIMATE.start_main_~var_21_arg_0~0#1_18| (_ BitVec 8))) (= ((_ extract 7 0) (bvand .cse2 ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse19 (_ bv1 32))))))) ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_21_arg_0~0#1_18|)))))) (_ bv0 8))) (not .cse20)) (or .cse20 (forall ((|v_ULTIMATE.start_main_~var_21_arg_0~0#1_18| (_ BitVec 8))) (= (_ bv0 8) ((_ extract 7 0) (bvand .cse2 ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse19 (_ bv0 32))))))) ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_21_arg_0~0#1_18|))))))))))))))) (and (or (not (= (_ bv0 8) ((_ extract 7 0) (bvand .cse2 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse23 .cse7))))))) .cse24) (not (= ((_ extract 7 0) (bvand .cse2 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse25 .cse7))))) (_ bv0 8)))) (forall ((|ULTIMATE.start_main_~state_8~0#1| (_ BitVec 8))) (not (= ((_ zero_extend 24) |ULTIMATE.start_main_~state_8~0#1|) .cse1)))) (forall ((|ULTIMATE.start_main_~state_8~0#1| (_ BitVec 8)) (|v_ULTIMATE.start_main_~var_21_arg_0~0#1_18| (_ BitVec 8))) (let ((.cse28 ((_ zero_extend 24) |ULTIMATE.start_main_~state_8~0#1|))) (let ((.cse27 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse8 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse28 .cse9)))))))))) (let ((.cse26 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse8 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse27 .cse9)))))))))) (or (= (_ bv0 8) ((_ extract 7 0) (bvand .cse2 ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) (bvashr .cse26 (_ bv2 32))))))) (_ bv1 32))))))) ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_21_arg_0~0#1_18|))))))) (not (= (_ bv0 8) ((_ extract 7 0) (bvand .cse2 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse7 ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) (bvashr .cse27 (_ bv2 32))))))) (_ bv1 32)))))))))))))) (= .cse28 .cse1) (not (= ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse4 ((_ zero_extend 24) ((_ extract 7 0) .cse27))))) .cse5)) (not (= ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse4 ((_ zero_extend 24) ((_ extract 7 0) .cse26))))) .cse5)) (= .cse27 .cse1)))))) (forall ((|ULTIMATE.start_main_~state_8~0#1| (_ BitVec 8)) (|v_ULTIMATE.start_main_~var_21_arg_0~0#1_18| (_ BitVec 8))) (let ((.cse30 ((_ zero_extend 24) |ULTIMATE.start_main_~state_8~0#1|))) (let ((.cse29 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse8 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse30 .cse9)))))))))) (let ((.cse31 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse8 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse29 .cse9)))))))))) (or (not (= (_ bv0 8) ((_ extract 7 0) (bvand .cse2 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse7 ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) (bvashr .cse29 (_ bv2 32))))))) (_ bv1 32)))))))))))))) (= .cse30 .cse1) (not (= ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse4 ((_ zero_extend 24) ((_ extract 7 0) .cse29))))) .cse5)) (= ((_ extract 7 0) (bvand .cse2 ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) (bvashr .cse31 (_ bv2 32))))))) (_ bv0 32))))))) ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_21_arg_0~0#1_18|)))))) (_ bv0 8)) (= ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse4 ((_ zero_extend 24) ((_ extract 7 0) .cse31))))) .cse5) (= .cse29 .cse1)))))))))))) is different from false [2025-03-08 09:43:21,979 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 10 not checked. [2025-03-08 09:43:21,980 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 09:43:21,980 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [341639817] [2025-03-08 09:43:21,980 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [341639817] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 09:43:21,980 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-08 09:43:21,980 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 15 [2025-03-08 09:43:21,980 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [411132414] [2025-03-08 09:43:21,980 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-08 09:43:21,980 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-08 09:43:21,980 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 09:43:21,981 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-08 09:43:21,981 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=138, Unknown=1, NotChecked=24, Total=210 [2025-03-08 09:43:21,981 INFO L87 Difference]: Start difference. First operand 15 states and 15 transitions. Second operand has 15 states, 15 states have (on average 1.5333333333333334) internal successors, (23), 15 states have internal predecessors, (23), 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-08 09:43:26,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 09:43:26,844 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2025-03-08 09:43:26,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 09:43:26,845 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 1.5333333333333334) internal successors, (23), 15 states have internal predecessors, (23), 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 14 [2025-03-08 09:43:26,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 09:43:26,845 INFO L225 Difference]: With dead ends: 15 [2025-03-08 09:43:26,845 INFO L226 Difference]: Without dead ends: 0 [2025-03-08 09:43:26,846 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 13 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 9.7s TimeCoverageRelationStatistics Valid=88, Invalid=187, Unknown=1, NotChecked=30, Total=306 [2025-03-08 09:43:26,846 INFO L435 NwaCegarLoop]: 2 mSDtfsCounter, 9 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 11 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-08 09:43:26,846 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 11 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-08 09:43:26,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-03-08 09:43:26,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-03-08 09:43:26,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 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-08 09:43:26,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-03-08 09:43:26,848 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 14 [2025-03-08 09:43:26,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 09:43:26,848 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-08 09:43:26,848 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 1.5333333333333334) internal successors, (23), 15 states have internal predecessors, (23), 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-08 09:43:26,848 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-03-08 09:43:26,849 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-03-08 09:43:26,851 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-08 09:43:26,858 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-08 09:43:27,052 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 09:43:27,055 INFO L422 BasicCegarLoop]: Path program histogram: [2, 1] [2025-03-08 09:43:27,056 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-03-08 09:43:30,201 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-08 09:43:30,210 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: BitVectorAccessExpression [2025-03-08 09:43:30,211 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: BitVectorAccessExpression [2025-03-08 09:43:30,211 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression [2025-03-08 09:43:30,212 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.03 09:43:30 BoogieIcfgContainer [2025-03-08 09:43:30,213 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-08 09:43:30,214 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-08 09:43:30,214 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-08 09:43:30,215 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-08 09:43:30,215 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 09:42:57" (3/4) ... [2025-03-08 09:43:30,217 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-08 09:43:30,223 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 10 nodes and edges [2025-03-08 09:43:30,223 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-03-08 09:43:30,224 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-03-08 09:43:30,224 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-03-08 09:43:30,285 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-08 09:43:30,285 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-08 09:43:30,286 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-08 09:43:30,287 INFO L158 Benchmark]: Toolchain (without parser) took 33235.66ms. Allocated memory was 117.4MB in the beginning and 176.2MB in the end (delta: 58.7MB). Free memory was 93.1MB in the beginning and 100.6MB in the end (delta: -7.5MB). Peak memory consumption was 47.1MB. Max. memory is 16.1GB. [2025-03-08 09:43:30,287 INFO L158 Benchmark]: CDTParser took 1.60ms. Allocated memory is still 83.9MB. Free memory was 62.2MB in the beginning and 62.2MB in the end (delta: 33.6kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 09:43:30,288 INFO L158 Benchmark]: CACSL2BoogieTranslator took 174.98ms. Allocated memory is still 117.4MB. Free memory was 92.8MB in the beginning and 79.8MB in the end (delta: 13.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-08 09:43:30,288 INFO L158 Benchmark]: Boogie Procedure Inliner took 30.60ms. Allocated memory is still 117.4MB. Free memory was 79.8MB in the beginning and 78.2MB in the end (delta: 1.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-08 09:43:30,288 INFO L158 Benchmark]: Boogie Preprocessor took 42.88ms. Allocated memory is still 117.4MB. Free memory was 78.2MB in the beginning and 76.6MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 09:43:30,288 INFO L158 Benchmark]: IcfgBuilder took 278.29ms. Allocated memory is still 117.4MB. Free memory was 76.6MB in the beginning and 62.6MB in the end (delta: 14.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-08 09:43:30,288 INFO L158 Benchmark]: TraceAbstraction took 32630.97ms. Allocated memory was 117.4MB in the beginning and 176.2MB in the end (delta: 58.7MB). Free memory was 62.1MB in the beginning and 106.1MB in the end (delta: -44.0MB). Peak memory consumption was 13.6MB. Max. memory is 16.1GB. [2025-03-08 09:43:30,288 INFO L158 Benchmark]: Witness Printer took 72.10ms. Allocated memory is still 176.2MB. Free memory was 106.1MB in the beginning and 100.6MB in the end (delta: 5.5MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 09:43:30,289 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.60ms. Allocated memory is still 83.9MB. Free memory was 62.2MB in the beginning and 62.2MB in the end (delta: 33.6kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 174.98ms. Allocated memory is still 117.4MB. Free memory was 92.8MB in the beginning and 79.8MB in the end (delta: 13.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 30.60ms. Allocated memory is still 117.4MB. Free memory was 79.8MB in the beginning and 78.2MB in the end (delta: 1.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 42.88ms. Allocated memory is still 117.4MB. Free memory was 78.2MB in the beginning and 76.6MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 278.29ms. Allocated memory is still 117.4MB. Free memory was 76.6MB in the beginning and 62.6MB in the end (delta: 14.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 32630.97ms. Allocated memory was 117.4MB in the beginning and 176.2MB in the end (delta: 58.7MB). Free memory was 62.1MB in the beginning and 106.1MB in the end (delta: -44.0MB). Peak memory consumption was 13.6MB. Max. memory is 16.1GB. * Witness Printer took 72.10ms. Allocated memory is still 176.2MB. Free memory was 106.1MB in the beginning and 100.6MB in the end (delta: 5.5MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression type not yet supported in backtranslation: BitVectorAccessExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression type not yet supported in backtranslation: BitVectorAccessExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression * 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 - PositiveResult [Line: 21]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 10 locations, 11 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 29.4s, OverallIterations: 3, TraceHistogramMax: 4, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 5.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 18 SdHoareTripleChecker+Valid, 0.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 18 mSDsluCounter, 41 SdHoareTripleChecker+Invalid, 0.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 31 mSDsCounter, 6 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 48 IncrementalHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 6 mSolverCounterUnsat, 10 mSDtfsCounter, 48 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 53 GetRequests, 21 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 9.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=15occurred in iteration=2, InterpolantAutomatonStates: 18, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 3 MinimizatonAttempts, 2 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 23.4s InterpolantComputationTime, 27 NumberOfCodeBlocks, 27 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 44 ConstructedInterpolants, 19 QuantifiedInterpolants, 9785 SizeOfPredicates, 21 NumberOfNonLiveVariables, 241 ConjunctsInSsa, 99 ConjunctsInUnsatCore, 5 InterpolantComputations, 1 PerfectInterpolantSequences, 6/34 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 - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 67]: Location Invariant Derived location invariant: ((((((((0 == var_7) && (3 == mask_SORT_12)) && (1 == var_19)) && (1 == var_49)) && (0 == var_14)) && (1 == mask_SORT_1)) && (4 == var_51)) && (7 == mask_SORT_6)) RESULT: Ultimate proved your program to be correct! [2025-03-08 09:43:30,500 WARN L435 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forcibly destroying the process [2025-03-08 09:43:30,649 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 137 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE