./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/xcsp/AllInterval-009.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 48c9605d Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/xcsp/AllInterval-009.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-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 32bit --witnessprinter.graph.data.programhash 467fcaafa9af0a00772f5009c99943c6cb7078cb0bca94a00a243b41a6183129 --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-07 21:26:02,936 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-07 21:26:02,973 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-07 21:26:02,976 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-07 21:26:02,976 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-07 21:26:02,989 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-07 21:26:02,989 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-07 21:26:02,989 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-07 21:26:02,990 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-07 21:26:02,990 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-07 21:26:02,990 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-07 21:26:02,990 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-07 21:26:02,990 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-07 21:26:02,990 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-07 21:26:02,990 INFO L153 SettingsManager]: * Use SBE=true [2025-02-07 21:26:02,990 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-07 21:26:02,990 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-07 21:26:02,990 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-07 21:26:02,990 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-07 21:26:02,990 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-07 21:26:02,990 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-07 21:26:02,990 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-07 21:26:02,990 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-07 21:26:02,991 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-07 21:26:02,991 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-07 21:26:02,991 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-07 21:26:02,991 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-07 21:26:02,991 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-07 21:26:02,991 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-07 21:26:02,991 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-07 21:26:02,991 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-07 21:26:02,991 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-07 21:26:02,991 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-07 21:26:02,991 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-07 21:26:02,991 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-07 21:26:02,991 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-07 21:26:02,991 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-07 21:26:02,991 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-07 21:26:02,991 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-07 21:26:02,991 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-07 21:26:02,991 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-07 21:26:02,991 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-07 21:26:02,992 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-07 21:26:02,992 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 -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 467fcaafa9af0a00772f5009c99943c6cb7078cb0bca94a00a243b41a6183129 [2025-02-07 21:26:03,144 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-07 21:26:03,157 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-07 21:26:03,161 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-07 21:26:03,165 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-07 21:26:03,165 INFO L274 PluginConnector]: CDTParser initialized [2025-02-07 21:26:03,166 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/xcsp/AllInterval-009.c [2025-02-07 21:26:04,291 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/5b2fc5fae/08ce7147b5d443e5b100d669ac9e245f/FLAG874143667 [2025-02-07 21:26:04,505 INFO L384 CDTParser]: Found 1 translation units. [2025-02-07 21:26:04,505 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/xcsp/AllInterval-009.c [2025-02-07 21:26:04,524 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/5b2fc5fae/08ce7147b5d443e5b100d669ac9e245f/FLAG874143667 [2025-02-07 21:26:04,552 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/5b2fc5fae/08ce7147b5d443e5b100d669ac9e245f [2025-02-07 21:26:04,554 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-07 21:26:04,557 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-07 21:26:04,558 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-07 21:26:04,558 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-07 21:26:04,561 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-07 21:26:04,562 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.02 09:26:04" (1/1) ... [2025-02-07 21:26:04,564 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2bf3e7f6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 09:26:04, skipping insertion in model container [2025-02-07 21:26:04,564 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.02 09:26:04" (1/1) ... [2025-02-07 21:26:04,579 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-07 21:26:04,711 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/xcsp/AllInterval-009.c[5030,5043] [2025-02-07 21:26:04,717 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-07 21:26:04,726 INFO L200 MainTranslator]: Completed pre-run [2025-02-07 21:26:04,759 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/xcsp/AllInterval-009.c[5030,5043] [2025-02-07 21:26:04,760 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-07 21:26:04,774 INFO L204 MainTranslator]: Completed translation [2025-02-07 21:26:04,774 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 09:26:04 WrapperNode [2025-02-07 21:26:04,774 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-07 21:26:04,775 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-07 21:26:04,776 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-07 21:26:04,776 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-07 21:26:04,782 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 09:26:04" (1/1) ... [2025-02-07 21:26:04,787 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 09:26:04" (1/1) ... [2025-02-07 21:26:04,815 INFO L138 Inliner]: procedures = 13, calls = 113, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 224 [2025-02-07 21:26:04,820 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-07 21:26:04,821 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-07 21:26:04,821 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-07 21:26:04,821 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-07 21:26:04,827 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 09:26:04" (1/1) ... [2025-02-07 21:26:04,827 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 09:26:04" (1/1) ... [2025-02-07 21:26:04,829 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 09:26:04" (1/1) ... [2025-02-07 21:26:04,840 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-02-07 21:26:04,843 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 09:26:04" (1/1) ... [2025-02-07 21:26:04,844 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 09:26:04" (1/1) ... [2025-02-07 21:26:04,850 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 09:26:04" (1/1) ... [2025-02-07 21:26:04,851 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 09:26:04" (1/1) ... [2025-02-07 21:26:04,851 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 09:26:04" (1/1) ... [2025-02-07 21:26:04,853 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 09:26:04" (1/1) ... [2025-02-07 21:26:04,857 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-07 21:26:04,857 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-07 21:26:04,857 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-07 21:26:04,857 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-07 21:26:04,858 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 09:26:04" (1/1) ... [2025-02-07 21:26:04,863 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-07 21:26:04,871 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 21:26:04,880 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-07 21:26:04,884 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-07 21:26:04,898 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-07 21:26:04,898 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-07 21:26:04,898 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-07 21:26:04,898 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-07 21:26:04,898 INFO L130 BoogieDeclarations]: Found specification of procedure assume [2025-02-07 21:26:04,898 INFO L138 BoogieDeclarations]: Found implementation of procedure assume [2025-02-07 21:26:04,949 INFO L257 CfgBuilder]: Building ICFG [2025-02-07 21:26:04,951 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-07 21:26:05,210 INFO L? ?]: Removed 12 outVars from TransFormulas that were not future-live. [2025-02-07 21:26:05,213 INFO L308 CfgBuilder]: Performing block encoding [2025-02-07 21:26:05,224 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-07 21:26:05,224 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-07 21:26:05,225 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 07.02 09:26:05 BoogieIcfgContainer [2025-02-07 21:26:05,225 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-07 21:26:05,226 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-07 21:26:05,226 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-07 21:26:05,229 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-07 21:26:05,229 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.02 09:26:04" (1/3) ... [2025-02-07 21:26:05,230 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7eb632e2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.02 09:26:05, skipping insertion in model container [2025-02-07 21:26:05,230 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 09:26:04" (2/3) ... [2025-02-07 21:26:05,230 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7eb632e2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.02 09:26:05, skipping insertion in model container [2025-02-07 21:26:05,230 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 07.02 09:26:05" (3/3) ... [2025-02-07 21:26:05,231 INFO L128 eAbstractionObserver]: Analyzing ICFG AllInterval-009.c [2025-02-07 21:26:05,240 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-07 21:26:05,241 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG AllInterval-009.c that has 2 procedures, 140 locations, 1 initial locations, 0 loop locations, and 1 error locations. [2025-02-07 21:26:05,276 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-07 21:26:05,284 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;@2e2902dc, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-07 21:26:05,285 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-07 21:26:05,287 INFO L276 IsEmpty]: Start isEmpty. Operand has 140 states, 31 states have (on average 1.064516129032258) internal successors, (33), 32 states have internal predecessors, (33), 106 states have call successors, (106), 1 states have call predecessors, (106), 1 states have return successors, (106), 106 states have call predecessors, (106), 106 states have call successors, (106) [2025-02-07 21:26:05,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 558 [2025-02-07 21:26:05,300 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 21:26:05,301 INFO L218 NwaCegarLoop]: trace histogram [106, 106, 106, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 21:26:05,301 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 21:26:05,304 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 21:26:05,304 INFO L85 PathProgramCache]: Analyzing trace with hash -1863341601, now seen corresponding path program 1 times [2025-02-07 21:26:05,308 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 21:26:05,308 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [578791081] [2025-02-07 21:26:05,309 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 21:26:05,309 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 21:26:05,383 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 557 statements into 1 equivalence classes. [2025-02-07 21:26:05,396 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 557 of 557 statements. [2025-02-07 21:26:05,397 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 21:26:05,397 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 21:26:05,712 INFO L134 CoverageAnalysis]: Checked inductivity of 22260 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 22050 trivial. 0 not checked. [2025-02-07 21:26:05,713 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 21:26:05,713 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [578791081] [2025-02-07 21:26:05,714 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [578791081] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-07 21:26:05,715 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1774258764] [2025-02-07 21:26:05,715 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 21:26:05,715 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 21:26:05,715 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 21:26:05,721 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-07 21:26:05,722 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-07 21:26:05,832 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 557 statements into 1 equivalence classes. [2025-02-07 21:26:05,976 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 557 of 557 statements. [2025-02-07 21:26:05,977 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 21:26:05,977 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 21:26:05,980 INFO L256 TraceCheckSpWp]: Trace formula consists of 1030 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-02-07 21:26:05,992 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 21:26:06,052 INFO L134 CoverageAnalysis]: Checked inductivity of 22260 backedges. 210 proven. 0 refuted. 0 times theorem prover too weak. 22050 trivial. 0 not checked. [2025-02-07 21:26:06,052 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-07 21:26:06,052 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1774258764] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 21:26:06,052 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-07 21:26:06,052 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-02-07 21:26:06,054 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [668814308] [2025-02-07 21:26:06,054 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 21:26:06,059 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-07 21:26:06,059 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 21:26:06,075 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-07 21:26:06,075 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-07 21:26:06,077 INFO L87 Difference]: Start difference. First operand has 140 states, 31 states have (on average 1.064516129032258) internal successors, (33), 32 states have internal predecessors, (33), 106 states have call successors, (106), 1 states have call predecessors, (106), 1 states have return successors, (106), 106 states have call predecessors, (106), 106 states have call successors, (106) Second operand has 2 states, 2 states have (on average 16.0) internal successors, (32), 2 states have internal predecessors, (32), 2 states have call successors, (106), 2 states have call predecessors, (106), 1 states have return successors, (106), 1 states have call predecessors, (106), 2 states have call successors, (106) [2025-02-07 21:26:06,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 21:26:06,118 INFO L93 Difference]: Finished difference Result 276 states and 592 transitions. [2025-02-07 21:26:06,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-07 21:26:06,120 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 16.0) internal successors, (32), 2 states have internal predecessors, (32), 2 states have call successors, (106), 2 states have call predecessors, (106), 1 states have return successors, (106), 1 states have call predecessors, (106), 2 states have call successors, (106) Word has length 557 [2025-02-07 21:26:06,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 21:26:06,126 INFO L225 Difference]: With dead ends: 276 [2025-02-07 21:26:06,126 INFO L226 Difference]: Without dead ends: 138 [2025-02-07 21:26:06,129 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 558 GetRequests, 558 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-07 21:26:06,132 INFO L435 NwaCegarLoop]: 242 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 242 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-07 21:26:06,134 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 242 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-07 21:26:06,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2025-02-07 21:26:06,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 138. [2025-02-07 21:26:06,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 138 states, 30 states have (on average 1.0) internal successors, (30), 30 states have internal predecessors, (30), 106 states have call successors, (106), 1 states have call predecessors, (106), 1 states have return successors, (106), 106 states have call predecessors, (106), 106 states have call successors, (106) [2025-02-07 21:26:06,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 242 transitions. [2025-02-07 21:26:06,184 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 242 transitions. Word has length 557 [2025-02-07 21:26:06,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 21:26:06,186 INFO L471 AbstractCegarLoop]: Abstraction has 138 states and 242 transitions. [2025-02-07 21:26:06,186 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 16.0) internal successors, (32), 2 states have internal predecessors, (32), 2 states have call successors, (106), 2 states have call predecessors, (106), 1 states have return successors, (106), 1 states have call predecessors, (106), 2 states have call successors, (106) [2025-02-07 21:26:06,186 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 242 transitions. [2025-02-07 21:26:06,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 558 [2025-02-07 21:26:06,198 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 21:26:06,198 INFO L218 NwaCegarLoop]: trace histogram [106, 106, 106, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 21:26:06,205 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-02-07 21:26:06,399 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,SelfDestructingSolverStorable0 [2025-02-07 21:26:06,399 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 21:26:06,400 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 21:26:06,400 INFO L85 PathProgramCache]: Analyzing trace with hash 793986679, now seen corresponding path program 1 times [2025-02-07 21:26:06,400 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 21:26:06,400 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [929078568] [2025-02-07 21:26:06,400 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 21:26:06,401 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 21:26:06,444 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 557 statements into 1 equivalence classes. [2025-02-07 21:26:08,226 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 557 of 557 statements. [2025-02-07 21:26:08,227 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 21:26:08,227 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-07 21:26:08,227 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-07 21:26:08,244 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 557 statements into 1 equivalence classes. [2025-02-07 21:26:09,184 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 557 of 557 statements. [2025-02-07 21:26:09,184 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 21:26:09,184 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-07 21:26:09,253 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-07 21:26:09,254 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-07 21:26:09,255 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-02-07 21:26:09,256 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-07 21:26:09,258 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1] [2025-02-07 21:26:09,392 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-07 21:26:09,395 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.02 09:26:09 BoogieIcfgContainer [2025-02-07 21:26:09,395 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-07 21:26:09,396 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-07 21:26:09,396 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-07 21:26:09,396 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-07 21:26:09,396 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 07.02 09:26:05" (3/4) ... [2025-02-07 21:26:09,397 INFO L140 WitnessPrinter]: Generating witness for reachability counterexample [2025-02-07 21:26:09,516 INFO L127 tionWitnessGenerator]: Generated YAML witness of length 319. [2025-02-07 21:26:09,647 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-02-07 21:26:09,648 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-02-07 21:26:09,649 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-07 21:26:09,650 INFO L158 Benchmark]: Toolchain (without parser) took 5091.83ms. Allocated memory was 167.8MB in the beginning and 478.2MB in the end (delta: 310.4MB). Free memory was 123.4MB in the beginning and 405.0MB in the end (delta: -281.6MB). Peak memory consumption was 28.8MB. Max. memory is 16.1GB. [2025-02-07 21:26:09,650 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 201.3MB. Free memory is still 117.2MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-07 21:26:09,650 INFO L158 Benchmark]: CACSL2BoogieTranslator took 216.73ms. Allocated memory is still 167.8MB. Free memory was 122.7MB in the beginning and 109.6MB in the end (delta: 13.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-02-07 21:26:09,651 INFO L158 Benchmark]: Boogie Procedure Inliner took 45.05ms. Allocated memory is still 167.8MB. Free memory was 109.6MB in the beginning and 107.6MB in the end (delta: 2.0MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-07 21:26:09,652 INFO L158 Benchmark]: Boogie Preprocessor took 35.90ms. Allocated memory is still 167.8MB. Free memory was 107.6MB in the beginning and 106.3MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-07 21:26:09,652 INFO L158 Benchmark]: IcfgBuilder took 367.68ms. Allocated memory is still 167.8MB. Free memory was 106.3MB in the beginning and 83.1MB in the end (delta: 23.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-02-07 21:26:09,652 INFO L158 Benchmark]: TraceAbstraction took 4169.08ms. Allocated memory was 167.8MB in the beginning and 478.2MB in the end (delta: 310.4MB). Free memory was 83.1MB in the beginning and 430.1MB in the end (delta: -347.0MB). Peak memory consumption was 240.2MB. Max. memory is 16.1GB. [2025-02-07 21:26:09,653 INFO L158 Benchmark]: Witness Printer took 253.01ms. Allocated memory is still 478.2MB. Free memory was 430.1MB in the beginning and 405.0MB in the end (delta: 25.1MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-02-07 21:26:09,653 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.13ms. Allocated memory is still 201.3MB. Free memory is still 117.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 216.73ms. Allocated memory is still 167.8MB. Free memory was 122.7MB in the beginning and 109.6MB in the end (delta: 13.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 45.05ms. Allocated memory is still 167.8MB. Free memory was 109.6MB in the beginning and 107.6MB in the end (delta: 2.0MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 35.90ms. Allocated memory is still 167.8MB. Free memory was 107.6MB in the beginning and 106.3MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 367.68ms. Allocated memory is still 167.8MB. Free memory was 106.3MB in the beginning and 83.1MB in the end (delta: 23.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 4169.08ms. Allocated memory was 167.8MB in the beginning and 478.2MB in the end (delta: 310.4MB). Free memory was 83.1MB in the beginning and 430.1MB in the end (delta: -347.0MB). Peak memory consumption was 240.2MB. Max. memory is 16.1GB. * Witness Printer took 253.01ms. Allocated memory is still 478.2MB. Free memory was 430.1MB in the beginning and 405.0MB in the end (delta: 25.1MB). Peak memory consumption was 25.2MB. 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 - CounterExampleResult [Line: 185]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L24] int cond0; [L25] int dummy = 0; [L26] int N; [L27] int var0; [L28] var0 = __VERIFIER_nondet_int() [L29] CALL assume(var0 >= 0) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L29] RET assume(var0 >= 0) VAL [var0=6] [L30] CALL assume(var0 <= 8) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L30] RET assume(var0 <= 8) VAL [var0=6] [L31] int var1; [L32] var1 = __VERIFIER_nondet_int() [L33] CALL assume(var1 >= 0) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L33] RET assume(var1 >= 0) VAL [var0=6, var1=1] [L34] CALL assume(var1 <= 8) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L34] RET assume(var1 <= 8) VAL [var0=6, var1=1] [L35] int var2; [L36] var2 = __VERIFIER_nondet_int() [L37] CALL assume(var2 >= 0) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L37] RET assume(var2 >= 0) VAL [var0=6, var1=1, var2=3] [L38] CALL assume(var2 <= 8) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L38] RET assume(var2 <= 8) VAL [var0=6, var1=1, var2=3] [L39] int var3; [L40] var3 = __VERIFIER_nondet_int() [L41] CALL assume(var3 >= 0) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L41] RET assume(var3 >= 0) VAL [var0=6, var1=1, var2=3, var3=7] [L42] CALL assume(var3 <= 8) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L42] RET assume(var3 <= 8) VAL [var0=6, var1=1, var2=3, var3=7] [L43] int var4; [L44] var4 = __VERIFIER_nondet_int() [L45] CALL assume(var4 >= 0) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L45] RET assume(var4 >= 0) VAL [var0=6, var1=1, var2=3, var3=7, var4=0] [L46] CALL assume(var4 <= 8) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L46] RET assume(var4 <= 8) VAL [var0=6, var1=1, var2=3, var3=7, var4=0] [L47] int var5; [L48] var5 = __VERIFIER_nondet_int() [L49] CALL assume(var5 >= 0) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L49] RET assume(var5 >= 0) VAL [var0=6, var1=1, var2=3, var3=7, var4=0, var5=8] [L50] CALL assume(var5 <= 8) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L50] RET assume(var5 <= 8) VAL [var0=6, var1=1, var2=3, var3=7, var4=0, var5=8] [L51] int var6; [L52] var6 = __VERIFIER_nondet_int() [L53] CALL assume(var6 >= 0) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L53] RET assume(var6 >= 0) VAL [var0=6, var1=1, var2=3, var3=7, var4=0, var5=8, var6=2] [L54] CALL assume(var6 <= 8) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L54] RET assume(var6 <= 8) VAL [var0=6, var1=1, var2=3, var3=7, var4=0, var5=8, var6=2] [L55] int var7; [L56] var7 = __VERIFIER_nondet_int() [L57] CALL assume(var7 >= 0) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L57] RET assume(var7 >= 0) VAL [var0=6, var1=1, var2=3, var3=7, var4=0, var5=8, var6=2, var7=5] [L58] CALL assume(var7 <= 8) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L58] RET assume(var7 <= 8) VAL [var0=6, var1=1, var2=3, var3=7, var4=0, var5=8, var6=2, var7=5] [L59] int var8; [L60] var8 = __VERIFIER_nondet_int() [L61] CALL assume(var8 >= 0) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L61] RET assume(var8 >= 0) VAL [var0=6, var1=1, var2=3, var3=7, var4=0, var5=8, var6=2, var7=5, var8=4] [L62] CALL assume(var8 <= 8) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L62] RET assume(var8 <= 8) VAL [var0=6, var1=1, var2=3, var3=7, var4=0, var5=8, var6=2, var7=5, var8=4] [L63] int var9; [L64] var9 = __VERIFIER_nondet_int() [L65] CALL assume(var9 >= 1) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L65] RET assume(var9 >= 1) VAL [var0=6, var1=1, var2=3, var3=7, var4=0, var5=8, var6=2, var7=5, var8=4, var9=5] [L66] CALL assume(var9 <= 8) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L66] RET assume(var9 <= 8) VAL [var0=6, var1=1, var2=3, var3=7, var4=0, var5=8, var6=2, var7=5, var8=4, var9=5] [L67] int var10; [L68] var10 = __VERIFIER_nondet_int() [L69] CALL assume(var10 >= 1) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L69] RET assume(var10 >= 1) VAL [var0=6, var10=2, var1=1, var2=3, var3=7, var4=0, var5=8, var6=2, var7=5, var8=4, var9=5] [L70] CALL assume(var10 <= 8) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L70] RET assume(var10 <= 8) VAL [var0=6, var10=2, var1=1, var2=3, var3=7, var4=0, var5=8, var6=2, var7=5, var8=4, var9=5] [L71] int var11; [L72] var11 = __VERIFIER_nondet_int() [L73] CALL assume(var11 >= 1) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L73] RET assume(var11 >= 1) VAL [var0=6, var10=2, var11=4, var1=1, var2=3, var3=7, var4=0, var5=8, var6=2, var7=5, var8=4, var9=5] [L74] CALL assume(var11 <= 8) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L74] RET assume(var11 <= 8) VAL [var0=6, var10=2, var11=4, var1=1, var2=3, var3=7, var4=0, var5=8, var6=2, var7=5, var8=4, var9=5] [L75] int var12; [L76] var12 = __VERIFIER_nondet_int() [L77] CALL assume(var12 >= 1) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L77] RET assume(var12 >= 1) VAL [var0=6, var10=2, var11=4, var12=7, var1=1, var2=3, var3=7, var4=0, var5=8, var6=2, var7=5, var8=4, var9=5] [L78] CALL assume(var12 <= 8) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L78] RET assume(var12 <= 8) VAL [var0=6, var10=2, var11=4, var12=7, var1=1, var2=3, var3=7, var4=0, var5=8, var6=2, var7=5, var8=4, var9=5] [L79] int var13; [L80] var13 = __VERIFIER_nondet_int() [L81] CALL assume(var13 >= 1) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L81] RET assume(var13 >= 1) VAL [var0=6, var10=2, var11=4, var12=7, var13=8, var1=1, var2=3, var3=7, var4=0, var5=8, var6=2, var7=5, var8=4, var9=5] [L82] CALL assume(var13 <= 8) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L82] RET assume(var13 <= 8) VAL [var0=6, var10=2, var11=4, var12=7, var13=8, var1=1, var2=3, var3=7, var4=0, var5=8, var6=2, var7=5, var8=4, var9=5] [L83] int var14; [L84] var14 = __VERIFIER_nondet_int() [L85] CALL assume(var14 >= 1) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L85] RET assume(var14 >= 1) VAL [var0=6, var10=2, var11=4, var12=7, var13=8, var14=6, var1=1, var2=3, var3=7, var4=0, var5=8, var6=2, var7=5, var8=4, var9=5] [L86] CALL assume(var14 <= 8) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L86] RET assume(var14 <= 8) VAL [var0=6, var10=2, var11=4, var12=7, var13=8, var14=6, var1=1, var2=3, var3=7, var4=0, var5=8, var6=2, var7=5, var8=4, var9=5] [L87] int var15; [L88] var15 = __VERIFIER_nondet_int() [L89] CALL assume(var15 >= 1) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L89] RET assume(var15 >= 1) VAL [var0=6, var10=2, var11=4, var12=7, var13=8, var14=6, var15=3, var1=1, var2=3, var3=7, var4=0, var5=8, var6=2, var7=5, var8=4, var9=5] [L90] CALL assume(var15 <= 8) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L90] RET assume(var15 <= 8) VAL [var0=6, var10=2, var11=4, var12=7, var13=8, var14=6, var15=3, var1=1, var2=3, var3=7, var4=0, var5=8, var6=2, var7=5, var8=4, var9=5] [L91] int var16; [L92] var16 = __VERIFIER_nondet_int() [L93] CALL assume(var16 >= 1) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L93] RET assume(var16 >= 1) VAL [var0=6, var10=2, var11=4, var12=7, var13=8, var14=6, var15=3, var16=1, var1=1, var2=3, var3=7, var4=0, var5=8, var6=2, var7=5, var8=4, var9=5] [L94] CALL assume(var16 <= 8) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L94] RET assume(var16 <= 8) VAL [var0=6, var10=2, var11=4, var12=7, var13=8, var14=6, var15=3, var16=1, var1=1, var2=3, var3=7, var4=0, var5=8, var6=2, var7=5, var8=4, var9=5] [L95] int myvar0 = 1; VAL [var0=6, var10=2, var11=4, var12=7, var13=8, var14=6, var15=3, var16=1, var1=1, var2=3, var3=7, var4=0, var5=8, var6=2, var7=5, var8=4, var9=5] [L96] CALL assume(var0 != var1) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L96] RET assume(var0 != var1) VAL [var0=6, var10=2, var11=4, var12=7, var13=8, var14=6, var15=3, var16=1, var1=1, var2=3, var3=7, var4=0, var5=8, var6=2, var7=5, var8=4, var9=5] [L97] CALL assume(var0 != var2) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L97] RET assume(var0 != var2) VAL [var0=6, var10=2, var11=4, var12=7, var13=8, var14=6, var15=3, var16=1, var1=1, var2=3, var3=7, var4=0, var5=8, var6=2, var7=5, var8=4, var9=5] [L98] CALL assume(var0 != var3) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L98] RET assume(var0 != var3) VAL [var0=6, var10=2, var11=4, var12=7, var13=8, var14=6, var15=3, var16=1, var1=1, var2=3, var3=7, var4=0, var5=8, var6=2, var7=5, var8=4, var9=5] [L99] CALL assume(var0 != var4) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L99] RET assume(var0 != var4) VAL [var0=6, var10=2, var11=4, var12=7, var13=8, var14=6, var15=3, var16=1, var1=1, var2=3, var3=7, var4=0, var5=8, var6=2, var7=5, var8=4, var9=5] [L100] CALL assume(var0 != var5) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L100] RET assume(var0 != var5) VAL [var0=6, var10=2, var11=4, var12=7, var13=8, var14=6, var15=3, var16=1, var1=1, var2=3, var3=7, var4=0, var5=8, var6=2, var7=5, var8=4, var9=5] [L101] CALL assume(var0 != var6) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L101] RET assume(var0 != var6) VAL [var0=6, var10=2, var11=4, var12=7, var13=8, var14=6, var15=3, var16=1, var1=1, var2=3, var3=7, var4=0, var5=8, var6=2, var7=5, var8=4, var9=5] [L102] CALL assume(var0 != var7) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L102] RET assume(var0 != var7) VAL [var0=6, var10=2, var11=4, var12=7, var13=8, var14=6, var15=3, var16=1, var1=1, var2=3, var3=7, var4=0, var5=8, var6=2, var7=5, var8=4, var9=5] [L103] CALL assume(var0 != var8) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L103] RET assume(var0 != var8) VAL [var0=6, var10=2, var11=4, var12=7, var13=8, var14=6, var15=3, var16=1, var1=1, var2=3, var3=7, var4=0, var5=8, var6=2, var7=5, var8=4, var9=5] [L104] CALL assume(var1 != var2) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L104] RET assume(var1 != var2) VAL [var0=6, var10=2, var11=4, var12=7, var13=8, var14=6, var15=3, var16=1, var1=1, var2=3, var3=7, var4=0, var5=8, var6=2, var7=5, var8=4, var9=5] [L105] CALL assume(var1 != var3) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L105] RET assume(var1 != var3) VAL [var0=6, var10=2, var11=4, var12=7, var13=8, var14=6, var15=3, var16=1, var1=1, var2=3, var3=7, var4=0, var5=8, var6=2, var7=5, var8=4, var9=5] [L106] CALL assume(var1 != var4) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L106] RET assume(var1 != var4) VAL [var0=6, var10=2, var11=4, var12=7, var13=8, var14=6, var15=3, var16=1, var1=1, var2=3, var3=7, var4=0, var5=8, var6=2, var7=5, var8=4, var9=5] [L107] CALL assume(var1 != var5) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L107] RET assume(var1 != var5) VAL [var0=6, var10=2, var11=4, var12=7, var13=8, var14=6, var15=3, var16=1, var1=1, var2=3, var3=7, var4=0, var5=8, var6=2, var7=5, var8=4, var9=5] [L108] CALL assume(var1 != var6) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L108] RET assume(var1 != var6) VAL [var0=6, var10=2, var11=4, var12=7, var13=8, var14=6, var15=3, var16=1, var1=1, var2=3, var3=7, var4=0, var5=8, var6=2, var7=5, var8=4, var9=5] [L109] CALL assume(var1 != var7) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L109] RET assume(var1 != var7) VAL [var0=6, var10=2, var11=4, var12=7, var13=8, var14=6, var15=3, var16=1, var1=1, var2=3, var3=7, var4=0, var5=8, var6=2, var7=5, var8=4, var9=5] [L110] CALL assume(var1 != var8) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L110] RET assume(var1 != var8) VAL [var0=6, var10=2, var11=4, var12=7, var13=8, var14=6, var15=3, var16=1, var1=1, var2=3, var3=7, var4=0, var5=8, var6=2, var7=5, var8=4, var9=5] [L111] CALL assume(var2 != var3) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L111] RET assume(var2 != var3) VAL [var0=6, var10=2, var11=4, var12=7, var13=8, var14=6, var15=3, var16=1, var1=1, var2=3, var3=7, var4=0, var5=8, var6=2, var7=5, var8=4, var9=5] [L112] CALL assume(var2 != var4) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L112] RET assume(var2 != var4) VAL [var0=6, var10=2, var11=4, var12=7, var13=8, var14=6, var15=3, var16=1, var1=1, var2=3, var3=7, var4=0, var5=8, var6=2, var7=5, var8=4, var9=5] [L113] CALL assume(var2 != var5) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L113] RET assume(var2 != var5) VAL [var0=6, var10=2, var11=4, var12=7, var13=8, var14=6, var15=3, var16=1, var1=1, var2=3, var3=7, var4=0, var5=8, var6=2, var7=5, var8=4, var9=5] [L114] CALL assume(var2 != var6) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L114] RET assume(var2 != var6) VAL [var0=6, var10=2, var11=4, var12=7, var13=8, var14=6, var15=3, var16=1, var1=1, var2=3, var3=7, var4=0, var5=8, var6=2, var7=5, var8=4, var9=5] [L115] CALL assume(var2 != var7) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L115] RET assume(var2 != var7) VAL [var0=6, var10=2, var11=4, var12=7, var13=8, var14=6, var15=3, var16=1, var1=1, var2=3, var3=7, var4=0, var5=8, var6=2, var7=5, var8=4, var9=5] [L116] CALL assume(var2 != var8) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L116] RET assume(var2 != var8) VAL [var0=6, var10=2, var11=4, var12=7, var13=8, var14=6, var15=3, var16=1, var1=1, var2=3, var3=7, var4=0, var5=8, var6=2, var7=5, var8=4, var9=5] [L117] CALL assume(var3 != var4) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L117] RET assume(var3 != var4) VAL [var0=6, var10=2, var11=4, var12=7, var13=8, var14=6, var15=3, var16=1, var1=1, var2=3, var3=7, var4=0, var5=8, var6=2, var7=5, var8=4, var9=5] [L118] CALL assume(var3 != var5) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L118] RET assume(var3 != var5) VAL [var0=6, var10=2, var11=4, var12=7, var13=8, var14=6, var15=3, var16=1, var1=1, var2=3, var3=7, var4=0, var5=8, var6=2, var7=5, var8=4, var9=5] [L119] CALL assume(var3 != var6) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L119] RET assume(var3 != var6) VAL [var0=6, var10=2, var11=4, var12=7, var13=8, var14=6, var15=3, var16=1, var1=1, var2=3, var3=7, var4=0, var5=8, var6=2, var7=5, var8=4, var9=5] [L120] CALL assume(var3 != var7) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L120] RET assume(var3 != var7) VAL [var0=6, var10=2, var11=4, var12=7, var13=8, var14=6, var15=3, var16=1, var1=1, var2=3, var3=7, var4=0, var5=8, var6=2, var7=5, var8=4, var9=5] [L121] CALL assume(var3 != var8) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L121] RET assume(var3 != var8) VAL [var0=6, var10=2, var11=4, var12=7, var13=8, var14=6, var15=3, var16=1, var1=1, var2=3, var3=7, var4=0, var5=8, var6=2, var7=5, var8=4, var9=5] [L122] CALL assume(var4 != var5) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L122] RET assume(var4 != var5) VAL [var0=6, var10=2, var11=4, var12=7, var13=8, var14=6, var15=3, var16=1, var1=1, var2=3, var3=7, var4=0, var5=8, var6=2, var7=5, var8=4, var9=5] [L123] CALL assume(var4 != var6) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L123] RET assume(var4 != var6) VAL [var0=6, var10=2, var11=4, var12=7, var13=8, var14=6, var15=3, var16=1, var1=1, var2=3, var3=7, var4=0, var5=8, var6=2, var7=5, var8=4, var9=5] [L124] CALL assume(var4 != var7) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L124] RET assume(var4 != var7) VAL [var0=6, var10=2, var11=4, var12=7, var13=8, var14=6, var15=3, var16=1, var1=1, var2=3, var3=7, var4=0, var5=8, var6=2, var7=5, var8=4, var9=5] [L125] CALL assume(var4 != var8) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L125] RET assume(var4 != var8) VAL [var0=6, var10=2, var11=4, var12=7, var13=8, var14=6, var15=3, var16=1, var1=1, var2=3, var3=7, var4=0, var5=8, var6=2, var7=5, var8=4, var9=5] [L126] CALL assume(var5 != var6) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L126] RET assume(var5 != var6) VAL [var0=6, var10=2, var11=4, var12=7, var13=8, var14=6, var15=3, var16=1, var1=1, var2=3, var3=7, var4=0, var5=8, var6=2, var7=5, var8=4, var9=5] [L127] CALL assume(var5 != var7) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L127] RET assume(var5 != var7) VAL [var0=6, var10=2, var11=4, var12=7, var13=8, var14=6, var15=3, var16=1, var1=1, var2=3, var3=7, var4=0, var5=8, var6=2, var7=5, var8=4, var9=5] [L128] CALL assume(var5 != var8) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L128] RET assume(var5 != var8) VAL [var0=6, var10=2, var11=4, var12=7, var13=8, var14=6, var15=3, var16=1, var1=1, var2=3, var3=7, var4=0, var5=8, var6=2, var7=5, var8=4, var9=5] [L129] CALL assume(var6 != var7) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L129] RET assume(var6 != var7) VAL [var0=6, var10=2, var11=4, var12=7, var13=8, var14=6, var15=3, var16=1, var1=1, var2=3, var3=7, var4=0, var5=8, var6=2, var7=5, var8=4, var9=5] [L130] CALL assume(var6 != var8) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L130] RET assume(var6 != var8) VAL [var0=6, var10=2, var11=4, var12=7, var13=8, var14=6, var15=3, var16=1, var1=1, var2=3, var3=7, var4=0, var5=8, var6=2, var7=5, var8=4, var9=5] [L131] CALL assume(var7 != var8) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L131] RET assume(var7 != var8) VAL [var0=6, var10=2, var11=4, var12=7, var13=8, var14=6, var15=3, var16=1, var1=1, var2=3, var3=7, var4=0, var5=8, var6=2, var7=5, var8=4, var9=5] [L132] CALL assume(var9 != var10) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L132] RET assume(var9 != var10) VAL [var0=6, var10=2, var11=4, var12=7, var13=8, var14=6, var15=3, var16=1, var1=1, var2=3, var3=7, var4=0, var5=8, var6=2, var7=5, var8=4, var9=5] [L133] CALL assume(var9 != var11) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L133] RET assume(var9 != var11) VAL [var0=6, var10=2, var11=4, var12=7, var13=8, var14=6, var15=3, var16=1, var1=1, var2=3, var3=7, var4=0, var5=8, var6=2, var7=5, var8=4, var9=5] [L134] CALL assume(var9 != var12) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L134] RET assume(var9 != var12) VAL [var0=6, var10=2, var11=4, var12=7, var13=8, var14=6, var15=3, var16=1, var1=1, var2=3, var3=7, var4=0, var5=8, var6=2, var7=5, var8=4, var9=5] [L135] CALL assume(var9 != var13) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L135] RET assume(var9 != var13) VAL [var0=6, var10=2, var11=4, var12=7, var13=8, var14=6, var15=3, var16=1, var1=1, var2=3, var3=7, var4=0, var5=8, var6=2, var7=5, var8=4, var9=5] [L136] CALL assume(var9 != var14) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L136] RET assume(var9 != var14) VAL [var0=6, var10=2, var11=4, var12=7, var13=8, var14=6, var15=3, var16=1, var1=1, var2=3, var3=7, var4=0, var5=8, var6=2, var7=5, var8=4, var9=5] [L137] CALL assume(var9 != var15) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L137] RET assume(var9 != var15) VAL [var0=6, var10=2, var11=4, var12=7, var13=8, var14=6, var15=3, var16=1, var1=1, var2=3, var3=7, var4=0, var5=8, var6=2, var7=5, var8=4, var9=5] [L138] CALL assume(var9 != var16) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L138] RET assume(var9 != var16) VAL [var0=6, var10=2, var11=4, var12=7, var13=8, var14=6, var15=3, var16=1, var1=1, var2=3, var3=7, var4=0, var5=8, var6=2, var7=5, var8=4, var9=5] [L139] CALL assume(var10 != var11) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L139] RET assume(var10 != var11) VAL [var0=6, var10=2, var11=4, var12=7, var13=8, var14=6, var15=3, var16=1, var1=1, var2=3, var3=7, var4=0, var5=8, var6=2, var7=5, var8=4, var9=5] [L140] CALL assume(var10 != var12) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L140] RET assume(var10 != var12) VAL [var0=6, var10=2, var11=4, var12=7, var13=8, var14=6, var15=3, var16=1, var1=1, var2=3, var3=7, var4=0, var5=8, var6=2, var7=5, var8=4, var9=5] [L141] CALL assume(var10 != var13) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L141] RET assume(var10 != var13) VAL [var0=6, var10=2, var11=4, var12=7, var13=8, var14=6, var15=3, var16=1, var1=1, var2=3, var3=7, var4=0, var5=8, var6=2, var7=5, var8=4, var9=5] [L142] CALL assume(var10 != var14) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L142] RET assume(var10 != var14) VAL [var0=6, var10=2, var11=4, var12=7, var13=8, var14=6, var15=3, var16=1, var1=1, var2=3, var3=7, var4=0, var5=8, var6=2, var7=5, var8=4, var9=5] [L143] CALL assume(var10 != var15) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L143] RET assume(var10 != var15) VAL [var0=6, var10=2, var11=4, var12=7, var13=8, var14=6, var15=3, var16=1, var1=1, var2=3, var3=7, var4=0, var5=8, var6=2, var7=5, var8=4, var9=5] [L144] CALL assume(var10 != var16) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L144] RET assume(var10 != var16) VAL [var0=6, var10=2, var11=4, var12=7, var13=8, var14=6, var15=3, var16=1, var1=1, var2=3, var3=7, var4=0, var5=8, var6=2, var7=5, var8=4, var9=5] [L145] CALL assume(var11 != var12) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L145] RET assume(var11 != var12) VAL [var0=6, var10=2, var11=4, var12=7, var13=8, var14=6, var15=3, var16=1, var1=1, var2=3, var3=7, var4=0, var5=8, var6=2, var7=5, var8=4, var9=5] [L146] CALL assume(var11 != var13) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L146] RET assume(var11 != var13) VAL [var0=6, var10=2, var11=4, var12=7, var13=8, var14=6, var15=3, var16=1, var1=1, var2=3, var3=7, var4=0, var5=8, var6=2, var7=5, var8=4, var9=5] [L147] CALL assume(var11 != var14) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L147] RET assume(var11 != var14) VAL [var0=6, var10=2, var11=4, var12=7, var13=8, var14=6, var15=3, var16=1, var1=1, var2=3, var3=7, var4=0, var5=8, var6=2, var7=5, var8=4, var9=5] [L148] CALL assume(var11 != var15) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L148] RET assume(var11 != var15) VAL [var0=6, var10=2, var11=4, var12=7, var13=8, var14=6, var15=3, var16=1, var1=1, var2=3, var3=7, var4=0, var5=8, var6=2, var7=5, var8=4, var9=5] [L149] CALL assume(var11 != var16) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L149] RET assume(var11 != var16) VAL [var0=6, var10=2, var11=4, var12=7, var13=8, var14=6, var15=3, var16=1, var1=1, var2=3, var3=7, var4=0, var5=8, var6=2, var7=5, var8=4, var9=5] [L150] CALL assume(var12 != var13) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L150] RET assume(var12 != var13) VAL [var0=6, var10=2, var11=4, var12=7, var13=8, var14=6, var15=3, var16=1, var1=1, var2=3, var3=7, var4=0, var5=8, var6=2, var7=5, var8=4, var9=5] [L151] CALL assume(var12 != var14) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L151] RET assume(var12 != var14) VAL [var0=6, var10=2, var11=4, var12=7, var13=8, var14=6, var15=3, var16=1, var1=1, var2=3, var3=7, var4=0, var5=8, var6=2, var7=5, var8=4, var9=5] [L152] CALL assume(var12 != var15) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L152] RET assume(var12 != var15) VAL [var0=6, var10=2, var11=4, var12=7, var13=8, var14=6, var15=3, var16=1, var1=1, var2=3, var3=7, var4=0, var5=8, var6=2, var7=5, var8=4, var9=5] [L153] CALL assume(var12 != var16) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L153] RET assume(var12 != var16) VAL [var0=6, var10=2, var11=4, var12=7, var13=8, var14=6, var15=3, var16=1, var1=1, var2=3, var3=7, var4=0, var5=8, var6=2, var7=5, var8=4, var9=5] [L154] CALL assume(var13 != var14) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L154] RET assume(var13 != var14) VAL [var0=6, var10=2, var11=4, var12=7, var13=8, var14=6, var15=3, var16=1, var1=1, var2=3, var3=7, var4=0, var5=8, var6=2, var7=5, var8=4, var9=5] [L155] CALL assume(var13 != var15) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L155] RET assume(var13 != var15) VAL [var0=6, var10=2, var11=4, var12=7, var13=8, var14=6, var15=3, var16=1, var1=1, var2=3, var3=7, var4=0, var5=8, var6=2, var7=5, var8=4, var9=5] [L156] CALL assume(var13 != var16) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L156] RET assume(var13 != var16) VAL [var0=6, var10=2, var11=4, var12=7, var13=8, var14=6, var15=3, var16=1, var1=1, var2=3, var3=7, var4=0, var5=8, var6=2, var7=5, var8=4, var9=5] [L157] CALL assume(var14 != var15) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L157] RET assume(var14 != var15) VAL [var0=6, var10=2, var11=4, var12=7, var13=8, var14=6, var15=3, var16=1, var1=1, var2=3, var3=7, var4=0, var5=8, var6=2, var7=5, var8=4, var9=5] [L158] CALL assume(var14 != var16) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L158] RET assume(var14 != var16) VAL [var0=6, var10=2, var11=4, var12=7, var13=8, var14=6, var15=3, var16=1, var1=1, var2=3, var3=7, var4=0, var5=8, var6=2, var7=5, var8=4, var9=5] [L159] CALL assume(var15 != var16) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L159] RET assume(var15 != var16) VAL [var0=6, var10=2, var11=4, var12=7, var13=8, var14=6, var15=3, var16=1, var1=1, var2=3, var3=7, var4=0, var5=8, var6=2, var7=5, var8=4, var9=5] [L160] int var_for_abs; [L161] var_for_abs = var0 - var1 [L162] var_for_abs = (var_for_abs >= 0) ? var_for_abs : var_for_abs * (-1) VAL [var10=2, var11=4, var12=7, var13=8, var14=6, var15=3, var16=1, var1=1, var2=3, var3=7, var4=0, var5=8, var6=2, var7=5, var8=4, var9=5, var_for_abs=5] [L163] CALL assume(var9 == var_for_abs) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L163] RET assume(var9 == var_for_abs) VAL [var10=2, var11=4, var12=7, var13=8, var14=6, var15=3, var16=1, var1=1, var2=3, var3=7, var4=0, var5=8, var6=2, var7=5, var8=4, var9=5, var_for_abs=5] [L164] var_for_abs = var1 - var2 [L165] var_for_abs = (var_for_abs >= 0) ? var_for_abs : var_for_abs * (-1) VAL [var10=2, var11=4, var12=7, var13=8, var14=6, var15=3, var16=1, var2=3, var3=7, var4=0, var5=8, var6=2, var7=5, var8=4, var9=5, var_for_abs=2] [L166] CALL assume(var10 == var_for_abs) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L166] RET assume(var10 == var_for_abs) VAL [var10=2, var11=4, var12=7, var13=8, var14=6, var15=3, var16=1, var2=3, var3=7, var4=0, var5=8, var6=2, var7=5, var8=4, var9=5, var_for_abs=2] [L167] var_for_abs = var2 - var3 [L168] var_for_abs = (var_for_abs >= 0) ? var_for_abs : var_for_abs * (-1) VAL [var10=2, var11=4, var12=7, var13=8, var14=6, var15=3, var16=1, var3=7, var4=0, var5=8, var6=2, var7=5, var8=4, var9=5, var_for_abs=4] [L169] CALL assume(var11 == var_for_abs) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L169] RET assume(var11 == var_for_abs) VAL [var10=2, var11=4, var12=7, var13=8, var14=6, var15=3, var16=1, var3=7, var4=0, var5=8, var6=2, var7=5, var8=4, var9=5, var_for_abs=4] [L170] var_for_abs = var3 - var4 [L171] var_for_abs = (var_for_abs >= 0) ? var_for_abs : var_for_abs * (-1) VAL [var10=2, var11=4, var12=7, var13=8, var14=6, var15=3, var16=1, var4=0, var5=8, var6=2, var7=5, var8=4, var9=5, var_for_abs=7] [L172] CALL assume(var12 == var_for_abs) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L172] RET assume(var12 == var_for_abs) VAL [var10=2, var11=4, var12=7, var13=8, var14=6, var15=3, var16=1, var4=0, var5=8, var6=2, var7=5, var8=4, var9=5, var_for_abs=7] [L173] var_for_abs = var4 - var5 [L174] var_for_abs = (var_for_abs >= 0) ? var_for_abs : var_for_abs * (-1) VAL [var10=2, var11=4, var12=7, var13=8, var14=6, var15=3, var16=1, var5=8, var6=2, var7=5, var8=4, var9=5, var_for_abs=8] [L175] CALL assume(var13 == var_for_abs) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L175] RET assume(var13 == var_for_abs) VAL [var10=2, var11=4, var12=7, var13=8, var14=6, var15=3, var16=1, var5=8, var6=2, var7=5, var8=4, var9=5, var_for_abs=8] [L176] var_for_abs = var5 - var6 [L177] var_for_abs = (var_for_abs >= 0) ? var_for_abs : var_for_abs * (-1) VAL [var10=2, var11=4, var12=7, var13=8, var14=6, var15=3, var16=1, var6=2, var7=5, var8=4, var9=5, var_for_abs=6] [L178] CALL assume(var14 == var_for_abs) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L178] RET assume(var14 == var_for_abs) VAL [var10=2, var11=4, var12=7, var13=8, var14=6, var15=3, var16=1, var6=2, var7=5, var8=4, var9=5, var_for_abs=6] [L179] var_for_abs = var6 - var7 [L180] var_for_abs = (var_for_abs >= 0) ? var_for_abs : var_for_abs * (-1) VAL [var10=2, var11=4, var12=7, var13=8, var14=6, var15=3, var16=1, var7=5, var8=4, var9=5, var_for_abs=3] [L181] CALL assume(var15 == var_for_abs) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L181] RET assume(var15 == var_for_abs) VAL [var10=2, var11=4, var12=7, var13=8, var14=6, var15=3, var16=1, var7=5, var8=4, var9=5, var_for_abs=3] [L182] var_for_abs = var7 - var8 [L183] var_for_abs = (var_for_abs >= 0) ? var_for_abs : var_for_abs * (-1) VAL [var10=2, var11=4, var12=7, var13=8, var14=6, var15=3, var16=1, var9=5, var_for_abs=1] [L184] CALL assume(var16 == var_for_abs) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L184] RET assume(var16 == var_for_abs) VAL [var10=2, var11=4, var12=7, var13=8, var14=6, var15=3, var16=1, var9=5, var_for_abs=1] [L185] reach_error() VAL [var10=2, var11=4, var12=7, var13=8, var14=6, var15=3, var16=1, var9=5, var_for_abs=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 140 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 4.0s, OverallIterations: 2, TraceHistogramMax: 106, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 0 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 0 mSDsluCounter, 242 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 0 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 0 IncrementalHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 0 mSolverCounterUnsat, 242 mSDtfsCounter, 0 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 558 GetRequests, 558 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=140occurred in iteration=0, InterpolantAutomatonStates: 2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 1.9s SatisfiabilityAnalysisTime, 0.4s InterpolantComputationTime, 1671 NumberOfCodeBlocks, 1671 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 1112 ConstructedInterpolants, 0 QuantifiedInterpolants, 1112 SizeOfPredicates, 0 NumberOfNonLiveVariables, 1030 ConjunctsInSsa, 1 ConjunctsInUnsatCore, 2 InterpolantComputations, 1 PerfectInterpolantSequences, 44310/44520 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 proved your program to be incorrect! [2025-02-07 21:26:09,675 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 Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE