./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_arrays_vsaR_p02.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 48c9605d Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_arrays_vsaR_p02.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash c9237163e2805f66062dc578af6664f7122718fcb3464bd31fd071298f5647b0 --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-08 00:14:57,302 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-08 00:14:57,341 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2025-02-08 00:14:57,345 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-08 00:14:57,345 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-08 00:14:57,363 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-08 00:14:57,363 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-08 00:14:57,363 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-08 00:14:57,363 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-08 00:14:57,363 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-08 00:14:57,363 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-08 00:14:57,363 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-08 00:14:57,364 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-08 00:14:57,364 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-08 00:14:57,364 INFO L153 SettingsManager]: * Use SBE=true [2025-02-08 00:14:57,364 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-08 00:14:57,364 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-08 00:14:57,364 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-08 00:14:57,364 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-08 00:14:57,364 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-08 00:14:57,364 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-08 00:14:57,364 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-08 00:14:57,364 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-08 00:14:57,364 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-08 00:14:57,364 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-08 00:14:57,364 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-08 00:14:57,364 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-08 00:14:57,365 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-08 00:14:57,365 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-08 00:14:57,365 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 00:14:57,365 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-08 00:14:57,365 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-08 00:14:57,365 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-08 00:14:57,365 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-08 00:14:57,365 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-08 00:14:57,365 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-08 00:14:57,365 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-08 00:14:57,365 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-08 00:14:57,365 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-08 00:14:57,365 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-08 00:14:57,365 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> c9237163e2805f66062dc578af6664f7122718fcb3464bd31fd071298f5647b0 [2025-02-08 00:14:57,551 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-08 00:14:57,556 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-08 00:14:57,557 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-08 00:14:57,558 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-08 00:14:57,558 INFO L274 PluginConnector]: CDTParser initialized [2025-02-08 00:14:57,559 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_arrays_vsaR_p02.c [2025-02-08 00:14:58,691 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/e25d3d36c/0b3e51b6f1b5463483efffeb58dff2c1/FLAG9ebb65f29 [2025-02-08 00:14:58,971 INFO L384 CDTParser]: Found 1 translation units. [2025-02-08 00:14:58,975 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_arrays_vsaR_p02.c [2025-02-08 00:14:58,996 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/e25d3d36c/0b3e51b6f1b5463483efffeb58dff2c1/FLAG9ebb65f29 [2025-02-08 00:14:59,252 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/e25d3d36c/0b3e51b6f1b5463483efffeb58dff2c1 [2025-02-08 00:14:59,254 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-08 00:14:59,255 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-08 00:14:59,256 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-08 00:14:59,256 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-08 00:14:59,259 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-08 00:14:59,260 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 12:14:59" (1/1) ... [2025-02-08 00:14:59,260 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2cf2b30e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:14:59, skipping insertion in model container [2025-02-08 00:14:59,261 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 12:14:59" (1/1) ... [2025-02-08 00:14:59,297 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-08 00:14:59,443 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_arrays_vsaR_p02.c[1259,1272] [2025-02-08 00:14:59,648 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 00:14:59,661 INFO L200 MainTranslator]: Completed pre-run [2025-02-08 00:14:59,669 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_arrays_vsaR_p02.c[1259,1272] [2025-02-08 00:14:59,740 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 00:14:59,750 INFO L204 MainTranslator]: Completed translation [2025-02-08 00:14:59,751 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:14:59 WrapperNode [2025-02-08 00:14:59,751 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-08 00:14:59,752 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-08 00:14:59,752 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-08 00:14:59,752 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-08 00:14:59,756 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:14:59" (1/1) ... [2025-02-08 00:14:59,794 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:14:59" (1/1) ... [2025-02-08 00:14:59,986 INFO L138 Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 2113 [2025-02-08 00:14:59,986 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-08 00:14:59,987 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-08 00:14:59,987 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-08 00:14:59,987 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-08 00:14:59,993 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:14:59" (1/1) ... [2025-02-08 00:14:59,993 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:14:59" (1/1) ... [2025-02-08 00:15:00,026 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:14:59" (1/1) ... [2025-02-08 00:15:00,082 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-02-08 00:15:00,083 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:14:59" (1/1) ... [2025-02-08 00:15:00,083 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:14:59" (1/1) ... [2025-02-08 00:15:00,128 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:14:59" (1/1) ... [2025-02-08 00:15:00,141 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:14:59" (1/1) ... [2025-02-08 00:15:00,156 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:14:59" (1/1) ... [2025-02-08 00:15:00,210 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:14:59" (1/1) ... [2025-02-08 00:15:00,239 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-08 00:15:00,240 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-08 00:15:00,241 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-08 00:15:00,241 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-08 00:15:00,242 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:14:59" (1/1) ... [2025-02-08 00:15:00,248 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 00:15:00,258 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 00:15:00,271 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-08 00:15:00,279 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-08 00:15:00,295 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-08 00:15:00,295 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-08 00:15:00,296 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-08 00:15:00,296 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-08 00:15:00,553 INFO L257 CfgBuilder]: Building ICFG [2025-02-08 00:15:00,556 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-08 00:15:02,615 INFO L? ?]: Removed 1322 outVars from TransFormulas that were not future-live. [2025-02-08 00:15:02,615 INFO L308 CfgBuilder]: Performing block encoding [2025-02-08 00:15:02,709 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-08 00:15:02,712 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-08 00:15:02,713 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 12:15:02 BoogieIcfgContainer [2025-02-08 00:15:02,713 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-08 00:15:02,715 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-08 00:15:02,715 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-08 00:15:02,719 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-08 00:15:02,719 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.02 12:14:59" (1/3) ... [2025-02-08 00:15:02,719 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@224da0bd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 12:15:02, skipping insertion in model container [2025-02-08 00:15:02,720 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:14:59" (2/3) ... [2025-02-08 00:15:02,720 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@224da0bd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 12:15:02, skipping insertion in model container [2025-02-08 00:15:02,720 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 12:15:02" (3/3) ... [2025-02-08 00:15:02,721 INFO L128 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.vis_arrays_vsaR_p02.c [2025-02-08 00:15:02,733 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-08 00:15:02,735 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG btor2c-lazyMod.vis_arrays_vsaR_p02.c that has 1 procedures, 529 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-08 00:15:02,782 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 00:15:02,789 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;@2b117b34, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 00:15:02,790 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-08 00:15:02,795 INFO L276 IsEmpty]: Start isEmpty. Operand has 529 states, 527 states have (on average 1.5009487666034156) internal successors, (791), 528 states have internal predecessors, (791), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:15:02,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-02-08 00:15:02,799 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 00:15:02,799 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-02-08 00:15:02,800 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 00:15:02,803 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:15:02,803 INFO L85 PathProgramCache]: Analyzing trace with hash -1728801492, now seen corresponding path program 1 times [2025-02-08 00:15:02,808 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 00:15:02,810 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [392282400] [2025-02-08 00:15:02,810 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:15:02,810 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 00:15:02,875 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-02-08 00:15:02,940 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-02-08 00:15:02,940 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:15:02,940 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:15:03,315 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 00:15:03,316 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 00:15:03,316 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [392282400] [2025-02-08 00:15:03,316 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [392282400] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 00:15:03,317 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 00:15:03,317 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 00:15:03,318 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [418196913] [2025-02-08 00:15:03,319 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 00:15:03,321 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 00:15:03,321 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 00:15:03,334 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 00:15:03,335 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 00:15:03,337 INFO L87 Difference]: Start difference. First operand has 529 states, 527 states have (on average 1.5009487666034156) internal successors, (791), 528 states have internal predecessors, (791), 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 10.0) internal successors, (40), 4 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-02-08 00:15:03,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 00:15:03,746 INFO L93 Difference]: Finished difference Result 1005 states and 1505 transitions. [2025-02-08 00:15:03,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 00:15:03,748 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 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-02-08 00:15:03,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 00:15:03,755 INFO L225 Difference]: With dead ends: 1005 [2025-02-08 00:15:03,756 INFO L226 Difference]: Without dead ends: 529 [2025-02-08 00:15:03,759 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 00:15:03,761 INFO L435 NwaCegarLoop]: 656 mSDtfsCounter, 0 mSDsluCounter, 1307 mSDsCounter, 0 mSdLazyCounter, 400 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1963 SdHoareTripleChecker+Invalid, 400 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 400 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-08 00:15:03,761 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1963 Invalid, 400 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 400 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-08 00:15:03,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 529 states. [2025-02-08 00:15:03,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 529 to 529. [2025-02-08 00:15:03,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 529 states, 528 states have (on average 1.496212121212121) internal successors, (790), 528 states have internal predecessors, (790), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:15:03,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 529 states to 529 states and 790 transitions. [2025-02-08 00:15:03,821 INFO L78 Accepts]: Start accepts. Automaton has 529 states and 790 transitions. Word has length 40 [2025-02-08 00:15:03,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 00:15:03,825 INFO L471 AbstractCegarLoop]: Abstraction has 529 states and 790 transitions. [2025-02-08 00:15:03,825 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 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-02-08 00:15:03,825 INFO L276 IsEmpty]: Start isEmpty. Operand 529 states and 790 transitions. [2025-02-08 00:15:03,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2025-02-08 00:15:03,826 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 00:15:03,826 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-02-08 00:15:03,826 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-08 00:15:03,826 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 00:15:03,827 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:15:03,827 INFO L85 PathProgramCache]: Analyzing trace with hash -2048558771, now seen corresponding path program 1 times [2025-02-08 00:15:03,827 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 00:15:03,827 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1398497726] [2025-02-08 00:15:03,831 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:15:03,832 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 00:15:03,873 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-02-08 00:15:03,890 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-02-08 00:15:03,890 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:15:03,890 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:15:04,023 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 00:15:04,024 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 00:15:04,024 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1398497726] [2025-02-08 00:15:04,024 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1398497726] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 00:15:04,024 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 00:15:04,024 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 00:15:04,024 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [164756583] [2025-02-08 00:15:04,025 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 00:15:04,025 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 00:15:04,025 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 00:15:04,027 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 00:15:04,027 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 00:15:04,027 INFO L87 Difference]: Start difference. First operand 529 states and 790 transitions. Second operand has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:15:04,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 00:15:04,291 INFO L93 Difference]: Finished difference Result 1007 states and 1504 transitions. [2025-02-08 00:15:04,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 00:15:04,292 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 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 41 [2025-02-08 00:15:04,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 00:15:04,294 INFO L225 Difference]: With dead ends: 1007 [2025-02-08 00:15:04,294 INFO L226 Difference]: Without dead ends: 531 [2025-02-08 00:15:04,294 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 00:15:04,295 INFO L435 NwaCegarLoop]: 656 mSDtfsCounter, 0 mSDsluCounter, 1304 mSDsCounter, 0 mSdLazyCounter, 403 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1960 SdHoareTripleChecker+Invalid, 403 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 403 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-08 00:15:04,295 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1960 Invalid, 403 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 403 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-08 00:15:04,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 531 states. [2025-02-08 00:15:04,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 531 to 531. [2025-02-08 00:15:04,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 531 states, 530 states have (on average 1.4943396226415093) internal successors, (792), 530 states have internal predecessors, (792), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:15:04,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 531 states to 531 states and 792 transitions. [2025-02-08 00:15:04,306 INFO L78 Accepts]: Start accepts. Automaton has 531 states and 792 transitions. Word has length 41 [2025-02-08 00:15:04,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 00:15:04,306 INFO L471 AbstractCegarLoop]: Abstraction has 531 states and 792 transitions. [2025-02-08 00:15:04,306 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:15:04,307 INFO L276 IsEmpty]: Start isEmpty. Operand 531 states and 792 transitions. [2025-02-08 00:15:04,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2025-02-08 00:15:04,307 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 00:15:04,307 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 00:15:04,308 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-08 00:15:04,308 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 00:15:04,308 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:15:04,308 INFO L85 PathProgramCache]: Analyzing trace with hash -1444269753, now seen corresponding path program 1 times [2025-02-08 00:15:04,308 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 00:15:04,308 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [324708403] [2025-02-08 00:15:04,309 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:15:04,309 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 00:15:04,336 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-02-08 00:15:04,370 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-02-08 00:15:04,371 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:15:04,371 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:15:04,637 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 00:15:04,637 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 00:15:04,637 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [324708403] [2025-02-08 00:15:04,637 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [324708403] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 00:15:04,638 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 00:15:04,638 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 00:15:04,638 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [805955727] [2025-02-08 00:15:04,638 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 00:15:04,638 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 00:15:04,638 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 00:15:04,638 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 00:15:04,638 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-08 00:15:04,638 INFO L87 Difference]: Start difference. First operand 531 states and 792 transitions. Second operand has 5 states, 5 states have (on average 8.4) internal successors, (42), 4 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:15:04,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 00:15:04,926 INFO L93 Difference]: Finished difference Result 1013 states and 1511 transitions. [2025-02-08 00:15:04,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 00:15:04,926 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 4 states have internal predecessors, (42), 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 42 [2025-02-08 00:15:04,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 00:15:04,928 INFO L225 Difference]: With dead ends: 1013 [2025-02-08 00:15:04,928 INFO L226 Difference]: Without dead ends: 535 [2025-02-08 00:15:04,929 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 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-02-08 00:15:04,929 INFO L435 NwaCegarLoop]: 652 mSDtfsCounter, 761 mSDsluCounter, 1298 mSDsCounter, 0 mSdLazyCounter, 413 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 761 SdHoareTripleChecker+Valid, 1950 SdHoareTripleChecker+Invalid, 413 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 413 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-08 00:15:04,929 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [761 Valid, 1950 Invalid, 413 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 413 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-08 00:15:04,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 535 states. [2025-02-08 00:15:04,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 535 to 534. [2025-02-08 00:15:04,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 534 states, 533 states have (on average 1.4934333958724202) internal successors, (796), 533 states have internal predecessors, (796), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:15:04,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 534 states to 534 states and 796 transitions. [2025-02-08 00:15:04,947 INFO L78 Accepts]: Start accepts. Automaton has 534 states and 796 transitions. Word has length 42 [2025-02-08 00:15:04,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 00:15:04,947 INFO L471 AbstractCegarLoop]: Abstraction has 534 states and 796 transitions. [2025-02-08 00:15:04,947 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 4 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:15:04,947 INFO L276 IsEmpty]: Start isEmpty. Operand 534 states and 796 transitions. [2025-02-08 00:15:04,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2025-02-08 00:15:04,948 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 00:15:04,948 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 00:15:04,948 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-08 00:15:04,948 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 00:15:04,949 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:15:04,949 INFO L85 PathProgramCache]: Analyzing trace with hash 58189568, now seen corresponding path program 1 times [2025-02-08 00:15:04,949 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 00:15:04,949 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [963295130] [2025-02-08 00:15:04,949 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:15:04,949 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 00:15:04,999 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-02-08 00:15:05,042 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-02-08 00:15:05,042 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:15:05,042 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:15:05,500 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 00:15:05,500 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 00:15:05,500 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [963295130] [2025-02-08 00:15:05,500 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [963295130] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 00:15:05,500 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 00:15:05,500 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-08 00:15:05,500 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [286866304] [2025-02-08 00:15:05,500 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 00:15:05,500 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-08 00:15:05,500 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 00:15:05,501 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-08 00:15:05,501 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-02-08 00:15:05,501 INFO L87 Difference]: Start difference. First operand 534 states and 796 transitions. Second operand has 7 states, 7 states have (on average 6.142857142857143) internal successors, (43), 6 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:15:06,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 00:15:06,002 INFO L93 Difference]: Finished difference Result 1024 states and 1526 transitions. [2025-02-08 00:15:06,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-08 00:15:06,003 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.142857142857143) internal successors, (43), 6 states have internal predecessors, (43), 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 43 [2025-02-08 00:15:06,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 00:15:06,010 INFO L225 Difference]: With dead ends: 1024 [2025-02-08 00:15:06,010 INFO L226 Difference]: Without dead ends: 543 [2025-02-08 00:15:06,011 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-02-08 00:15:06,012 INFO L435 NwaCegarLoop]: 648 mSDtfsCounter, 771 mSDsluCounter, 1938 mSDsCounter, 0 mSdLazyCounter, 570 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 771 SdHoareTripleChecker+Valid, 2586 SdHoareTripleChecker+Invalid, 570 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 570 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-08 00:15:06,017 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [771 Valid, 2586 Invalid, 570 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 570 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-08 00:15:06,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 543 states. [2025-02-08 00:15:06,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 543 to 538. [2025-02-08 00:15:06,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 538 states, 537 states have (on average 1.4916201117318435) internal successors, (801), 537 states have internal predecessors, (801), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:15:06,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 538 states to 538 states and 801 transitions. [2025-02-08 00:15:06,043 INFO L78 Accepts]: Start accepts. Automaton has 538 states and 801 transitions. Word has length 43 [2025-02-08 00:15:06,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 00:15:06,043 INFO L471 AbstractCegarLoop]: Abstraction has 538 states and 801 transitions. [2025-02-08 00:15:06,043 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.142857142857143) internal successors, (43), 6 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:15:06,043 INFO L276 IsEmpty]: Start isEmpty. Operand 538 states and 801 transitions. [2025-02-08 00:15:06,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2025-02-08 00:15:06,044 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 00:15:06,044 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 00:15:06,044 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-08 00:15:06,044 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 00:15:06,044 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:15:06,044 INFO L85 PathProgramCache]: Analyzing trace with hash 65673906, now seen corresponding path program 1 times [2025-02-08 00:15:06,045 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 00:15:06,045 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2036125446] [2025-02-08 00:15:06,045 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:15:06,045 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 00:15:06,086 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-02-08 00:15:06,101 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-02-08 00:15:06,101 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:15:06,101 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:15:06,252 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 00:15:06,252 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 00:15:06,252 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2036125446] [2025-02-08 00:15:06,252 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2036125446] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 00:15:06,252 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 00:15:06,252 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-08 00:15:06,253 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [89645656] [2025-02-08 00:15:06,253 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 00:15:06,253 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-08 00:15:06,253 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 00:15:06,253 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-08 00:15:06,253 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-02-08 00:15:06,254 INFO L87 Difference]: Start difference. First operand 538 states and 801 transitions. Second operand has 7 states, 7 states have (on average 6.142857142857143) internal successors, (43), 6 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:15:06,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 00:15:06,674 INFO L93 Difference]: Finished difference Result 1023 states and 1523 transitions. [2025-02-08 00:15:06,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-08 00:15:06,674 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.142857142857143) internal successors, (43), 6 states have internal predecessors, (43), 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 43 [2025-02-08 00:15:06,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 00:15:06,676 INFO L225 Difference]: With dead ends: 1023 [2025-02-08 00:15:06,676 INFO L226 Difference]: Without dead ends: 538 [2025-02-08 00:15:06,677 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2025-02-08 00:15:06,677 INFO L435 NwaCegarLoop]: 646 mSDtfsCounter, 764 mSDsluCounter, 2572 mSDsCounter, 0 mSdLazyCounter, 702 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 764 SdHoareTripleChecker+Valid, 3218 SdHoareTripleChecker+Invalid, 704 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 702 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-08 00:15:06,677 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [764 Valid, 3218 Invalid, 704 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 702 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-08 00:15:06,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 538 states. [2025-02-08 00:15:06,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 538 to 535. [2025-02-08 00:15:06,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 535 states, 534 states have (on average 1.4906367041198503) internal successors, (796), 534 states have internal predecessors, (796), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:15:06,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 535 states to 535 states and 796 transitions. [2025-02-08 00:15:06,686 INFO L78 Accepts]: Start accepts. Automaton has 535 states and 796 transitions. Word has length 43 [2025-02-08 00:15:06,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 00:15:06,686 INFO L471 AbstractCegarLoop]: Abstraction has 535 states and 796 transitions. [2025-02-08 00:15:06,686 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.142857142857143) internal successors, (43), 6 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:15:06,686 INFO L276 IsEmpty]: Start isEmpty. Operand 535 states and 796 transitions. [2025-02-08 00:15:06,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2025-02-08 00:15:06,687 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 00:15:06,687 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 00:15:06,687 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-08 00:15:06,687 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 00:15:06,687 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:15:06,687 INFO L85 PathProgramCache]: Analyzing trace with hash -1566762320, now seen corresponding path program 1 times [2025-02-08 00:15:06,687 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 00:15:06,688 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [872361767] [2025-02-08 00:15:06,688 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:15:06,688 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 00:15:06,703 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-02-08 00:15:06,737 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-02-08 00:15:06,737 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:15:06,738 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:15:06,840 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 00:15:06,840 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 00:15:06,840 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [872361767] [2025-02-08 00:15:06,840 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [872361767] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 00:15:06,840 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 00:15:06,840 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 00:15:06,841 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1387727188] [2025-02-08 00:15:06,841 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 00:15:06,841 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 00:15:06,841 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 00:15:06,841 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 00:15:06,841 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-08 00:15:06,841 INFO L87 Difference]: Start difference. First operand 535 states and 796 transitions. Second operand has 5 states, 5 states have (on average 8.8) internal successors, (44), 4 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:15:07,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 00:15:07,403 INFO L93 Difference]: Finished difference Result 1113 states and 1651 transitions. [2025-02-08 00:15:07,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 00:15:07,403 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.8) internal successors, (44), 4 states have internal predecessors, (44), 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 44 [2025-02-08 00:15:07,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 00:15:07,406 INFO L225 Difference]: With dead ends: 1113 [2025-02-08 00:15:07,406 INFO L226 Difference]: Without dead ends: 631 [2025-02-08 00:15:07,408 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-02-08 00:15:07,408 INFO L435 NwaCegarLoop]: 502 mSDtfsCounter, 1014 mSDsluCounter, 1000 mSDsCounter, 0 mSdLazyCounter, 858 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1014 SdHoareTripleChecker+Valid, 1502 SdHoareTripleChecker+Invalid, 859 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 858 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-08 00:15:07,409 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1014 Valid, 1502 Invalid, 859 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 858 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-08 00:15:07,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 631 states. [2025-02-08 00:15:07,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 631 to 543. [2025-02-08 00:15:07,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 543 states, 542 states have (on average 1.4870848708487086) internal successors, (806), 542 states have internal predecessors, (806), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:15:07,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 543 states to 543 states and 806 transitions. [2025-02-08 00:15:07,424 INFO L78 Accepts]: Start accepts. Automaton has 543 states and 806 transitions. Word has length 44 [2025-02-08 00:15:07,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 00:15:07,424 INFO L471 AbstractCegarLoop]: Abstraction has 543 states and 806 transitions. [2025-02-08 00:15:07,424 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.8) internal successors, (44), 4 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:15:07,424 INFO L276 IsEmpty]: Start isEmpty. Operand 543 states and 806 transitions. [2025-02-08 00:15:07,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2025-02-08 00:15:07,425 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 00:15:07,425 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 00:15:07,425 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-08 00:15:07,425 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 00:15:07,425 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:15:07,425 INFO L85 PathProgramCache]: Analyzing trace with hash -378197259, now seen corresponding path program 1 times [2025-02-08 00:15:07,425 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 00:15:07,425 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [168725699] [2025-02-08 00:15:07,425 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:15:07,425 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 00:15:07,443 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-02-08 00:15:07,459 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-02-08 00:15:07,459 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:15:07,459 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 00:15:07,459 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 00:15:07,466 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-02-08 00:15:07,481 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-02-08 00:15:07,481 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:15:07,481 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 00:15:07,525 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 00:15:07,525 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-08 00:15:07,526 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-02-08 00:15:07,527 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-08 00:15:07,529 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2025-02-08 00:15:07,551 WARN L310 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2025-02-08 00:15:07,557 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-08 00:15:07,559 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.02 12:15:07 BoogieIcfgContainer [2025-02-08 00:15:07,559 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-08 00:15:07,559 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-08 00:15:07,560 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-08 00:15:07,560 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-08 00:15:07,560 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 12:15:02" (3/4) ... [2025-02-08 00:15:07,562 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-02-08 00:15:07,566 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-08 00:15:07,567 INFO L158 Benchmark]: Toolchain (without parser) took 8311.67ms. Allocated memory was 142.6MB in the beginning and 251.7MB in the end (delta: 109.1MB). Free memory was 111.8MB in the beginning and 53.2MB in the end (delta: 58.6MB). Peak memory consumption was 171.6MB. Max. memory is 16.1GB. [2025-02-08 00:15:07,567 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 226.5MB. Free memory is still 148.6MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 00:15:07,567 INFO L158 Benchmark]: CACSL2BoogieTranslator took 494.94ms. Allocated memory is still 142.6MB. Free memory was 111.3MB in the beginning and 68.3MB in the end (delta: 43.0MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. [2025-02-08 00:15:07,568 INFO L158 Benchmark]: Boogie Procedure Inliner took 234.86ms. Allocated memory is still 142.6MB. Free memory was 68.3MB in the beginning and 75.4MB in the end (delta: -7.1MB). Peak memory consumption was 54.4MB. Max. memory is 16.1GB. [2025-02-08 00:15:07,568 INFO L158 Benchmark]: Boogie Preprocessor took 252.82ms. Allocated memory is still 142.6MB. Free memory was 75.4MB in the beginning and 75.6MB in the end (delta: -165.3kB). Peak memory consumption was 49.2MB. Max. memory is 16.1GB. [2025-02-08 00:15:07,568 INFO L158 Benchmark]: IcfgBuilder took 2472.82ms. Allocated memory was 142.6MB in the beginning and 234.9MB in the end (delta: 92.3MB). Free memory was 75.6MB in the beginning and 119.5MB in the end (delta: -43.9MB). Peak memory consumption was 132.0MB. Max. memory is 16.1GB. [2025-02-08 00:15:07,568 INFO L158 Benchmark]: TraceAbstraction took 4844.22ms. Allocated memory was 234.9MB in the beginning and 251.7MB in the end (delta: 16.8MB). Free memory was 119.5MB in the beginning and 53.2MB in the end (delta: 66.3MB). Peak memory consumption was 79.1MB. Max. memory is 16.1GB. [2025-02-08 00:15:07,568 INFO L158 Benchmark]: Witness Printer took 7.00ms. Allocated memory is still 251.7MB. Free memory was 53.2MB in the beginning and 53.2MB in the end (delta: 21.6kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-08 00:15:07,569 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.20ms. Allocated memory is still 226.5MB. Free memory is still 148.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 494.94ms. Allocated memory is still 142.6MB. Free memory was 111.3MB in the beginning and 68.3MB in the end (delta: 43.0MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 234.86ms. Allocated memory is still 142.6MB. Free memory was 68.3MB in the beginning and 75.4MB in the end (delta: -7.1MB). Peak memory consumption was 54.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 252.82ms. Allocated memory is still 142.6MB. Free memory was 75.4MB in the beginning and 75.6MB in the end (delta: -165.3kB). Peak memory consumption was 49.2MB. Max. memory is 16.1GB. * IcfgBuilder took 2472.82ms. Allocated memory was 142.6MB in the beginning and 234.9MB in the end (delta: 92.3MB). Free memory was 75.6MB in the beginning and 119.5MB in the end (delta: -43.9MB). Peak memory consumption was 132.0MB. Max. memory is 16.1GB. * TraceAbstraction took 4844.22ms. Allocated memory was 234.9MB in the beginning and 251.7MB in the end (delta: 16.8MB). Free memory was 119.5MB in the beginning and 53.2MB in the end (delta: 66.3MB). Peak memory consumption was 79.1MB. Max. memory is 16.1GB. * Witness Printer took 7.00ms. Allocated memory is still 251.7MB. Free memory was 53.2MB in the beginning and 53.2MB in the end (delta: 21.6kB). 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 165. Possible FailurePath: [L26] const SORT_1 mask_SORT_1 = (SORT_1)-1 >> (sizeof(SORT_1) * 8 - 1); [L27] const SORT_1 msb_SORT_1 = (SORT_1)1 << (1 - 1); [L29] const SORT_3 mask_SORT_3 = (SORT_3)-1 >> (sizeof(SORT_3) * 8 - 5); [L30] const SORT_3 msb_SORT_3 = (SORT_3)1 << (5 - 1); [L32] const SORT_5 mask_SORT_5 = (SORT_5)-1 >> (sizeof(SORT_5) * 8 - 12); [L33] const SORT_5 msb_SORT_5 = (SORT_5)1 << (12 - 1); [L35] const SORT_45 mask_SORT_45 = (SORT_45)-1 >> (sizeof(SORT_45) * 8 - 3); [L36] const SORT_45 msb_SORT_45 = (SORT_45)1 << (3 - 1); [L38] const SORT_86 mask_SORT_86 = (SORT_86)-1 >> (sizeof(SORT_86) * 8 - 4); [L39] const SORT_86 msb_SORT_86 = (SORT_86)1 << (4 - 1); [L41] const SORT_143 mask_SORT_143 = (SORT_143)-1 >> (sizeof(SORT_143) * 8 - 32); [L42] const SORT_143 msb_SORT_143 = (SORT_143)1 << (32 - 1); [L44] const SORT_167 mask_SORT_167 = (SORT_167)-1 >> (sizeof(SORT_167) * 8 - 2); [L45] const SORT_167 msb_SORT_167 = (SORT_167)1 << (2 - 1); [L47] const SORT_3 var_7 = 0; [L48] const SORT_1 var_11 = 0; [L49] const SORT_1 var_20 = 1; [L50] const SORT_5 var_32 = 0; [L51] const SORT_45 var_46 = 0; [L52] const SORT_45 var_50 = 2; [L53] const SORT_45 var_54 = 1; [L54] const SORT_45 var_59 = 4; [L55] const SORT_45 var_61 = 5; [L56] const SORT_45 var_65 = 3; [L57] const SORT_3 var_73 = 2; [L58] const SORT_45 var_103 = 7; [L59] const SORT_45 var_108 = 6; [L60] const SORT_143 var_145 = 0; [L61] const SORT_3 var_176 = 31; [L63] SORT_1 input_2; [L64] SORT_3 input_4; [L65] SORT_5 input_6; [L66] SORT_3 input_164; [L67] SORT_3 input_165; [L68] SORT_3 input_166; [L69] SORT_3 input_175; [L70] SORT_3 input_185; [L71] SORT_3 input_186; [L72] SORT_3 input_187; [L73] SORT_3 input_190; [L74] SORT_3 input_209; [L75] SORT_3 input_210; [L76] SORT_3 input_211; [L77] SORT_3 input_214; [L78] SORT_3 input_216; [L79] SORT_167 input_230; [L80] SORT_167 input_231; [L81] SORT_167 input_232; [L83] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_167=3, mask_SORT_1=1, mask_SORT_3=31, mask_SORT_45=7, mask_SORT_5=4095, mask_SORT_86=15, var_103=7, var_108=6, var_11=0, var_145=0, var_176=31, var_20=1, var_32=0, var_46=0, var_50=2, var_54=1, var_59=4, var_61=5, var_65=3, var_73=2, var_7=0] [L83] SORT_3 state_8 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L84] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_167=3, mask_SORT_1=1, mask_SORT_3=31, mask_SORT_45=7, mask_SORT_5=4095, mask_SORT_86=15, var_103=7, var_108=6, var_11=0, var_145=0, var_176=31, var_20=1, var_32=0, var_46=0, var_50=2, var_54=1, var_59=4, var_61=5, var_65=3, var_73=2, var_7=0] [L84] SORT_3 state_13 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L85] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_167=3, mask_SORT_1=1, mask_SORT_3=31, mask_SORT_45=7, mask_SORT_5=4095, mask_SORT_86=15, var_103=7, var_108=6, var_11=0, var_145=0, var_176=31, var_20=1, var_32=0, var_46=0, var_50=2, var_54=1, var_59=4, var_61=5, var_65=3, var_73=2, var_7=0] [L85] SORT_3 state_24 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L86] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_167=3, mask_SORT_1=1, mask_SORT_3=31, mask_SORT_45=7, mask_SORT_5=4095, mask_SORT_86=15, var_103=7, var_108=6, var_11=0, var_145=0, var_176=31, var_20=1, var_32=0, var_46=0, var_50=2, var_54=1, var_59=4, var_61=5, var_65=3, var_73=2, var_7=0] [L86] SORT_3 state_26 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L87] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_167=3, mask_SORT_1=1, mask_SORT_3=31, mask_SORT_45=7, mask_SORT_5=4095, mask_SORT_86=15, var_103=7, var_108=6, var_11=0, var_145=0, var_176=31, var_20=1, var_32=0, var_46=0, var_50=2, var_54=1, var_59=4, var_61=5, var_65=3, var_73=2, var_7=0] [L87] SORT_3 state_28 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L88] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_167=3, mask_SORT_1=1, mask_SORT_3=31, mask_SORT_45=7, mask_SORT_5=4095, mask_SORT_86=15, var_103=7, var_108=6, var_11=0, var_145=0, var_176=31, var_20=1, var_32=0, var_46=0, var_50=2, var_54=1, var_59=4, var_61=5, var_65=3, var_73=2, var_7=0] [L88] SORT_1 state_30 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L89] EXPR __VERIFIER_nondet_ushort() & mask_SORT_5 VAL [mask_SORT_167=3, mask_SORT_1=1, mask_SORT_3=31, mask_SORT_45=7, mask_SORT_86=15, var_103=7, var_108=6, var_11=0, var_145=0, var_176=31, var_20=1, var_32=0, var_46=0, var_50=2, var_54=1, var_59=4, var_61=5, var_65=3, var_73=2, var_7=0] [L89] SORT_5 state_33 = __VERIFIER_nondet_ushort() & mask_SORT_5; [L90] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_167=3, mask_SORT_1=1, mask_SORT_3=31, mask_SORT_45=7, mask_SORT_86=15, var_103=7, var_108=6, var_11=0, var_145=0, var_176=31, var_20=1, var_32=0, var_46=0, var_50=2, var_54=1, var_59=4, var_61=5, var_65=3, var_73=2, var_7=0] [L90] SORT_3 state_35 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L91] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_167=3, mask_SORT_1=1, mask_SORT_3=31, mask_SORT_45=7, mask_SORT_86=15, var_103=7, var_108=6, var_11=0, var_145=0, var_176=31, var_20=1, var_32=0, var_46=0, var_50=2, var_54=1, var_59=4, var_61=5, var_65=3, var_73=2, var_7=0] [L91] SORT_3 state_37 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L92] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_167=3, mask_SORT_1=1, mask_SORT_3=31, mask_SORT_45=7, mask_SORT_86=15, var_103=7, var_108=6, var_11=0, var_145=0, var_176=31, var_20=1, var_32=0, var_46=0, var_50=2, var_54=1, var_59=4, var_61=5, var_65=3, var_73=2, var_7=0] [L92] SORT_3 state_39 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L93] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_167=3, mask_SORT_1=1, mask_SORT_3=31, mask_SORT_45=7, mask_SORT_86=15, var_103=7, var_108=6, var_11=0, var_145=0, var_176=31, var_20=1, var_32=0, var_46=0, var_50=2, var_54=1, var_59=4, var_61=5, var_65=3, var_73=2, var_7=0] [L93] SORT_3 state_41 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L94] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_167=3, mask_SORT_1=1, mask_SORT_3=31, mask_SORT_45=7, mask_SORT_86=15, var_103=7, var_108=6, var_11=0, var_145=0, var_176=31, var_20=1, var_32=0, var_46=0, var_50=2, var_54=1, var_59=4, var_61=5, var_65=3, var_73=2, var_7=0] [L94] SORT_3 state_43 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L95] EXPR __VERIFIER_nondet_uchar() & mask_SORT_45 VAL [mask_SORT_167=3, mask_SORT_1=1, mask_SORT_3=31, mask_SORT_45=7, mask_SORT_86=15, var_103=7, var_108=6, var_11=0, var_145=0, var_176=31, var_20=1, var_32=0, var_46=0, var_50=2, var_54=1, var_59=4, var_61=5, var_65=3, var_73=2, var_7=0] [L95] SORT_45 state_47 = __VERIFIER_nondet_uchar() & mask_SORT_45; [L97] SORT_3 init_9_arg_1 = var_7; [L98] state_8 = init_9_arg_1 [L99] SORT_3 init_14_arg_1 = var_7; [L100] state_13 = init_14_arg_1 [L101] SORT_3 init_25_arg_1 = var_7; [L102] state_24 = init_25_arg_1 [L103] SORT_3 init_27_arg_1 = var_7; [L104] state_26 = init_27_arg_1 [L105] SORT_3 init_29_arg_1 = var_7; [L106] state_28 = init_29_arg_1 [L107] SORT_1 init_31_arg_1 = var_11; [L108] state_30 = init_31_arg_1 [L109] SORT_5 init_34_arg_1 = var_32; [L110] state_33 = init_34_arg_1 [L111] SORT_3 init_36_arg_1 = var_7; [L112] state_35 = init_36_arg_1 [L113] SORT_3 init_38_arg_1 = var_7; [L114] state_37 = init_38_arg_1 [L115] SORT_3 init_40_arg_1 = var_7; [L116] state_39 = init_40_arg_1 [L117] SORT_3 init_42_arg_1 = var_7; [L118] state_41 = init_42_arg_1 [L119] SORT_3 init_44_arg_1 = var_7; [L120] state_43 = init_44_arg_1 [L121] SORT_45 init_48_arg_1 = var_46; [L122] state_47 = init_48_arg_1 VAL [mask_SORT_167=3, mask_SORT_1=1, mask_SORT_3=31, mask_SORT_45=7, mask_SORT_86=15, state_13=0, state_24=0, state_26=0, state_28=0, state_30=0, state_33=0, state_35=0, state_37=0, state_39=0, state_41=0, state_43=0, state_47=0, state_8=0, var_103=7, var_108=6, var_11=0, var_145=0, var_176=31, var_20=1, var_46=0, var_50=2, var_54=1, var_59=4, var_61=5, var_65=3, var_73=2, var_7=0] [L125] input_2 = __VERIFIER_nondet_uchar() [L126] input_4 = __VERIFIER_nondet_uchar() [L127] input_6 = __VERIFIER_nondet_ushort() [L128] input_164 = __VERIFIER_nondet_uchar() [L129] input_165 = __VERIFIER_nondet_uchar() [L130] input_166 = __VERIFIER_nondet_uchar() [L131] input_175 = __VERIFIER_nondet_uchar() [L132] input_185 = __VERIFIER_nondet_uchar() [L133] input_186 = __VERIFIER_nondet_uchar() [L134] input_187 = __VERIFIER_nondet_uchar() [L135] input_190 = __VERIFIER_nondet_uchar() [L136] input_209 = __VERIFIER_nondet_uchar() [L137] input_210 = __VERIFIER_nondet_uchar() [L138] input_211 = __VERIFIER_nondet_uchar() [L139] input_214 = __VERIFIER_nondet_uchar() [L140] input_216 = __VERIFIER_nondet_uchar() [L141] input_230 = __VERIFIER_nondet_uchar() [L142] input_231 = __VERIFIER_nondet_uchar() [L143] input_232 = __VERIFIER_nondet_uchar() [L146] SORT_3 var_10_arg_0 = state_8; [L147] SORT_1 var_10 = var_10_arg_0 >> 0; VAL [mask_SORT_167=3, mask_SORT_1=1, mask_SORT_3=31, mask_SORT_45=7, mask_SORT_86=15, state_13=0, state_24=0, state_26=0, state_28=0, state_30=0, state_33=0, state_35=0, state_37=0, state_39=0, state_41=0, state_43=0, state_47=0, state_8=0, var_103=7, var_108=6, var_10=0, var_11=0, var_145=0, var_176=31, var_20=1, var_46=0, var_50=2, var_54=1, var_59=4, var_61=5, var_65=3, var_73=2, var_7=0] [L148] EXPR var_10 & mask_SORT_1 VAL [mask_SORT_167=3, mask_SORT_1=1, mask_SORT_3=31, mask_SORT_45=7, mask_SORT_86=15, state_13=0, state_24=0, state_26=0, state_28=0, state_30=0, state_33=0, state_35=0, state_37=0, state_39=0, state_41=0, state_43=0, state_47=0, state_8=0, var_103=7, var_108=6, var_11=0, var_145=0, var_176=31, var_20=1, var_46=0, var_50=2, var_54=1, var_59=4, var_61=5, var_65=3, var_73=2, var_7=0] [L148] var_10 = var_10 & mask_SORT_1 [L149] SORT_1 var_12_arg_0 = var_10; [L150] SORT_1 var_12_arg_1 = var_11; [L151] SORT_1 var_12 = var_12_arg_0 == var_12_arg_1; [L152] SORT_3 var_15_arg_0 = state_13; [L153] SORT_1 var_15 = var_15_arg_0 >> 0; VAL [mask_SORT_167=3, mask_SORT_1=1, mask_SORT_3=31, mask_SORT_45=7, mask_SORT_86=15, state_13=0, state_24=0, state_26=0, state_28=0, state_30=0, state_33=0, state_35=0, state_37=0, state_39=0, state_41=0, state_43=0, state_47=0, state_8=0, var_103=7, var_108=6, var_11=0, var_12=1, var_145=0, var_15=0, var_176=31, var_20=1, var_46=0, var_50=2, var_54=1, var_59=4, var_61=5, var_65=3, var_73=2, var_7=0] [L154] EXPR var_15 & mask_SORT_1 VAL [mask_SORT_167=3, mask_SORT_1=1, mask_SORT_3=31, mask_SORT_45=7, mask_SORT_86=15, state_13=0, state_24=0, state_26=0, state_28=0, state_30=0, state_33=0, state_35=0, state_37=0, state_39=0, state_41=0, state_43=0, state_47=0, state_8=0, var_103=7, var_108=6, var_11=0, var_12=1, var_145=0, var_176=31, var_20=1, var_46=0, var_50=2, var_54=1, var_59=4, var_61=5, var_65=3, var_73=2, var_7=0] [L154] var_15 = var_15 & mask_SORT_1 [L155] SORT_1 var_16_arg_0 = var_15; [L156] SORT_1 var_16_arg_1 = var_11; [L157] SORT_1 var_16 = var_16_arg_0 == var_16_arg_1; [L158] SORT_1 var_17_arg_0 = var_12; [L159] SORT_1 var_17_arg_1 = var_16; VAL [mask_SORT_167=3, mask_SORT_1=1, mask_SORT_3=31, mask_SORT_45=7, mask_SORT_86=15, state_13=0, state_24=0, state_26=0, state_28=0, state_30=0, state_33=0, state_35=0, state_37=0, state_39=0, state_41=0, state_43=0, state_47=0, state_8=0, var_103=7, var_108=6, var_11=0, var_145=0, var_176=31, var_17_arg_0=1, var_17_arg_1=1, var_20=1, var_46=0, var_50=2, var_54=1, var_59=4, var_61=5, var_65=3, var_73=2, var_7=0] [L160] EXPR var_17_arg_0 & var_17_arg_1 VAL [mask_SORT_167=3, mask_SORT_1=1, mask_SORT_3=31, mask_SORT_45=7, mask_SORT_86=15, state_13=0, state_24=0, state_26=0, state_28=0, state_30=0, state_33=0, state_35=0, state_37=0, state_39=0, state_41=0, state_43=0, state_47=0, state_8=0, var_103=7, var_108=6, var_11=0, var_145=0, var_176=31, var_20=1, var_46=0, var_50=2, var_54=1, var_59=4, var_61=5, var_65=3, var_73=2, var_7=0] [L160] SORT_1 var_17 = var_17_arg_0 & var_17_arg_1; [L161] SORT_1 var_21_arg_0 = var_17; [L162] SORT_1 var_21 = ~var_21_arg_0; [L163] SORT_1 var_22_arg_0 = var_20; [L164] SORT_1 var_22_arg_1 = var_21; VAL [mask_SORT_167=3, mask_SORT_1=1, mask_SORT_3=31, mask_SORT_45=7, mask_SORT_86=15, state_13=0, state_24=0, state_26=0, state_28=0, state_30=0, state_33=0, state_35=0, state_37=0, state_39=0, state_41=0, state_43=0, state_47=0, state_8=0, var_103=7, var_108=6, var_11=0, var_145=0, var_176=31, var_20=1, var_22_arg_0=1, var_22_arg_1=-2, var_46=0, var_50=2, var_54=1, var_59=4, var_61=5, var_65=3, var_73=2, var_7=0] [L165] EXPR var_22_arg_0 & var_22_arg_1 VAL [mask_SORT_167=3, mask_SORT_1=1, mask_SORT_3=31, mask_SORT_45=7, mask_SORT_86=15, state_13=0, state_24=0, state_26=0, state_28=0, state_30=0, state_33=0, state_35=0, state_37=0, state_39=0, state_41=0, state_43=0, state_47=0, state_8=0, var_103=7, var_108=6, var_11=0, var_145=0, var_176=31, var_20=1, var_46=0, var_50=2, var_54=1, var_59=4, var_61=5, var_65=3, var_73=2, var_7=0] [L165] SORT_1 var_22 = var_22_arg_0 & var_22_arg_1; [L166] EXPR var_22 & mask_SORT_1 VAL [mask_SORT_167=3, mask_SORT_1=1, mask_SORT_3=31, mask_SORT_45=7, mask_SORT_86=15, state_13=0, state_24=0, state_26=0, state_28=0, state_30=0, state_33=0, state_35=0, state_37=0, state_39=0, state_41=0, state_43=0, state_47=0, state_8=0, var_103=7, var_108=6, var_11=0, var_145=0, var_176=31, var_20=1, var_46=0, var_50=2, var_54=1, var_59=4, var_61=5, var_65=3, var_73=2, var_7=0] [L166] var_22 = var_22 & mask_SORT_1 [L167] SORT_1 bad_23_arg_0 = var_22; [L168] CALL __VERIFIER_assert(!(bad_23_arg_0)) [L21] COND TRUE !(cond) [L21] reach_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 529 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 4.8s, OverallIterations: 7, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 3310 SdHoareTripleChecker+Valid, 2.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3310 mSDsluCounter, 13179 SdHoareTripleChecker+Invalid, 1.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 9419 mSDsCounter, 3 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3346 IncrementalHoareTripleChecker+Invalid, 3349 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 3 mSolverCounterUnsat, 3760 mSDtfsCounter, 3346 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 38 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=543occurred in iteration=6, InterpolantAutomatonStates: 32, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 6 MinimizatonAttempts, 97 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.5s InterpolantComputationTime, 297 NumberOfCodeBlocks, 297 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 247 ConstructedInterpolants, 0 QuantifiedInterpolants, 790 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 6 InterpolantComputations, 6 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2025-02-08 00:15:07,598 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_arrays_vsaR_p02.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash c9237163e2805f66062dc578af6664f7122718fcb3464bd31fd071298f5647b0 --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-08 00:15:09,538 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-08 00:15:09,626 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Bitvector.epf [2025-02-08 00:15:09,632 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-08 00:15:09,632 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-08 00:15:09,653 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-08 00:15:09,654 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-08 00:15:09,654 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-08 00:15:09,655 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-08 00:15:09,655 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-08 00:15:09,655 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-08 00:15:09,656 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-08 00:15:09,656 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-08 00:15:09,656 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-08 00:15:09,656 INFO L153 SettingsManager]: * Use SBE=true [2025-02-08 00:15:09,657 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-08 00:15:09,657 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-08 00:15:09,657 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-08 00:15:09,657 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-08 00:15:09,657 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-08 00:15:09,657 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-08 00:15:09,657 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-02-08 00:15:09,657 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-02-08 00:15:09,657 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-02-08 00:15:09,657 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-08 00:15:09,657 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-08 00:15:09,658 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-08 00:15:09,658 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-08 00:15:09,658 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-08 00:15:09,658 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-08 00:15:09,658 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-08 00:15:09,658 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 00:15:09,658 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-08 00:15:09,658 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-08 00:15:09,659 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-08 00:15:09,659 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-08 00:15:09,659 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-02-08 00:15:09,660 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-02-08 00:15:09,660 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-08 00:15:09,660 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-08 00:15:09,660 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-08 00:15:09,660 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-08 00:15:09,660 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> c9237163e2805f66062dc578af6664f7122718fcb3464bd31fd071298f5647b0 [2025-02-08 00:15:09,916 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-08 00:15:09,934 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-08 00:15:09,940 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-08 00:15:09,941 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-08 00:15:09,941 INFO L274 PluginConnector]: CDTParser initialized [2025-02-08 00:15:09,942 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_arrays_vsaR_p02.c [2025-02-08 00:15:11,135 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/6ba9e337a/e9104fbb0a42423fbb156d197e4c00a5/FLAG0076dfbd0 [2025-02-08 00:15:11,414 INFO L384 CDTParser]: Found 1 translation units. [2025-02-08 00:15:11,418 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_arrays_vsaR_p02.c [2025-02-08 00:15:11,429 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/6ba9e337a/e9104fbb0a42423fbb156d197e4c00a5/FLAG0076dfbd0 [2025-02-08 00:15:11,441 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/6ba9e337a/e9104fbb0a42423fbb156d197e4c00a5 [2025-02-08 00:15:11,443 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-08 00:15:11,445 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-08 00:15:11,446 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-08 00:15:11,447 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-08 00:15:11,450 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-08 00:15:11,450 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 12:15:11" (1/1) ... [2025-02-08 00:15:11,452 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@35cd850c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:15:11, skipping insertion in model container [2025-02-08 00:15:11,452 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 12:15:11" (1/1) ... [2025-02-08 00:15:11,485 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-08 00:15:11,614 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_arrays_vsaR_p02.c[1259,1272] [2025-02-08 00:15:11,763 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 00:15:11,775 INFO L200 MainTranslator]: Completed pre-run [2025-02-08 00:15:11,783 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_arrays_vsaR_p02.c[1259,1272] [2025-02-08 00:15:11,876 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 00:15:11,885 INFO L204 MainTranslator]: Completed translation [2025-02-08 00:15:11,886 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:15:11 WrapperNode [2025-02-08 00:15:11,886 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-08 00:15:11,887 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-08 00:15:11,887 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-08 00:15:11,887 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-08 00:15:11,891 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:15:11" (1/1) ... [2025-02-08 00:15:11,913 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:15:11" (1/1) ... [2025-02-08 00:15:11,954 INFO L138 Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 1071 [2025-02-08 00:15:11,955 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-08 00:15:11,955 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-08 00:15:11,955 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-08 00:15:11,955 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-08 00:15:11,965 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:15:11" (1/1) ... [2025-02-08 00:15:11,965 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:15:11" (1/1) ... [2025-02-08 00:15:11,971 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:15:11" (1/1) ... [2025-02-08 00:15:11,988 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-02-08 00:15:11,988 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:15:11" (1/1) ... [2025-02-08 00:15:11,989 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:15:11" (1/1) ... [2025-02-08 00:15:12,013 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:15:11" (1/1) ... [2025-02-08 00:15:12,015 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:15:11" (1/1) ... [2025-02-08 00:15:12,021 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:15:11" (1/1) ... [2025-02-08 00:15:12,026 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:15:11" (1/1) ... [2025-02-08 00:15:12,032 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-08 00:15:12,033 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-08 00:15:12,033 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-08 00:15:12,033 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-08 00:15:12,034 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:15:11" (1/1) ... [2025-02-08 00:15:12,062 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 00:15:12,070 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 00:15:12,081 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-08 00:15:12,085 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-08 00:15:12,100 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-08 00:15:12,100 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-02-08 00:15:12,101 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-08 00:15:12,101 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-08 00:15:12,278 INFO L257 CfgBuilder]: Building ICFG [2025-02-08 00:15:12,279 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-08 00:15:13,493 INFO L? ?]: Removed 63 outVars from TransFormulas that were not future-live. [2025-02-08 00:15:13,493 INFO L308 CfgBuilder]: Performing block encoding [2025-02-08 00:15:13,498 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-08 00:15:13,499 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-08 00:15:13,499 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 12:15:13 BoogieIcfgContainer [2025-02-08 00:15:13,499 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-08 00:15:13,501 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-08 00:15:13,501 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-08 00:15:13,504 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-08 00:15:13,504 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.02 12:15:11" (1/3) ... [2025-02-08 00:15:13,505 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3a5b7eb2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 12:15:13, skipping insertion in model container [2025-02-08 00:15:13,505 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:15:11" (2/3) ... [2025-02-08 00:15:13,505 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3a5b7eb2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 12:15:13, skipping insertion in model container [2025-02-08 00:15:13,505 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 12:15:13" (3/3) ... [2025-02-08 00:15:13,506 INFO L128 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.vis_arrays_vsaR_p02.c [2025-02-08 00:15:13,516 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-08 00:15:13,517 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG btor2c-lazyMod.vis_arrays_vsaR_p02.c that has 1 procedures, 8 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-08 00:15:13,546 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 00:15:13,554 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;@3bafb467, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 00:15:13,555 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-08 00:15:13,557 INFO L276 IsEmpty]: Start isEmpty. Operand has 8 states, 6 states have (on average 1.5) internal successors, (9), 7 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:15:13,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2025-02-08 00:15:13,560 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 00:15:13,561 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2025-02-08 00:15:13,561 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 00:15:13,565 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:15:13,565 INFO L85 PathProgramCache]: Analyzing trace with hash 1137951, now seen corresponding path program 1 times [2025-02-08 00:15:13,572 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-08 00:15:13,572 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [545381135] [2025-02-08 00:15:13,574 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:15:13,574 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 00:15:13,574 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 00:15:13,597 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 00:15:13,599 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-08 00:15:13,781 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-08 00:15:13,797 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-08 00:15:13,798 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:15:13,798 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:15:13,801 INFO L256 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 28 conjuncts are in the unsatisfiable core [2025-02-08 00:15:13,808 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 00:15:13,931 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 00:15:13,932 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 00:15:13,932 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-08 00:15:13,932 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [545381135] [2025-02-08 00:15:13,932 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [545381135] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 00:15:13,932 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 00:15:13,933 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 00:15:13,934 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1830969727] [2025-02-08 00:15:13,937 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 00:15:13,939 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 00:15:13,939 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-08 00:15:13,954 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 00:15:13,955 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 00:15:13,956 INFO L87 Difference]: Start difference. First operand has 8 states, 6 states have (on average 1.5) internal successors, (9), 7 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 4 states, 4 states have (on average 1.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:15:14,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 00:15:14,008 INFO L93 Difference]: Finished difference Result 16 states and 21 transitions. [2025-02-08 00:15:14,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 00:15:14,010 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2025-02-08 00:15:14,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 00:15:14,014 INFO L225 Difference]: With dead ends: 16 [2025-02-08 00:15:14,014 INFO L226 Difference]: Without dead ends: 9 [2025-02-08 00:15:14,015 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-08 00:15:14,017 INFO L435 NwaCegarLoop]: 3 mSDtfsCounter, 2 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 8 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 00:15:14,017 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 8 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 00:15:14,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2025-02-08 00:15:14,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 8. [2025-02-08 00:15:14,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 7 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:15:14,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 8 transitions. [2025-02-08 00:15:14,033 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 8 transitions. Word has length 4 [2025-02-08 00:15:14,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 00:15:14,033 INFO L471 AbstractCegarLoop]: Abstraction has 8 states and 8 transitions. [2025-02-08 00:15:14,033 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:15:14,033 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2025-02-08 00:15:14,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-02-08 00:15:14,033 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 00:15:14,033 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1] [2025-02-08 00:15:14,040 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-02-08 00:15:14,234 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 00:15:14,234 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 00:15:14,235 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:15:14,235 INFO L85 PathProgramCache]: Analyzing trace with hash -458170295, now seen corresponding path program 1 times [2025-02-08 00:15:14,236 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-08 00:15:14,236 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [519649241] [2025-02-08 00:15:14,236 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:15:14,236 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 00:15:14,236 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 00:15:14,238 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 00:15:14,239 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-02-08 00:15:14,485 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-02-08 00:15:14,520 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-02-08 00:15:14,520 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:15:14,520 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:15:14,524 INFO L256 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 36 conjuncts are in the unsatisfiable core [2025-02-08 00:15:14,531 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 00:15:14,801 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 00:15:14,802 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 00:15:16,594 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 00:15:16,595 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-08 00:15:16,595 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [519649241] [2025-02-08 00:15:16,595 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [519649241] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 00:15:16,596 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-08 00:15:16,596 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 9 [2025-02-08 00:15:16,596 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2027367331] [2025-02-08 00:15:16,596 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-08 00:15:16,597 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-08 00:15:16,597 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-08 00:15:16,597 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-08 00:15:16,598 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2025-02-08 00:15:16,598 INFO L87 Difference]: Start difference. First operand 8 states and 8 transitions. Second operand has 10 states, 10 states have (on average 1.3) internal successors, (13), 9 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:15:16,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 00:15:16,765 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2025-02-08 00:15:16,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 00:15:16,765 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 1.3) internal successors, (13), 9 states have internal predecessors, (13), 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 7 [2025-02-08 00:15:16,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 00:15:16,766 INFO L225 Difference]: With dead ends: 14 [2025-02-08 00:15:16,766 INFO L226 Difference]: Without dead ends: 12 [2025-02-08 00:15:16,766 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=47, Invalid=109, Unknown=0, NotChecked=0, Total=156 [2025-02-08 00:15:16,767 INFO L435 NwaCegarLoop]: 3 mSDtfsCounter, 4 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 13 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 00:15:16,767 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 13 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 00:15:16,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2025-02-08 00:15:16,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 11. [2025-02-08 00:15:16,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 10 states have (on average 1.1) internal successors, (11), 10 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-02-08 00:15:16,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 11 transitions. [2025-02-08 00:15:16,770 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 11 transitions. Word has length 7 [2025-02-08 00:15:16,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 00:15:16,771 INFO L471 AbstractCegarLoop]: Abstraction has 11 states and 11 transitions. [2025-02-08 00:15:16,771 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 1.3) internal successors, (13), 9 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:15:16,771 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 11 transitions. [2025-02-08 00:15:16,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-02-08 00:15:16,771 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 00:15:16,772 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1] [2025-02-08 00:15:16,783 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-02-08 00:15:16,972 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 00:15:16,972 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 00:15:16,975 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:15:16,975 INFO L85 PathProgramCache]: Analyzing trace with hash 55678175, now seen corresponding path program 2 times [2025-02-08 00:15:16,976 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-08 00:15:16,976 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [588206315] [2025-02-08 00:15:16,976 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 00:15:16,976 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 00:15:16,976 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 00:15:16,979 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 00:15:16,983 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-02-08 00:15:17,267 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 10 statements into 2 equivalence classes. [2025-02-08 00:15:17,321 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 10 of 10 statements. [2025-02-08 00:15:17,322 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-08 00:15:17,322 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:15:17,328 INFO L256 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 60 conjuncts are in the unsatisfiable core [2025-02-08 00:15:17,339 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 00:15:27,082 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 00:15:27,082 INFO L312 TraceCheckSpWp]: Computing backward predicates...