./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_QF_BV_bcuvis32.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 551b0097 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_QF_BV_bcuvis32.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 1ef8d174762b17df623a48d7afe94f1e8bc5e2233dcaad9b42847f8ac912d010 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 08:18:03,019 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 08:18:03,094 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2025-01-09 08:18:03,098 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 08:18:03,099 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 08:18:03,119 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 08:18:03,120 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 08:18:03,120 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 08:18:03,120 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 08:18:03,120 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 08:18:03,120 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 08:18:03,120 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 08:18:03,120 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 08:18:03,120 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 08:18:03,121 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 08:18:03,121 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 08:18:03,121 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 08:18:03,121 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 08:18:03,121 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 08:18:03,121 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 08:18:03,121 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 08:18:03,121 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 08:18:03,121 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 08:18:03,121 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 08:18:03,121 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 08:18:03,122 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 08:18:03,122 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 08:18:03,122 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 08:18:03,122 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 08:18:03,122 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 08:18:03,122 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 08:18:03,123 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 08:18:03,123 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 08:18:03,123 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 08:18:03,123 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 08:18:03,123 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 08:18:03,123 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 08:18:03,123 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 08:18:03,123 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 08:18:03,124 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 08:18:03,124 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 08:18:03,124 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 08:18:03,124 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 08:18:03,124 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 08:18:03,124 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 08:18:03,124 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 -> 1ef8d174762b17df623a48d7afe94f1e8bc5e2233dcaad9b42847f8ac912d010 [2025-01-09 08:18:03,400 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 08:18:03,410 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 08:18:03,412 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 08:18:03,413 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 08:18:03,414 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 08:18:03,415 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_QF_BV_bcuvis32.c [2025-01-09 08:18:04,689 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/48043ecb0/124d9f6027ba4f43a06f7c5b310cb10e/FLAG6cac7e98a [2025-01-09 08:18:05,064 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 08:18:05,064 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_QF_BV_bcuvis32.c [2025-01-09 08:18:05,101 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/48043ecb0/124d9f6027ba4f43a06f7c5b310cb10e/FLAG6cac7e98a [2025-01-09 08:18:05,123 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/48043ecb0/124d9f6027ba4f43a06f7c5b310cb10e [2025-01-09 08:18:05,125 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 08:18:05,127 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 08:18:05,128 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 08:18:05,128 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 08:18:05,131 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 08:18:05,131 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 08:18:05" (1/1) ... [2025-01-09 08:18:05,132 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@526be6f0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:18:05, skipping insertion in model container [2025-01-09 08:18:05,132 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 08:18:05" (1/1) ... [2025-01-09 08:18:05,163 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 08:18:05,315 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_QF_BV_bcuvis32.c[1258,1271] [2025-01-09 08:18:05,441 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 08:18:05,457 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 08:18:05,466 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_QF_BV_bcuvis32.c[1258,1271] [2025-01-09 08:18:05,544 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 08:18:05,562 INFO L204 MainTranslator]: Completed translation [2025-01-09 08:18:05,563 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:18:05 WrapperNode [2025-01-09 08:18:05,565 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 08:18:05,566 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 08:18:05,566 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 08:18:05,566 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 08:18:05,572 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:18:05" (1/1) ... [2025-01-09 08:18:05,590 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:18:05" (1/1) ... [2025-01-09 08:18:05,665 INFO L138 Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 617 [2025-01-09 08:18:05,666 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 08:18:05,666 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 08:18:05,666 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 08:18:05,666 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 08:18:05,674 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:18:05" (1/1) ... [2025-01-09 08:18:05,675 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:18:05" (1/1) ... [2025-01-09 08:18:05,695 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:18:05" (1/1) ... [2025-01-09 08:18:05,743 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-01-09 08:18:05,745 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:18:05" (1/1) ... [2025-01-09 08:18:05,745 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:18:05" (1/1) ... [2025-01-09 08:18:05,778 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:18:05" (1/1) ... [2025-01-09 08:18:05,786 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:18:05" (1/1) ... [2025-01-09 08:18:05,799 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:18:05" (1/1) ... [2025-01-09 08:18:05,814 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:18:05" (1/1) ... [2025-01-09 08:18:05,825 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:18:05" (1/1) ... [2025-01-09 08:18:05,841 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 08:18:05,843 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 08:18:05,844 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 08:18:05,844 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 08:18:05,845 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:18:05" (1/1) ... [2025-01-09 08:18:05,849 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 08:18:05,862 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 08:18:05,878 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-01-09 08:18:05,885 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-01-09 08:18:05,906 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 08:18:05,906 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 08:18:05,906 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 08:18:05,906 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 08:18:06,042 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 08:18:06,045 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 08:18:06,884 INFO L? ?]: Removed 316 outVars from TransFormulas that were not future-live. [2025-01-09 08:18:06,884 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 08:18:06,897 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 08:18:06,897 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 08:18:06,897 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 08:18:06 BoogieIcfgContainer [2025-01-09 08:18:06,898 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 08:18:06,899 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 08:18:06,899 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 08:18:06,904 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 08:18:06,905 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 08:18:05" (1/3) ... [2025-01-09 08:18:06,905 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@24d51e5e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 08:18:06, skipping insertion in model container [2025-01-09 08:18:06,905 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:18:05" (2/3) ... [2025-01-09 08:18:06,906 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@24d51e5e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 08:18:06, skipping insertion in model container [2025-01-09 08:18:06,906 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 08:18:06" (3/3) ... [2025-01-09 08:18:06,907 INFO L128 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.vis_QF_BV_bcuvis32.c [2025-01-09 08:18:06,922 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 08:18:06,924 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG btor2c-lazyMod.vis_QF_BV_bcuvis32.c that has 1 procedures, 118 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 08:18:06,982 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 08:18:06,995 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;@3165e90a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 08:18:06,995 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 08:18:07,000 INFO L276 IsEmpty]: Start isEmpty. Operand has 118 states, 116 states have (on average 1.4913793103448276) internal successors, (173), 117 states have internal predecessors, (173), 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-01-09 08:18:07,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2025-01-09 08:18:07,008 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 08:18:07,008 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 08:18:07,009 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 08:18:07,014 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 08:18:07,015 INFO L85 PathProgramCache]: Analyzing trace with hash 1749147305, now seen corresponding path program 1 times [2025-01-09 08:18:07,022 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 08:18:07,023 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1344085952] [2025-01-09 08:18:07,023 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 08:18:07,024 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 08:18:07,110 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-01-09 08:18:07,177 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-01-09 08:18:07,179 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 08:18:07,179 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 08:18:07,740 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 08:18:07,740 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 08:18:07,741 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1344085952] [2025-01-09 08:18:07,741 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1344085952] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 08:18:07,741 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 08:18:07,742 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 08:18:07,744 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1276374052] [2025-01-09 08:18:07,745 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 08:18:07,748 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 08:18:07,748 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 08:18:07,763 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 08:18:07,763 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 08:18:07,767 INFO L87 Difference]: Start difference. First operand has 118 states, 116 states have (on average 1.4913793103448276) internal successors, (173), 117 states have internal predecessors, (173), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:18:07,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 08:18:07,822 INFO L93 Difference]: Finished difference Result 193 states and 285 transitions. [2025-01-09 08:18:07,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 08:18:07,825 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 39 [2025-01-09 08:18:07,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 08:18:07,831 INFO L225 Difference]: With dead ends: 193 [2025-01-09 08:18:07,832 INFO L226 Difference]: Without dead ends: 117 [2025-01-09 08:18:07,835 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-01-09 08:18:07,837 INFO L435 NwaCegarLoop]: 167 mSDtfsCounter, 0 mSDsluCounter, 328 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 495 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 08:18:07,838 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 495 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 08:18:07,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2025-01-09 08:18:07,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 117. [2025-01-09 08:18:07,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 116 states have (on average 1.4741379310344827) internal successors, (171), 116 states have internal predecessors, (171), 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-01-09 08:18:07,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 171 transitions. [2025-01-09 08:18:07,874 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 171 transitions. Word has length 39 [2025-01-09 08:18:07,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 08:18:07,874 INFO L471 AbstractCegarLoop]: Abstraction has 117 states and 171 transitions. [2025-01-09 08:18:07,875 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:18:07,875 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 171 transitions. [2025-01-09 08:18:07,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-01-09 08:18:07,876 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 08:18:07,876 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 08:18:07,876 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 08:18:07,876 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 08:18:07,877 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 08:18:07,877 INFO L85 PathProgramCache]: Analyzing trace with hash -1609313019, now seen corresponding path program 1 times [2025-01-09 08:18:07,877 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 08:18:07,877 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [955534209] [2025-01-09 08:18:07,877 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 08:18:07,877 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 08:18:07,904 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-01-09 08:18:07,927 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-01-09 08:18:07,927 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 08:18:07,927 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 08:18:08,117 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 08:18:08,118 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 08:18:08,118 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [955534209] [2025-01-09 08:18:08,119 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [955534209] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 08:18:08,119 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 08:18:08,119 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 08:18:08,119 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1586642576] [2025-01-09 08:18:08,119 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 08:18:08,120 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 08:18:08,121 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 08:18:08,122 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 08:18:08,122 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 08:18:08,122 INFO L87 Difference]: Start difference. First operand 117 states and 171 transitions. Second operand has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:18:08,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 08:18:08,176 INFO L93 Difference]: Finished difference Result 194 states and 283 transitions. [2025-01-09 08:18:08,177 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 08:18:08,177 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 40 [2025-01-09 08:18:08,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 08:18:08,178 INFO L225 Difference]: With dead ends: 194 [2025-01-09 08:18:08,178 INFO L226 Difference]: Without dead ends: 119 [2025-01-09 08:18:08,179 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-01-09 08:18:08,179 INFO L435 NwaCegarLoop]: 167 mSDtfsCounter, 0 mSDsluCounter, 324 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 491 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 08:18:08,180 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 491 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 08:18:08,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2025-01-09 08:18:08,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 119. [2025-01-09 08:18:08,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 118 states have (on average 1.4661016949152543) internal successors, (173), 118 states have internal predecessors, (173), 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-01-09 08:18:08,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 173 transitions. [2025-01-09 08:18:08,189 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 173 transitions. Word has length 40 [2025-01-09 08:18:08,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 08:18:08,189 INFO L471 AbstractCegarLoop]: Abstraction has 119 states and 173 transitions. [2025-01-09 08:18:08,189 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:18:08,190 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 173 transitions. [2025-01-09 08:18:08,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2025-01-09 08:18:08,190 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 08:18:08,191 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 08:18:08,191 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 08:18:08,191 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 08:18:08,191 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 08:18:08,192 INFO L85 PathProgramCache]: Analyzing trace with hash 552938242, now seen corresponding path program 1 times [2025-01-09 08:18:08,193 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 08:18:08,193 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1939438048] [2025-01-09 08:18:08,193 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 08:18:08,193 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 08:18:08,214 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-01-09 08:18:08,264 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-01-09 08:18:08,266 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 08:18:08,266 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 08:18:08,639 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 08:18:08,639 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 08:18:08,639 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1939438048] [2025-01-09 08:18:08,639 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1939438048] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 08:18:08,639 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 08:18:08,639 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 08:18:08,640 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1410850582] [2025-01-09 08:18:08,640 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 08:18:08,640 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 08:18:08,640 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 08:18:08,640 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 08:18:08,640 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-01-09 08:18:08,641 INFO L87 Difference]: Start difference. First operand 119 states and 173 transitions. Second operand has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 6 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:18:08,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 08:18:08,787 INFO L93 Difference]: Finished difference Result 200 states and 290 transitions. [2025-01-09 08:18:08,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 08:18:08,788 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 6 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 41 [2025-01-09 08:18:08,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 08:18:08,789 INFO L225 Difference]: With dead ends: 200 [2025-01-09 08:18:08,792 INFO L226 Difference]: Without dead ends: 123 [2025-01-09 08:18:08,792 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-01-09 08:18:08,793 INFO L435 NwaCegarLoop]: 154 mSDtfsCounter, 144 mSDsluCounter, 455 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 144 SdHoareTripleChecker+Valid, 609 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 08:18:08,793 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [144 Valid, 609 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 08:18:08,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2025-01-09 08:18:08,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 122. [2025-01-09 08:18:08,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 121 states have (on average 1.4545454545454546) internal successors, (176), 121 states have internal predecessors, (176), 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-01-09 08:18:08,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 176 transitions. [2025-01-09 08:18:08,802 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 176 transitions. Word has length 41 [2025-01-09 08:18:08,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 08:18:08,803 INFO L471 AbstractCegarLoop]: Abstraction has 122 states and 176 transitions. [2025-01-09 08:18:08,803 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 6 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:18:08,803 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 176 transitions. [2025-01-09 08:18:08,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2025-01-09 08:18:08,804 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 08:18:08,804 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 08:18:08,804 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 08:18:08,804 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 08:18:08,805 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 08:18:08,805 INFO L85 PathProgramCache]: Analyzing trace with hash 870103340, now seen corresponding path program 1 times [2025-01-09 08:18:08,805 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 08:18:08,805 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [407062077] [2025-01-09 08:18:08,805 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 08:18:08,805 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 08:18:08,830 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-01-09 08:18:08,865 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-01-09 08:18:08,868 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 08:18:08,868 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 08:18:09,216 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 08:18:09,217 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 08:18:09,217 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [407062077] [2025-01-09 08:18:09,217 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [407062077] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 08:18:09,217 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 08:18:09,217 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 08:18:09,217 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1659756778] [2025-01-09 08:18:09,217 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 08:18:09,217 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 08:18:09,218 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 08:18:09,218 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 08:18:09,218 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-01-09 08:18:09,218 INFO L87 Difference]: Start difference. First operand 122 states and 176 transitions. Second operand has 6 states, 6 states have (on average 7.0) internal successors, (42), 6 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:18:09,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 08:18:09,350 INFO L93 Difference]: Finished difference Result 206 states and 296 transitions. [2025-01-09 08:18:09,350 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 08:18:09,350 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.0) internal successors, (42), 6 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 42 [2025-01-09 08:18:09,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 08:18:09,351 INFO L225 Difference]: With dead ends: 206 [2025-01-09 08:18:09,351 INFO L226 Difference]: Without dead ends: 126 [2025-01-09 08:18:09,352 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-01-09 08:18:09,352 INFO L435 NwaCegarLoop]: 158 mSDtfsCounter, 137 mSDsluCounter, 464 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 137 SdHoareTripleChecker+Valid, 622 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 08:18:09,353 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [137 Valid, 622 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 08:18:09,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2025-01-09 08:18:09,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 122. [2025-01-09 08:18:09,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 121 states have (on average 1.4545454545454546) internal successors, (176), 121 states have internal predecessors, (176), 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-01-09 08:18:09,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 176 transitions. [2025-01-09 08:18:09,366 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 176 transitions. Word has length 42 [2025-01-09 08:18:09,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 08:18:09,367 INFO L471 AbstractCegarLoop]: Abstraction has 122 states and 176 transitions. [2025-01-09 08:18:09,368 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.0) internal successors, (42), 6 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:18:09,369 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 176 transitions. [2025-01-09 08:18:09,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2025-01-09 08:18:09,369 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 08:18:09,370 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 08:18:09,370 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 08:18:09,370 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 08:18:09,370 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 08:18:09,372 INFO L85 PathProgramCache]: Analyzing trace with hash 1525761640, now seen corresponding path program 1 times [2025-01-09 08:18:09,372 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 08:18:09,372 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1246419672] [2025-01-09 08:18:09,372 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 08:18:09,372 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 08:18:09,394 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-01-09 08:18:09,423 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-01-09 08:18:09,427 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 08:18:09,427 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 08:18:09,427 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-09 08:18:09,438 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-01-09 08:18:09,466 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-01-09 08:18:09,471 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 08:18:09,472 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 08:18:09,508 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-09 08:18:09,509 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-09 08:18:09,510 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-01-09 08:18:09,512 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 08:18:09,515 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2025-01-09 08:18:09,565 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-09 08:18:09,570 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.01 08:18:09 BoogieIcfgContainer [2025-01-09 08:18:09,570 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-09 08:18:09,571 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-09 08:18:09,572 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-09 08:18:09,572 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-09 08:18:09,573 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 08:18:06" (3/4) ... [2025-01-09 08:18:09,575 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-01-09 08:18:09,576 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-09 08:18:09,578 INFO L158 Benchmark]: Toolchain (without parser) took 4450.63ms. Allocated memory was 142.6MB in the beginning and 343.9MB in the end (delta: 201.3MB). Free memory was 106.3MB in the beginning and 229.4MB in the end (delta: -123.0MB). Peak memory consumption was 81.5MB. Max. memory is 16.1GB. [2025-01-09 08:18:09,578 INFO L158 Benchmark]: CDTParser took 0.25ms. Allocated memory is still 201.3MB. Free memory is still 115.3MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 08:18:09,580 INFO L158 Benchmark]: CACSL2BoogieTranslator took 437.66ms. Allocated memory is still 142.6MB. Free memory was 106.3MB in the beginning and 86.4MB in the end (delta: 19.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-01-09 08:18:09,581 INFO L158 Benchmark]: Boogie Procedure Inliner took 99.72ms. Allocated memory is still 142.6MB. Free memory was 86.4MB in the beginning and 75.1MB in the end (delta: 11.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-01-09 08:18:09,581 INFO L158 Benchmark]: Boogie Preprocessor took 175.24ms. Allocated memory is still 142.6MB. Free memory was 75.1MB in the beginning and 67.3MB in the end (delta: 7.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 08:18:09,581 INFO L158 Benchmark]: RCFGBuilder took 1054.58ms. Allocated memory is still 142.6MB. Free memory was 67.3MB in the beginning and 66.8MB in the end (delta: 548.6kB). Peak memory consumption was 44.2MB. Max. memory is 16.1GB. [2025-01-09 08:18:09,581 INFO L158 Benchmark]: TraceAbstraction took 2671.16ms. Allocated memory was 142.6MB in the beginning and 343.9MB in the end (delta: 201.3MB). Free memory was 66.2MB in the beginning and 229.8MB in the end (delta: -163.6MB). Peak memory consumption was 37.4MB. Max. memory is 16.1GB. [2025-01-09 08:18:09,582 INFO L158 Benchmark]: Witness Printer took 5.39ms. Allocated memory is still 343.9MB. Free memory was 229.8MB in the beginning and 229.4MB in the end (delta: 451.9kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 08:18:09,583 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.25ms. Allocated memory is still 201.3MB. Free memory is still 115.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 437.66ms. Allocated memory is still 142.6MB. Free memory was 106.3MB in the beginning and 86.4MB in the end (delta: 19.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 99.72ms. Allocated memory is still 142.6MB. Free memory was 86.4MB in the beginning and 75.1MB in the end (delta: 11.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Preprocessor took 175.24ms. Allocated memory is still 142.6MB. Free memory was 75.1MB in the beginning and 67.3MB in the end (delta: 7.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 1054.58ms. Allocated memory is still 142.6MB. Free memory was 67.3MB in the beginning and 66.8MB in the end (delta: 548.6kB). Peak memory consumption was 44.2MB. Max. memory is 16.1GB. * TraceAbstraction took 2671.16ms. Allocated memory was 142.6MB in the beginning and 343.9MB in the end (delta: 201.3MB). Free memory was 66.2MB in the beginning and 229.8MB in the end (delta: -163.6MB). Peak memory consumption was 37.4MB. Max. memory is 16.1GB. * Witness Printer took 5.39ms. Allocated memory is still 343.9MB. Free memory was 229.8MB in the beginning and 229.4MB in the end (delta: 451.9kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 21]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of bitwiseAnd at line 149. Possible FailurePath: [L26] const SORT_1 mask_SORT_1 = (SORT_1)-1 >> (sizeof(SORT_1) * 8 - 32); [L27] const SORT_1 msb_SORT_1 = (SORT_1)1 << (32 - 1); [L29] const SORT_3 mask_SORT_3 = (SORT_3)-1 >> (sizeof(SORT_3) * 8 - 1); [L30] const SORT_3 msb_SORT_3 = (SORT_3)1 << (1 - 1); [L32] const SORT_16 mask_SORT_16 = (SORT_16)-1 >> (sizeof(SORT_16) * 8 - 2); [L33] const SORT_16 msb_SORT_16 = (SORT_16)1 << (2 - 1); [L35] const SORT_59 mask_SORT_59 = (SORT_59)-1 >> (sizeof(SORT_59) * 8 - 3); [L36] const SORT_59 msb_SORT_59 = (SORT_59)1 << (3 - 1); [L38] const SORT_16 var_17 = 0; [L39] const SORT_16 var_20 = 3; [L40] const SORT_3 var_22 = 1; [L41] const SORT_3 var_36 = 0; [L42] const SORT_16 var_77 = 2; [L43] const SORT_16 var_80 = 1; [L44] const SORT_59 var_92 = 0; [L46] SORT_1 input_2; [L47] SORT_3 input_4; [L48] SORT_1 input_5; [L49] SORT_3 input_6; [L50] SORT_3 input_7; [L51] SORT_3 input_8; [L52] SORT_1 input_9; [L53] SORT_3 input_10; [L54] SORT_3 input_11; [L55] SORT_1 input_12; [L56] SORT_3 input_13; [L57] SORT_3 input_14; [L58] SORT_3 input_15; [L59] SORT_1 input_32; [L60] SORT_3 input_34; [L61] SORT_1 input_39; [L62] SORT_3 input_41; [L63] SORT_1 input_47; [L64] SORT_1 input_53; [L65] SORT_1 input_55; [L66] SORT_1 input_57; [L67] SORT_59 input_60; [L68] SORT_59 input_66; [L69] SORT_1 input_69; [L70] SORT_3 input_73; [L72] EXPR __VERIFIER_nondet_uchar() & mask_SORT_16 VAL [mask_SORT_16=3, mask_SORT_3=1, var_17=0, var_20=3, var_22=1, var_36=0, var_77=2, var_80=1, var_92=0] [L72] SORT_16 state_18 = __VERIFIER_nondet_uchar() & mask_SORT_16; [L73] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_16=3, mask_SORT_3=1, var_17=0, var_20=3, var_22=1, var_36=0, var_77=2, var_80=1, var_92=0] [L73] SORT_3 state_23 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L74] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_16=3, mask_SORT_3=1, var_17=0, var_20=3, var_22=1, var_36=0, var_77=2, var_80=1, var_92=0] [L74] SORT_3 state_37 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L75] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_16=3, mask_SORT_3=1, var_17=0, var_20=3, var_22=1, var_36=0, var_77=2, var_80=1, var_92=0] [L75] SORT_3 state_43 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L76] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_16=3, mask_SORT_3=1, var_17=0, var_20=3, var_22=1, var_36=0, var_77=2, var_80=1, var_92=0] [L76] SORT_3 state_45 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L77] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_16=3, mask_SORT_3=1, var_17=0, var_20=3, var_22=1, var_36=0, var_77=2, var_80=1, var_92=0] [L77] SORT_3 state_49 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L78] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_16=3, mask_SORT_3=1, var_17=0, var_20=3, var_22=1, var_36=0, var_77=2, var_80=1, var_92=0] [L78] SORT_3 state_51 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L79] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_16=3, mask_SORT_3=1, var_17=0, var_20=3, var_22=1, var_36=0, var_77=2, var_80=1, var_92=0] [L79] SORT_3 state_62 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L80] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_16=3, mask_SORT_3=1, var_17=0, var_20=3, var_22=1, var_36=0, var_77=2, var_80=1, var_92=0] [L80] SORT_3 state_64 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L81] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_16=3, mask_SORT_3=1, var_17=0, var_20=3, var_22=1, var_36=0, var_77=2, var_80=1, var_92=0] [L81] SORT_3 state_71 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L83] SORT_16 init_19_arg_1 = var_17; [L84] state_18 = init_19_arg_1 [L85] SORT_3 init_24_arg_1 = var_22; [L86] state_23 = init_24_arg_1 [L87] SORT_3 init_38_arg_1 = var_36; [L88] state_37 = init_38_arg_1 [L89] SORT_3 init_44_arg_1 = var_36; [L90] state_43 = init_44_arg_1 [L91] SORT_3 init_46_arg_1 = var_36; [L92] state_45 = init_46_arg_1 [L93] SORT_3 init_50_arg_1 = var_36; [L94] state_49 = init_50_arg_1 [L95] SORT_3 init_52_arg_1 = var_36; [L96] state_51 = init_52_arg_1 [L97] SORT_3 init_63_arg_1 = var_36; [L98] state_62 = init_63_arg_1 [L99] SORT_3 init_65_arg_1 = var_36; [L100] state_64 = init_65_arg_1 [L101] SORT_3 init_72_arg_1 = var_36; [L102] state_71 = init_72_arg_1 VAL [mask_SORT_16=3, mask_SORT_3=1, state_18=0, state_23=1, state_37=0, state_43=0, state_45=0, state_49=0, state_51=0, state_62=0, state_64=0, state_71=0, var_17=0, var_20=3, var_22=1, var_36=0, var_77=2, var_80=1, var_92=0] [L105] input_2 = __VERIFIER_nondet_uint() [L106] input_4 = __VERIFIER_nondet_uchar() [L107] input_5 = __VERIFIER_nondet_uint() [L108] input_6 = __VERIFIER_nondet_uchar() [L109] input_7 = __VERIFIER_nondet_uchar() [L110] EXPR input_7 & mask_SORT_3 VAL [mask_SORT_16=3, mask_SORT_3=1, state_18=0, state_23=1, state_37=0, state_43=0, state_45=0, state_49=0, state_51=0, state_62=0, state_64=0, state_71=0, var_17=0, var_20=3, var_22=1, var_36=0, var_77=2, var_80=1, var_92=0] [L110] input_7 = input_7 & mask_SORT_3 [L111] input_8 = __VERIFIER_nondet_uchar() [L112] EXPR input_8 & mask_SORT_3 VAL [input_7=0, mask_SORT_16=3, mask_SORT_3=1, state_18=0, state_23=1, state_37=0, state_43=0, state_45=0, state_49=0, state_51=0, state_62=0, state_64=0, state_71=0, var_17=0, var_20=3, var_22=1, var_36=0, var_77=2, var_80=1, var_92=0] [L112] input_8 = input_8 & mask_SORT_3 [L113] input_9 = __VERIFIER_nondet_uint() [L114] input_10 = __VERIFIER_nondet_uchar() [L115] EXPR input_10 & mask_SORT_3 VAL [input_7=0, input_8=0, mask_SORT_16=3, mask_SORT_3=1, state_18=0, state_23=1, state_37=0, state_43=0, state_45=0, state_49=0, state_51=0, state_62=0, state_64=0, state_71=0, var_17=0, var_20=3, var_22=1, var_36=0, var_77=2, var_80=1, var_92=0] [L115] input_10 = input_10 & mask_SORT_3 [L116] input_11 = __VERIFIER_nondet_uchar() [L117] EXPR input_11 & mask_SORT_3 VAL [input_10=0, input_7=0, input_8=0, mask_SORT_16=3, mask_SORT_3=1, state_18=0, state_23=1, state_37=0, state_43=0, state_45=0, state_49=0, state_51=0, state_62=0, state_64=0, state_71=0, var_17=0, var_20=3, var_22=1, var_36=0, var_77=2, var_80=1, var_92=0] [L117] input_11 = input_11 & mask_SORT_3 [L118] input_12 = __VERIFIER_nondet_uint() [L119] input_13 = __VERIFIER_nondet_uchar() [L120] input_14 = __VERIFIER_nondet_uchar() [L121] input_15 = __VERIFIER_nondet_uchar() [L122] input_32 = __VERIFIER_nondet_uint() [L123] input_34 = __VERIFIER_nondet_uchar() [L124] input_39 = __VERIFIER_nondet_uint() [L125] input_41 = __VERIFIER_nondet_uchar() [L126] input_47 = __VERIFIER_nondet_uint() [L127] input_53 = __VERIFIER_nondet_uint() [L128] input_55 = __VERIFIER_nondet_uint() [L129] input_57 = __VERIFIER_nondet_uint() [L130] input_60 = __VERIFIER_nondet_uchar() [L131] input_66 = __VERIFIER_nondet_uchar() [L132] input_69 = __VERIFIER_nondet_uint() [L133] input_73 = __VERIFIER_nondet_uchar() [L136] SORT_16 var_21_arg_0 = state_18; [L137] SORT_16 var_21_arg_1 = var_20; [L138] SORT_3 var_21 = var_21_arg_0 != var_21_arg_1; [L139] SORT_3 var_25_arg_0 = state_23; [L140] SORT_3 var_25_arg_1 = var_22; [L141] SORT_3 var_25 = var_25_arg_0 == var_25_arg_1; [L142] SORT_3 var_26_arg_0 = var_21; [L143] SORT_3 var_26_arg_1 = var_25; VAL [input_10=0, input_11=0, input_7=0, input_8=0, mask_SORT_16=3, mask_SORT_3=1, state_18=0, state_23=1, state_37=0, state_43=0, state_45=0, state_49=0, state_51=0, state_62=0, state_64=0, state_71=0, var_17=0, var_20=3, var_22=1, var_26_arg_0=1, var_26_arg_1=1, var_36=0, var_77=2, var_80=1, var_92=0] [L144] EXPR var_26_arg_0 | var_26_arg_1 VAL [input_10=0, input_11=0, input_7=0, input_8=0, mask_SORT_16=3, mask_SORT_3=1, state_18=0, state_23=1, state_37=0, state_43=0, state_45=0, state_49=0, state_51=0, state_62=0, state_64=0, state_71=0, var_17=0, var_20=3, var_22=1, var_36=0, var_77=2, var_80=1, var_92=0] [L144] SORT_3 var_26 = var_26_arg_0 | var_26_arg_1; [L145] SORT_3 var_29_arg_0 = var_26; [L146] SORT_3 var_29 = ~var_29_arg_0; [L147] SORT_3 var_30_arg_0 = var_22; [L148] SORT_3 var_30_arg_1 = var_29; VAL [input_10=0, input_11=0, input_7=0, input_8=0, mask_SORT_16=3, mask_SORT_3=1, state_18=0, state_23=1, state_37=0, state_43=0, state_45=0, state_49=0, state_51=0, state_62=0, state_64=0, state_71=0, var_17=0, var_20=3, var_22=1, var_30_arg_0=1, var_30_arg_1=-2, var_36=0, var_77=2, var_80=1, var_92=0] [L149] EXPR var_30_arg_0 & var_30_arg_1 VAL [input_10=0, input_11=0, input_7=0, input_8=0, mask_SORT_16=3, mask_SORT_3=1, state_18=0, state_23=1, state_37=0, state_43=0, state_45=0, state_49=0, state_51=0, state_62=0, state_64=0, state_71=0, var_17=0, var_20=3, var_22=1, var_36=0, var_77=2, var_80=1, var_92=0] [L149] SORT_3 var_30 = var_30_arg_0 & var_30_arg_1; [L150] EXPR var_30 & mask_SORT_3 VAL [input_10=0, input_11=0, input_7=0, input_8=0, mask_SORT_16=3, mask_SORT_3=1, state_18=0, state_23=1, state_37=0, state_43=0, state_45=0, state_49=0, state_51=0, state_62=0, state_64=0, state_71=0, var_17=0, var_20=3, var_22=1, var_36=0, var_77=2, var_80=1, var_92=0] [L150] var_30 = var_30 & mask_SORT_3 [L151] SORT_3 bad_31_arg_0 = var_30; [L152] CALL __VERIFIER_assert(!(bad_31_arg_0)) [L21] COND TRUE !(cond) [L21] reach_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 118 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 2.6s, OverallIterations: 5, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 281 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 281 mSDsluCounter, 2217 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1571 mSDsCounter, 2 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 153 IncrementalHoareTripleChecker+Invalid, 155 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2 mSolverCounterUnsat, 646 mSDtfsCounter, 153 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 25 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=122occurred in iteration=3, InterpolantAutomatonStates: 20, 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, 4 MinimizatonAttempts, 5 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.5s InterpolantComputationTime, 204 NumberOfCodeBlocks, 204 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 158 ConstructedInterpolants, 0 QuantifiedInterpolants, 366 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 4 InterpolantComputations, 4 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-01-09 08:18:09,605 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_QF_BV_bcuvis32.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 1ef8d174762b17df623a48d7afe94f1e8bc5e2233dcaad9b42847f8ac912d010 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 08:18:11,935 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 08:18:12,049 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Bitvector.epf [2025-01-09 08:18:12,059 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 08:18:12,061 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 08:18:12,087 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 08:18:12,088 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 08:18:12,088 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 08:18:12,088 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 08:18:12,088 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 08:18:12,088 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 08:18:12,088 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 08:18:12,089 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 08:18:12,089 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 08:18:12,089 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 08:18:12,089 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 08:18:12,089 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 08:18:12,089 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 08:18:12,090 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 08:18:12,090 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 08:18:12,090 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 08:18:12,090 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-01-09 08:18:12,090 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-01-09 08:18:12,090 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-01-09 08:18:12,090 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 08:18:12,090 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 08:18:12,091 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 08:18:12,091 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 08:18:12,091 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 08:18:12,091 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 08:18:12,091 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 08:18:12,091 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 08:18:12,091 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 08:18:12,092 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 08:18:12,092 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 08:18:12,092 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 08:18:12,092 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 08:18:12,092 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 08:18:12,092 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 08:18:12,092 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 08:18:12,092 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 08:18:12,093 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-01-09 08:18:12,093 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-01-09 08:18:12,093 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 08:18:12,093 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 08:18:12,093 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 08:18:12,093 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 08:18:12,093 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 -> 1ef8d174762b17df623a48d7afe94f1e8bc5e2233dcaad9b42847f8ac912d010 [2025-01-09 08:18:12,416 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 08:18:12,423 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 08:18:12,426 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 08:18:12,428 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 08:18:12,431 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 08:18:12,432 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_QF_BV_bcuvis32.c [2025-01-09 08:18:13,749 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/beab5bd36/cafe0781f5a14170a2b7f59601ec6390/FLAG8441eb622 [2025-01-09 08:18:14,003 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 08:18:14,004 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_QF_BV_bcuvis32.c [2025-01-09 08:18:14,020 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/beab5bd36/cafe0781f5a14170a2b7f59601ec6390/FLAG8441eb622 [2025-01-09 08:18:14,321 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/beab5bd36/cafe0781f5a14170a2b7f59601ec6390 [2025-01-09 08:18:14,323 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 08:18:14,324 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 08:18:14,325 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 08:18:14,325 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 08:18:14,329 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 08:18:14,330 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 08:18:14" (1/1) ... [2025-01-09 08:18:14,331 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@49a18eef and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:18:14, skipping insertion in model container [2025-01-09 08:18:14,331 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 08:18:14" (1/1) ... [2025-01-09 08:18:14,360 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 08:18:14,512 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_QF_BV_bcuvis32.c[1258,1271] [2025-01-09 08:18:14,599 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 08:18:14,614 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 08:18:14,626 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_QF_BV_bcuvis32.c[1258,1271] [2025-01-09 08:18:14,687 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 08:18:14,706 INFO L204 MainTranslator]: Completed translation [2025-01-09 08:18:14,708 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:18:14 WrapperNode [2025-01-09 08:18:14,709 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 08:18:14,710 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 08:18:14,710 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 08:18:14,710 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 08:18:14,716 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:18:14" (1/1) ... [2025-01-09 08:18:14,728 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:18:14" (1/1) ... [2025-01-09 08:18:14,757 INFO L138 Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 401 [2025-01-09 08:18:14,758 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 08:18:14,758 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 08:18:14,758 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 08:18:14,759 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 08:18:14,767 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:18:14" (1/1) ... [2025-01-09 08:18:14,767 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:18:14" (1/1) ... [2025-01-09 08:18:14,772 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:18:14" (1/1) ... [2025-01-09 08:18:14,786 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-01-09 08:18:14,787 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:18:14" (1/1) ... [2025-01-09 08:18:14,787 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:18:14" (1/1) ... [2025-01-09 08:18:14,796 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:18:14" (1/1) ... [2025-01-09 08:18:14,799 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:18:14" (1/1) ... [2025-01-09 08:18:14,806 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:18:14" (1/1) ... [2025-01-09 08:18:14,811 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:18:14" (1/1) ... [2025-01-09 08:18:14,815 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:18:14" (1/1) ... [2025-01-09 08:18:14,828 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 08:18:14,829 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 08:18:14,829 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 08:18:14,829 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 08:18:14,830 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:18:14" (1/1) ... [2025-01-09 08:18:14,836 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 08:18:14,849 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 08:18:14,866 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-01-09 08:18:14,870 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-01-09 08:18:14,896 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 08:18:14,896 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-01-09 08:18:14,896 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 08:18:14,896 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 08:18:15,055 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 08:18:15,057 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 08:18:15,457 INFO L? ?]: Removed 43 outVars from TransFormulas that were not future-live. [2025-01-09 08:18:15,458 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 08:18:15,467 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 08:18:15,468 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 08:18:15,468 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 08:18:15 BoogieIcfgContainer [2025-01-09 08:18:15,468 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 08:18:15,470 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 08:18:15,470 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 08:18:15,475 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 08:18:15,475 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 08:18:14" (1/3) ... [2025-01-09 08:18:15,476 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7f32c5c6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 08:18:15, skipping insertion in model container [2025-01-09 08:18:15,476 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:18:14" (2/3) ... [2025-01-09 08:18:15,477 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7f32c5c6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 08:18:15, skipping insertion in model container [2025-01-09 08:18:15,478 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 08:18:15" (3/3) ... [2025-01-09 08:18:15,480 INFO L128 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.vis_QF_BV_bcuvis32.c [2025-01-09 08:18:15,494 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 08:18:15,497 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG btor2c-lazyMod.vis_QF_BV_bcuvis32.c that has 1 procedures, 10 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 08:18:15,546 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 08:18:15,560 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;@61ce3a27, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 08:18:15,560 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 08:18:15,564 INFO L276 IsEmpty]: Start isEmpty. Operand has 10 states, 8 states have (on average 1.375) internal successors, (11), 9 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:18:15,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2025-01-09 08:18:15,571 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 08:18:15,571 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2025-01-09 08:18:15,572 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 08:18:15,577 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 08:18:15,578 INFO L85 PathProgramCache]: Analyzing trace with hash 28694789, now seen corresponding path program 1 times [2025-01-09 08:18:15,587 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 08:18:15,591 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1587560167] [2025-01-09 08:18:15,591 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 08:18:15,593 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 08:18:15,594 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 08:18:15,597 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 08:18:15,599 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-01-09 08:18:15,765 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-01-09 08:18:15,789 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-01-09 08:18:15,789 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 08:18:15,789 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 08:18:15,793 INFO L256 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-01-09 08:18:15,804 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 08:18:15,973 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 08:18:15,973 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 08:18:15,974 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 08:18:15,974 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1587560167] [2025-01-09 08:18:15,975 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1587560167] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 08:18:15,975 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 08:18:15,975 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 08:18:15,978 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1371841602] [2025-01-09 08:18:15,978 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 08:18:15,982 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 08:18:15,983 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 08:18:16,001 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 08:18:16,003 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 08:18:16,005 INFO L87 Difference]: Start difference. First operand has 10 states, 8 states have (on average 1.375) internal successors, (11), 9 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 4 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:18:16,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 08:18:16,061 INFO L93 Difference]: Finished difference Result 18 states and 23 transitions. [2025-01-09 08:18:16,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 08:18:16,063 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2025-01-09 08:18:16,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 08:18:16,070 INFO L225 Difference]: With dead ends: 18 [2025-01-09 08:18:16,070 INFO L226 Difference]: Without dead ends: 10 [2025-01-09 08:18:16,073 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 08:18:16,077 INFO L435 NwaCegarLoop]: 4 mSDtfsCounter, 2 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 11 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 08:18:16,077 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 11 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 08:18:16,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2025-01-09 08:18:16,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 9. [2025-01-09 08:18:16,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 1.125) internal successors, (9), 8 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:18:16,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2025-01-09 08:18:16,104 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 5 [2025-01-09 08:18:16,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 08:18:16,105 INFO L471 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2025-01-09 08:18:16,105 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:18:16,105 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2025-01-09 08:18:16,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-01-09 08:18:16,106 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 08:18:16,106 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2025-01-09 08:18:16,116 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-01-09 08:18:16,311 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-01-09 08:18:16,311 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 08:18:16,312 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 08:18:16,312 INFO L85 PathProgramCache]: Analyzing trace with hash 152739811, now seen corresponding path program 1 times [2025-01-09 08:18:16,313 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 08:18:16,313 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1019126210] [2025-01-09 08:18:16,313 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 08:18:16,313 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 08:18:16,313 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 08:18:16,315 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-01-09 08:18:16,318 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-01-09 08:18:16,477 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-01-09 08:18:16,514 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-01-09 08:18:16,514 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 08:18:16,515 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 08:18:16,519 INFO L256 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 24 conjuncts are in the unsatisfiable core [2025-01-09 08:18:16,525 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 08:18:17,379 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 08:18:17,380 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 08:18:20,254 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 08:18:20,254 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 08:18:20,254 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1019126210] [2025-01-09 08:18:20,254 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1019126210] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 08:18:20,254 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-01-09 08:18:20,254 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2025-01-09 08:18:20,255 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1071706219] [2025-01-09 08:18:20,255 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-01-09 08:18:20,256 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-09 08:18:20,256 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 08:18:20,257 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-09 08:18:20,257 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2025-01-09 08:18:20,257 INFO L87 Difference]: Start difference. First operand 9 states and 9 transitions. Second operand has 10 states, 10 states have (on average 1.4) internal successors, (14), 10 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:18:20,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 08:18:20,356 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2025-01-09 08:18:20,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 08:18:20,357 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 1.4) internal successors, (14), 10 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2025-01-09 08:18:20,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 08:18:20,358 INFO L225 Difference]: With dead ends: 15 [2025-01-09 08:18:20,358 INFO L226 Difference]: Without dead ends: 13 [2025-01-09 08:18:20,358 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2025-01-09 08:18:20,359 INFO L435 NwaCegarLoop]: 4 mSDtfsCounter, 4 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 19 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 08:18:20,360 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 19 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 08:18:20,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2025-01-09 08:18:20,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 12. [2025-01-09 08:18:20,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 11 states have (on average 1.0909090909090908) internal successors, (12), 11 states have internal predecessors, (12), 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-01-09 08:18:20,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2025-01-09 08:18:20,364 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 8 [2025-01-09 08:18:20,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 08:18:20,364 INFO L471 AbstractCegarLoop]: Abstraction has 12 states and 12 transitions. [2025-01-09 08:18:20,365 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 1.4) internal successors, (14), 10 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:18:20,365 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2025-01-09 08:18:20,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-01-09 08:18:20,365 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 08:18:20,365 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1] [2025-01-09 08:18:20,374 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-01-09 08:18:20,569 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-01-09 08:18:20,569 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 08:18:20,570 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 08:18:20,570 INFO L85 PathProgramCache]: Analyzing trace with hash 1906115653, now seen corresponding path program 2 times [2025-01-09 08:18:20,571 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 08:18:20,571 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [761961980] [2025-01-09 08:18:20,571 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 08:18:20,571 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 08:18:20,571 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 08:18:20,573 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-01-09 08:18:20,574 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-01-09 08:18:20,723 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 11 statements into 2 equivalence classes. [2025-01-09 08:18:20,758 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 11 of 11 statements. [2025-01-09 08:18:20,758 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-09 08:18:20,758 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 08:18:20,767 INFO L256 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 31 conjuncts are in the unsatisfiable core [2025-01-09 08:18:20,775 INFO L279 TraceCheckSpWp]: Computing forward predicates...