./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_arrays_am2910_p1.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 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_am2910_p1.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 e3ac6f8d68dfadee83df50cc30cff5b03f705d6e7b992071314ad032158be302 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 09:41:13,377 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 09:41:13,422 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2025-03-08 09:41:13,427 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 09:41:13,427 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 09:41:13,449 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 09:41:13,451 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 09:41:13,451 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 09:41:13,451 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 09:41:13,451 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 09:41:13,452 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 09:41:13,452 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 09:41:13,452 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 09:41:13,452 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 09:41:13,453 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 09:41:13,453 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 09:41:13,453 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 09:41:13,453 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 09:41:13,453 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 09:41:13,453 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 09:41:13,453 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 09:41:13,453 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 09:41:13,453 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 09:41:13,453 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 09:41:13,454 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 09:41:13,454 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 09:41:13,454 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 09:41:13,454 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 09:41:13,454 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 09:41:13,454 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 09:41:13,454 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 09:41:13,455 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 09:41:13,455 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 09:41:13,455 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 09:41:13,455 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 09:41:13,455 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 09:41:13,455 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 09:41:13,455 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 09:41:13,455 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 09:41:13,455 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 09:41:13,455 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 -> e3ac6f8d68dfadee83df50cc30cff5b03f705d6e7b992071314ad032158be302 [2025-03-08 09:41:13,666 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 09:41:13,671 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 09:41:13,674 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 09:41:13,674 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 09:41:13,675 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 09:41:13,675 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_am2910_p1.c [2025-03-08 09:41:14,816 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d0c262c2a/5686138ff5844073a870d1ebf0bc3a76/FLAG7229265b0 [2025-03-08 09:41:15,111 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 09:41:15,112 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_arrays_am2910_p1.c [2025-03-08 09:41:15,125 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d0c262c2a/5686138ff5844073a870d1ebf0bc3a76/FLAG7229265b0 [2025-03-08 09:41:15,135 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d0c262c2a/5686138ff5844073a870d1ebf0bc3a76 [2025-03-08 09:41:15,136 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 09:41:15,137 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 09:41:15,138 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 09:41:15,138 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 09:41:15,141 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 09:41:15,141 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 09:41:15" (1/1) ... [2025-03-08 09:41:15,142 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@30ec90d7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:41:15, skipping insertion in model container [2025-03-08 09:41:15,142 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 09:41:15" (1/1) ... [2025-03-08 09:41:15,180 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 09:41:15,295 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_am2910_p1.c[1260,1273] [2025-03-08 09:41:15,530 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 09:41:15,536 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 09:41:15,544 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_am2910_p1.c[1260,1273] [2025-03-08 09:41:15,664 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 09:41:15,674 INFO L204 MainTranslator]: Completed translation [2025-03-08 09:41:15,675 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:41:15 WrapperNode [2025-03-08 09:41:15,675 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 09:41:15,676 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 09:41:15,676 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 09:41:15,676 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 09:41:15,682 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:41:15" (1/1) ... [2025-03-08 09:41:15,727 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:41:15" (1/1) ... [2025-03-08 09:41:16,073 INFO L138 Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 4782 [2025-03-08 09:41:16,073 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 09:41:16,074 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 09:41:16,074 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 09:41:16,075 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 09:41:16,080 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:41:15" (1/1) ... [2025-03-08 09:41:16,081 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:41:15" (1/1) ... [2025-03-08 09:41:16,136 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:41:15" (1/1) ... [2025-03-08 09:41:16,282 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:41:16,285 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:41:15" (1/1) ... [2025-03-08 09:41:16,286 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:41:15" (1/1) ... [2025-03-08 09:41:16,436 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:41:15" (1/1) ... [2025-03-08 09:41:16,464 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:41:15" (1/1) ... [2025-03-08 09:41:16,482 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:41:15" (1/1) ... [2025-03-08 09:41:16,504 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:41:15" (1/1) ... [2025-03-08 09:41:16,568 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 09:41:16,570 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 09:41:16,570 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 09:41:16,570 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 09:41:16,571 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:41:15" (1/1) ... [2025-03-08 09:41:16,575 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 09:41:16,585 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 09:41:16,597 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:41:16,599 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:41:16,616 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 09:41:16,616 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 09:41:16,616 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 09:41:16,616 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 09:41:16,895 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 09:41:16,896 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 09:41:20,444 INFO L? ?]: Removed 2813 outVars from TransFormulas that were not future-live. [2025-03-08 09:41:20,444 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 09:41:20,593 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 09:41:20,594 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 09:41:20,594 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 09:41:20 BoogieIcfgContainer [2025-03-08 09:41:20,594 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 09:41:20,596 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 09:41:20,596 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 09:41:20,599 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 09:41:20,600 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 09:41:15" (1/3) ... [2025-03-08 09:41:20,600 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1222a0b7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 09:41:20, skipping insertion in model container [2025-03-08 09:41:20,600 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:41:15" (2/3) ... [2025-03-08 09:41:20,600 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1222a0b7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 09:41:20, skipping insertion in model container [2025-03-08 09:41:20,600 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 09:41:20" (3/3) ... [2025-03-08 09:41:20,601 INFO L128 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.vis_arrays_am2910_p1.c [2025-03-08 09:41:20,613 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 09:41:20,614 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG btor2c-lazyMod.vis_arrays_am2910_p1.c that has 1 procedures, 1510 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-08 09:41:20,687 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 09:41:20,699 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;@1cd3650, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 09:41:20,700 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 09:41:20,710 INFO L276 IsEmpty]: Start isEmpty. Operand has 1510 states, 1508 states have (on average 1.4993368700265253) internal successors, (2261), 1509 states have internal predecessors, (2261), 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:41:20,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2025-03-08 09:41:20,717 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 09:41:20,717 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 09:41:20,718 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 09:41:20,724 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 09:41:20,724 INFO L85 PathProgramCache]: Analyzing trace with hash 542269131, now seen corresponding path program 1 times [2025-03-08 09:41:20,731 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 09:41:20,732 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1219753579] [2025-03-08 09:41:20,734 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 09:41:20,735 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 09:41:20,832 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-03-08 09:41:20,922 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-03-08 09:41:20,924 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 09:41:20,924 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 09:41:21,319 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:41:21,320 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 09:41:21,320 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1219753579] [2025-03-08 09:41:21,320 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1219753579] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 09:41:21,320 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 09:41:21,322 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 09:41:21,322 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1168775058] [2025-03-08 09:41:21,323 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 09:41:21,326 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 09:41:21,326 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 09:41:21,339 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 09:41:21,340 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 09:41:21,344 INFO L87 Difference]: Start difference. First operand has 1510 states, 1508 states have (on average 1.4993368700265253) internal successors, (2261), 1509 states have internal predecessors, (2261), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 09:41:22,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 09:41:22,054 INFO L93 Difference]: Finished difference Result 2981 states and 4467 transitions. [2025-03-08 09:41:22,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 09:41:22,056 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2025-03-08 09:41:22,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 09:41:22,076 INFO L225 Difference]: With dead ends: 2981 [2025-03-08 09:41:22,076 INFO L226 Difference]: Without dead ends: 1509 [2025-03-08 09:41:22,081 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:41:22,083 INFO L435 NwaCegarLoop]: 1880 mSDtfsCounter, 0 mSDsluCounter, 3755 mSDsCounter, 0 mSdLazyCounter, 1135 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 5635 SdHoareTripleChecker+Invalid, 1135 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1135 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-08 09:41:22,083 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 5635 Invalid, 1135 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1135 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-08 09:41:22,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1509 states. [2025-03-08 09:41:22,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1509 to 1509. [2025-03-08 09:41:22,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1509 states, 1508 states have (on average 1.4980106100795756) internal successors, (2259), 1508 states have internal predecessors, (2259), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 09:41:22,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1509 states to 1509 states and 2259 transitions. [2025-03-08 09:41:22,160 INFO L78 Accepts]: Start accepts. Automaton has 1509 states and 2259 transitions. Word has length 37 [2025-03-08 09:41:22,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 09:41:22,160 INFO L471 AbstractCegarLoop]: Abstraction has 1509 states and 2259 transitions. [2025-03-08 09:41:22,161 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 09:41:22,161 INFO L276 IsEmpty]: Start isEmpty. Operand 1509 states and 2259 transitions. [2025-03-08 09:41:22,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2025-03-08 09:41:22,162 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 09:41:22,162 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 09:41:22,163 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-08 09:41:22,163 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 09:41:22,164 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 09:41:22,164 INFO L85 PathProgramCache]: Analyzing trace with hash -364844465, now seen corresponding path program 1 times [2025-03-08 09:41:22,164 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 09:41:22,164 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1175322890] [2025-03-08 09:41:22,164 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 09:41:22,164 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 09:41:22,195 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-03-08 09:41:22,220 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-03-08 09:41:22,220 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 09:41:22,220 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 09:41:22,401 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:41:22,401 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 09:41:22,401 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1175322890] [2025-03-08 09:41:22,402 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1175322890] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 09:41:22,402 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 09:41:22,402 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 09:41:22,402 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [565055091] [2025-03-08 09:41:22,402 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 09:41:22,403 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 09:41:22,404 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 09:41:22,404 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 09:41:22,404 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 09:41:22,404 INFO L87 Difference]: Start difference. First operand 1509 states and 2259 transitions. Second operand has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 09:41:23,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 09:41:23,058 INFO L93 Difference]: Finished difference Result 2982 states and 4465 transitions. [2025-03-08 09:41:23,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 09:41:23,058 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2025-03-08 09:41:23,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 09:41:23,064 INFO L225 Difference]: With dead ends: 2982 [2025-03-08 09:41:23,064 INFO L226 Difference]: Without dead ends: 1511 [2025-03-08 09:41:23,066 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:41:23,067 INFO L435 NwaCegarLoop]: 1880 mSDtfsCounter, 0 mSDsluCounter, 3752 mSDsCounter, 0 mSdLazyCounter, 1138 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 5632 SdHoareTripleChecker+Invalid, 1138 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1138 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-08 09:41:23,068 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 5632 Invalid, 1138 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1138 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-08 09:41:23,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1511 states. [2025-03-08 09:41:23,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1511 to 1511. [2025-03-08 09:41:23,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1511 states, 1510 states have (on average 1.4973509933774833) internal successors, (2261), 1510 states have internal predecessors, (2261), 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:41:23,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1511 states to 1511 states and 2261 transitions. [2025-03-08 09:41:23,110 INFO L78 Accepts]: Start accepts. Automaton has 1511 states and 2261 transitions. Word has length 38 [2025-03-08 09:41:23,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 09:41:23,111 INFO L471 AbstractCegarLoop]: Abstraction has 1511 states and 2261 transitions. [2025-03-08 09:41:23,111 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 09:41:23,111 INFO L276 IsEmpty]: Start isEmpty. Operand 1511 states and 2261 transitions. [2025-03-08 09:41:23,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2025-03-08 09:41:23,112 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 09:41:23,113 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 09:41:23,113 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 09:41:23,113 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 09:41:23,113 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 09:41:23,116 INFO L85 PathProgramCache]: Analyzing trace with hash -788732090, now seen corresponding path program 1 times [2025-03-08 09:41:23,116 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 09:41:23,117 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1668636582] [2025-03-08 09:41:23,117 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 09:41:23,117 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 09:41:23,152 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-03-08 09:41:23,209 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-03-08 09:41:23,210 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 09:41:23,210 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 09:41:23,426 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:41:23,427 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 09:41:23,427 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1668636582] [2025-03-08 09:41:23,427 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1668636582] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 09:41:23,427 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 09:41:23,428 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 09:41:23,428 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2379619] [2025-03-08 09:41:23,428 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 09:41:23,428 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 09:41:23,428 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 09:41:23,428 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 09:41:23,428 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-08 09:41:23,429 INFO L87 Difference]: Start difference. First operand 1511 states and 2261 transitions. Second operand has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 09:41:24,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 09:41:24,064 INFO L93 Difference]: Finished difference Result 2988 states and 4472 transitions. [2025-03-08 09:41:24,064 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 09:41:24,065 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 39 [2025-03-08 09:41:24,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 09:41:24,069 INFO L225 Difference]: With dead ends: 2988 [2025-03-08 09:41:24,069 INFO L226 Difference]: Without dead ends: 1515 [2025-03-08 09:41:24,071 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-03-08 09:41:24,072 INFO L435 NwaCegarLoop]: 1876 mSDtfsCounter, 2232 mSDsluCounter, 3745 mSDsCounter, 0 mSdLazyCounter, 1149 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2232 SdHoareTripleChecker+Valid, 5621 SdHoareTripleChecker+Invalid, 1150 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1149 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-08 09:41:24,072 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2232 Valid, 5621 Invalid, 1150 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1149 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-08 09:41:24,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1515 states. [2025-03-08 09:41:24,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1515 to 1514. [2025-03-08 09:41:24,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1514 states, 1513 states have (on average 1.4963648380700594) internal successors, (2264), 1513 states have internal predecessors, (2264), 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:41:24,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1514 states to 1514 states and 2264 transitions. [2025-03-08 09:41:24,096 INFO L78 Accepts]: Start accepts. Automaton has 1514 states and 2264 transitions. Word has length 39 [2025-03-08 09:41:24,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 09:41:24,096 INFO L471 AbstractCegarLoop]: Abstraction has 1514 states and 2264 transitions. [2025-03-08 09:41:24,096 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 09:41:24,096 INFO L276 IsEmpty]: Start isEmpty. Operand 1514 states and 2264 transitions. [2025-03-08 09:41:24,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-03-08 09:41:24,097 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 09:41:24,097 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 09:41:24,097 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 09:41:24,097 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 09:41:24,098 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 09:41:24,098 INFO L85 PathProgramCache]: Analyzing trace with hash -1573262010, now seen corresponding path program 1 times [2025-03-08 09:41:24,098 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 09:41:24,098 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2037416728] [2025-03-08 09:41:24,098 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 09:41:24,098 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 09:41:24,121 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-03-08 09:41:24,166 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-03-08 09:41:24,168 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 09:41:24,168 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 09:41:24,960 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:41:24,960 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 09:41:24,960 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2037416728] [2025-03-08 09:41:24,960 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2037416728] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 09:41:24,960 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 09:41:24,961 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 09:41:24,961 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [482784916] [2025-03-08 09:41:24,961 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 09:41:24,961 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-08 09:41:24,961 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 09:41:24,961 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-08 09:41:24,961 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-08 09:41:24,962 INFO L87 Difference]: Start difference. First operand 1514 states and 2264 transitions. Second operand has 8 states, 8 states have (on average 5.0) internal successors, (40), 8 states have internal predecessors, (40), 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:41:26,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 09:41:26,465 INFO L93 Difference]: Finished difference Result 4466 states and 6680 transitions. [2025-03-08 09:41:26,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-08 09:41:26,465 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.0) internal successors, (40), 8 states have internal predecessors, (40), 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 40 [2025-03-08 09:41:26,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 09:41:26,478 INFO L225 Difference]: With dead ends: 4466 [2025-03-08 09:41:26,478 INFO L226 Difference]: Without dead ends: 2990 [2025-03-08 09:41:26,481 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2025-03-08 09:41:26,481 INFO L435 NwaCegarLoop]: 1866 mSDtfsCounter, 6635 mSDsluCounter, 9325 mSDsCounter, 0 mSdLazyCounter, 2351 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6635 SdHoareTripleChecker+Valid, 11191 SdHoareTripleChecker+Invalid, 2352 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 2351 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-03-08 09:41:26,482 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6635 Valid, 11191 Invalid, 2352 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 2351 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-03-08 09:41:26,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2990 states. [2025-03-08 09:41:26,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2990 to 1529. [2025-03-08 09:41:26,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1529 states, 1528 states have (on average 1.4960732984293195) internal successors, (2286), 1528 states have internal predecessors, (2286), 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:41:26,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1529 states to 1529 states and 2286 transitions. [2025-03-08 09:41:26,529 INFO L78 Accepts]: Start accepts. Automaton has 1529 states and 2286 transitions. Word has length 40 [2025-03-08 09:41:26,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 09:41:26,529 INFO L471 AbstractCegarLoop]: Abstraction has 1529 states and 2286 transitions. [2025-03-08 09:41:26,530 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.0) internal successors, (40), 8 states have internal predecessors, (40), 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:41:26,530 INFO L276 IsEmpty]: Start isEmpty. Operand 1529 states and 2286 transitions. [2025-03-08 09:41:26,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-03-08 09:41:26,531 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 09:41:26,531 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 09:41:26,531 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-08 09:41:26,531 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 09:41:26,532 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 09:41:26,532 INFO L85 PathProgramCache]: Analyzing trace with hash -1087493292, now seen corresponding path program 1 times [2025-03-08 09:41:26,532 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 09:41:26,532 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1163315202] [2025-03-08 09:41:26,532 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 09:41:26,532 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 09:41:26,566 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-03-08 09:41:26,598 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-03-08 09:41:26,598 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 09:41:26,598 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 09:41:26,813 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:41:26,814 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 09:41:26,814 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1163315202] [2025-03-08 09:41:26,814 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1163315202] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 09:41:26,814 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 09:41:26,814 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-08 09:41:26,814 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [921776072] [2025-03-08 09:41:26,814 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 09:41:26,814 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 09:41:26,815 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 09:41:26,815 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 09:41:26,815 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-03-08 09:41:26,815 INFO L87 Difference]: Start difference. First operand 1529 states and 2286 transitions. Second operand has 7 states, 7 states have (on average 5.714285714285714) internal successors, (40), 7 states have internal predecessors, (40), 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:41:27,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 09:41:27,732 INFO L93 Difference]: Finished difference Result 3003 states and 4492 transitions. [2025-03-08 09:41:27,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-08 09:41:27,732 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.714285714285714) internal successors, (40), 7 states have internal predecessors, (40), 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 40 [2025-03-08 09:41:27,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 09:41:27,738 INFO L225 Difference]: With dead ends: 3003 [2025-03-08 09:41:27,738 INFO L226 Difference]: Without dead ends: 1527 [2025-03-08 09:41:27,740 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2025-03-08 09:41:27,742 INFO L435 NwaCegarLoop]: 1869 mSDtfsCounter, 2228 mSDsluCounter, 7463 mSDsCounter, 0 mSdLazyCounter, 1927 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2228 SdHoareTripleChecker+Valid, 9332 SdHoareTripleChecker+Invalid, 1930 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 1927 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-08 09:41:27,742 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2228 Valid, 9332 Invalid, 1930 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 1927 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-08 09:41:27,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1527 states. [2025-03-08 09:41:27,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1527 to 1524. [2025-03-08 09:41:27,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1524 states, 1523 states have (on average 1.4963887065003283) internal successors, (2279), 1523 states have internal predecessors, (2279), 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:41:27,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1524 states to 1524 states and 2279 transitions. [2025-03-08 09:41:27,770 INFO L78 Accepts]: Start accepts. Automaton has 1524 states and 2279 transitions. Word has length 40 [2025-03-08 09:41:27,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 09:41:27,770 INFO L471 AbstractCegarLoop]: Abstraction has 1524 states and 2279 transitions. [2025-03-08 09:41:27,770 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.714285714285714) internal successors, (40), 7 states have internal predecessors, (40), 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:41:27,771 INFO L276 IsEmpty]: Start isEmpty. Operand 1524 states and 2279 transitions. [2025-03-08 09:41:27,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2025-03-08 09:41:27,773 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 09:41:27,773 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 09:41:27,773 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-08 09:41:27,773 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 09:41:27,773 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 09:41:27,773 INFO L85 PathProgramCache]: Analyzing trace with hash 2050042616, now seen corresponding path program 1 times [2025-03-08 09:41:27,773 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 09:41:27,773 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1360398056] [2025-03-08 09:41:27,773 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 09:41:27,773 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 09:41:27,821 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-03-08 09:41:27,853 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-03-08 09:41:27,853 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 09:41:27,853 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-08 09:41:27,853 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-08 09:41:27,865 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-03-08 09:41:27,891 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-03-08 09:41:27,892 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 09:41:27,892 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-08 09:41:27,938 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-08 09:41:27,938 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-08 09:41:27,939 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-08 09:41:27,941 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-08 09:41:27,943 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2025-03-08 09:41:27,983 WARN L310 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2025-03-08 09:41:27,994 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-08 09:41:27,996 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.03 09:41:27 BoogieIcfgContainer [2025-03-08 09:41:27,997 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-08 09:41:27,997 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-08 09:41:27,997 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-08 09:41:27,997 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-08 09:41:27,998 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 09:41:20" (3/4) ... [2025-03-08 09:41:27,999 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-08 09:41:28,000 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-08 09:41:28,000 INFO L158 Benchmark]: Toolchain (without parser) took 12863.20ms. Allocated memory was 167.8MB in the beginning and 503.3MB in the end (delta: 335.5MB). Free memory was 119.6MB in the beginning and 314.9MB in the end (delta: -195.3MB). Peak memory consumption was 146.8MB. Max. memory is 16.1GB. [2025-03-08 09:41:28,001 INFO L158 Benchmark]: CDTParser took 0.88ms. Allocated memory is still 201.3MB. Free memory is still 120.5MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 09:41:28,001 INFO L158 Benchmark]: CACSL2BoogieTranslator took 537.14ms. Allocated memory is still 167.8MB. Free memory was 119.6MB in the beginning and 45.8MB in the end (delta: 73.8MB). Peak memory consumption was 75.5MB. Max. memory is 16.1GB. [2025-03-08 09:41:28,001 INFO L158 Benchmark]: Boogie Procedure Inliner took 398.15ms. Allocated memory was 167.8MB in the beginning and 176.2MB in the end (delta: 8.4MB). Free memory was 45.8MB in the beginning and 66.3MB in the end (delta: -20.5MB). Peak memory consumption was 88.7MB. Max. memory is 16.1GB. [2025-03-08 09:41:28,001 INFO L158 Benchmark]: Boogie Preprocessor took 494.05ms. Allocated memory was 176.2MB in the beginning and 453.0MB in the end (delta: 276.8MB). Free memory was 66.3MB in the beginning and 312.8MB in the end (delta: -246.5MB). Peak memory consumption was 46.4MB. Max. memory is 16.1GB. [2025-03-08 09:41:28,001 INFO L158 Benchmark]: IcfgBuilder took 4024.70ms. Allocated memory is still 453.0MB. Free memory was 312.8MB in the beginning and 263.2MB in the end (delta: 49.6MB). Peak memory consumption was 246.8MB. Max. memory is 16.1GB. [2025-03-08 09:41:28,002 INFO L158 Benchmark]: TraceAbstraction took 7400.80ms. Allocated memory was 453.0MB in the beginning and 503.3MB in the end (delta: 50.3MB). Free memory was 263.2MB in the beginning and 315.0MB in the end (delta: -51.8MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 09:41:28,002 INFO L158 Benchmark]: Witness Printer took 2.82ms. Allocated memory is still 503.3MB. Free memory was 315.0MB in the beginning and 314.9MB in the end (delta: 66.3kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-08 09:41:28,003 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.88ms. Allocated memory is still 201.3MB. Free memory is still 120.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 537.14ms. Allocated memory is still 167.8MB. Free memory was 119.6MB in the beginning and 45.8MB in the end (delta: 73.8MB). Peak memory consumption was 75.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 398.15ms. Allocated memory was 167.8MB in the beginning and 176.2MB in the end (delta: 8.4MB). Free memory was 45.8MB in the beginning and 66.3MB in the end (delta: -20.5MB). Peak memory consumption was 88.7MB. Max. memory is 16.1GB. * Boogie Preprocessor took 494.05ms. Allocated memory was 176.2MB in the beginning and 453.0MB in the end (delta: 276.8MB). Free memory was 66.3MB in the beginning and 312.8MB in the end (delta: -246.5MB). Peak memory consumption was 46.4MB. Max. memory is 16.1GB. * IcfgBuilder took 4024.70ms. Allocated memory is still 453.0MB. Free memory was 312.8MB in the beginning and 263.2MB in the end (delta: 49.6MB). Peak memory consumption was 246.8MB. Max. memory is 16.1GB. * TraceAbstraction took 7400.80ms. Allocated memory was 453.0MB in the beginning and 503.3MB in the end (delta: 50.3MB). Free memory was 263.2MB in the beginning and 315.0MB in the end (delta: -51.8MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 2.82ms. Allocated memory is still 503.3MB. Free memory was 315.0MB in the beginning and 314.9MB in the end (delta: 66.3kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 21]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of bitwiseAnd at line 207. Possible FailurePath: [L26] const SORT_1 mask_SORT_1 = (SORT_1)-1 >> (sizeof(SORT_1) * 8 - 12); [L27] const SORT_1 msb_SORT_1 = (SORT_1)1 << (12 - 1); [L29] const SORT_6 mask_SORT_6 = (SORT_6)-1 >> (sizeof(SORT_6) * 8 - 1); [L30] const SORT_6 msb_SORT_6 = (SORT_6)1 << (1 - 1); [L32] const SORT_11 mask_SORT_11 = (SORT_11)-1 >> (sizeof(SORT_11) * 8 - 4); [L33] const SORT_11 msb_SORT_11 = (SORT_11)1 << (4 - 1); [L35] const SORT_37 mask_SORT_37 = (SORT_37)-1 >> (sizeof(SORT_37) * 8 - 32); [L36] const SORT_37 msb_SORT_37 = (SORT_37)1 << (32 - 1); [L38] const SORT_41 mask_SORT_41 = (SORT_41)-1 >> (sizeof(SORT_41) * 8 - 3); [L39] const SORT_41 msb_SORT_41 = (SORT_41)1 << (3 - 1); [L41] const SORT_289 mask_SORT_289 = (SORT_289)-1 >> (sizeof(SORT_289) * 8 - 2); [L42] const SORT_289 msb_SORT_289 = (SORT_289)1 << (2 - 1); [L44] const SORT_293 mask_SORT_293 = (SORT_293)-1 >> (sizeof(SORT_293) * 8 - 5); [L45] const SORT_293 msb_SORT_293 = (SORT_293)1 << (5 - 1); [L47] const SORT_295 mask_SORT_295 = (SORT_295)-1 >> (sizeof(SORT_295) * 8 - 6); [L48] const SORT_295 msb_SORT_295 = (SORT_295)1 << (6 - 1); [L50] const SORT_297 mask_SORT_297 = (SORT_297)-1 >> (sizeof(SORT_297) * 8 - 7); [L51] const SORT_297 msb_SORT_297 = (SORT_297)1 << (7 - 1); [L53] const SORT_299 mask_SORT_299 = (SORT_299)-1 >> (sizeof(SORT_299) * 8 - 8); [L54] const SORT_299 msb_SORT_299 = (SORT_299)1 << (8 - 1); [L56] const SORT_301 mask_SORT_301 = (SORT_301)-1 >> (sizeof(SORT_301) * 8 - 9); [L57] const SORT_301 msb_SORT_301 = (SORT_301)1 << (9 - 1); [L59] const SORT_303 mask_SORT_303 = (SORT_303)-1 >> (sizeof(SORT_303) * 8 - 10); [L60] const SORT_303 msb_SORT_303 = (SORT_303)1 << (10 - 1); [L62] const SORT_305 mask_SORT_305 = (SORT_305)-1 >> (sizeof(SORT_305) * 8 - 11); [L63] const SORT_305 msb_SORT_305 = (SORT_305)1 << (11 - 1); [L65] const SORT_1 var_16 = 0; [L66] const SORT_6 var_21 = 0; [L67] const SORT_37 var_39 = 0; [L68] const SORT_41 var_42 = 0; [L69] const SORT_41 var_45 = 6; [L70] const SORT_41 var_47 = 7; [L71] const SORT_6 var_53 = 1; [L72] const SORT_11 var_57 = 2; [L73] const SORT_11 var_62 = 9; [L74] const SORT_11 var_70 = 15; [L75] const SORT_11 var_75 = 1; [L76] const SORT_11 var_77 = 3; [L77] const SORT_11 var_80 = 5; [L78] const SORT_11 var_83 = 7; [L79] const SORT_11 var_86 = 11; [L80] const SORT_11 var_108 = 8; [L81] const SORT_11 var_112 = 10; [L82] const SORT_11 var_116 = 13; [L83] const SORT_11 var_127 = 4; [L84] const SORT_11 var_129 = 12; [L85] const SORT_11 var_132 = 14; [L86] const SORT_11 var_138 = 6; [L87] const SORT_11 var_165 = 0; [L88] const SORT_41 var_209 = 1; [L89] const SORT_41 var_211 = 5; [L90] const SORT_1 var_229 = 4095; [L91] const SORT_1 var_569 = 1; [L92] const SORT_305 var_577 = 0; [L94] SORT_1 input_2; [L95] SORT_1 input_3; [L96] SORT_1 input_4; [L97] SORT_1 input_5; [L98] SORT_6 input_7; [L99] SORT_6 input_8; [L100] SORT_6 input_9; [L101] SORT_1 input_10; [L102] SORT_11 input_12; [L103] SORT_6 input_13; [L104] SORT_6 input_14; [L105] SORT_6 input_15; [L106] SORT_1 input_216; [L107] SORT_41 input_219; [L109] EXPR __VERIFIER_nondet_ushort() & mask_SORT_1 VAL [mask_SORT_11=15, mask_SORT_1=4095, mask_SORT_289=3, mask_SORT_293=31, mask_SORT_295=63, mask_SORT_297=127, mask_SORT_299=255, mask_SORT_301=511, mask_SORT_303=1023, mask_SORT_305=2047, mask_SORT_41=7, mask_SORT_6=1, var_108=8, var_112=10, var_116=13, var_127=4, var_129=12, var_132=14, var_138=6, var_165=0, var_16=0, var_209=1, var_211=5, var_21=0, var_229=4095, var_39=0, var_42=0, var_45=6, var_47=7, var_53=1, var_569=1, var_577=0, var_57=2, var_62=9, var_70=15, var_75=1, var_77=3, var_80=5, var_83=7, var_86=11] [L109] SORT_1 state_17 = __VERIFIER_nondet_ushort() & mask_SORT_1; [L110] EXPR __VERIFIER_nondet_ushort() & mask_SORT_1 VAL [mask_SORT_11=15, mask_SORT_1=4095, mask_SORT_289=3, mask_SORT_293=31, mask_SORT_295=63, mask_SORT_297=127, mask_SORT_299=255, mask_SORT_301=511, mask_SORT_303=1023, mask_SORT_305=2047, mask_SORT_41=7, mask_SORT_6=1, var_108=8, var_112=10, var_116=13, var_127=4, var_129=12, var_132=14, var_138=6, var_165=0, var_16=0, var_209=1, var_211=5, var_21=0, var_229=4095, var_39=0, var_42=0, var_45=6, var_47=7, var_53=1, var_569=1, var_577=0, var_57=2, var_62=9, var_70=15, var_75=1, var_77=3, var_80=5, var_83=7, var_86=11] [L110] SORT_1 state_19 = __VERIFIER_nondet_ushort() & mask_SORT_1; [L111] EXPR __VERIFIER_nondet_ushort() & mask_SORT_1 VAL [mask_SORT_11=15, mask_SORT_1=4095, mask_SORT_289=3, mask_SORT_293=31, mask_SORT_295=63, mask_SORT_297=127, mask_SORT_299=255, mask_SORT_301=511, mask_SORT_303=1023, mask_SORT_305=2047, mask_SORT_41=7, mask_SORT_6=1, var_108=8, var_112=10, var_116=13, var_127=4, var_129=12, var_132=14, var_138=6, var_165=0, var_16=0, var_209=1, var_211=5, var_21=0, var_229=4095, var_39=0, var_42=0, var_45=6, var_47=7, var_53=1, var_569=1, var_577=0, var_57=2, var_62=9, var_70=15, var_75=1, var_77=3, var_80=5, var_83=7, var_86=11] [L111] SORT_1 state_23 = __VERIFIER_nondet_ushort() & mask_SORT_1; [L112] EXPR __VERIFIER_nondet_ushort() & mask_SORT_1 VAL [mask_SORT_11=15, mask_SORT_1=4095, mask_SORT_289=3, mask_SORT_293=31, mask_SORT_295=63, mask_SORT_297=127, mask_SORT_299=255, mask_SORT_301=511, mask_SORT_303=1023, mask_SORT_305=2047, mask_SORT_41=7, mask_SORT_6=1, var_108=8, var_112=10, var_116=13, var_127=4, var_129=12, var_132=14, var_138=6, var_165=0, var_16=0, var_209=1, var_211=5, var_21=0, var_229=4095, var_39=0, var_42=0, var_45=6, var_47=7, var_53=1, var_569=1, var_577=0, var_57=2, var_62=9, var_70=15, var_75=1, var_77=3, var_80=5, var_83=7, var_86=11] [L112] SORT_1 state_25 = __VERIFIER_nondet_ushort() & mask_SORT_1; [L113] EXPR __VERIFIER_nondet_ushort() & mask_SORT_1 VAL [mask_SORT_11=15, mask_SORT_1=4095, mask_SORT_289=3, mask_SORT_293=31, mask_SORT_295=63, mask_SORT_297=127, mask_SORT_299=255, mask_SORT_301=511, mask_SORT_303=1023, mask_SORT_305=2047, mask_SORT_41=7, mask_SORT_6=1, var_108=8, var_112=10, var_116=13, var_127=4, var_129=12, var_132=14, var_138=6, var_165=0, var_16=0, var_209=1, var_211=5, var_21=0, var_229=4095, var_39=0, var_42=0, var_45=6, var_47=7, var_53=1, var_569=1, var_577=0, var_57=2, var_62=9, var_70=15, var_75=1, var_77=3, var_80=5, var_83=7, var_86=11] [L113] SORT_1 state_29 = __VERIFIER_nondet_ushort() & mask_SORT_1; [L114] EXPR __VERIFIER_nondet_ushort() & mask_SORT_1 VAL [mask_SORT_11=15, mask_SORT_1=4095, mask_SORT_289=3, mask_SORT_293=31, mask_SORT_295=63, mask_SORT_297=127, mask_SORT_299=255, mask_SORT_301=511, mask_SORT_303=1023, mask_SORT_305=2047, mask_SORT_41=7, mask_SORT_6=1, var_108=8, var_112=10, var_116=13, var_127=4, var_129=12, var_132=14, var_138=6, var_165=0, var_16=0, var_209=1, var_211=5, var_21=0, var_229=4095, var_39=0, var_42=0, var_45=6, var_47=7, var_53=1, var_569=1, var_577=0, var_57=2, var_62=9, var_70=15, var_75=1, var_77=3, var_80=5, var_83=7, var_86=11] [L114] SORT_1 state_31 = __VERIFIER_nondet_ushort() & mask_SORT_1; [L115] EXPR __VERIFIER_nondet_uchar() & mask_SORT_41 VAL [mask_SORT_11=15, mask_SORT_1=4095, mask_SORT_289=3, mask_SORT_293=31, mask_SORT_295=63, mask_SORT_297=127, mask_SORT_299=255, mask_SORT_301=511, mask_SORT_303=1023, mask_SORT_305=2047, mask_SORT_41=7, mask_SORT_6=1, var_108=8, var_112=10, var_116=13, var_127=4, var_129=12, var_132=14, var_138=6, var_165=0, var_16=0, var_209=1, var_211=5, var_21=0, var_229=4095, var_39=0, var_42=0, var_45=6, var_47=7, var_53=1, var_569=1, var_577=0, var_57=2, var_62=9, var_70=15, var_75=1, var_77=3, var_80=5, var_83=7, var_86=11] [L115] SORT_41 state_43 = __VERIFIER_nondet_uchar() & mask_SORT_41; [L116] EXPR __VERIFIER_nondet_ushort() & mask_SORT_1 VAL [mask_SORT_11=15, mask_SORT_1=4095, mask_SORT_289=3, mask_SORT_293=31, mask_SORT_295=63, mask_SORT_297=127, mask_SORT_299=255, mask_SORT_301=511, mask_SORT_303=1023, mask_SORT_305=2047, mask_SORT_41=7, mask_SORT_6=1, var_108=8, var_112=10, var_116=13, var_127=4, var_129=12, var_132=14, var_138=6, var_165=0, var_16=0, var_209=1, var_211=5, var_21=0, var_229=4095, var_39=0, var_42=0, var_45=6, var_47=7, var_53=1, var_569=1, var_577=0, var_57=2, var_62=9, var_70=15, var_75=1, var_77=3, var_80=5, var_83=7, var_86=11] [L116] SORT_1 state_59 = __VERIFIER_nondet_ushort() & mask_SORT_1; [L117] EXPR __VERIFIER_nondet_ushort() & mask_SORT_1 VAL [mask_SORT_11=15, mask_SORT_1=4095, mask_SORT_289=3, mask_SORT_293=31, mask_SORT_295=63, mask_SORT_297=127, mask_SORT_299=255, mask_SORT_301=511, mask_SORT_303=1023, mask_SORT_305=2047, mask_SORT_41=7, mask_SORT_6=1, var_108=8, var_112=10, var_116=13, var_127=4, var_129=12, var_132=14, var_138=6, var_165=0, var_16=0, var_209=1, var_211=5, var_21=0, var_229=4095, var_39=0, var_42=0, var_45=6, var_47=7, var_53=1, var_569=1, var_577=0, var_57=2, var_62=9, var_70=15, var_75=1, var_77=3, var_80=5, var_83=7, var_86=11] [L117] SORT_1 state_125 = __VERIFIER_nondet_ushort() & mask_SORT_1; [L119] SORT_1 init_18_arg_1 = var_16; [L120] state_17 = init_18_arg_1 [L121] SORT_1 init_20_arg_1 = var_16; [L122] state_19 = init_20_arg_1 [L123] SORT_1 init_24_arg_1 = var_16; [L124] state_23 = init_24_arg_1 [L125] SORT_1 init_26_arg_1 = var_16; [L126] state_25 = init_26_arg_1 [L127] SORT_1 init_30_arg_1 = var_16; [L128] state_29 = init_30_arg_1 [L129] SORT_1 init_32_arg_1 = var_16; [L130] state_31 = init_32_arg_1 [L131] SORT_41 init_44_arg_1 = var_42; [L132] state_43 = init_44_arg_1 [L133] SORT_1 init_60_arg_1 = var_16; [L134] state_59 = init_60_arg_1 [L135] SORT_1 init_126_arg_1 = var_16; [L136] state_125 = init_126_arg_1 VAL [mask_SORT_11=15, mask_SORT_1=4095, mask_SORT_289=3, mask_SORT_293=31, mask_SORT_295=63, mask_SORT_297=127, mask_SORT_299=255, mask_SORT_301=511, mask_SORT_303=1023, mask_SORT_305=2047, mask_SORT_41=7, mask_SORT_6=1, state_125=0, state_17=0, state_19=0, state_23=0, state_25=0, state_29=0, state_31=0, state_43=0, state_59=0, var_108=8, var_112=10, var_116=13, var_127=4, var_129=12, var_132=14, var_138=6, var_165=0, var_16=0, var_209=1, var_211=5, var_21=0, var_229=4095, var_39=0, var_42=0, var_45=6, var_47=7, var_53=1, var_569=1, var_577=0, var_57=2, var_62=9, var_70=15, var_75=1, var_77=3, var_80=5, var_83=7, var_86=11] [L139] input_2 = __VERIFIER_nondet_ushort() [L140] input_3 = __VERIFIER_nondet_ushort() [L141] input_4 = __VERIFIER_nondet_ushort() [L142] input_5 = __VERIFIER_nondet_ushort() [L143] input_7 = __VERIFIER_nondet_uchar() [L144] input_8 = __VERIFIER_nondet_uchar() [L145] input_9 = __VERIFIER_nondet_uchar() [L146] EXPR input_9 & mask_SORT_6 VAL [mask_SORT_11=15, mask_SORT_1=4095, mask_SORT_289=3, mask_SORT_293=31, mask_SORT_295=63, mask_SORT_297=127, mask_SORT_299=255, mask_SORT_301=511, mask_SORT_303=1023, mask_SORT_305=2047, mask_SORT_41=7, mask_SORT_6=1, state_125=0, state_17=0, state_19=0, state_23=0, state_25=0, state_29=0, state_31=0, state_43=0, state_59=0, var_108=8, var_112=10, var_116=13, var_127=4, var_129=12, var_132=14, var_138=6, var_165=0, var_16=0, var_209=1, var_211=5, var_21=0, var_229=4095, var_39=0, var_42=0, var_45=6, var_47=7, var_53=1, var_569=1, var_577=0, var_57=2, var_62=9, var_70=15, var_75=1, var_77=3, var_80=5, var_83=7, var_86=11] [L146] input_9 = input_9 & mask_SORT_6 [L147] input_10 = __VERIFIER_nondet_ushort() [L148] input_12 = __VERIFIER_nondet_uchar() [L149] EXPR input_12 & mask_SORT_11 VAL [input_9=0, mask_SORT_11=15, mask_SORT_1=4095, mask_SORT_289=3, mask_SORT_293=31, mask_SORT_295=63, mask_SORT_297=127, mask_SORT_299=255, mask_SORT_301=511, mask_SORT_303=1023, mask_SORT_305=2047, mask_SORT_41=7, mask_SORT_6=1, state_125=0, state_17=0, state_19=0, state_23=0, state_25=0, state_29=0, state_31=0, state_43=0, state_59=0, var_108=8, var_112=10, var_116=13, var_127=4, var_129=12, var_132=14, var_138=6, var_165=0, var_16=0, var_209=1, var_211=5, var_21=0, var_229=4095, var_39=0, var_42=0, var_45=6, var_47=7, var_53=1, var_569=1, var_577=0, var_57=2, var_62=9, var_70=15, var_75=1, var_77=3, var_80=5, var_83=7, var_86=11] [L149] input_12 = input_12 & mask_SORT_11 [L150] input_13 = __VERIFIER_nondet_uchar() [L151] input_14 = __VERIFIER_nondet_uchar() [L152] input_15 = __VERIFIER_nondet_uchar() [L153] input_216 = __VERIFIER_nondet_ushort() [L154] input_219 = __VERIFIER_nondet_uchar() [L157] SORT_6 var_34_arg_0 = var_21; [L158] SORT_1 var_34_arg_1 = input_5; [L159] SORT_1 var_34_arg_2 = input_4; [L160] SORT_1 var_34 = var_34_arg_0 ? var_34_arg_1 : var_34_arg_2; [L161] SORT_6 var_33_arg_0 = var_21; [L162] SORT_1 var_33_arg_1 = state_31; [L163] SORT_1 var_33_arg_2 = state_29; [L164] SORT_1 var_33 = var_33_arg_0 ? var_33_arg_1 : var_33_arg_2; [L165] SORT_6 var_35_arg_0 = var_21; [L166] SORT_1 var_35_arg_1 = var_34; [L167] SORT_1 var_35_arg_2 = var_33; [L168] SORT_1 var_35 = var_35_arg_0 ? var_35_arg_1 : var_35_arg_2; [L169] SORT_6 var_27_arg_0 = var_21; [L170] SORT_1 var_27_arg_1 = state_25; [L171] SORT_1 var_27_arg_2 = state_23; [L172] SORT_1 var_27 = var_27_arg_0 ? var_27_arg_1 : var_27_arg_2; [L173] SORT_6 var_22_arg_0 = var_21; [L174] SORT_1 var_22_arg_1 = state_19; [L175] SORT_1 var_22_arg_2 = state_17; [L176] SORT_1 var_22 = var_22_arg_0 ? var_22_arg_1 : var_22_arg_2; [L177] SORT_6 var_28_arg_0 = var_21; [L178] SORT_1 var_28_arg_1 = var_27; [L179] SORT_1 var_28_arg_2 = var_22; [L180] SORT_1 var_28 = var_28_arg_0 ? var_28_arg_1 : var_28_arg_2; [L181] SORT_6 var_36_arg_0 = var_21; [L182] SORT_1 var_36_arg_1 = var_35; [L183] SORT_1 var_36_arg_2 = var_28; [L184] SORT_1 var_36 = var_36_arg_0 ? var_36_arg_1 : var_36_arg_2; [L185] SORT_1 var_38_arg_0 = var_36; VAL [input_12=0, input_9=0, mask_SORT_11=15, mask_SORT_1=4095, mask_SORT_289=3, mask_SORT_293=31, mask_SORT_295=63, mask_SORT_297=127, mask_SORT_299=255, mask_SORT_301=511, mask_SORT_303=1023, mask_SORT_305=2047, mask_SORT_41=7, mask_SORT_6=1, state_125=0, state_17=0, state_19=0, state_23=0, state_25=0, state_29=0, state_31=0, state_43=0, state_59=0, var_108=8, var_112=10, var_116=13, var_127=4, var_129=12, var_132=14, var_138=6, var_165=0, var_16=0, var_209=1, var_211=5, var_21=0, var_229=4095, var_38_arg_0=0, var_39=0, var_42=0, var_45=6, var_47=7, var_53=1, var_569=1, var_577=0, var_57=2, var_62=9, var_70=15, var_75=1, var_77=3, var_80=5, var_83=7, var_86=11] [L186] EXPR var_38_arg_0 & mask_SORT_1 VAL [input_12=0, input_9=0, mask_SORT_11=15, mask_SORT_1=4095, mask_SORT_289=3, mask_SORT_293=31, mask_SORT_295=63, mask_SORT_297=127, mask_SORT_299=255, mask_SORT_301=511, mask_SORT_303=1023, mask_SORT_305=2047, mask_SORT_41=7, mask_SORT_6=1, state_125=0, state_17=0, state_19=0, state_23=0, state_25=0, state_29=0, state_31=0, state_43=0, state_59=0, var_108=8, var_112=10, var_116=13, var_127=4, var_129=12, var_132=14, var_138=6, var_165=0, var_16=0, var_209=1, var_211=5, var_21=0, var_229=4095, var_39=0, var_42=0, var_45=6, var_47=7, var_53=1, var_569=1, var_577=0, var_57=2, var_62=9, var_70=15, var_75=1, var_77=3, var_80=5, var_83=7, var_86=11] [L186] var_38_arg_0 = var_38_arg_0 & mask_SORT_1 [L187] SORT_37 var_38 = var_38_arg_0; [L188] SORT_37 var_40_arg_0 = var_38; [L189] SORT_37 var_40_arg_1 = var_39; [L190] SORT_6 var_40 = var_40_arg_0 == var_40_arg_1; [L191] SORT_41 var_46_arg_0 = state_43; [L192] SORT_41 var_46_arg_1 = var_45; [L193] SORT_6 var_46 = var_46_arg_0 != var_46_arg_1; [L194] SORT_41 var_48_arg_0 = state_43; [L195] SORT_41 var_48_arg_1 = var_47; [L196] SORT_6 var_48 = var_48_arg_0 != var_48_arg_1; [L197] SORT_6 var_49_arg_0 = var_46; [L198] SORT_6 var_49_arg_1 = var_48; VAL [input_12=0, input_9=0, mask_SORT_11=15, mask_SORT_1=4095, mask_SORT_289=3, mask_SORT_293=31, mask_SORT_295=63, mask_SORT_297=127, mask_SORT_299=255, mask_SORT_301=511, mask_SORT_303=1023, mask_SORT_305=2047, mask_SORT_41=7, mask_SORT_6=1, state_125=0, state_17=0, state_19=0, state_23=0, state_25=0, state_29=0, state_31=0, state_43=0, state_59=0, var_108=8, var_112=10, var_116=13, var_127=4, var_129=12, var_132=14, var_138=6, var_165=0, var_16=0, var_209=1, var_211=5, var_21=0, var_229=4095, var_39=0, var_40=1, var_42=0, var_45=6, var_47=7, var_49_arg_0=1, var_49_arg_1=1, var_53=1, var_569=1, var_577=0, var_57=2, var_62=9, var_70=15, var_75=1, var_77=3, var_80=5, var_83=7, var_86=11] [L199] EXPR var_49_arg_0 | var_49_arg_1 VAL [input_12=0, input_9=0, mask_SORT_11=15, mask_SORT_1=4095, mask_SORT_289=3, mask_SORT_293=31, mask_SORT_295=63, mask_SORT_297=127, mask_SORT_299=255, mask_SORT_301=511, mask_SORT_303=1023, mask_SORT_305=2047, mask_SORT_41=7, mask_SORT_6=1, state_125=0, state_17=0, state_19=0, state_23=0, state_25=0, state_29=0, state_31=0, state_43=0, state_59=0, var_108=8, var_112=10, var_116=13, var_127=4, var_129=12, var_132=14, var_138=6, var_165=0, var_16=0, var_209=1, var_211=5, var_21=0, var_229=4095, var_39=0, var_40=1, var_42=0, var_45=6, var_47=7, var_53=1, var_569=1, var_577=0, var_57=2, var_62=9, var_70=15, var_75=1, var_77=3, var_80=5, var_83=7, var_86=11] [L199] SORT_6 var_49 = var_49_arg_0 | var_49_arg_1; [L200] SORT_6 var_50_arg_0 = var_40; [L201] SORT_6 var_50_arg_1 = var_49; VAL [input_12=0, input_9=0, mask_SORT_11=15, mask_SORT_1=4095, mask_SORT_289=3, mask_SORT_293=31, mask_SORT_295=63, mask_SORT_297=127, mask_SORT_299=255, mask_SORT_301=511, mask_SORT_303=1023, mask_SORT_305=2047, mask_SORT_41=7, mask_SORT_6=1, state_125=0, state_17=0, state_19=0, state_23=0, state_25=0, state_29=0, state_31=0, state_43=0, state_59=0, var_108=8, var_112=10, var_116=13, var_127=4, var_129=12, var_132=14, var_138=6, var_165=0, var_16=0, var_209=1, var_211=5, var_21=0, var_229=4095, var_39=0, var_42=0, var_45=6, var_47=7, var_50_arg_0=1, var_50_arg_1=1, var_53=1, var_569=1, var_577=0, var_57=2, var_62=9, var_70=15, var_75=1, var_77=3, var_80=5, var_83=7, var_86=11] [L202] EXPR var_50_arg_0 & var_50_arg_1 VAL [input_12=0, input_9=0, mask_SORT_11=15, mask_SORT_1=4095, mask_SORT_289=3, mask_SORT_293=31, mask_SORT_295=63, mask_SORT_297=127, mask_SORT_299=255, mask_SORT_301=511, mask_SORT_303=1023, mask_SORT_305=2047, mask_SORT_41=7, mask_SORT_6=1, state_125=0, state_17=0, state_19=0, state_23=0, state_25=0, state_29=0, state_31=0, state_43=0, state_59=0, var_108=8, var_112=10, var_116=13, var_127=4, var_129=12, var_132=14, var_138=6, var_165=0, var_16=0, var_209=1, var_211=5, var_21=0, var_229=4095, var_39=0, var_42=0, var_45=6, var_47=7, var_53=1, var_569=1, var_577=0, var_57=2, var_62=9, var_70=15, var_75=1, var_77=3, var_80=5, var_83=7, var_86=11] [L202] SORT_6 var_50 = var_50_arg_0 & var_50_arg_1; [L203] SORT_6 var_54_arg_0 = var_50; [L204] SORT_6 var_54 = ~var_54_arg_0; [L205] SORT_6 var_55_arg_0 = var_53; [L206] SORT_6 var_55_arg_1 = var_54; VAL [input_12=0, input_9=0, mask_SORT_11=15, mask_SORT_1=4095, mask_SORT_289=3, mask_SORT_293=31, mask_SORT_295=63, mask_SORT_297=127, mask_SORT_299=255, mask_SORT_301=511, mask_SORT_303=1023, mask_SORT_305=2047, mask_SORT_41=7, mask_SORT_6=1, state_125=0, state_17=0, state_19=0, state_23=0, state_25=0, state_29=0, state_31=0, state_43=0, state_59=0, var_108=8, var_112=10, var_116=13, var_127=4, var_129=12, var_132=14, var_138=6, var_165=0, var_16=0, var_209=1, var_211=5, var_21=0, var_229=4095, var_39=0, var_42=0, var_45=6, var_47=7, var_53=1, var_55_arg_0=1, var_55_arg_1=-2, var_569=1, var_577=0, var_57=2, var_62=9, var_70=15, var_75=1, var_77=3, var_80=5, var_83=7, var_86=11] [L207] EXPR var_55_arg_0 & var_55_arg_1 VAL [input_12=0, input_9=0, mask_SORT_11=15, mask_SORT_1=4095, mask_SORT_289=3, mask_SORT_293=31, mask_SORT_295=63, mask_SORT_297=127, mask_SORT_299=255, mask_SORT_301=511, mask_SORT_303=1023, mask_SORT_305=2047, mask_SORT_41=7, mask_SORT_6=1, state_125=0, state_17=0, state_19=0, state_23=0, state_25=0, state_29=0, state_31=0, state_43=0, state_59=0, var_108=8, var_112=10, var_116=13, var_127=4, var_129=12, var_132=14, var_138=6, var_165=0, var_16=0, var_209=1, var_211=5, var_21=0, var_229=4095, var_39=0, var_42=0, var_45=6, var_47=7, var_53=1, var_569=1, var_577=0, var_57=2, var_62=9, var_70=15, var_75=1, var_77=3, var_80=5, var_83=7, var_86=11] [L207] SORT_6 var_55 = var_55_arg_0 & var_55_arg_1; [L208] EXPR var_55 & mask_SORT_6 VAL [input_12=0, input_9=0, mask_SORT_11=15, mask_SORT_1=4095, mask_SORT_289=3, mask_SORT_293=31, mask_SORT_295=63, mask_SORT_297=127, mask_SORT_299=255, mask_SORT_301=511, mask_SORT_303=1023, mask_SORT_305=2047, mask_SORT_41=7, mask_SORT_6=1, state_125=0, state_17=0, state_19=0, state_23=0, state_25=0, state_29=0, state_31=0, state_43=0, state_59=0, var_108=8, var_112=10, var_116=13, var_127=4, var_129=12, var_132=14, var_138=6, var_165=0, var_16=0, var_209=1, var_211=5, var_21=0, var_229=4095, var_39=0, var_42=0, var_45=6, var_47=7, var_53=1, var_569=1, var_577=0, var_57=2, var_62=9, var_70=15, var_75=1, var_77=3, var_80=5, var_83=7, var_86=11] [L208] var_55 = var_55 & mask_SORT_6 [L209] SORT_6 bad_56_arg_0 = var_55; [L210] CALL __VERIFIER_assert(!(bad_56_arg_0)) [L21] COND TRUE !(cond) [L21] reach_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 1510 locations, 2261 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 7.3s, OverallIterations: 6, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 4.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 11095 SdHoareTripleChecker+Valid, 4.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 11095 mSDsluCounter, 37411 SdHoareTripleChecker+Invalid, 3.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 28040 mSDsCounter, 5 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 7700 IncrementalHoareTripleChecker+Invalid, 7705 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 5 mSolverCounterUnsat, 9371 mSDtfsCounter, 7700 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 37 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1529occurred in iteration=4, InterpolantAutomatonStates: 28, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 5 MinimizatonAttempts, 1465 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.8s InterpolantComputationTime, 235 NumberOfCodeBlocks, 235 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 189 ConstructedInterpolants, 0 QuantifiedInterpolants, 650 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:41:28,020 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_am2910_p1.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 e3ac6f8d68dfadee83df50cc30cff5b03f705d6e7b992071314ad032158be302 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 09:41:29,896 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 09:41:29,969 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Bitvector.epf [2025-03-08 09:41:29,974 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 09:41:29,974 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 09:41:29,994 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 09:41:29,995 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 09:41:29,995 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 09:41:29,995 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 09:41:29,995 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 09:41:29,995 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 09:41:29,996 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 09:41:29,996 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 09:41:29,996 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 09:41:29,997 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 09:41:29,997 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 09:41:29,997 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 09:41:29,997 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 09:41:29,998 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 09:41:29,998 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 09:41:29,998 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 09:41:29,998 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-08 09:41:29,998 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-08 09:41:29,998 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-08 09:41:29,998 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 09:41:29,998 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 09:41:29,998 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 09:41:29,998 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 09:41:29,998 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 09:41:29,998 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 09:41:29,998 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 09:41:29,999 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 09:41:29,999 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 09:41:29,999 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 09:41:29,999 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 09:41:29,999 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 09:41:29,999 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-08 09:41:29,999 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-08 09:41:29,999 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 09:41:29,999 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 09:41:29,999 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 09:41:29,999 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 09:41:29,999 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 -> e3ac6f8d68dfadee83df50cc30cff5b03f705d6e7b992071314ad032158be302 [2025-03-08 09:41:30,241 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 09:41:30,246 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 09:41:30,248 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 09:41:30,248 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 09:41:30,249 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 09:41:30,249 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_am2910_p1.c [2025-03-08 09:41:31,376 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f166e4d3f/818b454054ba41e18d8e42f134dd364d/FLAGbb59f4f71 [2025-03-08 09:41:31,669 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 09:41:31,671 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_arrays_am2910_p1.c [2025-03-08 09:41:31,687 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f166e4d3f/818b454054ba41e18d8e42f134dd364d/FLAGbb59f4f71 [2025-03-08 09:41:31,704 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f166e4d3f/818b454054ba41e18d8e42f134dd364d [2025-03-08 09:41:31,706 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 09:41:31,710 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 09:41:31,711 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 09:41:31,711 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 09:41:31,714 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 09:41:31,715 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 09:41:31" (1/1) ... [2025-03-08 09:41:31,717 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@cb27fab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:41:31, skipping insertion in model container [2025-03-08 09:41:31,717 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 09:41:31" (1/1) ... [2025-03-08 09:41:31,757 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 09:41:31,880 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_am2910_p1.c[1260,1273] [2025-03-08 09:41:32,092 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 09:41:32,101 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 09:41:32,111 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_am2910_p1.c[1260,1273] [2025-03-08 09:41:32,225 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 09:41:32,235 INFO L204 MainTranslator]: Completed translation [2025-03-08 09:41:32,235 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:41:32 WrapperNode [2025-03-08 09:41:32,235 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 09:41:32,236 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 09:41:32,236 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 09:41:32,236 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 09:41:32,240 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:41:32" (1/1) ... [2025-03-08 09:41:32,267 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:41:32" (1/1) ... [2025-03-08 09:41:32,356 INFO L138 Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 1782 [2025-03-08 09:41:32,356 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 09:41:32,357 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 09:41:32,357 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 09:41:32,357 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 09:41:32,362 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:41:32" (1/1) ... [2025-03-08 09:41:32,363 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:41:32" (1/1) ... [2025-03-08 09:41:32,373 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:41:32" (1/1) ... [2025-03-08 09:41:32,410 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:41:32,410 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:41:32" (1/1) ... [2025-03-08 09:41:32,411 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:41:32" (1/1) ... [2025-03-08 09:41:32,444 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:41:32" (1/1) ... [2025-03-08 09:41:32,447 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:41:32" (1/1) ... [2025-03-08 09:41:32,451 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:41:32" (1/1) ... [2025-03-08 09:41:32,456 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:41:32" (1/1) ... [2025-03-08 09:41:32,471 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 09:41:32,471 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 09:41:32,471 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 09:41:32,471 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 09:41:32,472 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:41:32" (1/1) ... [2025-03-08 09:41:32,476 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 09:41:32,484 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 09:41:32,495 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:41:32,502 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:41:32,513 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 09:41:32,513 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-08 09:41:32,513 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 09:41:32,513 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 09:41:32,774 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 09:41:32,775 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 09:41:34,062 INFO L? ?]: Removed 91 outVars from TransFormulas that were not future-live. [2025-03-08 09:41:34,063 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 09:41:34,069 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 09:41:34,070 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 09:41:34,070 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 09:41:34 BoogieIcfgContainer [2025-03-08 09:41:34,070 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 09:41:34,072 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 09:41:34,072 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 09:41:34,075 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 09:41:34,075 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 09:41:31" (1/3) ... [2025-03-08 09:41:34,076 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7d7b1369 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 09:41:34, skipping insertion in model container [2025-03-08 09:41:34,076 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:41:32" (2/3) ... [2025-03-08 09:41:34,077 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7d7b1369 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 09:41:34, skipping insertion in model container [2025-03-08 09:41:34,077 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 09:41:34" (3/3) ... [2025-03-08 09:41:34,078 INFO L128 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.vis_arrays_am2910_p1.c [2025-03-08 09:41:34,088 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 09:41:34,089 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG btor2c-lazyMod.vis_arrays_am2910_p1.c that has 1 procedures, 10 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-08 09:41:34,123 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 09:41:34,130 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;@5fd870d6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 09:41:34,131 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 09:41:34,134 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:41:34,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2025-03-08 09:41:34,137 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 09:41:34,137 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2025-03-08 09:41:34,138 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 09:41:34,141 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 09:41:34,142 INFO L85 PathProgramCache]: Analyzing trace with hash 38140359, now seen corresponding path program 1 times [2025-03-08 09:41:34,149 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 09:41:34,150 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [571137216] [2025-03-08 09:41:34,150 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 09:41:34,150 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 09:41:34,150 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 09:41:34,152 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:41:34,153 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:41:34,466 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-08 09:41:34,493 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-08 09:41:34,493 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 09:41:34,493 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 09:41:34,500 INFO L256 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 41 conjuncts are in the unsatisfiable core [2025-03-08 09:41:34,512 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 09:41:34,749 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:41:34,751 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 09:41:34,751 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 09:41:34,751 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [571137216] [2025-03-08 09:41:34,752 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [571137216] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 09:41:34,752 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 09:41:34,752 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 09:41:34,753 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1689376651] [2025-03-08 09:41:34,753 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 09:41:34,755 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 09:41:34,755 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 09:41:34,767 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 09:41:34,769 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 09:41:34,770 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:41:34,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 09:41:34,870 INFO L93 Difference]: Finished difference Result 18 states and 23 transitions. [2025-03-08 09:41:34,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 09:41:34,872 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:41:34,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 09:41:34,876 INFO L225 Difference]: With dead ends: 18 [2025-03-08 09:41:34,876 INFO L226 Difference]: Without dead ends: 10 [2025-03-08 09:41:34,878 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:41:34,880 INFO L435 NwaCegarLoop]: 4 mSDtfsCounter, 2 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 11 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 09:41:34,883 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 11 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 09:41:34,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2025-03-08 09:41:34,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 9. [2025-03-08 09:41:34,899 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:41:34,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2025-03-08 09:41:34,903 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 5 [2025-03-08 09:41:34,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 09:41:34,903 INFO L471 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2025-03-08 09:41:34,903 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:41:34,903 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2025-03-08 09:41:34,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-03-08 09:41:34,904 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 09:41:34,904 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2025-03-08 09:41:34,911 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:41:35,108 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:41:35,108 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 09:41:35,108 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 09:41:35,109 INFO L85 PathProgramCache]: Analyzing trace with hash -1926026653, now seen corresponding path program 1 times [2025-03-08 09:41:35,111 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 09:41:35,111 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [265925868] [2025-03-08 09:41:35,111 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 09:41:35,111 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 09:41:35,111 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 09:41:35,113 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:41:35,115 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:41:35,494 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-08 09:41:35,562 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-08 09:41:35,562 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 09:41:35,562 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 09:41:35,571 INFO L256 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 61 conjuncts are in the unsatisfiable core [2025-03-08 09:41:35,583 INFO L279 TraceCheckSpWp]: Computing forward predicates...