./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_arrays_vsaR_p13.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_p13.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 07c94e5cd3bc71d2316ee023f3c3de7a743ac154d633131bf7b85324be3bb818 --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-08 00:15:50,843 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-08 00:15:50,902 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:15:50,907 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-08 00:15:50,911 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-08 00:15:50,929 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-08 00:15:50,930 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-08 00:15:50,930 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-08 00:15:50,930 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-08 00:15:50,930 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-08 00:15:50,930 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-08 00:15:50,930 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-08 00:15:50,931 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-08 00:15:50,931 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-08 00:15:50,931 INFO L153 SettingsManager]: * Use SBE=true [2025-02-08 00:15:50,931 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-08 00:15:50,931 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-08 00:15:50,931 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-08 00:15:50,931 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-08 00:15:50,931 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-08 00:15:50,931 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-08 00:15:50,932 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-08 00:15:50,932 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-08 00:15:50,932 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-08 00:15:50,932 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-08 00:15:50,932 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-08 00:15:50,932 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-08 00:15:50,932 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-08 00:15:50,932 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-08 00:15:50,932 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 00:15:50,932 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-08 00:15:50,932 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-08 00:15:50,933 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-08 00:15:50,933 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-08 00:15:50,933 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-08 00:15:50,933 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-08 00:15:50,933 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-08 00:15:50,933 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-08 00:15:50,933 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-08 00:15:50,933 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-08 00:15:50,933 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 -> 07c94e5cd3bc71d2316ee023f3c3de7a743ac154d633131bf7b85324be3bb818 [2025-02-08 00:15:51,189 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-08 00:15:51,200 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-08 00:15:51,202 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-08 00:15:51,203 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-08 00:15:51,203 INFO L274 PluginConnector]: CDTParser initialized [2025-02-08 00:15:51,205 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_p13.c [2025-02-08 00:15:52,388 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/21d60dc23/1a9eca99fdee40fabb8ae80c9fde61d3/FLAG87374615d [2025-02-08 00:15:52,676 INFO L384 CDTParser]: Found 1 translation units. [2025-02-08 00:15:52,679 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_arrays_vsaR_p13.c [2025-02-08 00:15:52,694 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/21d60dc23/1a9eca99fdee40fabb8ae80c9fde61d3/FLAG87374615d [2025-02-08 00:15:52,949 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/21d60dc23/1a9eca99fdee40fabb8ae80c9fde61d3 [2025-02-08 00:15:52,951 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-08 00:15:52,952 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-08 00:15:52,953 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-08 00:15:52,953 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-08 00:15:52,956 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-08 00:15:52,956 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 12:15:52" (1/1) ... [2025-02-08 00:15:52,957 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5eb09b5f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:15:52, skipping insertion in model container [2025-02-08 00:15:52,957 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 12:15:52" (1/1) ... [2025-02-08 00:15:52,981 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-08 00:15:53,116 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_p13.c[1259,1272] [2025-02-08 00:15:53,306 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 00:15:53,313 INFO L200 MainTranslator]: Completed pre-run [2025-02-08 00:15:53,320 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_p13.c[1259,1272] [2025-02-08 00:15:53,412 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 00:15:53,421 INFO L204 MainTranslator]: Completed translation [2025-02-08 00:15:53,421 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:15:53 WrapperNode [2025-02-08 00:15:53,422 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-08 00:15:53,422 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-08 00:15:53,422 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-08 00:15:53,422 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-08 00:15:53,426 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:53" (1/1) ... [2025-02-08 00:15:53,455 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:53" (1/1) ... [2025-02-08 00:15:53,621 INFO L138 Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 2159 [2025-02-08 00:15:53,621 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-08 00:15:53,622 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-08 00:15:53,622 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-08 00:15:53,622 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-08 00:15:53,628 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:53" (1/1) ... [2025-02-08 00:15:53,629 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:53" (1/1) ... [2025-02-08 00:15:53,678 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:53" (1/1) ... [2025-02-08 00:15:53,726 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:53,726 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:53" (1/1) ... [2025-02-08 00:15:53,726 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:53" (1/1) ... [2025-02-08 00:15:53,837 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:53" (1/1) ... [2025-02-08 00:15:53,844 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:53" (1/1) ... [2025-02-08 00:15:53,856 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:53" (1/1) ... [2025-02-08 00:15:53,868 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:53" (1/1) ... [2025-02-08 00:15:53,895 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-08 00:15:53,897 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-08 00:15:53,897 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-08 00:15:53,897 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-08 00:15:53,898 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:15:53" (1/1) ... [2025-02-08 00:15:53,902 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 00:15:53,910 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 00:15:53,923 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:53,932 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:53,949 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-08 00:15:53,949 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-08 00:15:53,949 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-08 00:15:53,949 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-08 00:15:54,179 INFO L257 CfgBuilder]: Building ICFG [2025-02-08 00:15:54,181 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-08 00:15:55,943 INFO L? ?]: Removed 1350 outVars from TransFormulas that were not future-live. [2025-02-08 00:15:55,943 INFO L308 CfgBuilder]: Performing block encoding [2025-02-08 00:15:56,059 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-08 00:15:56,061 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-08 00:15:56,062 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 12:15:56 BoogieIcfgContainer [2025-02-08 00:15:56,062 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-08 00:15:56,064 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-08 00:15:56,064 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-08 00:15:56,067 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-08 00:15:56,067 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.02 12:15:52" (1/3) ... [2025-02-08 00:15:56,068 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@23c90ff8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 12:15:56, skipping insertion in model container [2025-02-08 00:15:56,068 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:15:53" (2/3) ... [2025-02-08 00:15:56,068 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@23c90ff8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 12:15:56, skipping insertion in model container [2025-02-08 00:15:56,068 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 12:15:56" (3/3) ... [2025-02-08 00:15:56,069 INFO L128 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.vis_arrays_vsaR_p13.c [2025-02-08 00:15:56,078 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-08 00:15:56,079 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG btor2c-lazyMod.vis_arrays_vsaR_p13.c that has 1 procedures, 545 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-08 00:15:56,116 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 00:15:56,123 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;@36730b66, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 00:15:56,123 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-08 00:15:56,127 INFO L276 IsEmpty]: Start isEmpty. Operand has 545 states, 543 states have (on average 1.5009208103130756) internal successors, (815), 544 states have internal predecessors, (815), 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:56,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2025-02-08 00:15:56,131 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 00:15:56,131 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:56,132 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 00:15:56,135 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:15:56,135 INFO L85 PathProgramCache]: Analyzing trace with hash 640184906, now seen corresponding path program 1 times [2025-02-08 00:15:56,140 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 00:15:56,140 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1416717946] [2025-02-08 00:15:56,141 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:15:56,141 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 00:15:56,208 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-02-08 00:15:56,304 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-02-08 00:15:56,305 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:15:56,305 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:15:56,713 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:56,714 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 00:15:56,714 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1416717946] [2025-02-08 00:15:56,715 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1416717946] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 00:15:56,715 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 00:15:56,717 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 00:15:56,718 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1020493655] [2025-02-08 00:15:56,719 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 00:15:56,721 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 00:15:56,722 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 00:15:56,736 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 00:15:56,736 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 00:15:56,739 INFO L87 Difference]: Start difference. First operand has 545 states, 543 states have (on average 1.5009208103130756) internal successors, (815), 544 states have internal predecessors, (815), 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 11.0) 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:57,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 00:15:57,109 INFO L93 Difference]: Finished difference Result 1037 states and 1553 transitions. [2025-02-08 00:15:57,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 00:15:57,111 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.0) 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:57,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 00:15:57,120 INFO L225 Difference]: With dead ends: 1037 [2025-02-08 00:15:57,120 INFO L226 Difference]: Without dead ends: 545 [2025-02-08 00:15:57,123 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:57,124 INFO L435 NwaCegarLoop]: 676 mSDtfsCounter, 0 mSDsluCounter, 1347 mSDsCounter, 0 mSdLazyCounter, 412 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2023 SdHoareTripleChecker+Invalid, 412 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 412 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-08 00:15:57,125 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2023 Invalid, 412 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 412 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-08 00:15:57,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 545 states. [2025-02-08 00:15:57,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 545 to 545. [2025-02-08 00:15:57,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 545 states, 544 states have (on average 1.4963235294117647) internal successors, (814), 544 states have internal predecessors, (814), 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:57,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 545 states to 545 states and 814 transitions. [2025-02-08 00:15:57,162 INFO L78 Accepts]: Start accepts. Automaton has 545 states and 814 transitions. Word has length 44 [2025-02-08 00:15:57,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 00:15:57,162 INFO L471 AbstractCegarLoop]: Abstraction has 545 states and 814 transitions. [2025-02-08 00:15:57,162 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.0) 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:57,162 INFO L276 IsEmpty]: Start isEmpty. Operand 545 states and 814 transitions. [2025-02-08 00:15:57,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2025-02-08 00:15:57,163 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 00:15:57,163 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 00:15:57,163 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-08 00:15:57,163 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 00:15:57,164 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:15:57,164 INFO L85 PathProgramCache]: Analyzing trace with hash -1624424451, now seen corresponding path program 1 times [2025-02-08 00:15:57,164 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 00:15:57,164 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1472747003] [2025-02-08 00:15:57,164 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:15:57,164 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 00:15:57,183 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-02-08 00:15:57,202 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-02-08 00:15:57,203 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:15:57,203 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:15:57,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:57,315 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 00:15:57,315 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1472747003] [2025-02-08 00:15:57,316 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1472747003] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 00:15:57,316 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 00:15:57,316 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 00:15:57,316 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1306791506] [2025-02-08 00:15:57,316 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 00:15:57,316 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 00:15:57,317 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 00:15:57,317 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 00:15:57,318 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 00:15:57,319 INFO L87 Difference]: Start difference. First operand 545 states and 814 transitions. Second operand has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:15:57,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 00:15:57,574 INFO L93 Difference]: Finished difference Result 1039 states and 1552 transitions. [2025-02-08 00:15:57,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 00:15:57,575 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 45 [2025-02-08 00:15:57,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 00:15:57,577 INFO L225 Difference]: With dead ends: 1039 [2025-02-08 00:15:57,577 INFO L226 Difference]: Without dead ends: 547 [2025-02-08 00:15:57,578 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:57,578 INFO L435 NwaCegarLoop]: 676 mSDtfsCounter, 0 mSDsluCounter, 1344 mSDsCounter, 0 mSdLazyCounter, 415 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2020 SdHoareTripleChecker+Invalid, 415 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 415 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-08 00:15:57,580 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2020 Invalid, 415 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 415 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-08 00:15:57,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 547 states. [2025-02-08 00:15:57,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 547 to 547. [2025-02-08 00:15:57,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 547 states, 546 states have (on average 1.4945054945054945) internal successors, (816), 546 states have internal predecessors, (816), 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:57,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 547 states to 547 states and 816 transitions. [2025-02-08 00:15:57,601 INFO L78 Accepts]: Start accepts. Automaton has 547 states and 816 transitions. Word has length 45 [2025-02-08 00:15:57,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 00:15:57,601 INFO L471 AbstractCegarLoop]: Abstraction has 547 states and 816 transitions. [2025-02-08 00:15:57,601 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:15:57,601 INFO L276 IsEmpty]: Start isEmpty. Operand 547 states and 816 transitions. [2025-02-08 00:15:57,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2025-02-08 00:15:57,602 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 00:15:57,602 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 00:15:57,602 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-08 00:15:57,602 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 00:15:57,603 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:15:57,603 INFO L85 PathProgramCache]: Analyzing trace with hash -1181007707, now seen corresponding path program 1 times [2025-02-08 00:15:57,603 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 00:15:57,603 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1950168754] [2025-02-08 00:15:57,603 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:15:57,603 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 00:15:57,627 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-02-08 00:15:57,666 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-02-08 00:15:57,667 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:15:57,667 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:15:57,941 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:57,941 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 00:15:57,941 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1950168754] [2025-02-08 00:15:57,941 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1950168754] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 00:15:57,941 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 00:15:57,941 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-08 00:15:57,941 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [411813657] [2025-02-08 00:15:57,941 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 00:15:57,942 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 00:15:57,942 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 00:15:57,942 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 00:15:57,942 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-08 00:15:57,943 INFO L87 Difference]: Start difference. First operand 547 states and 816 transitions. Second operand has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 6 states have internal predecessors, (46), 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:58,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 00:15:58,306 INFO L93 Difference]: Finished difference Result 1047 states and 1562 transitions. [2025-02-08 00:15:58,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 00:15:58,306 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 6 states have internal predecessors, (46), 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 46 [2025-02-08 00:15:58,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 00:15:58,309 INFO L225 Difference]: With dead ends: 1047 [2025-02-08 00:15:58,309 INFO L226 Difference]: Without dead ends: 553 [2025-02-08 00:15:58,310 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-08 00:15:58,310 INFO L435 NwaCegarLoop]: 672 mSDtfsCounter, 2 mSDsluCounter, 2677 mSDsCounter, 0 mSdLazyCounter, 710 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 3349 SdHoareTripleChecker+Invalid, 711 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 710 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-08 00:15:58,311 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 3349 Invalid, 711 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 710 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-08 00:15:58,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 553 states. [2025-02-08 00:15:58,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 553 to 552. [2025-02-08 00:15:58,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 552 states, 551 states have (on average 1.4936479128856623) internal successors, (823), 551 states have internal predecessors, (823), 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:58,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 552 states to 552 states and 823 transitions. [2025-02-08 00:15:58,323 INFO L78 Accepts]: Start accepts. Automaton has 552 states and 823 transitions. Word has length 46 [2025-02-08 00:15:58,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 00:15:58,323 INFO L471 AbstractCegarLoop]: Abstraction has 552 states and 823 transitions. [2025-02-08 00:15:58,324 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 6 states have internal predecessors, (46), 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:58,324 INFO L276 IsEmpty]: Start isEmpty. Operand 552 states and 823 transitions. [2025-02-08 00:15:58,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2025-02-08 00:15:58,328 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 00:15:58,328 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 00:15:58,328 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-08 00:15:58,328 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 00:15:58,329 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:15:58,329 INFO L85 PathProgramCache]: Analyzing trace with hash 1122542599, now seen corresponding path program 1 times [2025-02-08 00:15:58,329 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 00:15:58,329 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1192811316] [2025-02-08 00:15:58,329 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:15:58,329 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 00:15:58,349 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-02-08 00:15:58,362 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-02-08 00:15:58,362 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:15:58,362 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:15:58,462 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:58,463 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 00:15:58,463 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1192811316] [2025-02-08 00:15:58,463 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1192811316] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 00:15:58,463 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 00:15:58,463 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 00:15:58,463 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1856134763] [2025-02-08 00:15:58,463 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 00:15:58,464 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 00:15:58,464 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 00:15:58,464 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 00:15:58,464 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-08 00:15:58,464 INFO L87 Difference]: Start difference. First operand 552 states and 823 transitions. Second operand has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:15:58,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 00:15:58,679 INFO L93 Difference]: Finished difference Result 1053 states and 1570 transitions. [2025-02-08 00:15:58,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 00:15:58,679 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 47 [2025-02-08 00:15:58,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 00:15:58,681 INFO L225 Difference]: With dead ends: 1053 [2025-02-08 00:15:58,681 INFO L226 Difference]: Without dead ends: 554 [2025-02-08 00:15:58,682 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-08 00:15:58,683 INFO L435 NwaCegarLoop]: 676 mSDtfsCounter, 0 mSDsluCounter, 1344 mSDsCounter, 0 mSdLazyCounter, 415 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2020 SdHoareTripleChecker+Invalid, 417 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 415 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-08 00:15:58,683 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2020 Invalid, 417 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 415 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-08 00:15:58,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 554 states. [2025-02-08 00:15:58,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 554 to 554. [2025-02-08 00:15:58,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 554 states, 553 states have (on average 1.4918625678119348) internal successors, (825), 553 states have internal predecessors, (825), 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:58,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 554 states to 554 states and 825 transitions. [2025-02-08 00:15:58,691 INFO L78 Accepts]: Start accepts. Automaton has 554 states and 825 transitions. Word has length 47 [2025-02-08 00:15:58,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 00:15:58,692 INFO L471 AbstractCegarLoop]: Abstraction has 554 states and 825 transitions. [2025-02-08 00:15:58,692 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:15:58,692 INFO L276 IsEmpty]: Start isEmpty. Operand 554 states and 825 transitions. [2025-02-08 00:15:58,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2025-02-08 00:15:58,693 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 00:15:58,693 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 00:15:58,693 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-08 00:15:58,693 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 00:15:58,693 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:15:58,693 INFO L85 PathProgramCache]: Analyzing trace with hash 1437556259, now seen corresponding path program 1 times [2025-02-08 00:15:58,693 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 00:15:58,694 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [972023088] [2025-02-08 00:15:58,694 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:15:58,694 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 00:15:58,710 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-02-08 00:15:58,740 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-02-08 00:15:58,740 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:15:58,740 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:15:59,129 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:59,130 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 00:15:59,130 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [972023088] [2025-02-08 00:15:59,130 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [972023088] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 00:15:59,130 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 00:15:59,130 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-08 00:15:59,130 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [731564617] [2025-02-08 00:15:59,131 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 00:15:59,131 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-08 00:15:59,131 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 00:15:59,131 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-08 00:15:59,132 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2025-02-08 00:15:59,132 INFO L87 Difference]: Start difference. First operand 554 states and 825 transitions. Second operand has 8 states, 8 states have (on average 6.0) internal successors, (48), 7 states have internal predecessors, (48), 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:59,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 00:15:59,492 INFO L93 Difference]: Finished difference Result 1060 states and 1578 transitions. [2025-02-08 00:15:59,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-08 00:15:59,493 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.0) internal successors, (48), 7 states have internal predecessors, (48), 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 48 [2025-02-08 00:15:59,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 00:15:59,495 INFO L225 Difference]: With dead ends: 1060 [2025-02-08 00:15:59,495 INFO L226 Difference]: Without dead ends: 559 [2025-02-08 00:15:59,496 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2025-02-08 00:15:59,496 INFO L435 NwaCegarLoop]: 667 mSDtfsCounter, 783 mSDsluCounter, 2660 mSDsCounter, 0 mSdLazyCounter, 733 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 783 SdHoareTripleChecker+Valid, 3327 SdHoareTripleChecker+Invalid, 735 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 733 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-08 00:15:59,496 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [783 Valid, 3327 Invalid, 735 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 733 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-08 00:15:59,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 559 states. [2025-02-08 00:15:59,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 559 to 558. [2025-02-08 00:15:59,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 558 states, 557 states have (on average 1.4901256732495511) internal successors, (830), 557 states have internal predecessors, (830), 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:59,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 558 states to 558 states and 830 transitions. [2025-02-08 00:15:59,504 INFO L78 Accepts]: Start accepts. Automaton has 558 states and 830 transitions. Word has length 48 [2025-02-08 00:15:59,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 00:15:59,505 INFO L471 AbstractCegarLoop]: Abstraction has 558 states and 830 transitions. [2025-02-08 00:15:59,505 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.0) internal successors, (48), 7 states have internal predecessors, (48), 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:59,505 INFO L276 IsEmpty]: Start isEmpty. Operand 558 states and 830 transitions. [2025-02-08 00:15:59,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2025-02-08 00:15:59,506 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 00:15:59,506 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 00:15:59,506 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-08 00:15:59,506 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 00:15:59,506 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:15:59,507 INFO L85 PathProgramCache]: Analyzing trace with hash -231564832, now seen corresponding path program 1 times [2025-02-08 00:15:59,507 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 00:15:59,507 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1763698579] [2025-02-08 00:15:59,507 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:15:59,507 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 00:15:59,542 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-02-08 00:15:59,552 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-02-08 00:15:59,552 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:15:59,552 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:15:59,630 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:59,631 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 00:15:59,631 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1763698579] [2025-02-08 00:15:59,631 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1763698579] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 00:15:59,631 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 00:15:59,631 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 00:15:59,631 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [203780145] [2025-02-08 00:15:59,631 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 00:15:59,632 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 00:15:59,633 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 00:15:59,634 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 00:15:59,634 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 00:15:59,634 INFO L87 Difference]: Start difference. First operand 558 states and 830 transitions. Second operand has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 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:59,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 00:15:59,842 INFO L93 Difference]: Finished difference Result 1065 states and 1584 transitions. [2025-02-08 00:15:59,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 00:15:59,842 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 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 48 [2025-02-08 00:15:59,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 00:15:59,844 INFO L225 Difference]: With dead ends: 1065 [2025-02-08 00:15:59,844 INFO L226 Difference]: Without dead ends: 560 [2025-02-08 00:15:59,845 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:59,846 INFO L435 NwaCegarLoop]: 676 mSDtfsCounter, 0 mSDsluCounter, 1344 mSDsCounter, 0 mSdLazyCounter, 415 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2020 SdHoareTripleChecker+Invalid, 415 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 415 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-08 00:15:59,846 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2020 Invalid, 415 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 415 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-08 00:15:59,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 560 states. [2025-02-08 00:15:59,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 560 to 560. [2025-02-08 00:15:59,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 560 states, 559 states have (on average 1.4883720930232558) internal successors, (832), 559 states have internal predecessors, (832), 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:59,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 560 states to 560 states and 832 transitions. [2025-02-08 00:15:59,859 INFO L78 Accepts]: Start accepts. Automaton has 560 states and 832 transitions. Word has length 48 [2025-02-08 00:15:59,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 00:15:59,859 INFO L471 AbstractCegarLoop]: Abstraction has 560 states and 832 transitions. [2025-02-08 00:15:59,860 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 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:59,860 INFO L276 IsEmpty]: Start isEmpty. Operand 560 states and 832 transitions. [2025-02-08 00:15:59,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2025-02-08 00:15:59,861 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 00:15:59,861 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 00:15:59,861 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-08 00:15:59,861 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 00:15:59,862 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:15:59,862 INFO L85 PathProgramCache]: Analyzing trace with hash 294931582, now seen corresponding path program 1 times [2025-02-08 00:15:59,862 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 00:15:59,862 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1950792250] [2025-02-08 00:15:59,862 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:15:59,862 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 00:15:59,878 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-02-08 00:15:59,920 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-02-08 00:15:59,921 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:15:59,921 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 00:15:59,921 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 00:15:59,929 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-02-08 00:15:59,960 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-02-08 00:15:59,960 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:15:59,961 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 00:16:00,003 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 00:16:00,003 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-08 00:16:00,004 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-02-08 00:16:00,005 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-08 00:16:00,007 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2025-02-08 00:16:00,038 WARN L310 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2025-02-08 00:16:00,052 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-08 00:16:00,054 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.02 12:16:00 BoogieIcfgContainer [2025-02-08 00:16:00,056 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-08 00:16:00,056 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-08 00:16:00,057 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-08 00:16:00,057 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-08 00:16:00,057 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:56" (3/4) ... [2025-02-08 00:16:00,059 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-02-08 00:16:00,060 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-08 00:16:00,060 INFO L158 Benchmark]: Toolchain (without parser) took 7108.43ms. Allocated memory was 142.6MB in the beginning and 310.4MB in the end (delta: 167.8MB). Free memory was 105.4MB in the beginning and 111.2MB in the end (delta: -5.8MB). Peak memory consumption was 160.1MB. Max. memory is 16.1GB. [2025-02-08 00:16:00,061 INFO L158 Benchmark]: CDTParser took 0.23ms. Allocated memory is still 201.3MB. Free memory is still 127.9MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 00:16:00,061 INFO L158 Benchmark]: CACSL2BoogieTranslator took 469.13ms. Allocated memory is still 142.6MB. Free memory was 105.4MB in the beginning and 61.1MB in the end (delta: 44.3MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. [2025-02-08 00:16:00,061 INFO L158 Benchmark]: Boogie Procedure Inliner took 198.93ms. Allocated memory is still 142.6MB. Free memory was 61.1MB in the beginning and 67.8MB in the end (delta: -6.7MB). Peak memory consumption was 54.1MB. Max. memory is 16.1GB. [2025-02-08 00:16:00,062 INFO L158 Benchmark]: Boogie Preprocessor took 273.92ms. Allocated memory is still 142.6MB. Free memory was 67.8MB in the beginning and 72.6MB in the end (delta: -4.8MB). Peak memory consumption was 43.9MB. Max. memory is 16.1GB. [2025-02-08 00:16:00,062 INFO L158 Benchmark]: IcfgBuilder took 2165.36ms. Allocated memory was 142.6MB in the beginning and 310.4MB in the end (delta: 167.8MB). Free memory was 72.6MB in the beginning and 151.1MB in the end (delta: -78.5MB). Peak memory consumption was 196.3MB. Max. memory is 16.1GB. [2025-02-08 00:16:00,062 INFO L158 Benchmark]: TraceAbstraction took 3992.23ms. Allocated memory is still 310.4MB. Free memory was 151.1MB in the beginning and 111.2MB in the end (delta: 39.9MB). Peak memory consumption was 36.5MB. Max. memory is 16.1GB. [2025-02-08 00:16:00,063 INFO L158 Benchmark]: Witness Printer took 3.17ms. Allocated memory is still 310.4MB. Free memory was 111.2MB in the beginning and 111.2MB in the end (delta: 39.0kB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 00:16:00,064 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.23ms. Allocated memory is still 201.3MB. Free memory is still 127.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 469.13ms. Allocated memory is still 142.6MB. Free memory was 105.4MB in the beginning and 61.1MB in the end (delta: 44.3MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 198.93ms. Allocated memory is still 142.6MB. Free memory was 61.1MB in the beginning and 67.8MB in the end (delta: -6.7MB). Peak memory consumption was 54.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 273.92ms. Allocated memory is still 142.6MB. Free memory was 67.8MB in the beginning and 72.6MB in the end (delta: -4.8MB). Peak memory consumption was 43.9MB. Max. memory is 16.1GB. * IcfgBuilder took 2165.36ms. Allocated memory was 142.6MB in the beginning and 310.4MB in the end (delta: 167.8MB). Free memory was 72.6MB in the beginning and 151.1MB in the end (delta: -78.5MB). Peak memory consumption was 196.3MB. Max. memory is 16.1GB. * TraceAbstraction took 3992.23ms. Allocated memory is still 310.4MB. Free memory was 151.1MB in the beginning and 111.2MB in the end (delta: 39.9MB). Peak memory consumption was 36.5MB. Max. memory is 16.1GB. * Witness Printer took 3.17ms. Allocated memory is still 310.4MB. Free memory was 111.2MB in the beginning and 111.2MB in the end (delta: 39.0kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 21]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of bitwiseOr at line 177, overapproximation of bitwiseAnd at line 182. Possible FailurePath: [L26] const SORT_1 mask_SORT_1 = (SORT_1)-1 >> (sizeof(SORT_1) * 8 - 1); [L27] const SORT_1 msb_SORT_1 = (SORT_1)1 << (1 - 1); [L29] const SORT_3 mask_SORT_3 = (SORT_3)-1 >> (sizeof(SORT_3) * 8 - 5); [L30] const SORT_3 msb_SORT_3 = (SORT_3)1 << (5 - 1); [L32] const SORT_5 mask_SORT_5 = (SORT_5)-1 >> (sizeof(SORT_5) * 8 - 12); [L33] const SORT_5 msb_SORT_5 = (SORT_5)1 << (12 - 1); [L35] const SORT_7 mask_SORT_7 = (SORT_7)-1 >> (sizeof(SORT_7) * 8 - 3); [L36] const SORT_7 msb_SORT_7 = (SORT_7)1 << (3 - 1); [L38] const SORT_80 mask_SORT_80 = (SORT_80)-1 >> (sizeof(SORT_80) * 8 - 32); [L39] const SORT_80 msb_SORT_80 = (SORT_80)1 << (32 - 1); [L41] const SORT_91 mask_SORT_91 = (SORT_91)-1 >> (sizeof(SORT_91) * 8 - 4); [L42] const SORT_91 msb_SORT_91 = (SORT_91)1 << (4 - 1); [L44] const SORT_176 mask_SORT_176 = (SORT_176)-1 >> (sizeof(SORT_176) * 8 - 2); [L45] const SORT_176 msb_SORT_176 = (SORT_176)1 << (2 - 1); [L47] const SORT_7 var_8 = 0; [L48] const SORT_5 var_12 = 0; [L49] const SORT_7 var_16 = 2; [L50] const SORT_1 var_19 = 0; [L51] const SORT_3 var_23 = 0; [L52] const SORT_1 var_39 = 1; [L53] const SORT_7 var_59 = 1; [L54] const SORT_7 var_64 = 4; [L55] const SORT_7 var_66 = 5; [L56] const SORT_7 var_70 = 3; [L57] const SORT_80 var_82 = 0; [L58] const SORT_7 var_108 = 7; [L59] const SORT_7 var_113 = 6; [L60] const SORT_3 var_140 = 2; [L61] const SORT_3 var_185 = 31; [L63] SORT_1 input_2; [L64] SORT_3 input_4; [L65] SORT_5 input_6; [L66] SORT_3 input_173; [L67] SORT_3 input_174; [L68] SORT_3 input_175; [L69] SORT_3 input_184; [L70] SORT_3 input_194; [L71] SORT_3 input_195; [L72] SORT_3 input_196; [L73] SORT_3 input_199; [L74] SORT_3 input_218; [L75] SORT_3 input_219; [L76] SORT_3 input_220; [L77] SORT_3 input_223; [L78] SORT_3 input_225; [L79] SORT_176 input_239; [L80] SORT_176 input_240; [L81] SORT_176 input_241; [L83] EXPR __VERIFIER_nondet_uchar() & mask_SORT_7 VAL [mask_SORT_176=3, mask_SORT_1=1, mask_SORT_3=31, mask_SORT_5=4095, mask_SORT_7=7, mask_SORT_91=15, var_108=7, var_113=6, var_12=0, var_140=2, var_16=2, var_185=31, var_19=0, var_23=0, var_39=1, var_59=1, var_64=4, var_66=5, var_70=3, var_82=0, var_8=0] [L83] SORT_7 state_9 = __VERIFIER_nondet_uchar() & mask_SORT_7; [L84] EXPR __VERIFIER_nondet_ushort() & mask_SORT_5 VAL [mask_SORT_176=3, mask_SORT_1=1, mask_SORT_3=31, mask_SORT_7=7, mask_SORT_91=15, var_108=7, var_113=6, var_12=0, var_140=2, var_16=2, var_185=31, var_19=0, var_23=0, var_39=1, var_59=1, var_64=4, var_66=5, var_70=3, var_82=0, var_8=0] [L84] SORT_5 state_13 = __VERIFIER_nondet_ushort() & mask_SORT_5; [L85] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_176=3, mask_SORT_1=1, mask_SORT_3=31, mask_SORT_7=7, mask_SORT_91=15, var_108=7, var_113=6, var_12=0, var_140=2, var_16=2, var_185=31, var_19=0, var_23=0, var_39=1, var_59=1, var_64=4, var_66=5, var_70=3, var_82=0, var_8=0] [L85] SORT_1 state_20 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L86] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_176=3, mask_SORT_1=1, mask_SORT_3=31, mask_SORT_7=7, mask_SORT_91=15, var_108=7, var_113=6, var_12=0, var_140=2, var_16=2, var_185=31, var_19=0, var_23=0, var_39=1, var_59=1, var_64=4, var_66=5, var_70=3, var_82=0, var_8=0] [L86] SORT_3 state_24 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L87] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_176=3, mask_SORT_1=1, mask_SORT_3=31, mask_SORT_7=7, mask_SORT_91=15, var_108=7, var_113=6, var_12=0, var_140=2, var_16=2, var_185=31, var_19=0, var_23=0, var_39=1, var_59=1, var_64=4, var_66=5, var_70=3, var_82=0, var_8=0] [L87] SORT_3 state_26 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L88] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_176=3, mask_SORT_1=1, mask_SORT_3=31, mask_SORT_7=7, mask_SORT_91=15, var_108=7, var_113=6, var_12=0, var_140=2, var_16=2, var_185=31, var_19=0, var_23=0, var_39=1, var_59=1, var_64=4, var_66=5, var_70=3, var_82=0, var_8=0] [L88] SORT_3 state_32 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L89] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_176=3, mask_SORT_1=1, mask_SORT_3=31, mask_SORT_7=7, mask_SORT_91=15, var_108=7, var_113=6, var_12=0, var_140=2, var_16=2, var_185=31, var_19=0, var_23=0, var_39=1, var_59=1, var_64=4, var_66=5, var_70=3, var_82=0, var_8=0] [L89] SORT_3 state_43 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L90] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_176=3, mask_SORT_1=1, mask_SORT_3=31, mask_SORT_7=7, mask_SORT_91=15, var_108=7, var_113=6, var_12=0, var_140=2, var_16=2, var_185=31, var_19=0, var_23=0, var_39=1, var_59=1, var_64=4, var_66=5, var_70=3, var_82=0, var_8=0] [L90] SORT_3 state_45 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L91] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_176=3, mask_SORT_1=1, mask_SORT_3=31, mask_SORT_7=7, mask_SORT_91=15, var_108=7, var_113=6, var_12=0, var_140=2, var_16=2, var_185=31, var_19=0, var_23=0, var_39=1, var_59=1, var_64=4, var_66=5, var_70=3, var_82=0, var_8=0] [L91] SORT_3 state_47 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L92] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_176=3, mask_SORT_1=1, mask_SORT_3=31, mask_SORT_7=7, mask_SORT_91=15, var_108=7, var_113=6, var_12=0, var_140=2, var_16=2, var_185=31, var_19=0, var_23=0, var_39=1, var_59=1, var_64=4, var_66=5, var_70=3, var_82=0, var_8=0] [L92] SORT_3 state_49 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L93] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_176=3, mask_SORT_1=1, mask_SORT_3=31, mask_SORT_7=7, mask_SORT_91=15, var_108=7, var_113=6, var_12=0, var_140=2, var_16=2, var_185=31, var_19=0, var_23=0, var_39=1, var_59=1, var_64=4, var_66=5, var_70=3, var_82=0, var_8=0] [L93] SORT_3 state_51 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L94] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_176=3, mask_SORT_1=1, mask_SORT_3=31, mask_SORT_7=7, mask_SORT_91=15, var_108=7, var_113=6, var_12=0, var_140=2, var_16=2, var_185=31, var_19=0, var_23=0, var_39=1, var_59=1, var_64=4, var_66=5, var_70=3, var_82=0, var_8=0] [L94] SORT_3 state_53 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L95] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_176=3, mask_SORT_1=1, mask_SORT_3=31, mask_SORT_7=7, mask_SORT_91=15, var_108=7, var_113=6, var_12=0, var_140=2, var_16=2, var_185=31, var_19=0, var_23=0, var_39=1, var_59=1, var_64=4, var_66=5, var_70=3, var_82=0, var_8=0] [L95] SORT_3 state_55 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L97] SORT_7 init_10_arg_1 = var_8; [L98] state_9 = init_10_arg_1 [L99] SORT_5 init_14_arg_1 = var_12; [L100] state_13 = init_14_arg_1 [L101] SORT_1 init_21_arg_1 = var_19; [L102] state_20 = init_21_arg_1 [L103] SORT_3 init_25_arg_1 = var_23; [L104] state_24 = init_25_arg_1 [L105] SORT_3 init_27_arg_1 = var_23; [L106] state_26 = init_27_arg_1 [L107] SORT_3 init_33_arg_1 = var_23; [L108] state_32 = init_33_arg_1 [L109] SORT_3 init_44_arg_1 = var_23; [L110] state_43 = init_44_arg_1 [L111] SORT_3 init_46_arg_1 = var_23; [L112] state_45 = init_46_arg_1 [L113] SORT_3 init_48_arg_1 = var_23; [L114] state_47 = init_48_arg_1 [L115] SORT_3 init_50_arg_1 = var_23; [L116] state_49 = init_50_arg_1 [L117] SORT_3 init_52_arg_1 = var_23; [L118] state_51 = init_52_arg_1 [L119] SORT_3 init_54_arg_1 = var_23; [L120] state_53 = init_54_arg_1 [L121] SORT_3 init_56_arg_1 = var_23; [L122] state_55 = init_56_arg_1 VAL [mask_SORT_176=3, mask_SORT_1=1, mask_SORT_3=31, mask_SORT_7=7, mask_SORT_91=15, state_13=0, state_20=0, state_24=0, state_26=0, state_32=0, state_43=0, state_45=0, state_47=0, state_49=0, state_51=0, state_53=0, state_55=0, state_9=0, var_108=7, var_113=6, var_140=2, var_16=2, var_185=31, var_19=0, var_23=0, var_39=1, var_59=1, var_64=4, var_66=5, var_70=3, var_82=0, var_8=0] [L125] input_2 = __VERIFIER_nondet_uchar() [L126] input_4 = __VERIFIER_nondet_uchar() [L127] input_6 = __VERIFIER_nondet_ushort() [L128] input_173 = __VERIFIER_nondet_uchar() [L129] input_174 = __VERIFIER_nondet_uchar() [L130] input_175 = __VERIFIER_nondet_uchar() [L131] input_184 = __VERIFIER_nondet_uchar() [L132] input_194 = __VERIFIER_nondet_uchar() [L133] input_195 = __VERIFIER_nondet_uchar() [L134] input_196 = __VERIFIER_nondet_uchar() [L135] input_199 = __VERIFIER_nondet_uchar() [L136] input_218 = __VERIFIER_nondet_uchar() [L137] input_219 = __VERIFIER_nondet_uchar() [L138] input_220 = __VERIFIER_nondet_uchar() [L139] input_223 = __VERIFIER_nondet_uchar() [L140] input_225 = __VERIFIER_nondet_uchar() [L141] input_239 = __VERIFIER_nondet_uchar() [L142] input_240 = __VERIFIER_nondet_uchar() [L143] input_241 = __VERIFIER_nondet_uchar() [L146] SORT_7 var_11_arg_0 = state_9; [L147] SORT_1 var_11 = var_11_arg_0 >> 2; [L148] SORT_5 var_15_arg_0 = state_13; [L149] SORT_7 var_15 = var_15_arg_0 >> 9; VAL [mask_SORT_176=3, mask_SORT_1=1, mask_SORT_3=31, mask_SORT_7=7, mask_SORT_91=15, state_13=0, state_20=0, state_24=0, state_26=0, state_32=0, state_43=0, state_45=0, state_47=0, state_49=0, state_51=0, state_53=0, state_55=0, state_9=0, var_108=7, var_113=6, var_11=0, var_140=2, var_15=0, var_16=2, var_185=31, var_19=0, var_23=0, var_39=1, var_59=1, var_64=4, var_66=5, var_70=3, var_82=0, var_8=0] [L150] EXPR var_15 & mask_SORT_7 VAL [mask_SORT_176=3, mask_SORT_1=1, mask_SORT_3=31, mask_SORT_7=7, mask_SORT_91=15, state_13=0, state_20=0, state_24=0, state_26=0, state_32=0, state_43=0, state_45=0, state_47=0, state_49=0, state_51=0, state_53=0, state_55=0, state_9=0, var_108=7, var_113=6, var_11=0, var_140=2, var_16=2, var_185=31, var_19=0, var_23=0, var_39=1, var_59=1, var_64=4, var_66=5, var_70=3, var_82=0, var_8=0] [L150] var_15 = var_15 & mask_SORT_7 [L151] SORT_7 var_17_arg_0 = var_15; [L152] SORT_7 var_17_arg_1 = var_16; [L153] SORT_1 var_17 = var_17_arg_0 == var_17_arg_1; [L154] SORT_1 var_18_arg_0 = var_11; [L155] SORT_1 var_18_arg_1 = var_17; VAL [mask_SORT_176=3, mask_SORT_1=1, mask_SORT_3=31, mask_SORT_7=7, mask_SORT_91=15, state_13=0, state_20=0, state_24=0, state_26=0, state_32=0, state_43=0, state_45=0, state_47=0, state_49=0, state_51=0, state_53=0, state_55=0, state_9=0, var_108=7, var_113=6, var_140=2, var_15=0, var_16=2, var_17=0, var_185=31, var_18_arg_0=0, var_18_arg_1=0, var_19=0, var_23=0, var_39=1, var_59=1, var_64=4, var_66=5, var_70=3, var_82=0, var_8=0] [L156] EXPR var_18_arg_0 & var_18_arg_1 VAL [mask_SORT_176=3, mask_SORT_1=1, mask_SORT_3=31, mask_SORT_7=7, mask_SORT_91=15, state_13=0, state_20=0, state_24=0, state_26=0, state_32=0, state_43=0, state_45=0, state_47=0, state_49=0, state_51=0, state_53=0, state_55=0, state_9=0, var_108=7, var_113=6, var_140=2, var_15=0, var_16=2, var_17=0, var_185=31, var_19=0, var_23=0, var_39=1, var_59=1, var_64=4, var_66=5, var_70=3, var_82=0, var_8=0] [L156] SORT_1 var_18 = var_18_arg_0 & var_18_arg_1; [L157] SORT_1 var_22_arg_0 = var_18; [L158] SORT_1 var_22_arg_1 = state_20; VAL [mask_SORT_176=3, mask_SORT_1=1, mask_SORT_3=31, mask_SORT_7=7, mask_SORT_91=15, state_13=0, state_20=0, state_24=0, state_26=0, state_32=0, state_43=0, state_45=0, state_47=0, state_49=0, state_51=0, state_53=0, state_55=0, state_9=0, var_108=7, var_113=6, var_140=2, var_15=0, var_16=2, var_17=0, var_185=31, var_19=0, var_22_arg_0=0, var_22_arg_1=0, var_23=0, var_39=1, var_59=1, var_64=4, var_66=5, var_70=3, var_82=0, var_8=0] [L159] EXPR var_22_arg_0 & var_22_arg_1 VAL [mask_SORT_176=3, mask_SORT_1=1, mask_SORT_3=31, mask_SORT_7=7, mask_SORT_91=15, state_13=0, state_20=0, state_24=0, state_26=0, state_32=0, state_43=0, state_45=0, state_47=0, state_49=0, state_51=0, state_53=0, state_55=0, state_9=0, var_108=7, var_113=6, var_140=2, var_15=0, var_16=2, var_17=0, var_185=31, var_19=0, var_23=0, var_39=1, var_59=1, var_64=4, var_66=5, var_70=3, var_82=0, var_8=0] [L159] SORT_1 var_22 = var_22_arg_0 & var_22_arg_1; [L160] SORT_3 var_28_arg_0 = state_24; [L161] SORT_3 var_28_arg_1 = state_26; [L162] SORT_1 var_28 = var_28_arg_0 == var_28_arg_1; [L163] SORT_1 var_29_arg_0 = var_28; [L164] SORT_1 var_29 = ~var_29_arg_0; [L165] SORT_1 var_30_arg_0 = var_22; [L166] SORT_1 var_30_arg_1 = var_29; VAL [mask_SORT_176=3, mask_SORT_1=1, mask_SORT_3=31, mask_SORT_7=7, mask_SORT_91=15, state_13=0, state_20=0, state_24=0, state_26=0, state_32=0, state_43=0, state_45=0, state_47=0, state_49=0, state_51=0, state_53=0, state_55=0, state_9=0, var_108=7, var_113=6, var_140=2, var_15=0, var_16=2, var_17=0, var_185=31, var_19=0, var_23=0, var_30_arg_0=0, var_30_arg_1=-2, var_39=1, var_59=1, var_64=4, var_66=5, var_70=3, var_82=0, var_8=0] [L167] EXPR var_30_arg_0 & var_30_arg_1 VAL [mask_SORT_176=3, mask_SORT_1=1, mask_SORT_3=31, mask_SORT_7=7, mask_SORT_91=15, state_13=0, state_20=0, state_24=0, state_26=0, state_32=0, state_43=0, state_45=0, state_47=0, state_49=0, state_51=0, state_53=0, state_55=0, state_9=0, var_108=7, var_113=6, var_140=2, var_15=0, var_16=2, var_17=0, var_185=31, var_19=0, var_23=0, var_39=1, var_59=1, var_64=4, var_66=5, var_70=3, var_82=0, var_8=0] [L167] SORT_1 var_30 = var_30_arg_0 & var_30_arg_1; [L168] SORT_1 var_31_arg_0 = var_30; [L169] SORT_1 var_31 = ~var_31_arg_0; [L170] SORT_3 var_34_arg_0 = state_32; [L171] SORT_3 var_34_arg_1 = state_26; [L172] SORT_1 var_34 = var_34_arg_0 == var_34_arg_1; [L173] SORT_1 var_35_arg_0 = var_34; [L174] SORT_1 var_35 = ~var_35_arg_0; [L175] SORT_1 var_36_arg_0 = var_31; [L176] SORT_1 var_36_arg_1 = var_35; VAL [mask_SORT_176=3, mask_SORT_1=1, mask_SORT_3=31, mask_SORT_7=7, mask_SORT_91=15, state_13=0, state_20=0, state_24=0, state_26=0, state_32=0, state_43=0, state_45=0, state_47=0, state_49=0, state_51=0, state_53=0, state_55=0, state_9=0, var_108=7, var_113=6, var_140=2, var_15=0, var_16=2, var_17=0, var_185=31, var_19=0, var_23=0, var_36_arg_0=-1, var_36_arg_1=-2, var_39=1, var_59=1, var_64=4, var_66=5, var_70=3, var_82=0, var_8=0] [L177] EXPR var_36_arg_0 | var_36_arg_1 VAL [mask_SORT_176=3, mask_SORT_1=1, mask_SORT_3=31, mask_SORT_7=7, mask_SORT_91=15, state_13=0, state_20=0, state_24=0, state_26=0, state_32=0, state_43=0, state_45=0, state_47=0, state_49=0, state_51=0, state_53=0, state_55=0, state_9=0, var_108=7, var_113=6, var_140=2, var_15=0, var_16=2, var_17=0, var_185=31, var_19=0, var_23=0, var_39=1, var_59=1, var_64=4, var_66=5, var_70=3, var_82=0, var_8=0] [L177] SORT_1 var_36 = var_36_arg_0 | var_36_arg_1; [L178] SORT_1 var_40_arg_0 = var_36; [L179] SORT_1 var_40 = ~var_40_arg_0; [L180] SORT_1 var_41_arg_0 = var_39; [L181] SORT_1 var_41_arg_1 = var_40; VAL [mask_SORT_176=3, mask_SORT_1=1, mask_SORT_3=31, mask_SORT_7=7, mask_SORT_91=15, state_13=0, state_20=0, state_24=0, state_26=0, state_32=0, state_43=0, state_45=0, state_47=0, state_49=0, state_51=0, state_53=0, state_55=0, state_9=0, var_108=7, var_113=6, var_140=2, var_15=0, var_16=2, var_17=0, var_185=31, var_19=0, var_23=0, var_39=1, var_41_arg_0=1, var_41_arg_1=-254, var_59=1, var_64=4, var_66=5, var_70=3, var_82=0, var_8=0] [L182] EXPR var_41_arg_0 & var_41_arg_1 VAL [mask_SORT_176=3, mask_SORT_1=1, mask_SORT_3=31, mask_SORT_7=7, mask_SORT_91=15, state_13=0, state_20=0, state_24=0, state_26=0, state_32=0, state_43=0, state_45=0, state_47=0, state_49=0, state_51=0, state_53=0, state_55=0, state_9=0, var_108=7, var_113=6, var_140=2, var_15=0, var_16=2, var_17=0, var_185=31, var_19=0, var_23=0, var_39=1, var_59=1, var_64=4, var_66=5, var_70=3, var_82=0, var_8=0] [L182] SORT_1 var_41 = var_41_arg_0 & var_41_arg_1; [L183] EXPR var_41 & mask_SORT_1 VAL [mask_SORT_176=3, mask_SORT_1=1, mask_SORT_3=31, mask_SORT_7=7, mask_SORT_91=15, state_13=0, state_20=0, state_24=0, state_26=0, state_32=0, state_43=0, state_45=0, state_47=0, state_49=0, state_51=0, state_53=0, state_55=0, state_9=0, var_108=7, var_113=6, var_140=2, var_15=0, var_16=2, var_17=0, var_185=31, var_19=0, var_23=0, var_39=1, var_59=1, var_64=4, var_66=5, var_70=3, var_82=0, var_8=0] [L183] var_41 = var_41 & mask_SORT_1 [L184] SORT_1 bad_42_arg_0 = var_41; [L185] CALL __VERIFIER_assert(!(bad_42_arg_0)) [L21] COND TRUE !(cond) [L21] reach_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 545 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 3.9s, OverallIterations: 7, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 785 SdHoareTripleChecker+Valid, 1.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 785 mSDsluCounter, 14759 SdHoareTripleChecker+Invalid, 1.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 10716 mSDsCounter, 5 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3100 IncrementalHoareTripleChecker+Invalid, 3105 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 5 mSolverCounterUnsat, 4043 mSDtfsCounter, 3100 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 35 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=560occurred in iteration=6, InterpolantAutomatonStates: 30, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 6 MinimizatonAttempts, 2 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.4s InterpolantComputationTime, 327 NumberOfCodeBlocks, 327 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 272 ConstructedInterpolants, 0 QuantifiedInterpolants, 458 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:16:00,082 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, 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_p13.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 07c94e5cd3bc71d2316ee023f3c3de7a743ac154d633131bf7b85324be3bb818 --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-08 00:16:02,044 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-08 00:16:02,143 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:16:02,149 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-08 00:16:02,149 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-08 00:16:02,170 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-08 00:16:02,172 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-08 00:16:02,172 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-08 00:16:02,172 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-08 00:16:02,172 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-08 00:16:02,173 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-08 00:16:02,173 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-08 00:16:02,173 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-08 00:16:02,173 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-08 00:16:02,173 INFO L153 SettingsManager]: * Use SBE=true [2025-02-08 00:16:02,174 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-08 00:16:02,174 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-08 00:16:02,174 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-08 00:16:02,174 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-08 00:16:02,174 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-08 00:16:02,174 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-08 00:16:02,174 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-02-08 00:16:02,174 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-02-08 00:16:02,174 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-02-08 00:16:02,174 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-08 00:16:02,174 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-08 00:16:02,174 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-08 00:16:02,174 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-08 00:16:02,174 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-08 00:16:02,174 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-08 00:16:02,175 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-08 00:16:02,175 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 00:16:02,175 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-08 00:16:02,175 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-08 00:16:02,175 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-08 00:16:02,175 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-08 00:16:02,175 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-02-08 00:16:02,175 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-02-08 00:16:02,175 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-08 00:16:02,175 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-08 00:16:02,175 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-08 00:16:02,175 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-08 00:16:02,175 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 -> 07c94e5cd3bc71d2316ee023f3c3de7a743ac154d633131bf7b85324be3bb818 [2025-02-08 00:16:02,406 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-08 00:16:02,420 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-08 00:16:02,422 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-08 00:16:02,423 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-08 00:16:02,423 INFO L274 PluginConnector]: CDTParser initialized [2025-02-08 00:16:02,423 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_p13.c [2025-02-08 00:16:03,626 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/599b7225c/202b243ccf564bf29f286cb8cfd078ba/FLAG4628c36b6 [2025-02-08 00:16:03,896 INFO L384 CDTParser]: Found 1 translation units. [2025-02-08 00:16:03,899 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_arrays_vsaR_p13.c [2025-02-08 00:16:03,910 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/599b7225c/202b243ccf564bf29f286cb8cfd078ba/FLAG4628c36b6 [2025-02-08 00:16:04,193 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/599b7225c/202b243ccf564bf29f286cb8cfd078ba [2025-02-08 00:16:04,195 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-08 00:16:04,196 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-08 00:16:04,197 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-08 00:16:04,197 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-08 00:16:04,200 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-08 00:16:04,200 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 12:16:04" (1/1) ... [2025-02-08 00:16:04,202 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@603e8fa2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:16:04, skipping insertion in model container [2025-02-08 00:16:04,202 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 12:16:04" (1/1) ... [2025-02-08 00:16:04,259 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-08 00:16:04,433 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_p13.c[1259,1272] [2025-02-08 00:16:04,578 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 00:16:04,587 INFO L200 MainTranslator]: Completed pre-run [2025-02-08 00:16:04,594 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_p13.c[1259,1272] [2025-02-08 00:16:04,688 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 00:16:04,699 INFO L204 MainTranslator]: Completed translation [2025-02-08 00:16:04,700 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:16:04 WrapperNode [2025-02-08 00:16:04,700 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-08 00:16:04,701 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-08 00:16:04,701 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-08 00:16:04,702 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-08 00:16:04,706 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:16:04" (1/1) ... [2025-02-08 00:16:04,728 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:16:04" (1/1) ... [2025-02-08 00:16:04,767 INFO L138 Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 1085 [2025-02-08 00:16:04,768 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-08 00:16:04,768 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-08 00:16:04,769 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-08 00:16:04,769 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-08 00:16:04,779 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:16:04" (1/1) ... [2025-02-08 00:16:04,779 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:16:04" (1/1) ... [2025-02-08 00:16:04,794 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:16:04" (1/1) ... [2025-02-08 00:16:04,834 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:16:04,835 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:16:04" (1/1) ... [2025-02-08 00:16:04,835 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:16:04" (1/1) ... [2025-02-08 00:16:04,865 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:16:04" (1/1) ... [2025-02-08 00:16:04,870 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:16:04" (1/1) ... [2025-02-08 00:16:04,876 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:16:04" (1/1) ... [2025-02-08 00:16:04,881 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:16:04" (1/1) ... [2025-02-08 00:16:04,910 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-08 00:16:04,914 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-08 00:16:04,914 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-08 00:16:04,914 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-08 00:16:04,915 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:16:04" (1/1) ... [2025-02-08 00:16:04,921 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 00:16:04,930 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 00:16:04,941 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:16:04,944 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:16:04,960 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-08 00:16:04,960 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-02-08 00:16:04,960 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-08 00:16:04,960 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-08 00:16:05,127 INFO L257 CfgBuilder]: Building ICFG [2025-02-08 00:16:05,129 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-08 00:16:06,175 INFO L? ?]: Removed 79 outVars from TransFormulas that were not future-live. [2025-02-08 00:16:06,175 INFO L308 CfgBuilder]: Performing block encoding [2025-02-08 00:16:06,182 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-08 00:16:06,182 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-08 00:16:06,182 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 12:16:06 BoogieIcfgContainer [2025-02-08 00:16:06,182 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-08 00:16:06,183 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-08 00:16:06,183 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-08 00:16:06,187 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-08 00:16:06,188 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.02 12:16:04" (1/3) ... [2025-02-08 00:16:06,188 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5a85d90b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 12:16:06, skipping insertion in model container [2025-02-08 00:16:06,188 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:16:04" (2/3) ... [2025-02-08 00:16:06,188 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5a85d90b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 12:16:06, skipping insertion in model container [2025-02-08 00:16:06,189 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 12:16:06" (3/3) ... [2025-02-08 00:16:06,190 INFO L128 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.vis_arrays_vsaR_p13.c [2025-02-08 00:16:06,203 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-08 00:16:06,204 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG btor2c-lazyMod.vis_arrays_vsaR_p13.c that has 1 procedures, 8 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-08 00:16:06,237 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 00:16:06,247 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;@7bbea43b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 00:16:06,247 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-08 00:16:06,250 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:16:06,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2025-02-08 00:16:06,253 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 00:16:06,254 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2025-02-08 00:16:06,255 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 00:16:06,259 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:16:06,260 INFO L85 PathProgramCache]: Analyzing trace with hash 1137951, now seen corresponding path program 1 times [2025-02-08 00:16:06,268 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-08 00:16:06,270 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [752630713] [2025-02-08 00:16:06,270 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:16:06,270 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 00:16:06,270 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 00:16:06,276 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:16:06,280 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:16:06,485 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-08 00:16:06,503 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-08 00:16:06,504 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:16:06,504 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:16:06,510 INFO L256 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-02-08 00:16:06,516 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 00:16:06,627 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:16:06,628 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 00:16:06,628 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-08 00:16:06,628 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [752630713] [2025-02-08 00:16:06,628 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [752630713] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 00:16:06,628 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 00:16:06,629 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 00:16:06,630 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1718191218] [2025-02-08 00:16:06,630 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 00:16:06,632 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 00:16:06,633 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-08 00:16:06,644 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 00:16:06,645 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 00:16:06,646 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:16:06,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 00:16:06,711 INFO L93 Difference]: Finished difference Result 16 states and 21 transitions. [2025-02-08 00:16:06,712 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 00:16:06,713 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:16:06,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 00:16:06,717 INFO L225 Difference]: With dead ends: 16 [2025-02-08 00:16:06,717 INFO L226 Difference]: Without dead ends: 9 [2025-02-08 00:16:06,719 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:16:06,721 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:16:06,721 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:16:06,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2025-02-08 00:16:06,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 8. [2025-02-08 00:16:06,739 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:16:06,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 8 transitions. [2025-02-08 00:16:06,744 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 8 transitions. Word has length 4 [2025-02-08 00:16:06,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 00:16:06,744 INFO L471 AbstractCegarLoop]: Abstraction has 8 states and 8 transitions. [2025-02-08 00:16:06,745 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:16:06,745 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2025-02-08 00:16:06,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-02-08 00:16:06,745 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 00:16:06,745 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1] [2025-02-08 00:16:06,753 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-02-08 00:16:06,946 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:16:06,946 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 00:16:06,946 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:16:06,946 INFO L85 PathProgramCache]: Analyzing trace with hash -458170295, now seen corresponding path program 1 times [2025-02-08 00:16:06,947 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-08 00:16:06,947 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2026854553] [2025-02-08 00:16:06,947 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:16:06,947 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 00:16:06,947 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 00:16:06,952 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:16:06,953 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:16:07,238 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-02-08 00:16:07,289 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-02-08 00:16:07,290 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:16:07,290 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:16:07,296 INFO L256 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 34 conjuncts are in the unsatisfiable core [2025-02-08 00:16:07,306 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 00:16:08,476 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:16:08,477 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 00:16:23,033 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:16:23,034 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-08 00:16:23,034 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2026854553] [2025-02-08 00:16:23,034 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2026854553] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 00:16:23,036 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-08 00:16:23,036 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 11 [2025-02-08 00:16:23,036 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2106133118] [2025-02-08 00:16:23,036 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-08 00:16:23,041 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-02-08 00:16:23,041 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-08 00:16:23,041 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-02-08 00:16:23,041 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2025-02-08 00:16:23,041 INFO L87 Difference]: Start difference. First operand 8 states and 8 transitions. Second operand has 12 states, 12 states have (on average 1.0833333333333333) internal successors, (13), 11 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:16:23,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 00:16:23,210 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2025-02-08 00:16:23,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-08 00:16:23,210 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 1.0833333333333333) internal successors, (13), 11 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:16:23,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 00:16:23,210 INFO L225 Difference]: With dead ends: 14 [2025-02-08 00:16:23,210 INFO L226 Difference]: Without dead ends: 12 [2025-02-08 00:16:23,211 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=67, Invalid=143, Unknown=0, NotChecked=0, Total=210 [2025-02-08 00:16:23,211 INFO L435 NwaCegarLoop]: 3 mSDtfsCounter, 6 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 00:16:23,211 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 18 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 00:16:23,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2025-02-08 00:16:23,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 11. [2025-02-08 00:16:23,213 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:16:23,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 11 transitions. [2025-02-08 00:16:23,213 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 11 transitions. Word has length 7 [2025-02-08 00:16:23,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 00:16:23,213 INFO L471 AbstractCegarLoop]: Abstraction has 11 states and 11 transitions. [2025-02-08 00:16:23,213 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 1.0833333333333333) internal successors, (13), 11 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:16:23,213 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 11 transitions. [2025-02-08 00:16:23,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-02-08 00:16:23,213 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 00:16:23,213 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1] [2025-02-08 00:16:23,221 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-02-08 00:16:23,414 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:16:23,414 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 00:16:23,415 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:16:23,415 INFO L85 PathProgramCache]: Analyzing trace with hash 55678175, now seen corresponding path program 2 times [2025-02-08 00:16:23,415 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-08 00:16:23,415 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [47954717] [2025-02-08 00:16:23,415 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 00:16:23,416 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 00:16:23,416 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 00:16:23,417 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:16:23,419 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:16:23,651 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 10 statements into 2 equivalence classes. [2025-02-08 00:16:23,701 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 10 of 10 statements. [2025-02-08 00:16:23,702 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-08 00:16:23,702 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:16:23,712 INFO L256 TraceCheckSpWp]: Trace formula consists of 214 conjuncts, 43 conjuncts are in the unsatisfiable core [2025-02-08 00:16:23,720 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 00:16:30,630 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:16:30,630 INFO L312 TraceCheckSpWp]: Computing backward predicates...