./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-20.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_loopvsstraightlinecode_25-1loop_file-20.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 f0109ea62ddaffea082e52dba5f82b006075477af70d5262772f7db35bf203e0 --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-08 23:39:07,177 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 23:39:07,222 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-08 23:39:07,226 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 23:39:07,228 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 23:39:07,251 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 23:39:07,252 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 23:39:07,252 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 23:39:07,253 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 23:39:07,254 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 23:39:07,254 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 23:39:07,254 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 23:39:07,255 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 23:39:07,255 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 23:39:07,257 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 23:39:07,258 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 23:39:07,258 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 23:39:07,258 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 23:39:07,258 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-08 23:39:07,258 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 23:39:07,258 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 23:39:07,259 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 23:39:07,259 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 23:39:07,259 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 23:39:07,259 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 23:39:07,260 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 23:39:07,260 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 23:39:07,260 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 23:39:07,260 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 23:39:07,260 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 23:39:07,260 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 23:39:07,260 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 23:39:07,261 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 23:39:07,261 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 23:39:07,261 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 23:39:07,261 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 23:39:07,261 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-08 23:39:07,261 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-08 23:39:07,261 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 23:39:07,262 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 23:39:07,262 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 23:39:07,263 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 23:39:07,263 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 -> f0109ea62ddaffea082e52dba5f82b006075477af70d5262772f7db35bf203e0 [2024-11-08 23:39:07,481 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 23:39:07,506 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 23:39:07,509 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 23:39:07,510 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 23:39:07,510 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 23:39:07,511 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-20.i [2024-11-08 23:39:08,873 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 23:39:09,031 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 23:39:09,032 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-20.i [2024-11-08 23:39:09,041 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/47e23c43d/9ddb7b0b848346ab822345ed89250591/FLAG910e92a9c [2024-11-08 23:39:09,054 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/47e23c43d/9ddb7b0b848346ab822345ed89250591 [2024-11-08 23:39:09,057 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 23:39:09,058 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 23:39:09,060 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 23:39:09,061 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 23:39:09,066 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 23:39:09,066 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 11:39:09" (1/1) ... [2024-11-08 23:39:09,067 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@40013c9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:39:09, skipping insertion in model container [2024-11-08 23:39:09,067 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 11:39:09" (1/1) ... [2024-11-08 23:39:09,092 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 23:39:09,282 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_loopvsstraightlinecode_25-1loop_file-20.i[915,928] [2024-11-08 23:39:09,304 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 23:39:09,311 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 23:39:09,319 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_loopvsstraightlinecode_25-1loop_file-20.i[915,928] [2024-11-08 23:39:09,329 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 23:39:09,341 INFO L204 MainTranslator]: Completed translation [2024-11-08 23:39:09,341 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:39:09 WrapperNode [2024-11-08 23:39:09,342 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 23:39:09,342 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 23:39:09,343 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 23:39:09,343 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 23:39:09,347 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:39:09" (1/1) ... [2024-11-08 23:39:09,353 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:39:09" (1/1) ... [2024-11-08 23:39:09,372 INFO L138 Inliner]: procedures = 26, calls = 19, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 84 [2024-11-08 23:39:09,373 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 23:39:09,373 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 23:39:09,373 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 23:39:09,373 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 23:39:09,390 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:39:09" (1/1) ... [2024-11-08 23:39:09,390 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:39:09" (1/1) ... [2024-11-08 23:39:09,392 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:39:09" (1/1) ... [2024-11-08 23:39:09,412 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 23:39:09,415 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:39:09" (1/1) ... [2024-11-08 23:39:09,416 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:39:09" (1/1) ... [2024-11-08 23:39:09,419 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:39:09" (1/1) ... [2024-11-08 23:39:09,422 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:39:09" (1/1) ... [2024-11-08 23:39:09,426 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:39:09" (1/1) ... [2024-11-08 23:39:09,431 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:39:09" (1/1) ... [2024-11-08 23:39:09,432 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 23:39:09,433 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 23:39:09,433 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 23:39:09,433 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 23:39:09,434 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:39:09" (1/1) ... [2024-11-08 23:39:09,440 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 23:39:09,452 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 23:39:09,471 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 23:39:09,474 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 23:39:09,511 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 23:39:09,511 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-08 23:39:09,511 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-08 23:39:09,511 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-08 23:39:09,511 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 23:39:09,512 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 23:39:09,569 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 23:39:09,571 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 23:39:09,700 INFO L? ?]: Removed 9 outVars from TransFormulas that were not future-live. [2024-11-08 23:39:09,701 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 23:39:09,710 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 23:39:09,710 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-08 23:39:09,711 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 11:39:09 BoogieIcfgContainer [2024-11-08 23:39:09,711 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 23:39:09,712 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 23:39:09,713 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 23:39:09,715 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 23:39:09,715 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 11:39:09" (1/3) ... [2024-11-08 23:39:09,715 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7a51651 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 11:39:09, skipping insertion in model container [2024-11-08 23:39:09,716 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:39:09" (2/3) ... [2024-11-08 23:39:09,716 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7a51651 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 11:39:09, skipping insertion in model container [2024-11-08 23:39:09,716 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 11:39:09" (3/3) ... [2024-11-08 23:39:09,717 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_25-1loop_file-20.i [2024-11-08 23:39:09,728 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 23:39:09,728 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-08 23:39:09,767 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 23:39:09,772 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;@7ae1dda4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 23:39:09,772 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 23:39:09,775 INFO L276 IsEmpty]: Start isEmpty. Operand has 37 states, 28 states have (on average 1.3928571428571428) internal successors, (39), 29 states have internal predecessors, (39), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-08 23:39:09,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2024-11-08 23:39:09,781 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 23:39:09,782 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 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 23:39:09,782 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 23:39:09,785 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 23:39:09,786 INFO L85 PathProgramCache]: Analyzing trace with hash -1833370510, now seen corresponding path program 1 times [2024-11-08 23:39:09,792 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 23:39:09,792 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1419823084] [2024-11-08 23:39:09,792 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 23:39:09,793 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:39:09,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:39:09,969 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 23:39:09,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:39:09,976 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 23:39:09,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:39:09,984 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 23:39:09,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:39:09,990 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-08 23:39:09,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:39:09,998 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-08 23:39:09,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:39:10,002 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-08 23:39:10,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:39:10,008 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-11-08 23:39:10,008 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 23:39:10,008 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1419823084] [2024-11-08 23:39:10,009 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1419823084] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 23:39:10,009 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 23:39:10,009 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 23:39:10,010 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1318262004] [2024-11-08 23:39:10,011 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 23:39:10,014 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-08 23:39:10,015 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 23:39:10,029 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-08 23:39:10,029 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 23:39:10,032 INFO L87 Difference]: Start difference. First operand has 37 states, 28 states have (on average 1.3928571428571428) internal successors, (39), 29 states have internal predecessors, (39), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) 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, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 2 states have call successors, (6) [2024-11-08 23:39:10,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 23:39:10,049 INFO L93 Difference]: Finished difference Result 71 states and 105 transitions. [2024-11-08 23:39:10,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-08 23:39:10,051 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, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 2 states have call successors, (6) Word has length 49 [2024-11-08 23:39:10,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 23:39:10,055 INFO L225 Difference]: With dead ends: 71 [2024-11-08 23:39:10,055 INFO L226 Difference]: Without dead ends: 33 [2024-11-08 23:39:10,058 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 20 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 23:39:10,062 INFO L432 NwaCegarLoop]: 48 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, 48 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 23:39:10,064 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 23:39:10,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2024-11-08 23:39:10,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2024-11-08 23:39:10,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 25 states have (on average 1.28) internal successors, (32), 25 states have internal predecessors, (32), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-08 23:39:10,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 44 transitions. [2024-11-08 23:39:10,118 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 44 transitions. Word has length 49 [2024-11-08 23:39:10,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 23:39:10,119 INFO L471 AbstractCegarLoop]: Abstraction has 33 states and 44 transitions. [2024-11-08 23:39:10,119 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, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 2 states have call successors, (6) [2024-11-08 23:39:10,119 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 44 transitions. [2024-11-08 23:39:10,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2024-11-08 23:39:10,121 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 23:39:10,122 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 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 23:39:10,122 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-08 23:39:10,122 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 23:39:10,123 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 23:39:10,123 INFO L85 PathProgramCache]: Analyzing trace with hash 1935673530, now seen corresponding path program 1 times [2024-11-08 23:39:10,124 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 23:39:10,124 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1724542464] [2024-11-08 23:39:10,124 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 23:39:10,124 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:39:10,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:39:10,271 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 23:39:10,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:39:10,277 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 23:39:10,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:39:10,285 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 23:39:10,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:39:10,298 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-08 23:39:10,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:39:10,308 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-08 23:39:10,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:39:10,313 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-08 23:39:10,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:39:10,319 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-11-08 23:39:10,323 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 23:39:10,323 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1724542464] [2024-11-08 23:39:10,324 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1724542464] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 23:39:10,324 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 23:39:10,324 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 23:39:10,324 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2107827602] [2024-11-08 23:39:10,325 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 23:39:10,326 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 23:39:10,326 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 23:39:10,327 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 23:39:10,327 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 23:39:10,327 INFO L87 Difference]: Start difference. First operand 33 states and 44 transitions. Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2024-11-08 23:39:10,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 23:39:10,366 INFO L93 Difference]: Finished difference Result 75 states and 100 transitions. [2024-11-08 23:39:10,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 23:39:10,368 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) Word has length 49 [2024-11-08 23:39:10,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 23:39:10,369 INFO L225 Difference]: With dead ends: 75 [2024-11-08 23:39:10,369 INFO L226 Difference]: Without dead ends: 45 [2024-11-08 23:39:10,370 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 23:39:10,371 INFO L432 NwaCegarLoop]: 43 mSDtfsCounter, 13 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 23:39:10,371 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 75 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 23:39:10,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2024-11-08 23:39:10,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 35. [2024-11-08 23:39:10,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 27 states have (on average 1.2592592592592593) internal successors, (34), 27 states have internal predecessors, (34), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-08 23:39:10,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 46 transitions. [2024-11-08 23:39:10,380 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 46 transitions. Word has length 49 [2024-11-08 23:39:10,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 23:39:10,381 INFO L471 AbstractCegarLoop]: Abstraction has 35 states and 46 transitions. [2024-11-08 23:39:10,381 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2024-11-08 23:39:10,381 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 46 transitions. [2024-11-08 23:39:10,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2024-11-08 23:39:10,383 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 23:39:10,383 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 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 23:39:10,383 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-08 23:39:10,383 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 23:39:10,383 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 23:39:10,384 INFO L85 PathProgramCache]: Analyzing trace with hash -1098421830, now seen corresponding path program 1 times [2024-11-08 23:39:10,384 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 23:39:10,384 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2075790803] [2024-11-08 23:39:10,384 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 23:39:10,384 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:39:10,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 23:39:10,411 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-08 23:39:10,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 23:39:10,481 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-08 23:39:10,481 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-08 23:39:10,482 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-08 23:39:10,483 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-08 23:39:10,487 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2024-11-08 23:39:10,524 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-08 23:39:10,527 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.11 11:39:10 BoogieIcfgContainer [2024-11-08 23:39:10,527 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-08 23:39:10,528 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-08 23:39:10,528 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-08 23:39:10,528 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-08 23:39:10,528 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 11:39:09" (3/4) ... [2024-11-08 23:39:10,530 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-08 23:39:10,531 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-08 23:39:10,531 INFO L158 Benchmark]: Toolchain (without parser) took 1473.04ms. Allocated memory is still 180.4MB. Free memory was 111.1MB in the beginning and 123.9MB in the end (delta: -12.8MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 23:39:10,532 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 109.1MB. Free memory is still 71.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 23:39:10,533 INFO L158 Benchmark]: CACSL2BoogieTranslator took 281.90ms. Allocated memory is still 180.4MB. Free memory was 110.8MB in the beginning and 149.6MB in the end (delta: -38.8MB). Peak memory consumption was 12.1MB. Max. memory is 16.1GB. [2024-11-08 23:39:10,533 INFO L158 Benchmark]: Boogie Procedure Inliner took 30.38ms. Allocated memory is still 180.4MB. Free memory was 149.6MB in the beginning and 147.5MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-08 23:39:10,533 INFO L158 Benchmark]: Boogie Preprocessor took 59.17ms. Allocated memory is still 180.4MB. Free memory was 147.5MB in the beginning and 145.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-08 23:39:10,533 INFO L158 Benchmark]: RCFGBuilder took 278.13ms. Allocated memory is still 180.4MB. Free memory was 145.4MB in the beginning and 132.1MB in the end (delta: 13.3MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-08 23:39:10,534 INFO L158 Benchmark]: TraceAbstraction took 814.76ms. Allocated memory is still 180.4MB. Free memory was 131.4MB in the beginning and 124.1MB in the end (delta: 7.3MB). Peak memory consumption was 4.7MB. Max. memory is 16.1GB. [2024-11-08 23:39:10,534 INFO L158 Benchmark]: Witness Printer took 3.29ms. Allocated memory is still 180.4MB. Free memory was 124.1MB in the beginning and 123.9MB in the end (delta: 245.1kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 23:39:10,535 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.14ms. Allocated memory is still 109.1MB. Free memory is still 71.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 281.90ms. Allocated memory is still 180.4MB. Free memory was 110.8MB in the beginning and 149.6MB in the end (delta: -38.8MB). Peak memory consumption was 12.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 30.38ms. Allocated memory is still 180.4MB. Free memory was 149.6MB in the beginning and 147.5MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 59.17ms. Allocated memory is still 180.4MB. Free memory was 147.5MB in the beginning and 145.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 278.13ms. Allocated memory is still 180.4MB. Free memory was 145.4MB in the beginning and 132.1MB in the end (delta: 13.3MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * TraceAbstraction took 814.76ms. Allocated memory is still 180.4MB. Free memory was 131.4MB in the beginning and 124.1MB in the end (delta: 7.3MB). Peak memory consumption was 4.7MB. Max. memory is 16.1GB. * Witness Printer took 3.29ms. Allocated memory is still 180.4MB. Free memory was 124.1MB in the beginning and 123.9MB in the end (delta: 245.1kB). 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 someBinaryFLOATComparisonOperation at line 75, overapproximation of someBinaryArithmeticDOUBLEoperation at line 41, overapproximation of someBinaryDOUBLEComparisonOperation at line 75, overapproximation of someBinaryArithmeticFLOAToperation at line 45. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] float var_1_1 = 0.6; [L23] unsigned char var_1_2 = 0; [L24] float var_1_3 = 0.0; [L25] float var_1_4 = 2.95; [L26] float var_1_5 = 8.5; [L27] float var_1_6 = 999999999999.4; [L28] double var_1_7 = 10.2; [L29] double var_1_8 = 32.7; [L30] double var_1_9 = 32.75; [L31] double last_1_var_1_8 = 32.7; VAL [isInitial=0, last_1_var_1_8=327/10, var_1_1=3/5, var_1_2=0, var_1_3=0, var_1_4=59/20, var_1_5=17/2, var_1_6=4999999999997/5, var_1_7=51/5, var_1_8=327/10, var_1_9=131/4] [L79] isInitial = 1 [L80] FCALL initially() [L81] int k_loop; [L82] k_loop = 0 VAL [isInitial=1, k_loop=0, last_1_var_1_8=327/10, var_1_1=3/5, var_1_2=0, var_1_3=0, var_1_4=59/20, var_1_5=17/2, var_1_6=4999999999997/5, var_1_7=51/5, var_1_8=327/10, var_1_9=131/4] [L82] COND TRUE k_loop < 1 [L83] CALL updateLastVariables() [L72] last_1_var_1_8 = var_1_8 VAL [isInitial=1, last_1_var_1_8=327/10, var_1_1=3/5, var_1_2=0, var_1_3=0, var_1_4=59/20, var_1_5=17/2, var_1_6=4999999999997/5, var_1_7=51/5, var_1_8=327/10, var_1_9=131/4] [L83] RET updateLastVariables() [L84] CALL updateVariables() [L59] var_1_2 = __VERIFIER_nondet_uchar() [L60] CALL assume_abort_if_not(var_1_2 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_8=327/10, var_1_1=3/5, var_1_3=0, var_1_4=59/20, var_1_5=17/2, var_1_6=4999999999997/5, var_1_7=51/5, var_1_8=327/10, var_1_9=131/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_8=327/10, var_1_1=3/5, var_1_3=0, var_1_4=59/20, var_1_5=17/2, var_1_6=4999999999997/5, var_1_7=51/5, var_1_8=327/10, var_1_9=131/4] [L60] RET assume_abort_if_not(var_1_2 >= 0) VAL [isInitial=1, last_1_var_1_8=327/10, var_1_1=3/5, var_1_3=0, var_1_4=59/20, var_1_5=17/2, var_1_6=4999999999997/5, var_1_7=51/5, var_1_8=327/10, var_1_9=131/4] [L61] CALL assume_abort_if_not(var_1_2 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_8=327/10, var_1_1=3/5, var_1_2=1, var_1_3=0, var_1_4=59/20, var_1_5=17/2, var_1_6=4999999999997/5, var_1_7=51/5, var_1_8=327/10, var_1_9=131/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_8=327/10, var_1_1=3/5, var_1_2=1, var_1_3=0, var_1_4=59/20, var_1_5=17/2, var_1_6=4999999999997/5, var_1_7=51/5, var_1_8=327/10, var_1_9=131/4] [L61] RET assume_abort_if_not(var_1_2 <= 1) VAL [isInitial=1, last_1_var_1_8=327/10, var_1_1=3/5, var_1_2=1, var_1_3=0, var_1_4=59/20, var_1_5=17/2, var_1_6=4999999999997/5, var_1_7=51/5, var_1_8=327/10, var_1_9=131/4] [L62] var_1_3 = __VERIFIER_nondet_float() [L63] CALL assume_abort_if_not((var_1_3 >= 4611686.018427382800e+12F && var_1_3 <= -1.0e-20F) || (var_1_3 <= 9223372.036854765600e+12F && var_1_3 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_8=327/10, var_1_1=3/5, var_1_2=1, var_1_4=59/20, var_1_5=17/2, var_1_6=4999999999997/5, var_1_7=51/5, var_1_8=327/10, var_1_9=131/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_8=327/10, var_1_1=3/5, var_1_2=1, var_1_4=59/20, var_1_5=17/2, var_1_6=4999999999997/5, var_1_7=51/5, var_1_8=327/10, var_1_9=131/4] [L63] RET assume_abort_if_not((var_1_3 >= 4611686.018427382800e+12F && var_1_3 <= -1.0e-20F) || (var_1_3 <= 9223372.036854765600e+12F && var_1_3 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_8=327/10, var_1_1=3/5, var_1_2=1, var_1_4=59/20, var_1_5=17/2, var_1_6=4999999999997/5, var_1_7=51/5, var_1_8=327/10, var_1_9=131/4] [L64] var_1_4 = __VERIFIER_nondet_float() [L65] CALL assume_abort_if_not((var_1_4 >= 0.0F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 4611686.018427382800e+12F && var_1_4 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_8=327/10, var_1_1=3/5, var_1_2=1, var_1_5=17/2, var_1_6=4999999999997/5, var_1_7=51/5, var_1_8=327/10, var_1_9=131/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_8=327/10, var_1_1=3/5, var_1_2=1, var_1_5=17/2, var_1_6=4999999999997/5, var_1_7=51/5, var_1_8=327/10, var_1_9=131/4] [L65] RET assume_abort_if_not((var_1_4 >= 0.0F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 4611686.018427382800e+12F && var_1_4 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_8=327/10, var_1_1=3/5, var_1_2=1, var_1_5=17/2, var_1_6=4999999999997/5, var_1_7=51/5, var_1_8=327/10, var_1_9=131/4] [L66] var_1_5 = __VERIFIER_nondet_float() [L67] CALL assume_abort_if_not((var_1_5 >= 0.0F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 9223372.036854765600e+12F && var_1_5 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_8=327/10, var_1_1=3/5, var_1_2=1, var_1_6=4999999999997/5, var_1_7=51/5, var_1_8=327/10, var_1_9=131/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_8=327/10, var_1_1=3/5, var_1_2=1, var_1_6=4999999999997/5, var_1_7=51/5, var_1_8=327/10, var_1_9=131/4] [L67] RET assume_abort_if_not((var_1_5 >= 0.0F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 9223372.036854765600e+12F && var_1_5 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_8=327/10, var_1_1=3/5, var_1_2=1, var_1_6=4999999999997/5, var_1_7=51/5, var_1_8=327/10, var_1_9=131/4] [L68] var_1_6 = __VERIFIER_nondet_float() [L69] CALL assume_abort_if_not((var_1_6 >= -461168.6018427382800e+13F && var_1_6 <= -1.0e-20F) || (var_1_6 <= 4611686.018427382800e+12F && var_1_6 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_8=327/10, var_1_1=3/5, var_1_2=1, var_1_7=51/5, var_1_8=327/10, var_1_9=131/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_8=327/10, var_1_1=3/5, var_1_2=1, var_1_7=51/5, var_1_8=327/10, var_1_9=131/4] [L69] RET assume_abort_if_not((var_1_6 >= -461168.6018427382800e+13F && var_1_6 <= -1.0e-20F) || (var_1_6 <= 4611686.018427382800e+12F && var_1_6 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_8=327/10, var_1_1=3/5, var_1_2=1, var_1_7=51/5, var_1_8=327/10, var_1_9=131/4] [L84] RET updateVariables() [L85] CALL step() [L35] COND TRUE \read(var_1_2) [L36] var_1_1 = ((var_1_3 - var_1_4) - var_1_5) VAL [isInitial=1, last_1_var_1_8=327/10, var_1_2=1, var_1_7=51/5, var_1_8=327/10, var_1_9=131/4] [L40] COND TRUE \read(var_1_2) [L41] var_1_7 = ((((((var_1_3 - 255.719)) < (var_1_5)) ? ((var_1_3 - 255.719)) : (var_1_5))) - 2.3) VAL [isInitial=1, last_1_var_1_8=327/10, var_1_2=1, var_1_8=327/10, var_1_9=131/4] [L43] COND TRUE \read(var_1_2) VAL [isInitial=1, last_1_var_1_8=327/10, var_1_2=1, var_1_8=327/10, var_1_9=131/4] [L44] COND TRUE var_1_7 >= ((((last_1_var_1_8) > (var_1_6)) ? (last_1_var_1_8) : (var_1_6))) [L45] var_1_8 = (var_1_5 - var_1_3) VAL [isInitial=1, last_1_var_1_8=327/10, var_1_2=1, var_1_9=131/4] [L54] COND TRUE var_1_4 != (var_1_3 - var_1_5) [L55] var_1_9 = var_1_6 VAL [isInitial=1, last_1_var_1_8=327/10, var_1_2=1, var_1_6=1000000000004, var_1_9=1000000000004] [L85] RET step() [L86] CALL, EXPR property() [L75-L76] return (((var_1_2 ? (var_1_1 == ((float) ((var_1_3 - var_1_4) - var_1_5))) : (var_1_1 == ((float) (var_1_4 + var_1_6)))) && (var_1_2 ? (var_1_7 == ((double) ((((((var_1_3 - 255.719)) < (var_1_5)) ? ((var_1_3 - 255.719)) : (var_1_5))) - 2.3))) : 1)) && (var_1_2 ? ((var_1_7 >= ((((last_1_var_1_8) > (var_1_6)) ? (last_1_var_1_8) : (var_1_6)))) ? (var_1_8 == ((double) (var_1_5 - var_1_3))) : (var_1_8 == ((double) var_1_4))) : ((var_1_7 <= var_1_5) ? (var_1_8 == ((double) var_1_6)) : 1))) && ((var_1_4 != (var_1_3 - var_1_5)) ? (var_1_9 == ((double) var_1_6)) : 1) ; VAL [\result=0, isInitial=1, last_1_var_1_8=327/10, var_1_2=1, var_1_6=1000000000004, var_1_9=1000000000004] [L86] RET, EXPR property() [L86] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_8=327/10, var_1_2=1, var_1_6=1000000000004, var_1_9=1000000000004] [L19] reach_error() VAL [isInitial=1, last_1_var_1_8=327/10, var_1_2=1, var_1_6=1000000000004, var_1_9=1000000000004] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 37 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 0.7s, OverallIterations: 3, TraceHistogramMax: 6, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 13 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 13 mSDsluCounter, 123 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 32 mSDsCounter, 3 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 11 IncrementalHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 3 mSolverCounterUnsat, 91 mSDtfsCounter, 11 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 35 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=37occurred in iteration=0, InterpolantAutomatonStates: 5, 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, 2 MinimizatonAttempts, 10 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.2s InterpolantComputationTime, 147 NumberOfCodeBlocks, 147 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 96 ConstructedInterpolants, 0 QuantifiedInterpolants, 106 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 2 InterpolantComputations, 2 PerfectInterpolantSequences, 120/120 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-08 23:39:10,559 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_loopvsstraightlinecode_25-1loop_file-20.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 f0109ea62ddaffea082e52dba5f82b006075477af70d5262772f7db35bf203e0 --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-08 23:39:12,663 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 23:39:12,727 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-08 23:39:12,736 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 23:39:12,736 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 23:39:12,757 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 23:39:12,760 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 23:39:12,760 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 23:39:12,761 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 23:39:12,762 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 23:39:12,762 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 23:39:12,763 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 23:39:12,763 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 23:39:12,765 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 23:39:12,765 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 23:39:12,766 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 23:39:12,766 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 23:39:12,766 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 23:39:12,766 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 23:39:12,766 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 23:39:12,766 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 23:39:12,767 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 23:39:12,767 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 23:39:12,767 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-08 23:39:12,767 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-08 23:39:12,767 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 23:39:12,767 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-08 23:39:12,767 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 23:39:12,768 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 23:39:12,768 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 23:39:12,768 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 23:39:12,768 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 23:39:12,768 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 23:39:12,768 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 23:39:12,779 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 23:39:12,780 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 23:39:12,780 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 23:39:12,780 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 23:39:12,780 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-08 23:39:12,781 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-08 23:39:12,781 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 23:39:12,781 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 23:39:12,781 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 23:39:12,781 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 23:39:12,782 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 -> f0109ea62ddaffea082e52dba5f82b006075477af70d5262772f7db35bf203e0 [2024-11-08 23:39:13,015 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 23:39:13,030 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 23:39:13,032 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 23:39:13,033 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 23:39:13,034 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 23:39:13,035 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-20.i [2024-11-08 23:39:14,329 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 23:39:14,517 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 23:39:14,517 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-20.i [2024-11-08 23:39:14,537 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6bd3d7d8d/e230fa96071d4fef893fae8229eced75/FLAG50a53194e [2024-11-08 23:39:14,553 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6bd3d7d8d/e230fa96071d4fef893fae8229eced75 [2024-11-08 23:39:14,555 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 23:39:14,557 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 23:39:14,558 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 23:39:14,559 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 23:39:14,565 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 23:39:14,565 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 11:39:14" (1/1) ... [2024-11-08 23:39:14,567 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@420f779a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:39:14, skipping insertion in model container [2024-11-08 23:39:14,567 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 11:39:14" (1/1) ... [2024-11-08 23:39:14,584 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 23:39:14,718 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_loopvsstraightlinecode_25-1loop_file-20.i[915,928] [2024-11-08 23:39:14,753 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 23:39:14,767 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 23:39:14,776 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_loopvsstraightlinecode_25-1loop_file-20.i[915,928] [2024-11-08 23:39:14,794 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 23:39:14,811 INFO L204 MainTranslator]: Completed translation [2024-11-08 23:39:14,811 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:39:14 WrapperNode [2024-11-08 23:39:14,812 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 23:39:14,813 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 23:39:14,813 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 23:39:14,813 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 23:39:14,817 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:39:14" (1/1) ... [2024-11-08 23:39:14,830 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:39:14" (1/1) ... [2024-11-08 23:39:14,849 INFO L138 Inliner]: procedures = 27, calls = 19, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 84 [2024-11-08 23:39:14,852 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 23:39:14,853 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 23:39:14,853 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 23:39:14,853 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 23:39:14,868 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:39:14" (1/1) ... [2024-11-08 23:39:14,868 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:39:14" (1/1) ... [2024-11-08 23:39:14,872 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:39:14" (1/1) ... [2024-11-08 23:39:14,881 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 23:39:14,882 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:39:14" (1/1) ... [2024-11-08 23:39:14,882 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:39:14" (1/1) ... [2024-11-08 23:39:14,892 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:39:14" (1/1) ... [2024-11-08 23:39:14,894 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:39:14" (1/1) ... [2024-11-08 23:39:14,898 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:39:14" (1/1) ... [2024-11-08 23:39:14,899 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:39:14" (1/1) ... [2024-11-08 23:39:14,901 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 23:39:14,905 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 23:39:14,905 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 23:39:14,905 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 23:39:14,906 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:39:14" (1/1) ... [2024-11-08 23:39:14,912 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 23:39:14,922 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 23:39:14,935 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 23:39:14,937 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 23:39:14,966 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 23:39:14,967 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-08 23:39:14,967 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-08 23:39:14,967 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-08 23:39:14,967 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 23:39:14,967 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 23:39:15,033 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 23:39:15,035 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 23:39:21,424 INFO L? ?]: Removed 9 outVars from TransFormulas that were not future-live. [2024-11-08 23:39:21,424 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 23:39:21,442 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 23:39:21,442 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-08 23:39:21,443 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 11:39:21 BoogieIcfgContainer [2024-11-08 23:39:21,443 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 23:39:21,445 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 23:39:21,445 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 23:39:21,448 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 23:39:21,448 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 11:39:14" (1/3) ... [2024-11-08 23:39:21,448 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@ea36f77 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 11:39:21, skipping insertion in model container [2024-11-08 23:39:21,448 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:39:14" (2/3) ... [2024-11-08 23:39:21,448 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@ea36f77 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 11:39:21, skipping insertion in model container [2024-11-08 23:39:21,448 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 11:39:21" (3/3) ... [2024-11-08 23:39:21,449 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_25-1loop_file-20.i [2024-11-08 23:39:21,463 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 23:39:21,463 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-08 23:39:21,504 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 23:39:21,510 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;@1fa16cf9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 23:39:21,510 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 23:39:21,514 INFO L276 IsEmpty]: Start isEmpty. Operand has 37 states, 28 states have (on average 1.3928571428571428) internal successors, (39), 29 states have internal predecessors, (39), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-08 23:39:21,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2024-11-08 23:39:21,521 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 23:39:21,522 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 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 23:39:21,522 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 23:39:21,527 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 23:39:21,527 INFO L85 PathProgramCache]: Analyzing trace with hash -1833370510, now seen corresponding path program 1 times [2024-11-08 23:39:21,538 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 23:39:21,539 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1693097190] [2024-11-08 23:39:21,539 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 23:39:21,540 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-08 23:39:21,540 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 23:39:21,547 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-08 23:39:21,549 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-08 23:39:21,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:39:21,910 INFO L255 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-08 23:39:21,917 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 23:39:21,944 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2024-11-08 23:39:21,944 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 23:39:21,945 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-08 23:39:21,945 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1693097190] [2024-11-08 23:39:21,945 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1693097190] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 23:39:21,946 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 23:39:21,946 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 23:39:21,947 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [839573086] [2024-11-08 23:39:21,947 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 23:39:21,950 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-08 23:39:21,950 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-08 23:39:21,965 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-08 23:39:21,965 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 23:39:21,967 INFO L87 Difference]: Start difference. First operand has 37 states, 28 states have (on average 1.3928571428571428) internal successors, (39), 29 states have internal predecessors, (39), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 states have internal predecessors, (26), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-11-08 23:39:21,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 23:39:21,984 INFO L93 Difference]: Finished difference Result 71 states and 105 transitions. [2024-11-08 23:39:21,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-08 23:39:21,985 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 states have internal predecessors, (26), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 49 [2024-11-08 23:39:21,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 23:39:21,989 INFO L225 Difference]: With dead ends: 71 [2024-11-08 23:39:21,989 INFO L226 Difference]: Without dead ends: 33 [2024-11-08 23:39:21,992 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 48 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 23:39:21,994 INFO L432 NwaCegarLoop]: 48 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, 48 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 23:39:21,996 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 23:39:22,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2024-11-08 23:39:22,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2024-11-08 23:39:22,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 25 states have (on average 1.28) internal successors, (32), 25 states have internal predecessors, (32), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-08 23:39:22,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 44 transitions. [2024-11-08 23:39:22,032 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 44 transitions. Word has length 49 [2024-11-08 23:39:22,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 23:39:22,035 INFO L471 AbstractCegarLoop]: Abstraction has 33 states and 44 transitions. [2024-11-08 23:39:22,036 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 states have internal predecessors, (26), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-11-08 23:39:22,036 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 44 transitions. [2024-11-08 23:39:22,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2024-11-08 23:39:22,038 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 23:39:22,038 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 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 23:39:22,069 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-08 23:39:22,246 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-08 23:39:22,247 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 23:39:22,248 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 23:39:22,248 INFO L85 PathProgramCache]: Analyzing trace with hash 1935673530, now seen corresponding path program 1 times [2024-11-08 23:39:22,248 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 23:39:22,249 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1684342263] [2024-11-08 23:39:22,249 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 23:39:22,249 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-08 23:39:22,249 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 23:39:22,252 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-08 23:39:22,252 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-08 23:39:22,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:39:22,638 INFO L255 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-08 23:39:22,641 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 23:39:22,697 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-11-08 23:39:22,698 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 23:39:22,698 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-08 23:39:22,698 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1684342263] [2024-11-08 23:39:22,698 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1684342263] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 23:39:22,698 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 23:39:22,698 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 23:39:22,698 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [443063725] [2024-11-08 23:39:22,698 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 23:39:22,699 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 23:39:22,699 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-08 23:39:22,700 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 23:39:22,700 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 23:39:22,701 INFO L87 Difference]: Start difference. First operand 33 states and 44 transitions. Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2024-11-08 23:39:24,396 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.62s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-08 23:39:28,589 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.10s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-08 23:39:32,592 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-08 23:39:32,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 23:39:32,639 INFO L93 Difference]: Finished difference Result 75 states and 100 transitions. [2024-11-08 23:39:32,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 23:39:32,640 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) Word has length 49 [2024-11-08 23:39:32,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 23:39:32,659 INFO L225 Difference]: With dead ends: 75 [2024-11-08 23:39:32,659 INFO L226 Difference]: Without dead ends: 45 [2024-11-08 23:39:32,660 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 23:39:32,661 INFO L432 NwaCegarLoop]: 44 mSDtfsCounter, 13 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 3 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.9s IncrementalHoareTripleChecker+Time [2024-11-08 23:39:32,662 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 75 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 10 Invalid, 2 Unknown, 0 Unchecked, 9.9s Time] [2024-11-08 23:39:32,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2024-11-08 23:39:32,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 35. [2024-11-08 23:39:32,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 27 states have (on average 1.2592592592592593) internal successors, (34), 27 states have internal predecessors, (34), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-08 23:39:32,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 46 transitions. [2024-11-08 23:39:32,672 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 46 transitions. Word has length 49 [2024-11-08 23:39:32,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 23:39:32,675 INFO L471 AbstractCegarLoop]: Abstraction has 35 states and 46 transitions. [2024-11-08 23:39:32,676 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2024-11-08 23:39:32,676 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 46 transitions. [2024-11-08 23:39:32,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2024-11-08 23:39:32,679 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 23:39:32,679 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 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 23:39:32,693 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 (3)] Ended with exit code 0 [2024-11-08 23:39:32,883 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /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-08 23:39:32,884 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 23:39:32,885 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 23:39:32,885 INFO L85 PathProgramCache]: Analyzing trace with hash -1098421830, now seen corresponding path program 1 times [2024-11-08 23:39:32,886 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 23:39:32,886 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1824183109] [2024-11-08 23:39:32,886 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 23:39:32,887 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-08 23:39:32,888 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 23:39:32,890 INFO L229 MonitoredProcess]: Starting monitored process 4 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-08 23:39:32,890 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 (4)] Waiting until timeout for monitored process [2024-11-08 23:39:33,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:39:33,342 INFO L255 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 24 conjuncts are in the unsatisfiable core [2024-11-08 23:39:33,347 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 23:39:53,238 WARN L286 SmtUtils]: Spent 7.15s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 23:40:06,475 WARN L286 SmtUtils]: Spent 7.55s on a formula simplification that was a NOOP. DAG size: 8 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 23:40:12,357 WARN L286 SmtUtils]: Spent 5.88s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 23:40:20,306 WARN L286 SmtUtils]: Spent 5.86s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 23:40:32,628 WARN L286 SmtUtils]: Spent 8.14s on a formula simplification that was a NOOP. DAG size: 9 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 23:40:38,704 WARN L286 SmtUtils]: Spent 6.08s on a formula simplification that was a NOOP. DAG size: 11 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 23:40:44,531 WARN L286 SmtUtils]: Spent 5.82s on a formula simplification that was a NOOP. DAG size: 10 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 23:40:50,452 WARN L286 SmtUtils]: Spent 5.92s on a formula simplification that was a NOOP. DAG size: 8 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)