./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/xcsp/AllInterval-007.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c7c6ca5d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/xcsp/AllInterval-007.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 79ad480fc17f59cc4e46ec2dbc023b5da3460c72b3c8ca1cc6dbc35a93f8cf64 --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-08 16:13:30,702 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 16:13:30,769 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-08 16:13:30,772 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 16:13:30,772 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 16:13:30,791 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 16:13:30,794 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 16:13:30,794 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 16:13:30,795 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 16:13:30,796 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 16:13:30,797 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 16:13:30,797 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 16:13:30,797 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 16:13:30,800 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 16:13:30,801 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 16:13:30,801 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 16:13:30,801 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 16:13:30,801 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 16:13:30,801 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-08 16:13:30,802 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 16:13:30,802 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 16:13:30,802 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 16:13:30,802 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 16:13:30,802 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 16:13:30,803 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 16:13:30,803 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 16:13:30,803 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 16:13:30,803 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 16:13:30,803 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 16:13:30,804 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 16:13:30,804 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 16:13:30,804 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 16:13:30,804 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 16:13:30,804 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 16:13:30,804 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 16:13:30,804 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 16:13:30,805 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-08 16:13:30,805 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-08 16:13:30,805 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 16:13:30,805 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 16:13:30,805 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 16:13:30,806 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 16:13:30,806 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 79ad480fc17f59cc4e46ec2dbc023b5da3460c72b3c8ca1cc6dbc35a93f8cf64 [2024-11-08 16:13:30,978 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 16:13:30,998 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 16:13:31,001 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 16:13:31,003 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 16:13:31,004 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 16:13:31,005 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/xcsp/AllInterval-007.c [2024-11-08 16:13:32,235 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 16:13:32,375 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 16:13:32,375 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/xcsp/AllInterval-007.c [2024-11-08 16:13:32,381 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b0b6bf6a8/7d7683d6a81c4cbcb833c4cec047b399/FLAG67f810b1a [2024-11-08 16:13:32,787 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b0b6bf6a8/7d7683d6a81c4cbcb833c4cec047b399 [2024-11-08 16:13:32,789 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 16:13:32,790 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 16:13:32,791 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 16:13:32,791 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 16:13:32,794 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 16:13:32,795 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 04:13:32" (1/1) ... [2024-11-08 16:13:32,795 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4060ffae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:13:32, skipping insertion in model container [2024-11-08 16:13:32,796 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 04:13:32" (1/1) ... [2024-11-08 16:13:32,814 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 16:13:32,957 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/xcsp/AllInterval-007.c[3690,3703] [2024-11-08 16:13:32,961 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 16:13:32,968 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 16:13:32,988 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/xcsp/AllInterval-007.c[3690,3703] [2024-11-08 16:13:32,989 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 16:13:33,002 INFO L204 MainTranslator]: Completed translation [2024-11-08 16:13:33,002 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:13:33 WrapperNode [2024-11-08 16:13:33,002 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 16:13:33,003 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 16:13:33,003 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 16:13:33,003 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 16:13:33,008 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:13:33" (1/1) ... [2024-11-08 16:13:33,019 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:13:33" (1/1) ... [2024-11-08 16:13:33,038 INFO L138 Inliner]: procedures = 13, calls = 75, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 162 [2024-11-08 16:13:33,039 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 16:13:33,039 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 16:13:33,039 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 16:13:33,040 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 16:13:33,047 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:13:33" (1/1) ... [2024-11-08 16:13:33,048 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:13:33" (1/1) ... [2024-11-08 16:13:33,049 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:13:33" (1/1) ... [2024-11-08 16:13:33,059 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]. [2024-11-08 16:13:33,059 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:13:33" (1/1) ... [2024-11-08 16:13:33,059 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:13:33" (1/1) ... [2024-11-08 16:13:33,062 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:13:33" (1/1) ... [2024-11-08 16:13:33,063 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:13:33" (1/1) ... [2024-11-08 16:13:33,064 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:13:33" (1/1) ... [2024-11-08 16:13:33,064 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:13:33" (1/1) ... [2024-11-08 16:13:33,066 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 16:13:33,070 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 16:13:33,070 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 16:13:33,070 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 16:13:33,070 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:13:33" (1/1) ... [2024-11-08 16:13:33,076 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 16:13:33,086 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 16:13:33,097 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-08 16:13:33,099 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-08 16:13:33,133 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 16:13:33,133 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 16:13:33,134 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 16:13:33,134 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-08 16:13:33,134 INFO L130 BoogieDeclarations]: Found specification of procedure assume [2024-11-08 16:13:33,134 INFO L138 BoogieDeclarations]: Found implementation of procedure assume [2024-11-08 16:13:33,191 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 16:13:33,192 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 16:13:33,413 INFO L? ?]: Removed 12 outVars from TransFormulas that were not future-live. [2024-11-08 16:13:33,413 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 16:13:33,429 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 16:13:33,430 INFO L316 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-08 16:13:33,430 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 04:13:33 BoogieIcfgContainer [2024-11-08 16:13:33,430 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 16:13:33,432 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 16:13:33,433 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 16:13:33,435 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 16:13:33,435 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 04:13:32" (1/3) ... [2024-11-08 16:13:33,436 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@791eca07 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 04:13:33, skipping insertion in model container [2024-11-08 16:13:33,436 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:13:33" (2/3) ... [2024-11-08 16:13:33,437 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@791eca07 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 04:13:33, skipping insertion in model container [2024-11-08 16:13:33,437 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 04:13:33" (3/3) ... [2024-11-08 16:13:33,438 INFO L112 eAbstractionObserver]: Analyzing ICFG AllInterval-007.c [2024-11-08 16:13:33,449 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 16:13:33,450 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-08 16:13:33,497 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 16:13:33,502 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;@567d17d1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 16:13:33,502 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 16:13:33,505 INFO L276 IsEmpty]: Start isEmpty. Operand has 98 states, 27 states have (on average 1.0740740740740742) internal successors, (29), 28 states have internal predecessors, (29), 68 states have call successors, (68), 1 states have call predecessors, (68), 1 states have return successors, (68), 68 states have call predecessors, (68), 68 states have call successors, (68) [2024-11-08 16:13:33,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 363 [2024-11-08 16:13:33,530 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:13:33,532 INFO L215 NwaCegarLoop]: trace histogram [68, 68, 68, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 16:13:33,532 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 16:13:33,539 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:13:33,539 INFO L85 PathProgramCache]: Analyzing trace with hash 925921856, now seen corresponding path program 1 times [2024-11-08 16:13:33,546 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 16:13:33,546 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1388173064] [2024-11-08 16:13:33,547 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:13:33,547 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 16:13:33,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:13:33,825 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 16:13:33,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:13:33,836 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-08 16:13:33,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:13:33,843 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-08 16:13:33,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:13:33,848 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-08 16:13:33,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:13:33,852 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-08 16:13:33,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:13:33,855 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-08 16:13:33,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:13:33,861 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-08 16:13:33,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:13:33,865 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-08 16:13:33,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:13:33,871 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-11-08 16:13:33,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:13:33,876 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-08 16:13:33,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:13:33,879 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-08 16:13:33,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:13:33,881 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-08 16:13:33,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:13:33,884 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-08 16:13:33,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:13:33,886 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-08 16:13:33,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:13:33,888 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-08 16:13:33,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:13:33,891 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-08 16:13:33,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:13:33,893 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-08 16:13:33,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:13:33,895 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-08 16:13:33,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:13:33,898 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-08 16:13:33,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:13:33,900 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-08 16:13:33,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:13:33,902 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-08 16:13:33,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:13:33,904 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-08 16:13:33,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:13:33,906 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-08 16:13:33,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:13:33,909 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-08 16:13:33,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:13:33,915 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-11-08 16:13:33,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:13:33,917 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-08 16:13:33,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:13:33,920 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2024-11-08 16:13:33,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:13:33,923 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-11-08 16:13:33,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:13:33,926 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-11-08 16:13:33,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:13:33,928 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2024-11-08 16:13:33,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:13:33,930 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 165 [2024-11-08 16:13:33,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:13:33,932 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 170 [2024-11-08 16:13:33,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:13:33,935 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2024-11-08 16:13:33,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:13:33,938 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 180 [2024-11-08 16:13:33,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:13:33,940 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 185 [2024-11-08 16:13:33,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:13:33,942 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 190 [2024-11-08 16:13:33,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:13:33,944 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 195 [2024-11-08 16:13:33,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:13:33,947 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 200 [2024-11-08 16:13:33,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:13:33,949 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 205 [2024-11-08 16:13:33,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:13:33,951 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 210 [2024-11-08 16:13:33,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:13:33,953 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 215 [2024-11-08 16:13:33,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:13:33,955 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 220 [2024-11-08 16:13:33,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:13:33,957 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 225 [2024-11-08 16:13:33,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:13:33,959 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 230 [2024-11-08 16:13:33,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:13:33,961 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 235 [2024-11-08 16:13:33,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:13:33,963 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 240 [2024-11-08 16:13:33,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:13:33,966 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 245 [2024-11-08 16:13:33,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:13:33,968 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 250 [2024-11-08 16:13:33,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:13:33,970 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 255 [2024-11-08 16:13:33,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:13:33,972 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 260 [2024-11-08 16:13:33,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:13:33,973 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 265 [2024-11-08 16:13:33,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:13:33,976 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 270 [2024-11-08 16:13:33,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:13:33,978 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 275 [2024-11-08 16:13:33,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:13:33,980 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 280 [2024-11-08 16:13:33,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:13:33,982 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 285 [2024-11-08 16:13:33,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:13:33,984 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 290 [2024-11-08 16:13:33,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:13:33,986 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 295 [2024-11-08 16:13:33,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:13:33,988 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 300 [2024-11-08 16:13:33,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:13:33,989 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 305 [2024-11-08 16:13:33,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:13:33,993 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 310 [2024-11-08 16:13:33,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:13:33,995 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 315 [2024-11-08 16:13:33,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:13:33,999 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 320 [2024-11-08 16:13:34,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:13:34,002 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 326 [2024-11-08 16:13:34,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:13:34,008 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 332 [2024-11-08 16:13:34,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:13:34,010 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 338 [2024-11-08 16:13:34,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:13:34,012 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 344 [2024-11-08 16:13:34,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:13:34,014 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 350 [2024-11-08 16:13:34,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:13:34,016 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 356 [2024-11-08 16:13:34,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:13:34,022 INFO L134 CoverageAnalysis]: Checked inductivity of 9112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9112 trivial. 0 not checked. [2024-11-08 16:13:34,023 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 16:13:34,023 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1388173064] [2024-11-08 16:13:34,024 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1388173064] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:13:34,024 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 16:13:34,025 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 16:13:34,026 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1905533724] [2024-11-08 16:13:34,027 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:13:34,030 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-08 16:13:34,030 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 16:13:34,053 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-08 16:13:34,054 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 16:13:34,056 INFO L87 Difference]: Start difference. First operand has 98 states, 27 states have (on average 1.0740740740740742) internal successors, (29), 28 states have internal predecessors, (29), 68 states have call successors, (68), 1 states have call predecessors, (68), 1 states have return successors, (68), 68 states have call predecessors, (68), 68 states have call successors, (68) Second operand has 2 states, 2 states have (on average 12.5) internal successors, (25), 2 states have internal predecessors, (25), 2 states have call successors, (68), 1 states have call predecessors, (68), 1 states have return successors, (68), 1 states have call predecessors, (68), 2 states have call successors, (68) [2024-11-08 16:13:34,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 16:13:34,092 INFO L93 Difference]: Finished difference Result 190 states and 392 transitions. [2024-11-08 16:13:34,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-08 16:13:34,096 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 12.5) internal successors, (25), 2 states have internal predecessors, (25), 2 states have call successors, (68), 1 states have call predecessors, (68), 1 states have return successors, (68), 1 states have call predecessors, (68), 2 states have call successors, (68) Word has length 362 [2024-11-08 16:13:34,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 16:13:34,103 INFO L225 Difference]: With dead ends: 190 [2024-11-08 16:13:34,103 INFO L226 Difference]: Without dead ends: 95 [2024-11-08 16:13:34,108 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 206 GetRequests, 206 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 16:13:34,111 INFO L432 NwaCegarLoop]: 161 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, 161 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 [2024-11-08 16:13:34,112 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 161 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 16:13:34,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2024-11-08 16:13:34,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2024-11-08 16:13:34,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 25 states have (on average 1.0) internal successors, (25), 25 states have internal predecessors, (25), 68 states have call successors, (68), 1 states have call predecessors, (68), 1 states have return successors, (68), 68 states have call predecessors, (68), 68 states have call successors, (68) [2024-11-08 16:13:34,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 161 transitions. [2024-11-08 16:13:34,161 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 161 transitions. Word has length 362 [2024-11-08 16:13:34,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 16:13:34,161 INFO L471 AbstractCegarLoop]: Abstraction has 95 states and 161 transitions. [2024-11-08 16:13:34,165 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 12.5) internal successors, (25), 2 states have internal predecessors, (25), 2 states have call successors, (68), 1 states have call predecessors, (68), 1 states have return successors, (68), 1 states have call predecessors, (68), 2 states have call successors, (68) [2024-11-08 16:13:34,165 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 161 transitions. [2024-11-08 16:13:34,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 363 [2024-11-08 16:13:34,170 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:13:34,170 INFO L215 NwaCegarLoop]: trace histogram [68, 68, 68, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 16:13:34,171 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-08 16:13:34,171 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 16:13:34,171 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:13:34,171 INFO L85 PathProgramCache]: Analyzing trace with hash 1542672372, now seen corresponding path program 1 times [2024-11-08 16:13:34,172 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 16:13:34,172 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2075665549] [2024-11-08 16:13:34,172 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:13:34,172 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 16:13:34,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 16:13:34,527 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-08 16:13:34,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 16:13:34,920 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-08 16:13:34,921 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-08 16:13:34,922 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-08 16:13:34,923 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-08 16:13:34,926 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1] [2024-11-08 16:13:35,000 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-08 16:13:35,005 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.11 04:13:35 BoogieIcfgContainer [2024-11-08 16:13:35,005 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-08 16:13:35,008 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-08 16:13:35,008 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-08 16:13:35,008 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-08 16:13:35,009 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 04:13:33" (3/4) ... [2024-11-08 16:13:35,010 INFO L136 WitnessPrinter]: Generating witness for reachability counterexample [2024-11-08 16:13:35,106 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-08 16:13:35,108 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-08 16:13:35,109 INFO L158 Benchmark]: Toolchain (without parser) took 2318.66ms. Allocated memory was 153.1MB in the beginning and 216.0MB in the end (delta: 62.9MB). Free memory was 107.2MB in the beginning and 141.4MB in the end (delta: -34.2MB). Peak memory consumption was 29.1MB. Max. memory is 16.1GB. [2024-11-08 16:13:35,109 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 153.1MB. Free memory is still 113.3MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 16:13:35,109 INFO L158 Benchmark]: CACSL2BoogieTranslator took 211.71ms. Allocated memory is still 153.1MB. Free memory was 106.8MB in the beginning and 92.4MB in the end (delta: 14.4MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-08 16:13:35,109 INFO L158 Benchmark]: Boogie Procedure Inliner took 35.98ms. Allocated memory is still 153.1MB. Free memory was 92.4MB in the beginning and 90.0MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-08 16:13:35,109 INFO L158 Benchmark]: Boogie Preprocessor took 26.50ms. Allocated memory is still 153.1MB. Free memory was 90.0MB in the beginning and 88.3MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-08 16:13:35,110 INFO L158 Benchmark]: RCFGBuilder took 360.65ms. Allocated memory is still 153.1MB. Free memory was 88.3MB in the beginning and 69.9MB in the end (delta: 18.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-08 16:13:35,110 INFO L158 Benchmark]: TraceAbstraction took 1572.96ms. Allocated memory was 153.1MB in the beginning and 216.0MB in the end (delta: 62.9MB). Free memory was 69.4MB in the beginning and 151.9MB in the end (delta: -82.4MB). Peak memory consumption was 76.0MB. Max. memory is 16.1GB. [2024-11-08 16:13:35,110 INFO L158 Benchmark]: Witness Printer took 100.01ms. Allocated memory is still 216.0MB. Free memory was 151.9MB in the beginning and 141.4MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-11-08 16:13:35,111 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.18ms. Allocated memory is still 153.1MB. Free memory is still 113.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 211.71ms. Allocated memory is still 153.1MB. Free memory was 106.8MB in the beginning and 92.4MB in the end (delta: 14.4MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 35.98ms. Allocated memory is still 153.1MB. Free memory was 92.4MB in the beginning and 90.0MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 26.50ms. Allocated memory is still 153.1MB. Free memory was 90.0MB in the beginning and 88.3MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 360.65ms. Allocated memory is still 153.1MB. Free memory was 88.3MB in the beginning and 69.9MB in the end (delta: 18.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 1572.96ms. Allocated memory was 153.1MB in the beginning and 216.0MB in the end (delta: 62.9MB). Free memory was 69.4MB in the beginning and 151.9MB in the end (delta: -82.4MB). Peak memory consumption was 76.0MB. Max. memory is 16.1GB. * Witness Printer took 100.01ms. Allocated memory is still 216.0MB. Free memory was 151.9MB in the beginning and 141.4MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. 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: 135]: 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=3] [L30] CALL assume(var0 <= 6) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L30] RET assume(var0 <= 6) VAL [var0=3] [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=3, var1=1] [L34] CALL assume(var1 <= 6) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L34] RET assume(var1 <= 6) VAL [var0=3, 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=3, var1=1, var2=6] [L38] CALL assume(var2 <= 6) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L38] RET assume(var2 <= 6) VAL [var0=3, var1=1, var2=6] [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=3, var1=1, var2=6, var3=0] [L42] CALL assume(var3 <= 6) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L42] RET assume(var3 <= 6) VAL [var0=3, var1=1, var2=6, var3=0] [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=3, var1=1, var2=6, var3=0, var4=4] [L46] CALL assume(var4 <= 6) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L46] RET assume(var4 <= 6) VAL [var0=3, var1=1, var2=6, var3=0, var4=4] [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=3, var1=1, var2=6, var3=0, var4=4, var5=5] [L50] CALL assume(var5 <= 6) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L50] RET assume(var5 <= 6) VAL [var0=3, var1=1, var2=6, var3=0, var4=4, var5=5] [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=3, var1=1, var2=6, var3=0, var4=4, var5=5, var6=2] [L54] CALL assume(var6 <= 6) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L54] RET assume(var6 <= 6) VAL [var0=3, var1=1, var2=6, var3=0, var4=4, var5=5, var6=2] [L55] int var7; [L56] var7 = __VERIFIER_nondet_int() [L57] CALL assume(var7 >= 1) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L57] RET assume(var7 >= 1) VAL [var0=3, var1=1, var2=6, var3=0, var4=4, var5=5, var6=2, var7=2] [L58] CALL assume(var7 <= 6) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L58] RET assume(var7 <= 6) VAL [var0=3, var1=1, var2=6, var3=0, var4=4, var5=5, var6=2, var7=2] [L59] int var8; [L60] var8 = __VERIFIER_nondet_int() [L61] CALL assume(var8 >= 1) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L61] RET assume(var8 >= 1) VAL [var0=3, var1=1, var2=6, var3=0, var4=4, var5=5, var6=2, var7=2, var8=5] [L62] CALL assume(var8 <= 6) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L62] RET assume(var8 <= 6) VAL [var0=3, var1=1, var2=6, var3=0, var4=4, var5=5, var6=2, var7=2, var8=5] [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=3, var1=1, var2=6, var3=0, var4=4, var5=5, var6=2, var7=2, var8=5, var9=6] [L66] CALL assume(var9 <= 6) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L66] RET assume(var9 <= 6) VAL [var0=3, var1=1, var2=6, var3=0, var4=4, var5=5, var6=2, var7=2, var8=5, var9=6] [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=3, var10=4, var1=1, var2=6, var3=0, var4=4, var5=5, var6=2, var7=2, var8=5, var9=6] [L70] CALL assume(var10 <= 6) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L70] RET assume(var10 <= 6) VAL [var0=3, var10=4, var1=1, var2=6, var3=0, var4=4, var5=5, var6=2, var7=2, var8=5, var9=6] [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=3, var10=4, var11=1, var1=1, var2=6, var3=0, var4=4, var5=5, var6=2, var7=2, var8=5, var9=6] [L74] CALL assume(var11 <= 6) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L74] RET assume(var11 <= 6) VAL [var0=3, var10=4, var11=1, var1=1, var2=6, var3=0, var4=4, var5=5, var6=2, var7=2, var8=5, var9=6] [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=3, var10=4, var11=1, var12=3, var1=1, var2=6, var3=0, var4=4, var5=5, var6=2, var7=2, var8=5, var9=6] [L78] CALL assume(var12 <= 6) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L78] RET assume(var12 <= 6) VAL [var0=3, var10=4, var11=1, var12=3, var1=1, var2=6, var3=0, var4=4, var5=5, var6=2, var7=2, var8=5, var9=6] [L79] int myvar0 = 1; VAL [var0=3, var10=4, var11=1, var12=3, var1=1, var2=6, var3=0, var4=4, var5=5, var6=2, var7=2, var8=5, var9=6] [L80] CALL assume(var0 != var1) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L80] RET assume(var0 != var1) VAL [var0=3, var10=4, var11=1, var12=3, var1=1, var2=6, var3=0, var4=4, var5=5, var6=2, var7=2, var8=5, var9=6] [L81] CALL assume(var0 != var2) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L81] RET assume(var0 != var2) VAL [var0=3, var10=4, var11=1, var12=3, var1=1, var2=6, var3=0, var4=4, var5=5, var6=2, var7=2, var8=5, var9=6] [L82] CALL assume(var0 != var3) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L82] RET assume(var0 != var3) VAL [var0=3, var10=4, var11=1, var12=3, var1=1, var2=6, var3=0, var4=4, var5=5, var6=2, var7=2, var8=5, var9=6] [L83] CALL assume(var0 != var4) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L83] RET assume(var0 != var4) VAL [var0=3, var10=4, var11=1, var12=3, var1=1, var2=6, var3=0, var4=4, var5=5, var6=2, var7=2, var8=5, var9=6] [L84] CALL assume(var0 != var5) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L84] RET assume(var0 != var5) VAL [var0=3, var10=4, var11=1, var12=3, var1=1, var2=6, var3=0, var4=4, var5=5, var6=2, var7=2, var8=5, var9=6] [L85] CALL assume(var0 != var6) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L85] RET assume(var0 != var6) VAL [var0=3, var10=4, var11=1, var12=3, var1=1, var2=6, var3=0, var4=4, var5=5, var6=2, var7=2, var8=5, var9=6] [L86] CALL assume(var1 != var2) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L86] RET assume(var1 != var2) VAL [var0=3, var10=4, var11=1, var12=3, var1=1, var2=6, var3=0, var4=4, var5=5, var6=2, var7=2, var8=5, var9=6] [L87] CALL assume(var1 != var3) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L87] RET assume(var1 != var3) VAL [var0=3, var10=4, var11=1, var12=3, var1=1, var2=6, var3=0, var4=4, var5=5, var6=2, var7=2, var8=5, var9=6] [L88] CALL assume(var1 != var4) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L88] RET assume(var1 != var4) VAL [var0=3, var10=4, var11=1, var12=3, var1=1, var2=6, var3=0, var4=4, var5=5, var6=2, var7=2, var8=5, var9=6] [L89] CALL assume(var1 != var5) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L89] RET assume(var1 != var5) VAL [var0=3, var10=4, var11=1, var12=3, var1=1, var2=6, var3=0, var4=4, var5=5, var6=2, var7=2, var8=5, var9=6] [L90] CALL assume(var1 != var6) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L90] RET assume(var1 != var6) VAL [var0=3, var10=4, var11=1, var12=3, var1=1, var2=6, var3=0, var4=4, var5=5, var6=2, var7=2, var8=5, var9=6] [L91] CALL assume(var2 != var3) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L91] RET assume(var2 != var3) VAL [var0=3, var10=4, var11=1, var12=3, var1=1, var2=6, var3=0, var4=4, var5=5, var6=2, var7=2, var8=5, var9=6] [L92] CALL assume(var2 != var4) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L92] RET assume(var2 != var4) VAL [var0=3, var10=4, var11=1, var12=3, var1=1, var2=6, var3=0, var4=4, var5=5, var6=2, var7=2, var8=5, var9=6] [L93] CALL assume(var2 != var5) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L93] RET assume(var2 != var5) VAL [var0=3, var10=4, var11=1, var12=3, var1=1, var2=6, var3=0, var4=4, var5=5, var6=2, var7=2, var8=5, var9=6] [L94] CALL assume(var2 != var6) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L94] RET assume(var2 != var6) VAL [var0=3, var10=4, var11=1, var12=3, var1=1, var2=6, var3=0, var4=4, var5=5, var6=2, var7=2, var8=5, var9=6] [L95] CALL assume(var3 != var4) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L95] RET assume(var3 != var4) VAL [var0=3, var10=4, var11=1, var12=3, var1=1, var2=6, var3=0, var4=4, var5=5, var6=2, var7=2, var8=5, var9=6] [L96] CALL assume(var3 != var5) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L96] RET assume(var3 != var5) VAL [var0=3, var10=4, var11=1, var12=3, var1=1, var2=6, var3=0, var4=4, var5=5, var6=2, var7=2, var8=5, var9=6] [L97] CALL assume(var3 != var6) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L97] RET assume(var3 != var6) VAL [var0=3, var10=4, var11=1, var12=3, var1=1, var2=6, var3=0, var4=4, var5=5, var6=2, var7=2, var8=5, var9=6] [L98] CALL assume(var4 != var5) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L98] RET assume(var4 != var5) VAL [var0=3, var10=4, var11=1, var12=3, var1=1, var2=6, var3=0, var4=4, var5=5, var6=2, var7=2, var8=5, var9=6] [L99] CALL assume(var4 != var6) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L99] RET assume(var4 != var6) VAL [var0=3, var10=4, var11=1, var12=3, var1=1, var2=6, var3=0, var4=4, var5=5, var6=2, var7=2, var8=5, var9=6] [L100] CALL assume(var5 != var6) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L100] RET assume(var5 != var6) VAL [var0=3, var10=4, var11=1, var12=3, var1=1, var2=6, var3=0, var4=4, var5=5, var6=2, var7=2, var8=5, var9=6] [L101] CALL assume(var7 != var8) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L101] RET assume(var7 != var8) VAL [var0=3, var10=4, var11=1, var12=3, var1=1, var2=6, var3=0, var4=4, var5=5, var6=2, var7=2, var8=5, var9=6] [L102] CALL assume(var7 != var9) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L102] RET assume(var7 != var9) VAL [var0=3, var10=4, var11=1, var12=3, var1=1, var2=6, var3=0, var4=4, var5=5, var6=2, var7=2, var8=5, var9=6] [L103] CALL assume(var7 != var10) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L103] RET assume(var7 != var10) VAL [var0=3, var10=4, var11=1, var12=3, var1=1, var2=6, var3=0, var4=4, var5=5, var6=2, var7=2, var8=5, var9=6] [L104] CALL assume(var7 != var11) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L104] RET assume(var7 != var11) VAL [var0=3, var10=4, var11=1, var12=3, var1=1, var2=6, var3=0, var4=4, var5=5, var6=2, var7=2, var8=5, var9=6] [L105] CALL assume(var7 != var12) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L105] RET assume(var7 != var12) VAL [var0=3, var10=4, var11=1, var12=3, var1=1, var2=6, var3=0, var4=4, var5=5, var6=2, var7=2, var8=5, var9=6] [L106] CALL assume(var8 != var9) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L106] RET assume(var8 != var9) VAL [var0=3, var10=4, var11=1, var12=3, var1=1, var2=6, var3=0, var4=4, var5=5, var6=2, var7=2, var8=5, var9=6] [L107] CALL assume(var8 != var10) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L107] RET assume(var8 != var10) VAL [var0=3, var10=4, var11=1, var12=3, var1=1, var2=6, var3=0, var4=4, var5=5, var6=2, var7=2, var8=5, var9=6] [L108] CALL assume(var8 != var11) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L108] RET assume(var8 != var11) VAL [var0=3, var10=4, var11=1, var12=3, var1=1, var2=6, var3=0, var4=4, var5=5, var6=2, var7=2, var8=5, var9=6] [L109] CALL assume(var8 != var12) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L109] RET assume(var8 != var12) VAL [var0=3, var10=4, var11=1, var12=3, var1=1, var2=6, var3=0, var4=4, var5=5, var6=2, var7=2, var8=5, var9=6] [L110] CALL assume(var9 != var10) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L110] RET assume(var9 != var10) VAL [var0=3, var10=4, var11=1, var12=3, var1=1, var2=6, var3=0, var4=4, var5=5, var6=2, var7=2, var8=5, var9=6] [L111] CALL assume(var9 != var11) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L111] RET assume(var9 != var11) VAL [var0=3, var10=4, var11=1, var12=3, var1=1, var2=6, var3=0, var4=4, var5=5, var6=2, var7=2, var8=5, var9=6] [L112] CALL assume(var9 != var12) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L112] RET assume(var9 != var12) VAL [var0=3, var10=4, var11=1, var12=3, var1=1, var2=6, var3=0, var4=4, var5=5, var6=2, var7=2, var8=5, var9=6] [L113] CALL assume(var10 != var11) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L113] RET assume(var10 != var11) VAL [var0=3, var10=4, var11=1, var12=3, var1=1, var2=6, var3=0, var4=4, var5=5, var6=2, var7=2, var8=5, var9=6] [L114] CALL assume(var10 != var12) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L114] RET assume(var10 != var12) VAL [var0=3, var10=4, var11=1, var12=3, var1=1, var2=6, var3=0, var4=4, var5=5, var6=2, var7=2, var8=5, var9=6] [L115] CALL assume(var11 != var12) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L115] RET assume(var11 != var12) VAL [var0=3, var10=4, var11=1, var12=3, var1=1, var2=6, var3=0, var4=4, var5=5, var6=2, var7=2, var8=5, var9=6] [L116] int var_for_abs; [L117] var_for_abs = var0 - var1 [L118] var_for_abs = (var_for_abs >= 0) ? var_for_abs : var_for_abs * (-1) VAL [var10=4, var11=1, var12=3, var1=1, var2=6, var3=0, var4=4, var5=5, var6=2, var7=2, var8=5, var9=6, var_for_abs=2] [L119] CALL assume(var7 == var_for_abs) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L119] RET assume(var7 == var_for_abs) VAL [var10=4, var11=1, var12=3, var1=1, var2=6, var3=0, var4=4, var5=5, var6=2, var7=2, var8=5, var9=6, var_for_abs=2] [L120] var_for_abs = var1 - var2 [L121] var_for_abs = (var_for_abs >= 0) ? var_for_abs : var_for_abs * (-1) VAL [var10=4, var11=1, var12=3, var2=6, var3=0, var4=4, var5=5, var6=2, var7=2, var8=5, var9=6, var_for_abs=5] [L122] CALL assume(var8 == var_for_abs) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L122] RET assume(var8 == var_for_abs) VAL [var10=4, var11=1, var12=3, var2=6, var3=0, var4=4, var5=5, var6=2, var7=2, var8=5, var9=6, var_for_abs=5] [L123] var_for_abs = var2 - var3 [L124] var_for_abs = (var_for_abs >= 0) ? var_for_abs : var_for_abs * (-1) VAL [var10=4, var11=1, var12=3, var3=0, var4=4, var5=5, var6=2, var7=2, var8=5, var9=6, var_for_abs=6] [L125] CALL assume(var9 == var_for_abs) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L125] RET assume(var9 == var_for_abs) VAL [var10=4, var11=1, var12=3, var3=0, var4=4, var5=5, var6=2, var7=2, var8=5, var9=6, var_for_abs=6] [L126] var_for_abs = var3 - var4 [L127] var_for_abs = (var_for_abs >= 0) ? var_for_abs : var_for_abs * (-1) VAL [var10=4, var11=1, var12=3, var4=4, var5=5, var6=2, var7=2, var8=5, var9=6, var_for_abs=4] [L128] CALL assume(var10 == var_for_abs) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L128] RET assume(var10 == var_for_abs) VAL [var10=4, var11=1, var12=3, var4=4, var5=5, var6=2, var7=2, var8=5, var9=6, var_for_abs=4] [L129] var_for_abs = var4 - var5 [L130] var_for_abs = (var_for_abs >= 0) ? var_for_abs : var_for_abs * (-1) VAL [var10=4, var11=1, var12=3, var5=5, var6=2, var7=2, var8=5, var9=6, var_for_abs=1] [L131] CALL assume(var11 == var_for_abs) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L131] RET assume(var11 == var_for_abs) VAL [var10=4, var11=1, var12=3, var5=5, var6=2, var7=2, var8=5, var9=6, var_for_abs=1] [L132] var_for_abs = var5 - var6 [L133] var_for_abs = (var_for_abs >= 0) ? var_for_abs : var_for_abs * (-1) VAL [var10=4, var11=1, var12=3, var7=2, var8=5, var9=6, var_for_abs=3] [L134] CALL assume(var12 == var_for_abs) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L134] RET assume(var12 == var_for_abs) VAL [var10=4, var11=1, var12=3, var7=2, var8=5, var9=6, var_for_abs=3] [L135] reach_error() VAL [var10=4, var11=1, var12=3, var7=2, var8=5, var9=6, var_for_abs=3] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 98 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.4s, OverallIterations: 2, TraceHistogramMax: 68, 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, 161 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, 161 mSDtfsCounter, 0 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 206 GetRequests, 206 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=98occurred 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.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 0.3s InterpolantComputationTime, 724 NumberOfCodeBlocks, 724 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 361 ConstructedInterpolants, 0 QuantifiedInterpolants, 361 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 9112/9112 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 RESULT: Ultimate proved your program to be incorrect! [2024-11-08 16:13:35,139 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE