./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-63.i --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/hardness-nfm22/hardness_operatoramount_amount10_file-63.i -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 886b3232bc42df15ec2cb488216aa307e0317bc0a29df06284f7e19764141f20 --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-09 00:34:13,127 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 00:34:13,189 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-09 00:34:13,195 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 00:34:13,201 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 00:34:13,214 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 00:34:13,215 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 00:34:13,215 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 00:34:13,216 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 00:34:13,216 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 00:34:13,216 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 00:34:13,216 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 00:34:13,217 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 00:34:13,217 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 00:34:13,217 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 00:34:13,218 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 00:34:13,218 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-09 00:34:13,218 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 00:34:13,219 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 00:34:13,219 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 00:34:13,219 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 00:34:13,220 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-09 00:34:13,222 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 00:34:13,223 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-09 00:34:13,223 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 00:34:13,223 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 00:34:13,223 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-09 00:34:13,223 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 00:34:13,223 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 00:34:13,224 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 00:34:13,224 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 00:34:13,224 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 00:34:13,224 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 00:34:13,224 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 00:34:13,224 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 00:34:13,225 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-09 00:34:13,225 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-09 00:34:13,225 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-09 00:34:13,225 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 00:34:13,225 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 00:34:13,225 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 00:34:13,227 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 00:34:13,227 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 -> 886b3232bc42df15ec2cb488216aa307e0317bc0a29df06284f7e19764141f20 [2024-11-09 00:34:13,430 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 00:34:13,450 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 00:34:13,452 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 00:34:13,453 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 00:34:13,453 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 00:34:13,454 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-63.i [2024-11-09 00:34:14,727 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 00:34:14,894 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 00:34:14,894 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-63.i [2024-11-09 00:34:14,901 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e3b7a6cb4/bbaedbd446d84653b5eb55c1d4d9e319/FLAG4a13f0384 [2024-11-09 00:34:14,916 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e3b7a6cb4/bbaedbd446d84653b5eb55c1d4d9e319 [2024-11-09 00:34:14,918 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 00:34:14,920 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 00:34:14,921 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 00:34:14,922 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 00:34:14,927 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 00:34:14,927 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 12:34:14" (1/1) ... [2024-11-09 00:34:14,928 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4967ab40 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:34:14, skipping insertion in model container [2024-11-09 00:34:14,928 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 12:34:14" (1/1) ... [2024-11-09 00:34:14,950 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 00:34:15,079 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/hardness-nfm22/hardness_operatoramount_amount10_file-63.i[915,928] [2024-11-09 00:34:15,100 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 00:34:15,107 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 00:34:15,116 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/hardness-nfm22/hardness_operatoramount_amount10_file-63.i[915,928] [2024-11-09 00:34:15,123 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 00:34:15,138 INFO L204 MainTranslator]: Completed translation [2024-11-09 00:34:15,138 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:34:15 WrapperNode [2024-11-09 00:34:15,138 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 00:34:15,139 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 00:34:15,139 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 00:34:15,140 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 00:34:15,145 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:34:15" (1/1) ... [2024-11-09 00:34:15,150 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:34:15" (1/1) ... [2024-11-09 00:34:15,165 INFO L138 Inliner]: procedures = 26, calls = 21, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 72 [2024-11-09 00:34:15,165 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 00:34:15,166 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 00:34:15,166 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 00:34:15,166 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 00:34:15,174 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:34:15" (1/1) ... [2024-11-09 00:34:15,174 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:34:15" (1/1) ... [2024-11-09 00:34:15,176 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:34:15" (1/1) ... [2024-11-09 00:34:15,188 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-09 00:34:15,188 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:34:15" (1/1) ... [2024-11-09 00:34:15,188 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:34:15" (1/1) ... [2024-11-09 00:34:15,192 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:34:15" (1/1) ... [2024-11-09 00:34:15,194 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:34:15" (1/1) ... [2024-11-09 00:34:15,195 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:34:15" (1/1) ... [2024-11-09 00:34:15,195 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:34:15" (1/1) ... [2024-11-09 00:34:15,197 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 00:34:15,197 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 00:34:15,197 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 00:34:15,198 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 00:34:15,198 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:34:15" (1/1) ... [2024-11-09 00:34:15,203 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 00:34:15,214 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 00:34:15,229 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-09 00:34:15,231 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-09 00:34:15,308 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 00:34:15,308 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-09 00:34:15,308 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-09 00:34:15,308 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-09 00:34:15,309 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 00:34:15,309 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 00:34:15,360 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 00:34:15,362 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 00:34:15,496 INFO L? ?]: Removed 10 outVars from TransFormulas that were not future-live. [2024-11-09 00:34:15,496 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 00:34:15,507 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 00:34:15,511 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-09 00:34:15,511 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 12:34:15 BoogieIcfgContainer [2024-11-09 00:34:15,512 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 00:34:15,513 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 00:34:15,513 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 00:34:15,518 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 00:34:15,519 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 12:34:14" (1/3) ... [2024-11-09 00:34:15,519 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@46f7d389 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 12:34:15, skipping insertion in model container [2024-11-09 00:34:15,519 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:34:15" (2/3) ... [2024-11-09 00:34:15,520 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@46f7d389 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 12:34:15, skipping insertion in model container [2024-11-09 00:34:15,520 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 12:34:15" (3/3) ... [2024-11-09 00:34:15,520 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount10_file-63.i [2024-11-09 00:34:15,542 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 00:34:15,546 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-09 00:34:15,591 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 00:34:15,597 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;@4f8ecb58, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 00:34:15,600 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-09 00:34:15,605 INFO L276 IsEmpty]: Start isEmpty. Operand has 33 states, 22 states have (on average 1.2727272727272727) internal successors, (28), 23 states have internal predecessors, (28), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-09 00:34:15,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2024-11-09 00:34:15,612 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 00:34:15,613 INFO L215 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 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-09 00:34:15,614 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 00:34:15,619 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 00:34:15,619 INFO L85 PathProgramCache]: Analyzing trace with hash 8485279, now seen corresponding path program 1 times [2024-11-09 00:34:15,626 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 00:34:15,627 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [436939613] [2024-11-09 00:34:15,627 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 00:34:15,627 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:34:15,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:34:15,803 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 00:34:15,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:34:15,811 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-09 00:34:15,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:34:15,822 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-09 00:34:15,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:34:15,828 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-09 00:34:15,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:34:15,835 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-09 00:34:15,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:34:15,843 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-09 00:34:15,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:34:15,853 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-09 00:34:15,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:34:15,862 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-09 00:34:15,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:34:15,867 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2024-11-09 00:34:15,868 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 00:34:15,868 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [436939613] [2024-11-09 00:34:15,869 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [436939613] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 00:34:15,869 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 00:34:15,869 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 00:34:15,870 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [783612074] [2024-11-09 00:34:15,871 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 00:34:15,874 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-09 00:34:15,874 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 00:34:15,890 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-09 00:34:15,891 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-09 00:34:15,893 INFO L87 Difference]: Start difference. First operand has 33 states, 22 states have (on average 1.2727272727272727) internal successors, (28), 23 states have internal predecessors, (28), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand has 2 states, 2 states have (on average 9.0) internal successors, (18), 2 states have internal predecessors, (18), 2 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 2 states have call successors, (8) [2024-11-09 00:34:15,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 00:34:15,912 INFO L93 Difference]: Finished difference Result 59 states and 90 transitions. [2024-11-09 00:34:15,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-09 00:34:15,913 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 9.0) internal successors, (18), 2 states have internal predecessors, (18), 2 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 2 states have call successors, (8) Word has length 55 [2024-11-09 00:34:15,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 00:34:15,918 INFO L225 Difference]: With dead ends: 59 [2024-11-09 00:34:15,918 INFO L226 Difference]: Without dead ends: 29 [2024-11-09 00:34:15,920 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 26 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-09 00:34:15,922 INFO L432 NwaCegarLoop]: 37 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, 37 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-09 00:34:15,923 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 00:34:15,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2024-11-09 00:34:15,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2024-11-09 00:34:15,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 19 states have (on average 1.105263157894737) internal successors, (21), 19 states have internal predecessors, (21), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-09 00:34:15,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 37 transitions. [2024-11-09 00:34:15,951 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 37 transitions. Word has length 55 [2024-11-09 00:34:15,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 00:34:15,952 INFO L471 AbstractCegarLoop]: Abstraction has 29 states and 37 transitions. [2024-11-09 00:34:15,952 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 9.0) internal successors, (18), 2 states have internal predecessors, (18), 2 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 2 states have call successors, (8) [2024-11-09 00:34:15,952 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 37 transitions. [2024-11-09 00:34:15,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2024-11-09 00:34:15,954 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 00:34:15,954 INFO L215 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 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-09 00:34:15,954 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-09 00:34:15,954 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 00:34:15,955 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 00:34:15,955 INFO L85 PathProgramCache]: Analyzing trace with hash 1869481315, now seen corresponding path program 1 times [2024-11-09 00:34:15,955 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 00:34:15,956 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [172674087] [2024-11-09 00:34:15,956 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 00:34:15,956 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:34:16,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 00:34:16,049 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 00:34:16,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 00:34:16,140 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 00:34:16,140 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-09 00:34:16,141 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-09 00:34:16,143 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-09 00:34:16,147 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1] [2024-11-09 00:34:16,200 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-09 00:34:16,202 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.11 12:34:16 BoogieIcfgContainer [2024-11-09 00:34:16,203 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-09 00:34:16,203 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-09 00:34:16,203 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-09 00:34:16,203 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-09 00:34:16,207 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 12:34:15" (3/4) ... [2024-11-09 00:34:16,209 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-09 00:34:16,210 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-09 00:34:16,210 INFO L158 Benchmark]: Toolchain (without parser) took 1290.27ms. Allocated memory is still 176.2MB. Free memory was 105.6MB in the beginning and 95.6MB in the end (delta: 10.1MB). Peak memory consumption was 9.2MB. Max. memory is 16.1GB. [2024-11-09 00:34:16,210 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 176.2MB. Free memory was 131.1MB in the beginning and 130.9MB in the end (delta: 160.7kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 00:34:16,211 INFO L158 Benchmark]: CACSL2BoogieTranslator took 217.96ms. Allocated memory is still 176.2MB. Free memory was 105.3MB in the beginning and 92.3MB in the end (delta: 13.0MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-09 00:34:16,211 INFO L158 Benchmark]: Boogie Procedure Inliner took 25.96ms. Allocated memory is still 176.2MB. Free memory was 92.3MB in the beginning and 90.7MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-09 00:34:16,215 INFO L158 Benchmark]: Boogie Preprocessor took 31.05ms. Allocated memory is still 176.2MB. Free memory was 90.7MB in the beginning and 88.8MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-09 00:34:16,216 INFO L158 Benchmark]: RCFGBuilder took 314.23ms. Allocated memory is still 176.2MB. Free memory was 88.7MB in the beginning and 137.5MB in the end (delta: -48.9MB). Peak memory consumption was 7.1MB. Max. memory is 16.1GB. [2024-11-09 00:34:16,216 INFO L158 Benchmark]: TraceAbstraction took 689.50ms. Allocated memory is still 176.2MB. Free memory was 136.7MB in the beginning and 95.6MB in the end (delta: 41.2MB). Peak memory consumption was 39.8MB. Max. memory is 16.1GB. [2024-11-09 00:34:16,216 INFO L158 Benchmark]: Witness Printer took 6.69ms. Allocated memory is still 176.2MB. Free memory is still 95.6MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 00:34:16,217 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.16ms. Allocated memory is still 176.2MB. Free memory was 131.1MB in the beginning and 130.9MB in the end (delta: 160.7kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 217.96ms. Allocated memory is still 176.2MB. Free memory was 105.3MB in the beginning and 92.3MB in the end (delta: 13.0MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 25.96ms. Allocated memory is still 176.2MB. Free memory was 92.3MB in the beginning and 90.7MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 31.05ms. Allocated memory is still 176.2MB. Free memory was 90.7MB in the beginning and 88.8MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 314.23ms. Allocated memory is still 176.2MB. Free memory was 88.7MB in the beginning and 137.5MB in the end (delta: -48.9MB). Peak memory consumption was 7.1MB. Max. memory is 16.1GB. * TraceAbstraction took 689.50ms. Allocated memory is still 176.2MB. Free memory was 136.7MB in the beginning and 95.6MB in the end (delta: 41.2MB). Peak memory consumption was 39.8MB. Max. memory is 16.1GB. * Witness Printer took 6.69ms. Allocated memory is still 176.2MB. Free memory is still 95.6MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 58, overapproximation of someBinaryArithmeticDOUBLEoperation at line 35. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] double var_1_1 = 2.2; [L23] signed long int var_1_2 = 32; [L24] signed long int var_1_3 = 5; [L25] signed long int var_1_4 = 5; [L26] double var_1_6 = 63.2; [L27] double var_1_7 = 25.2; [L28] unsigned long int var_1_8 = 128; VAL [isInitial=0, var_1_1=11/5, var_1_2=32, var_1_3=5, var_1_4=5, var_1_6=316/5, var_1_7=126/5, var_1_8=128] [L62] isInitial = 1 [L63] FCALL initially() [L64] COND TRUE 1 [L65] FCALL updateLastVariables() [L66] CALL updateVariables() [L41] var_1_2 = __VERIFIER_nondet_long() [L42] CALL assume_abort_if_not(var_1_2 >= -1) VAL [\old(cond)=1, isInitial=1, var_1_1=11/5, var_1_2=-1, var_1_3=5, var_1_4=5, var_1_6=316/5, var_1_7=126/5, var_1_8=128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=11/5, var_1_2=-1, var_1_3=5, var_1_4=5, var_1_6=316/5, var_1_7=126/5, var_1_8=128] [L42] RET assume_abort_if_not(var_1_2 >= -1) VAL [isInitial=1, var_1_1=11/5, var_1_2=-1, var_1_3=5, var_1_4=5, var_1_6=316/5, var_1_7=126/5, var_1_8=128] [L43] CALL assume_abort_if_not(var_1_2 <= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_1=11/5, var_1_2=-1, var_1_3=5, var_1_4=5, var_1_6=316/5, var_1_7=126/5, var_1_8=128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=11/5, var_1_2=-1, var_1_3=5, var_1_4=5, var_1_6=316/5, var_1_7=126/5, var_1_8=128] [L43] RET assume_abort_if_not(var_1_2 <= 2147483647) VAL [isInitial=1, var_1_1=11/5, var_1_2=-1, var_1_3=5, var_1_4=5, var_1_6=316/5, var_1_7=126/5, var_1_8=128] [L44] var_1_3 = __VERIFIER_nondet_long() [L45] CALL assume_abort_if_not(var_1_3 >= -1) VAL [\old(cond)=1, isInitial=1, var_1_1=11/5, var_1_2=-1, var_1_3=-1, var_1_4=5, var_1_6=316/5, var_1_7=126/5, var_1_8=128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=11/5, var_1_2=-1, var_1_3=-1, var_1_4=5, var_1_6=316/5, var_1_7=126/5, var_1_8=128] [L45] RET assume_abort_if_not(var_1_3 >= -1) VAL [isInitial=1, var_1_1=11/5, var_1_2=-1, var_1_3=-1, var_1_4=5, var_1_6=316/5, var_1_7=126/5, var_1_8=128] [L46] CALL assume_abort_if_not(var_1_3 <= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_1=11/5, var_1_2=-1, var_1_3=-1, var_1_4=5, var_1_6=316/5, var_1_7=126/5, var_1_8=128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=11/5, var_1_2=-1, var_1_3=-1, var_1_4=5, var_1_6=316/5, var_1_7=126/5, var_1_8=128] [L46] RET assume_abort_if_not(var_1_3 <= 2147483647) VAL [isInitial=1, var_1_1=11/5, var_1_2=-1, var_1_3=-1, var_1_4=5, var_1_6=316/5, var_1_7=126/5, var_1_8=128] [L47] var_1_4 = __VERIFIER_nondet_long() [L48] CALL assume_abort_if_not(var_1_4 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_1=11/5, var_1_2=-1, var_1_3=-1, var_1_4=2147483647, var_1_6=316/5, var_1_7=126/5, var_1_8=128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=11/5, var_1_2=-1, var_1_3=-1, var_1_4=2147483647, var_1_6=316/5, var_1_7=126/5, var_1_8=128] [L48] RET assume_abort_if_not(var_1_4 >= 0) VAL [isInitial=1, var_1_1=11/5, var_1_2=-1, var_1_3=-1, var_1_4=2147483647, var_1_6=316/5, var_1_7=126/5, var_1_8=128] [L49] CALL assume_abort_if_not(var_1_4 <= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_1=11/5, var_1_2=-1, var_1_3=-1, var_1_4=2147483647, var_1_6=316/5, var_1_7=126/5, var_1_8=128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=11/5, var_1_2=-1, var_1_3=-1, var_1_4=2147483647, var_1_6=316/5, var_1_7=126/5, var_1_8=128] [L49] RET assume_abort_if_not(var_1_4 <= 2147483647) VAL [isInitial=1, var_1_1=11/5, var_1_2=-1, var_1_3=-1, var_1_4=2147483647, var_1_6=316/5, var_1_7=126/5, var_1_8=128] [L50] var_1_6 = __VERIFIER_nondet_double() [L51] CALL assume_abort_if_not((var_1_6 >= 0.0F && var_1_6 <= -1.0e-20F) || (var_1_6 <= 9223372.036854765600e+12F && var_1_6 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_1=11/5, var_1_2=-1, var_1_3=-1, var_1_4=2147483647, var_1_7=126/5, var_1_8=128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=11/5, var_1_2=-1, var_1_3=-1, var_1_4=2147483647, var_1_7=126/5, var_1_8=128] [L51] RET assume_abort_if_not((var_1_6 >= 0.0F && var_1_6 <= -1.0e-20F) || (var_1_6 <= 9223372.036854765600e+12F && var_1_6 >= 1.0e-20F )) VAL [isInitial=1, var_1_1=11/5, var_1_2=-1, var_1_3=-1, var_1_4=2147483647, var_1_7=126/5, var_1_8=128] [L52] var_1_7 = __VERIFIER_nondet_double() [L53] CALL assume_abort_if_not((var_1_7 >= 0.0F && var_1_7 <= -1.0e-20F) || (var_1_7 <= 9223372.036854765600e+12F && var_1_7 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_1=11/5, var_1_2=-1, var_1_3=-1, var_1_4=2147483647, var_1_8=128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=11/5, var_1_2=-1, var_1_3=-1, var_1_4=2147483647, var_1_8=128] [L53] RET assume_abort_if_not((var_1_7 >= 0.0F && var_1_7 <= -1.0e-20F) || (var_1_7 <= 9223372.036854765600e+12F && var_1_7 >= 1.0e-20F )) VAL [isInitial=1, var_1_1=11/5, var_1_2=-1, var_1_3=-1, var_1_4=2147483647, var_1_8=128] [L66] RET updateVariables() [L67] CALL step() [L32] var_1_8 = var_1_4 [L33] signed long int stepLocal_0 = ((((var_1_2) > (var_1_3)) ? (var_1_2) : (var_1_3))) - var_1_4; VAL [isInitial=1, stepLocal_0=-2147483648, var_1_1=11/5, var_1_2=-1, var_1_3=-1, var_1_4=2147483647, var_1_8=2147483647] [L34] COND TRUE stepLocal_0 >= var_1_8 [L35] var_1_1 = (((((var_1_6 - var_1_7) < 0 ) ? -(var_1_6 - var_1_7) : (var_1_6 - var_1_7))) - 0.8) VAL [isInitial=1, var_1_2=-1, var_1_3=-1, var_1_4=2147483647, var_1_8=2147483647] [L67] RET step() [L68] CALL, EXPR property() [L58-L59] return (((((((var_1_2) > (var_1_3)) ? (var_1_2) : (var_1_3))) - var_1_4) >= var_1_8) ? (var_1_1 == ((double) (((((var_1_6 - var_1_7) < 0 ) ? -(var_1_6 - var_1_7) : (var_1_6 - var_1_7))) - 0.8))) : (var_1_1 == ((double) var_1_7))) && (var_1_8 == ((unsigned long int) var_1_4)) ; VAL [\result=0, isInitial=1, var_1_2=-1, var_1_3=-1, var_1_4=2147483647, var_1_8=2147483647] [L68] RET, EXPR property() [L68] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, var_1_2=-1, var_1_3=-1, var_1_4=2147483647, var_1_8=2147483647] [L19] reach_error() VAL [isInitial=1, var_1_2=-1, var_1_3=-1, var_1_4=2147483647, var_1_8=2147483647] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 33 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 0.6s, OverallIterations: 2, TraceHistogramMax: 8, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 0 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 0 mSDsluCounter, 37 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, 37 mSDtfsCounter, 0 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 26 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=33occurred 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.1s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 110 NumberOfCodeBlocks, 110 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 54 ConstructedInterpolants, 0 QuantifiedInterpolants, 54 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 112/112 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 could not prove your program: unable to determine feasibility of some traces [2024-11-09 00:34:16,246 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 Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### 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/hardness-nfm22/hardness_operatoramount_amount10_file-63.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.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 886b3232bc42df15ec2cb488216aa307e0317bc0a29df06284f7e19764141f20 --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-09 00:34:18,948 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 00:34:19,043 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-09 00:34:19,047 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 00:34:19,047 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 00:34:19,090 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 00:34:19,091 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 00:34:19,091 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 00:34:19,091 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 00:34:19,091 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 00:34:19,092 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 00:34:19,092 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 00:34:19,092 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 00:34:19,093 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 00:34:19,093 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 00:34:19,097 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 00:34:19,097 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-09 00:34:19,097 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 00:34:19,097 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 00:34:19,098 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 00:34:19,098 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-09 00:34:19,102 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 00:34:19,103 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-09 00:34:19,103 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-09 00:34:19,103 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-09 00:34:19,103 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 00:34:19,103 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-09 00:34:19,103 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 00:34:19,104 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-09 00:34:19,104 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 00:34:19,104 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 00:34:19,104 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 00:34:19,104 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 00:34:19,104 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 00:34:19,105 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 00:34:19,105 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 00:34:19,115 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 00:34:19,115 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-09 00:34:19,115 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-09 00:34:19,116 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-09 00:34:19,116 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 00:34:19,119 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 00:34:19,119 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 00:34:19,120 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 00:34:19,120 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 -> 886b3232bc42df15ec2cb488216aa307e0317bc0a29df06284f7e19764141f20 [2024-11-09 00:34:19,535 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 00:34:19,572 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 00:34:19,574 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 00:34:19,575 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 00:34:19,579 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 00:34:19,580 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-63.i [2024-11-09 00:34:21,069 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 00:34:21,234 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 00:34:21,234 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-63.i [2024-11-09 00:34:21,241 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4ee1fa8e9/71cf195de9a74256bc24a5b4a7fae46e/FLAG2c5721429 [2024-11-09 00:34:21,254 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4ee1fa8e9/71cf195de9a74256bc24a5b4a7fae46e [2024-11-09 00:34:21,256 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 00:34:21,257 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 00:34:21,259 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 00:34:21,259 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 00:34:21,272 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 00:34:21,272 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 12:34:21" (1/1) ... [2024-11-09 00:34:21,275 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@336b8f0a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:34:21, skipping insertion in model container [2024-11-09 00:34:21,275 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 12:34:21" (1/1) ... [2024-11-09 00:34:21,291 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 00:34:21,420 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/hardness-nfm22/hardness_operatoramount_amount10_file-63.i[915,928] [2024-11-09 00:34:21,445 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 00:34:21,456 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 00:34:21,467 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/hardness-nfm22/hardness_operatoramount_amount10_file-63.i[915,928] [2024-11-09 00:34:21,477 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 00:34:21,494 INFO L204 MainTranslator]: Completed translation [2024-11-09 00:34:21,494 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:34:21 WrapperNode [2024-11-09 00:34:21,494 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 00:34:21,495 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 00:34:21,495 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 00:34:21,495 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 00:34:21,500 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:34:21" (1/1) ... [2024-11-09 00:34:21,508 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:34:21" (1/1) ... [2024-11-09 00:34:21,523 INFO L138 Inliner]: procedures = 27, calls = 21, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 69 [2024-11-09 00:34:21,523 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 00:34:21,523 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 00:34:21,523 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 00:34:21,523 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 00:34:21,532 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:34:21" (1/1) ... [2024-11-09 00:34:21,532 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:34:21" (1/1) ... [2024-11-09 00:34:21,535 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:34:21" (1/1) ... [2024-11-09 00:34:21,550 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-09 00:34:21,550 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:34:21" (1/1) ... [2024-11-09 00:34:21,550 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:34:21" (1/1) ... [2024-11-09 00:34:21,555 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:34:21" (1/1) ... [2024-11-09 00:34:21,560 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:34:21" (1/1) ... [2024-11-09 00:34:21,561 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:34:21" (1/1) ... [2024-11-09 00:34:21,562 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:34:21" (1/1) ... [2024-11-09 00:34:21,567 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 00:34:21,568 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 00:34:21,568 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 00:34:21,568 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 00:34:21,569 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:34:21" (1/1) ... [2024-11-09 00:34:21,576 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 00:34:21,584 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 00:34:21,596 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-09 00:34:21,598 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-09 00:34:21,628 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 00:34:21,628 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-09 00:34:21,628 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-09 00:34:21,636 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-09 00:34:21,637 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 00:34:21,637 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 00:34:21,691 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 00:34:21,692 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 00:34:22,664 INFO L? ?]: Removed 10 outVars from TransFormulas that were not future-live. [2024-11-09 00:34:22,666 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 00:34:22,674 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 00:34:22,676 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-09 00:34:22,676 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 12:34:22 BoogieIcfgContainer [2024-11-09 00:34:22,676 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 00:34:22,678 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 00:34:22,678 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 00:34:22,680 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 00:34:22,681 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 12:34:21" (1/3) ... [2024-11-09 00:34:22,681 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@71c4ad27 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 12:34:22, skipping insertion in model container [2024-11-09 00:34:22,682 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:34:21" (2/3) ... [2024-11-09 00:34:22,682 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@71c4ad27 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 12:34:22, skipping insertion in model container [2024-11-09 00:34:22,682 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 12:34:22" (3/3) ... [2024-11-09 00:34:22,683 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount10_file-63.i [2024-11-09 00:34:22,695 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 00:34:22,695 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-09 00:34:22,740 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 00:34:22,747 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;@165f9421, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 00:34:22,751 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-09 00:34:22,757 INFO L276 IsEmpty]: Start isEmpty. Operand has 33 states, 22 states have (on average 1.2727272727272727) internal successors, (28), 23 states have internal predecessors, (28), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-09 00:34:22,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2024-11-09 00:34:22,767 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 00:34:22,767 INFO L215 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 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-09 00:34:22,768 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 00:34:22,775 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 00:34:22,775 INFO L85 PathProgramCache]: Analyzing trace with hash 8485279, now seen corresponding path program 1 times [2024-11-09 00:34:22,791 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 00:34:22,791 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [187773408] [2024-11-09 00:34:22,792 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 00:34:22,792 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 00:34:22,792 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 00:34:22,798 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 00:34:22,799 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-09 00:34:22,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:34:22,979 INFO L255 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-09 00:34:22,985 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 00:34:23,008 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 54 proven. 0 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2024-11-09 00:34:23,009 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 00:34:23,009 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 00:34:23,009 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [187773408] [2024-11-09 00:34:23,010 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [187773408] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 00:34:23,010 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 00:34:23,010 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 00:34:23,012 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [933170725] [2024-11-09 00:34:23,014 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 00:34:23,018 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-09 00:34:23,018 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 00:34:23,034 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-09 00:34:23,035 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-09 00:34:23,036 INFO L87 Difference]: Start difference. First operand has 33 states, 22 states have (on average 1.2727272727272727) internal successors, (28), 23 states have internal predecessors, (28), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand has 2 states, 2 states have (on average 11.0) internal successors, (22), 2 states have internal predecessors, (22), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-11-09 00:34:23,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 00:34:23,053 INFO L93 Difference]: Finished difference Result 59 states and 90 transitions. [2024-11-09 00:34:23,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-09 00:34:23,055 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 11.0) internal successors, (22), 2 states have internal predecessors, (22), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 55 [2024-11-09 00:34:23,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 00:34:23,060 INFO L225 Difference]: With dead ends: 59 [2024-11-09 00:34:23,060 INFO L226 Difference]: Without dead ends: 29 [2024-11-09 00:34:23,063 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 54 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-09 00:34:23,066 INFO L432 NwaCegarLoop]: 37 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, 37 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-09 00:34:23,067 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 00:34:23,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2024-11-09 00:34:23,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2024-11-09 00:34:23,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 19 states have (on average 1.105263157894737) internal successors, (21), 19 states have internal predecessors, (21), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-09 00:34:23,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 37 transitions. [2024-11-09 00:34:23,096 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 37 transitions. Word has length 55 [2024-11-09 00:34:23,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 00:34:23,096 INFO L471 AbstractCegarLoop]: Abstraction has 29 states and 37 transitions. [2024-11-09 00:34:23,096 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 11.0) internal successors, (22), 2 states have internal predecessors, (22), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-11-09 00:34:23,097 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 37 transitions. [2024-11-09 00:34:23,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2024-11-09 00:34:23,098 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 00:34:23,098 INFO L215 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 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-09 00:34:23,107 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-09 00:34:23,299 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 00:34:23,299 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 00:34:23,300 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 00:34:23,300 INFO L85 PathProgramCache]: Analyzing trace with hash 1869481315, now seen corresponding path program 1 times [2024-11-09 00:34:23,300 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 00:34:23,301 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1864417370] [2024-11-09 00:34:23,306 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 00:34:23,306 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 00:34:23,306 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 00:34:23,312 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 00:34:23,326 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-09 00:34:23,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:34:23,569 INFO L255 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 19 conjuncts are in the unsatisfiable core [2024-11-09 00:34:23,580 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 00:35:01,914 WARN L286 SmtUtils]: Spent 15.77s on a formula simplification that was a NOOP. DAG size: 48 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-09 00:35:40,146 WARN L286 SmtUtils]: Spent 5.33s on a formula simplification. DAG size of input: 9 DAG size of output: 1 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-09 00:35:55,873 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 80 proven. 3 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2024-11-09 00:35:55,873 INFO L311 TraceCheckSpWp]: Computing backward predicates...