./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-29.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_floatingpointinfluence_has-floats_file-29.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 5c3a6cfbeb64be96bf4eacae875b7628036a7e9302f517cb52ffb38da5c714c2 --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-08 22:57:29,064 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 22:57:29,135 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-08 22:57:29,140 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 22:57:29,142 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 22:57:29,164 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 22:57:29,165 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 22:57:29,165 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 22:57:29,166 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 22:57:29,168 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 22:57:29,168 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 22:57:29,169 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 22:57:29,169 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 22:57:29,169 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 22:57:29,170 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 22:57:29,173 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 22:57:29,173 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 22:57:29,173 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 22:57:29,174 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-08 22:57:29,174 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 22:57:29,174 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 22:57:29,175 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 22:57:29,175 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 22:57:29,175 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 22:57:29,175 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 22:57:29,175 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 22:57:29,176 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 22:57:29,176 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 22:57:29,178 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 22:57:29,178 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 22:57:29,178 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 22:57:29,179 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 22:57:29,179 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 22:57:29,179 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 22:57:29,179 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 22:57:29,180 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 22:57:29,180 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-08 22:57:29,180 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-08 22:57:29,180 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 22:57:29,181 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 22:57:29,181 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 22:57:29,181 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 22:57:29,183 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 -> 5c3a6cfbeb64be96bf4eacae875b7628036a7e9302f517cb52ffb38da5c714c2 [2024-11-08 22:57:29,475 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 22:57:29,503 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 22:57:29,506 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 22:57:29,507 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 22:57:29,508 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 22:57:29,509 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-29.i [2024-11-08 22:57:30,925 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 22:57:31,160 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 22:57:31,161 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-29.i [2024-11-08 22:57:31,170 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/75bdcb5cc/f0647b232d9a4e5695e5010b944f596a/FLAGee59a8c5d [2024-11-08 22:57:31,527 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/75bdcb5cc/f0647b232d9a4e5695e5010b944f596a [2024-11-08 22:57:31,530 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 22:57:31,531 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 22:57:31,534 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 22:57:31,534 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 22:57:31,540 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 22:57:31,540 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 10:57:31" (1/1) ... [2024-11-08 22:57:31,541 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@64ac8f6e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:57:31, skipping insertion in model container [2024-11-08 22:57:31,541 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 10:57:31" (1/1) ... [2024-11-08 22:57:31,570 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 22:57:31,752 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_floatingpointinfluence_has-floats_file-29.i[917,930] [2024-11-08 22:57:31,805 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 22:57:31,814 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 22:57:31,823 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_floatingpointinfluence_has-floats_file-29.i[917,930] [2024-11-08 22:57:31,837 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 22:57:31,854 INFO L204 MainTranslator]: Completed translation [2024-11-08 22:57:31,855 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:57:31 WrapperNode [2024-11-08 22:57:31,855 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 22:57:31,856 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 22:57:31,856 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 22:57:31,856 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 22:57:31,863 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:57:31" (1/1) ... [2024-11-08 22:57:31,870 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:57:31" (1/1) ... [2024-11-08 22:57:31,904 INFO L138 Inliner]: procedures = 26, calls = 19, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 78 [2024-11-08 22:57:31,908 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 22:57:31,909 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 22:57:31,909 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 22:57:31,909 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 22:57:31,920 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:57:31" (1/1) ... [2024-11-08 22:57:31,921 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:57:31" (1/1) ... [2024-11-08 22:57:31,923 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:57:31" (1/1) ... [2024-11-08 22:57:31,942 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 22:57:31,943 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:57:31" (1/1) ... [2024-11-08 22:57:31,943 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:57:31" (1/1) ... [2024-11-08 22:57:31,948 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:57:31" (1/1) ... [2024-11-08 22:57:31,951 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:57:31" (1/1) ... [2024-11-08 22:57:31,956 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:57:31" (1/1) ... [2024-11-08 22:57:31,957 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:57:31" (1/1) ... [2024-11-08 22:57:31,961 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 22:57:31,962 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 22:57:31,962 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 22:57:31,962 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 22:57:31,963 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:57:31" (1/1) ... [2024-11-08 22:57:31,970 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 22:57:31,981 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 22:57:32,000 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 22:57:32,006 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 22:57:32,051 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 22:57:32,052 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-08 22:57:32,052 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-08 22:57:32,052 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-08 22:57:32,052 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 22:57:32,052 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 22:57:32,132 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 22:57:32,135 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 22:57:32,355 INFO L? ?]: Removed 10 outVars from TransFormulas that were not future-live. [2024-11-08 22:57:32,356 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 22:57:32,366 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 22:57:32,367 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-08 22:57:32,367 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 10:57:32 BoogieIcfgContainer [2024-11-08 22:57:32,367 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 22:57:32,369 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 22:57:32,369 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 22:57:32,372 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 22:57:32,373 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 10:57:31" (1/3) ... [2024-11-08 22:57:32,373 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@597bb0b7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 10:57:32, skipping insertion in model container [2024-11-08 22:57:32,373 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:57:31" (2/3) ... [2024-11-08 22:57:32,374 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@597bb0b7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 10:57:32, skipping insertion in model container [2024-11-08 22:57:32,374 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 10:57:32" (3/3) ... [2024-11-08 22:57:32,375 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_floatingpointinfluence_has-floats_file-29.i [2024-11-08 22:57:32,388 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 22:57:32,389 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-08 22:57:32,442 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 22:57:32,448 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;@152b7dd0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 22:57:32,449 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 22:57:32,452 INFO L276 IsEmpty]: Start isEmpty. Operand has 37 states, 28 states have (on average 1.4285714285714286) internal successors, (40), 29 states have internal predecessors, (40), 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 22:57:32,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2024-11-08 22:57:32,459 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 22:57:32,459 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] [2024-11-08 22:57:32,460 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 22:57:32,465 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 22:57:32,465 INFO L85 PathProgramCache]: Analyzing trace with hash -1352345360, now seen corresponding path program 1 times [2024-11-08 22:57:32,474 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 22:57:32,474 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1559156501] [2024-11-08 22:57:32,475 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 22:57:32,475 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:57:32,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:57:32,680 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 22:57:32,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:57:32,688 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 22:57:32,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:57:32,694 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 22:57:32,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:57:32,698 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-08 22:57:32,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:57:32,703 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-08 22:57:32,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:57:32,708 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-08 22:57:32,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:57:32,714 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 22:57:32,715 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 22:57:32,715 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1559156501] [2024-11-08 22:57:32,716 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1559156501] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 22:57:32,716 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 22:57:32,716 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 22:57:32,717 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1038852007] [2024-11-08 22:57:32,718 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 22:57:32,725 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-08 22:57:32,726 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 22:57:32,746 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-08 22:57:32,747 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 22:57:32,748 INFO L87 Difference]: Start difference. First operand has 37 states, 28 states have (on average 1.4285714285714286) internal successors, (40), 29 states have internal predecessors, (40), 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 10.5) internal successors, (21), 2 states have internal predecessors, (21), 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 22:57:32,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 22:57:32,765 INFO L93 Difference]: Finished difference Result 67 states and 104 transitions. [2024-11-08 22:57:32,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-08 22:57:32,766 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 10.5) internal successors, (21), 2 states have internal predecessors, (21), 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 48 [2024-11-08 22:57:32,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 22:57:32,772 INFO L225 Difference]: With dead ends: 67 [2024-11-08 22:57:32,772 INFO L226 Difference]: Without dead ends: 33 [2024-11-08 22:57:32,775 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 22:57:32,778 INFO L432 NwaCegarLoop]: 45 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, 45 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 22:57:32,778 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 22:57:32,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2024-11-08 22:57:32,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2024-11-08 22:57:32,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 25 states have (on average 1.32) internal successors, (33), 25 states have internal predecessors, (33), 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 22:57:32,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 45 transitions. [2024-11-08 22:57:32,808 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 45 transitions. Word has length 48 [2024-11-08 22:57:32,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 22:57:32,809 INFO L471 AbstractCegarLoop]: Abstraction has 33 states and 45 transitions. [2024-11-08 22:57:32,809 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 10.5) internal successors, (21), 2 states have internal predecessors, (21), 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 22:57:32,809 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 45 transitions. [2024-11-08 22:57:32,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2024-11-08 22:57:32,811 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 22:57:32,811 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] [2024-11-08 22:57:32,811 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-08 22:57:32,812 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 22:57:32,812 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 22:57:32,812 INFO L85 PathProgramCache]: Analyzing trace with hash 1193502324, now seen corresponding path program 1 times [2024-11-08 22:57:32,812 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 22:57:32,813 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [255469287] [2024-11-08 22:57:32,813 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 22:57:32,813 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:57:32,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 22:57:32,910 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-08 22:57:32,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 22:57:33,039 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-08 22:57:33,040 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-08 22:57:33,042 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-08 22:57:33,044 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-08 22:57:33,048 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1] [2024-11-08 22:57:33,100 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-08 22:57:33,104 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.11 10:57:33 BoogieIcfgContainer [2024-11-08 22:57:33,104 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-08 22:57:33,104 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-08 22:57:33,104 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-08 22:57:33,105 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-08 22:57:33,105 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 10:57:32" (3/4) ... [2024-11-08 22:57:33,108 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-08 22:57:33,109 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-08 22:57:33,110 INFO L158 Benchmark]: Toolchain (without parser) took 1578.20ms. Allocated memory is still 148.9MB. Free memory was 114.3MB in the beginning and 89.3MB in the end (delta: 25.1MB). Peak memory consumption was 29.0MB. Max. memory is 16.1GB. [2024-11-08 22:57:33,111 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 148.9MB. Free memory was 121.4MB in the beginning and 121.3MB in the end (delta: 139.7kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 22:57:33,112 INFO L158 Benchmark]: CACSL2BoogieTranslator took 321.42ms. Allocated memory is still 148.9MB. Free memory was 113.9MB in the beginning and 99.8MB in the end (delta: 14.1MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-08 22:57:33,112 INFO L158 Benchmark]: Boogie Procedure Inliner took 52.60ms. Allocated memory is still 148.9MB. Free memory was 99.8MB in the beginning and 97.3MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-08 22:57:33,113 INFO L158 Benchmark]: Boogie Preprocessor took 52.10ms. Allocated memory is still 148.9MB. Free memory was 97.3MB in the beginning and 93.5MB in the end (delta: 3.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-08 22:57:33,113 INFO L158 Benchmark]: RCFGBuilder took 405.31ms. Allocated memory is still 148.9MB. Free memory was 93.5MB in the beginning and 79.6MB in the end (delta: 13.8MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-08 22:57:33,113 INFO L158 Benchmark]: TraceAbstraction took 734.54ms. Allocated memory is still 148.9MB. Free memory was 78.8MB in the beginning and 90.1MB in the end (delta: -11.3MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 22:57:33,116 INFO L158 Benchmark]: Witness Printer took 4.39ms. Allocated memory is still 148.9MB. Free memory was 90.1MB in the beginning and 89.3MB in the end (delta: 823.8kB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-08 22:57:33,119 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.19ms. Allocated memory is still 148.9MB. Free memory was 121.4MB in the beginning and 121.3MB in the end (delta: 139.7kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 321.42ms. Allocated memory is still 148.9MB. Free memory was 113.9MB in the beginning and 99.8MB in the end (delta: 14.1MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 52.60ms. Allocated memory is still 148.9MB. Free memory was 99.8MB in the beginning and 97.3MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 52.10ms. Allocated memory is still 148.9MB. Free memory was 97.3MB in the beginning and 93.5MB in the end (delta: 3.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 405.31ms. Allocated memory is still 148.9MB. Free memory was 93.5MB in the beginning and 79.6MB in the end (delta: 13.8MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * TraceAbstraction took 734.54ms. Allocated memory is still 148.9MB. Free memory was 78.8MB in the beginning and 90.1MB in the end (delta: -11.3MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 4.39ms. Allocated memory is still 148.9MB. Free memory was 90.1MB in the beginning and 89.3MB in the end (delta: 823.8kB). Peak memory consumption was 2.1MB. 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 76, overapproximation of someBinaryDOUBLEComparisonOperation at line 76. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] float var_1_1 = 2.5; [L23] float var_1_3 = 9.3; [L24] float var_1_4 = 3.4; [L25] unsigned short int var_1_5 = 32; [L26] unsigned short int var_1_9 = 1; [L27] unsigned char var_1_10 = 8; [L28] unsigned char var_1_11 = 5; [L29] unsigned char var_1_12 = 1; [L30] unsigned char var_1_13 = 1; [L31] unsigned char var_1_14 = 8; VAL [isInitial=0, var_1_10=8, var_1_11=5, var_1_12=1, var_1_13=1, var_1_14=8, var_1_1=5/2, var_1_3=93/10, var_1_4=17/5, var_1_5=32, var_1_9=1] [L80] isInitial = 1 [L81] FCALL initially() [L82] COND TRUE 1 [L83] FCALL updateLastVariables() [L84] CALL updateVariables() [L62] var_1_3 = __VERIFIER_nondet_float() [L63] CALL assume_abort_if_not((var_1_3 >= -922337.2036854765600e+13F && var_1_3 <= -1.0e-20F) || (var_1_3 <= 9223372.036854765600e+12F && var_1_3 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=8, var_1_11=5, var_1_12=1, var_1_13=1, var_1_14=8, var_1_1=5/2, var_1_4=17/5, var_1_5=32, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=8, var_1_11=5, var_1_12=1, var_1_13=1, var_1_14=8, var_1_1=5/2, var_1_4=17/5, var_1_5=32, var_1_9=1] [L63] RET assume_abort_if_not((var_1_3 >= -922337.2036854765600e+13F && var_1_3 <= -1.0e-20F) || (var_1_3 <= 9223372.036854765600e+12F && var_1_3 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=8, var_1_11=5, var_1_12=1, var_1_13=1, var_1_14=8, var_1_1=5/2, var_1_4=17/5, var_1_5=32, var_1_9=1] [L64] var_1_4 = __VERIFIER_nondet_float() [L65] CALL assume_abort_if_not((var_1_4 >= -922337.2036854776000e+13F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 9223372.036854776000e+12F && var_1_4 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=8, var_1_11=5, var_1_12=1, var_1_13=1, var_1_14=8, var_1_1=5/2, var_1_5=32, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=8, var_1_11=5, var_1_12=1, var_1_13=1, var_1_14=8, var_1_1=5/2, var_1_5=32, var_1_9=1] [L65] RET assume_abort_if_not((var_1_4 >= -922337.2036854776000e+13F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 9223372.036854776000e+12F && var_1_4 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=8, var_1_11=5, var_1_12=1, var_1_13=1, var_1_14=8, var_1_1=5/2, var_1_5=32, var_1_9=1] [L66] var_1_11 = __VERIFIER_nondet_uchar() [L67] CALL assume_abort_if_not(var_1_11 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=8, var_1_12=1, var_1_13=1, var_1_14=8, var_1_1=5/2, var_1_5=32, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=8, var_1_12=1, var_1_13=1, var_1_14=8, var_1_1=5/2, var_1_5=32, var_1_9=1] [L67] RET assume_abort_if_not(var_1_11 >= 0) VAL [isInitial=1, var_1_10=8, var_1_12=1, var_1_13=1, var_1_14=8, var_1_1=5/2, var_1_5=32, var_1_9=1] [L68] CALL assume_abort_if_not(var_1_11 <= 254) VAL [\old(cond)=1, isInitial=1, var_1_10=8, var_1_11=254, var_1_12=1, var_1_13=1, var_1_14=8, var_1_1=5/2, var_1_5=32, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=8, var_1_11=254, var_1_12=1, var_1_13=1, var_1_14=8, var_1_1=5/2, var_1_5=32, var_1_9=1] [L68] RET assume_abort_if_not(var_1_11 <= 254) VAL [isInitial=1, var_1_10=8, var_1_11=254, var_1_12=1, var_1_13=1, var_1_14=8, var_1_1=5/2, var_1_5=32, var_1_9=1] [L69] var_1_13 = __VERIFIER_nondet_uchar() [L70] CALL assume_abort_if_not(var_1_13 >= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=8, var_1_11=254, var_1_12=1, var_1_13=-255, var_1_14=8, var_1_1=5/2, var_1_5=32, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=8, var_1_11=254, var_1_12=1, var_1_13=-255, var_1_14=8, var_1_1=5/2, var_1_5=32, var_1_9=1] [L70] RET assume_abort_if_not(var_1_13 >= 1) VAL [isInitial=1, var_1_10=8, var_1_11=254, var_1_12=1, var_1_13=-255, var_1_14=8, var_1_1=5/2, var_1_5=32, var_1_9=1] [L71] CALL assume_abort_if_not(var_1_13 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=8, var_1_11=254, var_1_12=1, var_1_13=-255, var_1_14=8, var_1_1=5/2, var_1_5=32, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=8, var_1_11=254, var_1_12=1, var_1_13=-255, var_1_14=8, var_1_1=5/2, var_1_5=32, var_1_9=1] [L71] RET assume_abort_if_not(var_1_13 <= 1) VAL [isInitial=1, var_1_10=8, var_1_11=254, var_1_12=1, var_1_13=-255, var_1_14=8, var_1_1=5/2, var_1_5=32, var_1_9=1] [L84] RET updateVariables() [L85] CALL step() [L35] var_1_12 = var_1_13 [L36] var_1_14 = var_1_11 VAL [isInitial=1, var_1_10=8, var_1_11=254, var_1_12=-255, var_1_13=-255, var_1_14=254, var_1_1=5/2, var_1_5=32, var_1_9=1] [L37] COND TRUE \read(var_1_12) [L38] var_1_1 = var_1_3 VAL [isInitial=1, var_1_10=8, var_1_11=254, var_1_12=-255, var_1_13=-255, var_1_14=254, var_1_1=1275, var_1_3=1275, var_1_5=32, var_1_9=1] [L44] COND TRUE (var_1_1 + 8.125) > (var_1_1 * var_1_3) [L45] var_1_5 = (((((var_1_14 + var_1_14)) > (var_1_14)) ? ((var_1_14 + var_1_14)) : (var_1_14))) VAL [isInitial=1, var_1_10=8, var_1_11=254, var_1_12=-255, var_1_13=-255, var_1_14=254, var_1_1=1275, var_1_3=1275, var_1_5=508, var_1_9=1] [L49] signed long int stepLocal_0 = 5 * var_1_14; VAL [isInitial=1, stepLocal_0=1270, var_1_10=8, var_1_11=254, var_1_12=-255, var_1_13=-255, var_1_14=254, var_1_1=1275, var_1_3=1275, var_1_5=508, var_1_9=1] [L50] COND FALSE !(((((var_1_3) < (var_1_1)) ? (var_1_3) : (var_1_1))) == var_1_1) VAL [isInitial=1, stepLocal_0=1270, var_1_10=8, var_1_11=254, var_1_12=-255, var_1_13=-255, var_1_14=254, var_1_1=1275, var_1_3=1275, var_1_5=508, var_1_9=1] [L57] COND TRUE var_1_1 < var_1_3 [L58] var_1_10 = var_1_11 VAL [isInitial=1, stepLocal_0=1270, var_1_10=254, var_1_11=254, var_1_12=-255, var_1_13=-255, var_1_14=254, var_1_1=1275, var_1_3=1275, var_1_5=508, var_1_9=1] [L85] RET step() [L86] CALL, EXPR property() [L76-L77] return (((((var_1_12 ? (var_1_1 == ((float) var_1_3)) : ((! (var_1_3 < var_1_4)) ? (var_1_1 == ((float) ((((var_1_3) < 0 ) ? -(var_1_3) : (var_1_3))))) : 1)) && (((var_1_1 + 8.125) > (var_1_1 * var_1_3)) ? (var_1_5 == ((unsigned short int) (((((var_1_14 + var_1_14)) > (var_1_14)) ? ((var_1_14 + var_1_14)) : (var_1_14))))) : (var_1_5 == ((unsigned short int) var_1_14)))) && ((((((var_1_3) < (var_1_1)) ? (var_1_3) : (var_1_1))) == var_1_1) ? ((var_1_14 > (5 * var_1_14)) ? ((var_1_1 < (var_1_1 * 256.5f)) ? (var_1_9 == ((unsigned short int) var_1_14)) : 1) : 1) : 1)) && ((var_1_1 < var_1_3) ? (var_1_10 == ((unsigned char) var_1_11)) : 1)) && (var_1_12 == ((unsigned char) var_1_13))) && (var_1_14 == ((unsigned char) var_1_11)) ; VAL [\result=0, isInitial=1, var_1_10=254, var_1_11=254, var_1_12=-255, var_1_13=-255, var_1_14=254, var_1_1=1275, var_1_3=1275, var_1_5=508, var_1_9=1] [L86] RET, EXPR property() [L86] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, var_1_10=254, var_1_11=254, var_1_12=-255, var_1_13=-255, var_1_14=254, var_1_1=1275, var_1_3=1275, var_1_5=508, var_1_9=1] [L19] reach_error() VAL [isInitial=1, var_1_10=254, var_1_11=254, var_1_12=-255, var_1_13=-255, var_1_14=254, var_1_1=1275, var_1_3=1275, var_1_5=508, var_1_9=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 37 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 0.6s, OverallIterations: 2, TraceHistogramMax: 6, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 0 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 0 mSDsluCounter, 45 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 0 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 0 IncrementalHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 0 mSolverCounterUnsat, 45 mSDtfsCounter, 0 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 20 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=37occurred in iteration=0, InterpolantAutomatonStates: 2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 96 NumberOfCodeBlocks, 96 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 47 ConstructedInterpolants, 0 QuantifiedInterpolants, 47 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 60/60 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 22:57:33,149 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_floatingpointinfluence_has-floats_file-29.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 5c3a6cfbeb64be96bf4eacae875b7628036a7e9302f517cb52ffb38da5c714c2 --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-08 22:57:35,310 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 22:57:35,393 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-08 22:57:35,402 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 22:57:35,402 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 22:57:35,433 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 22:57:35,433 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 22:57:35,434 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 22:57:35,434 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 22:57:35,434 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 22:57:35,435 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 22:57:35,435 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 22:57:35,435 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 22:57:35,437 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 22:57:35,438 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 22:57:35,438 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 22:57:35,438 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 22:57:35,439 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 22:57:35,439 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 22:57:35,439 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 22:57:35,439 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 22:57:35,440 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 22:57:35,440 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 22:57:35,441 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-08 22:57:35,441 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-08 22:57:35,441 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 22:57:35,441 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-08 22:57:35,442 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 22:57:35,442 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 22:57:35,442 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 22:57:35,443 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 22:57:35,443 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 22:57:35,443 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 22:57:35,443 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 22:57:35,444 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 22:57:35,444 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 22:57:35,444 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 22:57:35,445 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 22:57:35,445 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-08 22:57:35,445 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-08 22:57:35,445 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 22:57:35,446 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 22:57:35,446 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 22:57:35,446 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 22:57:35,447 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 -> 5c3a6cfbeb64be96bf4eacae875b7628036a7e9302f517cb52ffb38da5c714c2 [2024-11-08 22:57:35,781 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 22:57:35,805 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 22:57:35,808 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 22:57:35,809 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 22:57:35,810 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 22:57:35,811 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-29.i [2024-11-08 22:57:37,398 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 22:57:37,634 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 22:57:37,635 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-29.i [2024-11-08 22:57:37,645 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a029e7414/2d905336bc5d4660b307a40cc9054d4a/FLAG219edfdc9 [2024-11-08 22:57:37,662 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a029e7414/2d905336bc5d4660b307a40cc9054d4a [2024-11-08 22:57:37,665 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 22:57:37,666 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 22:57:37,667 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 22:57:37,669 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 22:57:37,674 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 22:57:37,675 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 10:57:37" (1/1) ... [2024-11-08 22:57:37,675 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@266dbc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:57:37, skipping insertion in model container [2024-11-08 22:57:37,676 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 10:57:37" (1/1) ... [2024-11-08 22:57:37,702 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 22:57:37,903 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_floatingpointinfluence_has-floats_file-29.i[917,930] [2024-11-08 22:57:37,956 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 22:57:37,974 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 22:57:37,986 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_floatingpointinfluence_has-floats_file-29.i[917,930] [2024-11-08 22:57:38,009 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 22:57:38,040 INFO L204 MainTranslator]: Completed translation [2024-11-08 22:57:38,040 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:57:38 WrapperNode [2024-11-08 22:57:38,041 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 22:57:38,042 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 22:57:38,042 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 22:57:38,042 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 22:57:38,048 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:57:38" (1/1) ... [2024-11-08 22:57:38,064 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:57:38" (1/1) ... [2024-11-08 22:57:38,091 INFO L138 Inliner]: procedures = 27, calls = 19, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 78 [2024-11-08 22:57:38,095 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 22:57:38,096 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 22:57:38,096 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 22:57:38,096 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 22:57:38,107 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:57:38" (1/1) ... [2024-11-08 22:57:38,107 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:57:38" (1/1) ... [2024-11-08 22:57:38,111 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:57:38" (1/1) ... [2024-11-08 22:57:38,131 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 22:57:38,131 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:57:38" (1/1) ... [2024-11-08 22:57:38,131 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:57:38" (1/1) ... [2024-11-08 22:57:38,142 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:57:38" (1/1) ... [2024-11-08 22:57:38,145 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:57:38" (1/1) ... [2024-11-08 22:57:38,152 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:57:38" (1/1) ... [2024-11-08 22:57:38,153 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:57:38" (1/1) ... [2024-11-08 22:57:38,155 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 22:57:38,160 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 22:57:38,160 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 22:57:38,160 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 22:57:38,161 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:57:38" (1/1) ... [2024-11-08 22:57:38,166 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 22:57:38,179 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 22:57:38,194 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 22:57:38,198 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 22:57:38,244 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 22:57:38,244 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-08 22:57:38,244 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-08 22:57:38,245 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-08 22:57:38,245 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 22:57:38,245 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 22:57:38,329 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 22:57:38,333 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 22:57:42,869 INFO L? ?]: Removed 10 outVars from TransFormulas that were not future-live. [2024-11-08 22:57:42,869 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 22:57:42,880 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 22:57:42,881 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-08 22:57:42,881 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 10:57:42 BoogieIcfgContainer [2024-11-08 22:57:42,881 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 22:57:42,883 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 22:57:42,883 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 22:57:42,887 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 22:57:42,887 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 10:57:37" (1/3) ... [2024-11-08 22:57:42,888 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@74f6658e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 10:57:42, skipping insertion in model container [2024-11-08 22:57:42,888 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:57:38" (2/3) ... [2024-11-08 22:57:42,888 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@74f6658e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 10:57:42, skipping insertion in model container [2024-11-08 22:57:42,888 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 10:57:42" (3/3) ... [2024-11-08 22:57:42,889 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_floatingpointinfluence_has-floats_file-29.i [2024-11-08 22:57:42,905 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 22:57:42,905 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-08 22:57:42,967 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 22:57:42,973 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;@10ab13a3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 22:57:42,973 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 22:57:42,976 INFO L276 IsEmpty]: Start isEmpty. Operand has 37 states, 28 states have (on average 1.4285714285714286) internal successors, (40), 29 states have internal predecessors, (40), 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 22:57:42,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2024-11-08 22:57:42,984 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 22:57:42,985 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] [2024-11-08 22:57:42,986 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 22:57:42,991 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 22:57:42,991 INFO L85 PathProgramCache]: Analyzing trace with hash -1352345360, now seen corresponding path program 1 times [2024-11-08 22:57:43,004 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 22:57:43,005 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [297056749] [2024-11-08 22:57:43,005 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 22:57:43,005 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 22:57:43,005 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 22:57:43,007 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 22:57:43,033 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 22:57:43,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:57:43,325 INFO L255 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-08 22:57:43,330 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 22:57:43,369 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 22:57:43,370 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 22:57:43,371 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-08 22:57:43,371 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [297056749] [2024-11-08 22:57:43,372 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [297056749] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 22:57:43,372 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 22:57:43,372 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 22:57:43,374 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2108409203] [2024-11-08 22:57:43,374 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 22:57:43,380 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-08 22:57:43,381 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-08 22:57:43,404 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-08 22:57:43,405 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 22:57:43,407 INFO L87 Difference]: Start difference. First operand has 37 states, 28 states have (on average 1.4285714285714286) internal successors, (40), 29 states have internal predecessors, (40), 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 12.5) internal successors, (25), 2 states have internal predecessors, (25), 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 22:57:43,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 22:57:43,430 INFO L93 Difference]: Finished difference Result 67 states and 104 transitions. [2024-11-08 22:57:43,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-08 22:57:43,432 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 12.5) internal successors, (25), 2 states have internal predecessors, (25), 2 states have call successors, (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 48 [2024-11-08 22:57:43,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 22:57:43,438 INFO L225 Difference]: With dead ends: 67 [2024-11-08 22:57:43,438 INFO L226 Difference]: Without dead ends: 33 [2024-11-08 22:57:43,441 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 47 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 22:57:43,444 INFO L432 NwaCegarLoop]: 45 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, 45 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 22:57:43,445 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 22:57:43,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2024-11-08 22:57:43,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2024-11-08 22:57:43,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 25 states have (on average 1.32) internal successors, (33), 25 states have internal predecessors, (33), 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 22:57:43,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 45 transitions. [2024-11-08 22:57:43,480 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 45 transitions. Word has length 48 [2024-11-08 22:57:43,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 22:57:43,480 INFO L471 AbstractCegarLoop]: Abstraction has 33 states and 45 transitions. [2024-11-08 22:57:43,480 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 12.5) internal successors, (25), 2 states have internal predecessors, (25), 2 states have call successors, (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 22:57:43,481 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 45 transitions. [2024-11-08 22:57:43,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2024-11-08 22:57:43,483 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 22:57:43,483 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] [2024-11-08 22:57:43,492 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 22:57:43,683 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 22:57:43,684 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 22:57:43,685 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 22:57:43,685 INFO L85 PathProgramCache]: Analyzing trace with hash 1193502324, now seen corresponding path program 1 times [2024-11-08 22:57:43,686 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 22:57:43,686 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1361975741] [2024-11-08 22:57:43,686 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 22:57:43,686 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 22:57:43,687 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 22:57:43,688 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 22:57:43,689 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 22:57:43,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:57:43,917 INFO L255 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-08 22:57:43,920 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 22:57:43,991 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 22:57:43,991 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 22:57:43,991 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-08 22:57:43,992 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1361975741] [2024-11-08 22:57:43,992 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1361975741] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 22:57:43,992 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 22:57:43,992 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 22:57:43,992 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [463399403] [2024-11-08 22:57:43,993 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 22:57:43,994 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 22:57:43,994 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-08 22:57:43,996 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 22:57:43,996 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 22:57:43,997 INFO L87 Difference]: Start difference. First operand 33 states and 45 transitions. Second operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 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 22:57:45,648 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.53s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-08 22:57:47,556 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.88s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-08 22:57:51,227 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.67s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-08 22:57:53,398 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.86s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-08 22:57:53,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 22:57:53,502 INFO L93 Difference]: Finished difference Result 77 states and 106 transitions. [2024-11-08 22:57:53,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 22:57:53,507 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 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 48 [2024-11-08 22:57:53,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 22:57:53,508 INFO L225 Difference]: With dead ends: 77 [2024-11-08 22:57:53,508 INFO L226 Difference]: Without dead ends: 47 [2024-11-08 22:57:53,509 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 46 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 22:57:53,510 INFO L432 NwaCegarLoop]: 39 mSDtfsCounter, 14 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 69 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.5s IncrementalHoareTripleChecker+Time [2024-11-08 22:57:53,510 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 69 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 9.5s Time] [2024-11-08 22:57:53,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2024-11-08 22:57:53,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 39. [2024-11-08 22:57:53,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 31 states have (on average 1.3870967741935485) internal successors, (43), 31 states have internal predecessors, (43), 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 22:57:53,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 55 transitions. [2024-11-08 22:57:53,518 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 55 transitions. Word has length 48 [2024-11-08 22:57:53,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 22:57:53,519 INFO L471 AbstractCegarLoop]: Abstraction has 39 states and 55 transitions. [2024-11-08 22:57:53,520 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 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 22:57:53,520 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 55 transitions. [2024-11-08 22:57:53,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2024-11-08 22:57:53,521 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 22:57:53,521 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] [2024-11-08 22:57:53,531 INFO L540 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)] Forceful destruction successful, exit code 0 [2024-11-08 22:57:53,722 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 22:57:53,723 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 22:57:53,723 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 22:57:53,723 INFO L85 PathProgramCache]: Analyzing trace with hash 1195349366, now seen corresponding path program 1 times [2024-11-08 22:57:53,724 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 22:57:53,724 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1034081189] [2024-11-08 22:57:53,724 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 22:57:53,724 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 22:57:53,724 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 22:57:53,728 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 22:57:53,729 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 22:57:53,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:57:53,951 INFO L255 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-08 22:57:53,958 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 22:57:55,248 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-11-08 22:57:55,248 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 22:57:55,783 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2024-11-08 22:57:55,784 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-08 22:57:55,784 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1034081189] [2024-11-08 22:57:55,784 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1034081189] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 22:57:55,785 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-08 22:57:55,785 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 11 [2024-11-08 22:57:55,785 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [147332789] [2024-11-08 22:57:55,785 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-08 22:57:55,786 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-08 22:57:55,786 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-08 22:57:55,787 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-08 22:57:55,787 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2024-11-08 22:57:55,787 INFO L87 Difference]: Start difference. First operand 39 states and 55 transitions. Second operand has 11 states, 11 states have (on average 3.909090909090909) internal successors, (43), 11 states have internal predecessors, (43), 4 states have call successors, (12), 3 states have call predecessors, (12), 4 states have return successors, (12), 2 states have call predecessors, (12), 4 states have call successors, (12) [2024-11-08 22:57:58,567 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.10s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-08 22:58:00,238 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.67s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-08 22:58:02,149 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.87s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-08 22:58:04,434 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.15s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-08 22:58:07,361 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.93s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-08 22:58:10,329 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.78s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-08 22:58:12,767 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.32s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-08 22:58:12,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 22:58:12,895 INFO L93 Difference]: Finished difference Result 98 states and 130 transitions. [2024-11-08 22:58:12,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-08 22:58:12,896 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.909090909090909) internal successors, (43), 11 states have internal predecessors, (43), 4 states have call successors, (12), 3 states have call predecessors, (12), 4 states have return successors, (12), 2 states have call predecessors, (12), 4 states have call successors, (12) Word has length 48 [2024-11-08 22:58:12,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 22:58:12,898 INFO L225 Difference]: With dead ends: 98 [2024-11-08 22:58:12,898 INFO L226 Difference]: Without dead ends: 62 [2024-11-08 22:58:12,898 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 88 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=92, Invalid=180, Unknown=0, NotChecked=0, Total=272 [2024-11-08 22:58:12,899 INFO L432 NwaCegarLoop]: 30 mSDtfsCounter, 161 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 122 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 16.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 162 SdHoareTripleChecker+Valid, 98 SdHoareTripleChecker+Invalid, 138 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 122 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 16.7s IncrementalHoareTripleChecker+Time [2024-11-08 22:58:12,900 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [162 Valid, 98 Invalid, 138 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 122 Invalid, 0 Unknown, 0 Unchecked, 16.7s Time] [2024-11-08 22:58:12,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2024-11-08 22:58:12,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 43. [2024-11-08 22:58:12,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 34 states have (on average 1.3235294117647058) internal successors, (45), 34 states have internal predecessors, (45), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-08 22:58:12,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 57 transitions. [2024-11-08 22:58:12,915 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 57 transitions. Word has length 48 [2024-11-08 22:58:12,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 22:58:12,915 INFO L471 AbstractCegarLoop]: Abstraction has 43 states and 57 transitions. [2024-11-08 22:58:12,917 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.909090909090909) internal successors, (43), 11 states have internal predecessors, (43), 4 states have call successors, (12), 3 states have call predecessors, (12), 4 states have return successors, (12), 2 states have call predecessors, (12), 4 states have call successors, (12) [2024-11-08 22:58:12,917 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 57 transitions. [2024-11-08 22:58:12,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2024-11-08 22:58:12,918 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 22:58:12,919 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 22:58:12,936 INFO L540 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)] Forceful destruction successful, exit code 0 [2024-11-08 22:58:13,124 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /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 22:58:13,125 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 22:58:13,125 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 22:58:13,125 INFO L85 PathProgramCache]: Analyzing trace with hash -1398596816, now seen corresponding path program 1 times [2024-11-08 22:58:13,126 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 22:58:13,126 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1802603735] [2024-11-08 22:58:13,126 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 22:58:13,127 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 22:58:13,127 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 22:58:13,130 INFO L229 MonitoredProcess]: Starting monitored process 5 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 22:58:13,130 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 (5)] Waiting until timeout for monitored process [2024-11-08 22:58:13,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:58:13,316 INFO L255 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 20 conjuncts are in the unsatisfiable core [2024-11-08 22:58:13,322 INFO L278 TraceCheckSpWp]: Computing forward predicates...