./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 023d838f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-1.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 02ce82ba0ace3f5b040163bfedd713ab4e5a143077898ba922a6491fc85c9af7 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 08:15:16,829 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 08:15:16,910 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-10 08:15:16,915 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 08:15:16,918 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 08:15:16,949 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 08:15:16,951 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 08:15:16,951 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 08:15:16,952 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 08:15:16,953 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 08:15:16,954 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 08:15:16,954 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 08:15:16,955 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 08:15:16,957 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 08:15:16,957 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 08:15:16,957 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 08:15:16,958 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-10 08:15:16,958 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-10 08:15:16,958 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-10 08:15:16,961 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-10 08:15:16,962 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 08:15:16,962 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-10 08:15:16,963 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 08:15:16,963 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-10 08:15:16,963 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 08:15:16,964 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-10 08:15:16,964 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-10 08:15:16,964 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 08:15:16,965 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 08:15:16,965 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 08:15:16,965 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 08:15:16,965 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 08:15:16,966 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 08:15:16,966 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 08:15:16,966 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 08:15:16,967 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-10 08:15:16,967 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-10 08:15:16,967 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-10 08:15:16,967 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 08:15:16,968 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 08:15:16,968 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 08:15:16,969 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 08:15:16,970 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 -> 02ce82ba0ace3f5b040163bfedd713ab4e5a143077898ba922a6491fc85c9af7 [2024-11-10 08:15:17,237 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 08:15:17,261 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 08:15:17,264 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 08:15:17,265 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 08:15:17,266 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 08:15:17,267 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-1.i [2024-11-10 08:15:18,761 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 08:15:18,950 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 08:15:18,950 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-1.i [2024-11-10 08:15:18,959 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/44ec3ce41/e61021b7c1d34b9e86eac65f6fdeda30/FLAGec1e3c29d [2024-11-10 08:15:18,973 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/44ec3ce41/e61021b7c1d34b9e86eac65f6fdeda30 [2024-11-10 08:15:18,977 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 08:15:18,978 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 08:15:18,980 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 08:15:18,980 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 08:15:18,986 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 08:15:18,987 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 08:15:18" (1/1) ... [2024-11-10 08:15:18,988 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6c6caa2f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:15:18, skipping insertion in model container [2024-11-10 08:15:18,988 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 08:15:18" (1/1) ... [2024-11-10 08:15:19,007 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 08:15:19,177 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-1.i[914,927] [2024-11-10 08:15:19,202 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 08:15:19,212 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 08:15:19,222 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-1.i[914,927] [2024-11-10 08:15:19,232 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 08:15:19,250 INFO L204 MainTranslator]: Completed translation [2024-11-10 08:15:19,251 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:15:19 WrapperNode [2024-11-10 08:15:19,251 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 08:15:19,252 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 08:15:19,252 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 08:15:19,252 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 08:15:19,259 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:15:19" (1/1) ... [2024-11-10 08:15:19,267 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:15:19" (1/1) ... [2024-11-10 08:15:19,294 INFO L138 Inliner]: procedures = 26, calls = 23, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 77 [2024-11-10 08:15:19,294 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 08:15:19,295 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 08:15:19,295 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 08:15:19,295 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 08:15:19,304 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:15:19" (1/1) ... [2024-11-10 08:15:19,304 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:15:19" (1/1) ... [2024-11-10 08:15:19,306 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:15:19" (1/1) ... [2024-11-10 08:15:19,318 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-10 08:15:19,318 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:15:19" (1/1) ... [2024-11-10 08:15:19,318 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:15:19" (1/1) ... [2024-11-10 08:15:19,322 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:15:19" (1/1) ... [2024-11-10 08:15:19,323 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:15:19" (1/1) ... [2024-11-10 08:15:19,324 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:15:19" (1/1) ... [2024-11-10 08:15:19,325 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:15:19" (1/1) ... [2024-11-10 08:15:19,327 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 08:15:19,328 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 08:15:19,328 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 08:15:19,328 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 08:15:19,329 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:15:19" (1/1) ... [2024-11-10 08:15:19,335 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 08:15:19,346 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 08:15:19,364 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-10 08:15:19,370 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-10 08:15:19,419 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 08:15:19,419 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-10 08:15:19,419 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-10 08:15:19,419 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-10 08:15:19,419 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 08:15:19,420 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 08:15:19,500 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 08:15:19,503 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 08:15:19,699 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2024-11-10 08:15:19,700 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 08:15:19,715 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 08:15:19,718 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 08:15:19,718 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 08:15:19 BoogieIcfgContainer [2024-11-10 08:15:19,719 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 08:15:19,722 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 08:15:19,723 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 08:15:19,727 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 08:15:19,727 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 08:15:18" (1/3) ... [2024-11-10 08:15:19,729 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@54cf0db7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 08:15:19, skipping insertion in model container [2024-11-10 08:15:19,729 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:15:19" (2/3) ... [2024-11-10 08:15:19,731 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@54cf0db7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 08:15:19, skipping insertion in model container [2024-11-10 08:15:19,731 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 08:15:19" (3/3) ... [2024-11-10 08:15:19,732 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount10_file-1.i [2024-11-10 08:15:19,752 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 08:15:19,752 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-10 08:15:19,901 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 08:15:19,915 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;@3585b9b4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 08:15:19,948 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-10 08:15:19,955 INFO L276 IsEmpty]: Start isEmpty. Operand has 39 states, 26 states have (on average 1.2307692307692308) internal successors, (32), 27 states have internal predecessors, (32), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-11-10 08:15:19,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2024-11-10 08:15:19,976 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 08:15:19,977 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 08:15:19,978 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 08:15:19,985 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 08:15:19,986 INFO L85 PathProgramCache]: Analyzing trace with hash -621264280, now seen corresponding path program 1 times [2024-11-10 08:15:19,995 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 08:15:19,996 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [223937004] [2024-11-10 08:15:19,996 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 08:15:19,996 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 08:15:20,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:15:20,204 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 08:15:20,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:15:20,215 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-10 08:15:20,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:15:20,221 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-10 08:15:20,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:15:20,227 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-10 08:15:20,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:15:20,232 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-10 08:15:20,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:15:20,237 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-10 08:15:20,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:15:20,243 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-10 08:15:20,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:15:20,248 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-10 08:15:20,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:15:20,254 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-10 08:15:20,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:15:20,260 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-10 08:15:20,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:15:20,267 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2024-11-10 08:15:20,267 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 08:15:20,268 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [223937004] [2024-11-10 08:15:20,268 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [223937004] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 08:15:20,268 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 08:15:20,269 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 08:15:20,270 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [195571972] [2024-11-10 08:15:20,271 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 08:15:20,275 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-10 08:15:20,275 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 08:15:20,302 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-10 08:15:20,303 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 08:15:20,305 INFO L87 Difference]: Start difference. First operand has 39 states, 26 states have (on average 1.2307692307692308) internal successors, (32), 27 states have internal predecessors, (32), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) 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, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 2 states have call successors, (10) [2024-11-10 08:15:20,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 08:15:20,323 INFO L93 Difference]: Finished difference Result 70 states and 107 transitions. [2024-11-10 08:15:20,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-10 08:15:20,326 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, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 2 states have call successors, (10) Word has length 68 [2024-11-10 08:15:20,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 08:15:20,330 INFO L225 Difference]: With dead ends: 70 [2024-11-10 08:15:20,331 INFO L226 Difference]: Without dead ends: 34 [2024-11-10 08:15:20,333 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 32 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-10 08:15:20,336 INFO L432 NwaCegarLoop]: 44 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, 44 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-10 08:15:20,337 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 08:15:20,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2024-11-10 08:15:20,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2024-11-10 08:15:20,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 22 states have (on average 1.0909090909090908) internal successors, (24), 22 states have internal predecessors, (24), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-11-10 08:15:20,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 44 transitions. [2024-11-10 08:15:20,370 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 44 transitions. Word has length 68 [2024-11-10 08:15:20,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 08:15:20,371 INFO L471 AbstractCegarLoop]: Abstraction has 34 states and 44 transitions. [2024-11-10 08:15:20,371 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, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 2 states have call successors, (10) [2024-11-10 08:15:20,371 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 44 transitions. [2024-11-10 08:15:20,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2024-11-10 08:15:20,373 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 08:15:20,373 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 08:15:20,374 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-10 08:15:20,374 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 08:15:20,375 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 08:15:20,375 INFO L85 PathProgramCache]: Analyzing trace with hash 311612518, now seen corresponding path program 1 times [2024-11-10 08:15:20,375 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 08:15:20,376 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [372849632] [2024-11-10 08:15:20,376 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 08:15:20,376 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 08:15:20,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 08:15:20,513 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 08:15:20,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 08:15:20,646 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 08:15:20,647 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-10 08:15:20,649 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-10 08:15:20,651 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-10 08:15:20,654 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1] [2024-11-10 08:15:20,730 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-10 08:15:20,735 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.11 08:15:20 BoogieIcfgContainer [2024-11-10 08:15:20,735 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-10 08:15:20,736 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-10 08:15:20,736 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-10 08:15:20,737 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-10 08:15:20,738 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 08:15:19" (3/4) ... [2024-11-10 08:15:20,740 INFO L146 WitnessPrinter]: No result that supports witness generation found [2024-11-10 08:15:20,741 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-10 08:15:20,743 INFO L158 Benchmark]: Toolchain (without parser) took 1763.64ms. Allocated memory is still 163.6MB. Free memory was 107.7MB in the beginning and 91.2MB in the end (delta: 16.5MB). Peak memory consumption was 16.5MB. Max. memory is 16.1GB. [2024-11-10 08:15:20,743 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 163.6MB. Free memory is still 122.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 08:15:20,743 INFO L158 Benchmark]: CACSL2BoogieTranslator took 271.41ms. Allocated memory is still 163.6MB. Free memory was 107.3MB in the beginning and 94.0MB in the end (delta: 13.4MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-10 08:15:20,744 INFO L158 Benchmark]: Boogie Procedure Inliner took 42.29ms. Allocated memory is still 163.6MB. Free memory was 94.0MB in the beginning and 92.2MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-10 08:15:20,745 INFO L158 Benchmark]: Boogie Preprocessor took 32.11ms. Allocated memory is still 163.6MB. Free memory was 92.2MB in the beginning and 90.6MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-10 08:15:20,745 INFO L158 Benchmark]: IcfgBuilder took 391.77ms. Allocated memory is still 163.6MB. Free memory was 90.2MB in the beginning and 77.2MB in the end (delta: 13.0MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-10 08:15:20,748 INFO L158 Benchmark]: TraceAbstraction took 1013.89ms. Allocated memory is still 163.6MB. Free memory was 76.7MB in the beginning and 92.1MB in the end (delta: -15.4MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 08:15:20,748 INFO L158 Benchmark]: Witness Printer took 4.99ms. Allocated memory is still 163.6MB. Free memory was 92.1MB in the beginning and 91.2MB in the end (delta: 824.8kB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-10 08:15:20,754 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.20ms. Allocated memory is still 163.6MB. Free memory is still 122.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 271.41ms. Allocated memory is still 163.6MB. Free memory was 107.3MB in the beginning and 94.0MB in the end (delta: 13.4MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 42.29ms. Allocated memory is still 163.6MB. Free memory was 94.0MB in the beginning and 92.2MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 32.11ms. Allocated memory is still 163.6MB. Free memory was 92.2MB in the beginning and 90.6MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * IcfgBuilder took 391.77ms. Allocated memory is still 163.6MB. Free memory was 90.2MB in the beginning and 77.2MB in the end (delta: 13.0MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * TraceAbstraction took 1013.89ms. Allocated memory is still 163.6MB. Free memory was 76.7MB in the beginning and 92.1MB in the end (delta: -15.4MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 4.99ms. Allocated memory is still 163.6MB. Free memory was 92.1MB in the beginning and 91.2MB in the end (delta: 824.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 63, overapproximation of someUnaryFLOAToperation at line 39. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] float var_1_1 = 9.8; [L23] float var_1_2 = 10.375; [L24] float var_1_4 = 256.2; [L25] unsigned long int var_1_5 = 8; [L26] unsigned long int var_1_6 = 3674304896; [L27] unsigned long int var_1_7 = 8; [L28] unsigned char var_1_8 = 0; [L29] unsigned char var_1_9 = 0; [L30] signed short int var_1_10 = -25; [L31] signed short int var_1_11 = -5; VAL [isInitial=0, var_1_10=-25, var_1_11=-5, var_1_1=49/5, var_1_2=83/8, var_1_4=1281/5, var_1_5=8, var_1_6=3674304896, var_1_7=8, var_1_8=0, var_1_9=0] [L67] isInitial = 1 [L68] FCALL initially() [L69] COND TRUE 1 [L70] FCALL updateLastVariables() [L71] CALL updateVariables() [L43] var_1_2 = __VERIFIER_nondet_float() [L44] CALL assume_abort_if_not((var_1_2 >= -922337.2036854776000e+13F && var_1_2 <= -1.0e-20F) || (var_1_2 <= 9223372.036854776000e+12F && var_1_2 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=-25, var_1_11=-5, var_1_1=49/5, var_1_4=1281/5, var_1_5=8, var_1_6=3674304896, var_1_7=8, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-25, var_1_11=-5, var_1_1=49/5, var_1_4=1281/5, var_1_5=8, var_1_6=3674304896, var_1_7=8, var_1_8=0, var_1_9=0] [L44] RET assume_abort_if_not((var_1_2 >= -922337.2036854776000e+13F && var_1_2 <= -1.0e-20F) || (var_1_2 <= 9223372.036854776000e+12F && var_1_2 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=-25, var_1_11=-5, var_1_1=49/5, var_1_4=1281/5, var_1_5=8, var_1_6=3674304896, var_1_7=8, var_1_8=0, var_1_9=0] [L45] var_1_4 = __VERIFIER_nondet_float() [L46] CALL assume_abort_if_not((var_1_4 >= -922337.2036854765600e+13F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 9223372.036854765600e+12F && var_1_4 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=-25, var_1_11=-5, var_1_1=49/5, var_1_5=8, var_1_6=3674304896, var_1_7=8, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-25, var_1_11=-5, var_1_1=49/5, var_1_5=8, var_1_6=3674304896, var_1_7=8, var_1_8=0, var_1_9=0] [L46] RET assume_abort_if_not((var_1_4 >= -922337.2036854765600e+13F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 9223372.036854765600e+12F && var_1_4 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=-25, var_1_11=-5, var_1_1=49/5, var_1_5=8, var_1_6=3674304896, var_1_7=8, var_1_8=0, var_1_9=0] [L47] var_1_6 = __VERIFIER_nondet_ulong() [L48] CALL assume_abort_if_not(var_1_6 >= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_10=-25, var_1_11=-5, var_1_1=49/5, var_1_5=8, var_1_6=2147483647, var_1_7=8, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-25, var_1_11=-5, var_1_1=49/5, var_1_5=8, var_1_6=2147483647, var_1_7=8, var_1_8=0, var_1_9=0] [L48] RET assume_abort_if_not(var_1_6 >= 2147483647) VAL [isInitial=1, var_1_10=-25, var_1_11=-5, var_1_1=49/5, var_1_5=8, var_1_6=2147483647, var_1_7=8, var_1_8=0, var_1_9=0] [L49] CALL assume_abort_if_not(var_1_6 <= 4294967294) VAL [\old(cond)=1, isInitial=1, var_1_10=-25, var_1_11=-5, var_1_1=49/5, var_1_5=8, var_1_6=2147483647, var_1_7=8, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-25, var_1_11=-5, var_1_1=49/5, var_1_5=8, var_1_6=2147483647, var_1_7=8, var_1_8=0, var_1_9=0] [L49] RET assume_abort_if_not(var_1_6 <= 4294967294) VAL [isInitial=1, var_1_10=-25, var_1_11=-5, var_1_1=49/5, var_1_5=8, var_1_6=2147483647, var_1_7=8, var_1_8=0, var_1_9=0] [L50] var_1_7 = __VERIFIER_nondet_ulong() [L51] CALL assume_abort_if_not(var_1_7 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=-25, var_1_11=-5, var_1_1=49/5, var_1_5=8, var_1_6=2147483647, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-25, var_1_11=-5, var_1_1=49/5, var_1_5=8, var_1_6=2147483647, var_1_8=0, var_1_9=0] [L51] RET assume_abort_if_not(var_1_7 >= 0) VAL [isInitial=1, var_1_10=-25, var_1_11=-5, var_1_1=49/5, var_1_5=8, var_1_6=2147483647, var_1_8=0, var_1_9=0] [L52] CALL assume_abort_if_not(var_1_7 <= 4294967294) VAL [\old(cond)=1, isInitial=1, var_1_10=-25, var_1_11=-5, var_1_1=49/5, var_1_5=8, var_1_6=2147483647, var_1_7=2147483147, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-25, var_1_11=-5, var_1_1=49/5, var_1_5=8, var_1_6=2147483647, var_1_7=2147483147, var_1_8=0, var_1_9=0] [L52] RET assume_abort_if_not(var_1_7 <= 4294967294) VAL [isInitial=1, var_1_10=-25, var_1_11=-5, var_1_1=49/5, var_1_5=8, var_1_6=2147483647, var_1_7=2147483147, var_1_8=0, var_1_9=0] [L53] var_1_9 = __VERIFIER_nondet_uchar() [L54] CALL assume_abort_if_not(var_1_9 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=-25, var_1_11=-5, var_1_1=49/5, var_1_5=8, var_1_6=2147483647, var_1_7=2147483147, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-25, var_1_11=-5, var_1_1=49/5, var_1_5=8, var_1_6=2147483647, var_1_7=2147483147, var_1_8=0] [L54] RET assume_abort_if_not(var_1_9 >= 0) VAL [isInitial=1, var_1_10=-25, var_1_11=-5, var_1_1=49/5, var_1_5=8, var_1_6=2147483647, var_1_7=2147483147, var_1_8=0] [L55] CALL assume_abort_if_not(var_1_9 <= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=-25, var_1_11=-5, var_1_1=49/5, var_1_5=8, var_1_6=2147483647, var_1_7=2147483147, var_1_8=0, var_1_9=-256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-25, var_1_11=-5, var_1_1=49/5, var_1_5=8, var_1_6=2147483647, var_1_7=2147483147, var_1_8=0, var_1_9=-256] [L55] RET assume_abort_if_not(var_1_9 <= 0) VAL [isInitial=1, var_1_10=-25, var_1_11=-5, var_1_1=49/5, var_1_5=8, var_1_6=2147483647, var_1_7=2147483147, var_1_8=0, var_1_9=-256] [L56] var_1_11 = __VERIFIER_nondet_short() [L57] CALL assume_abort_if_not(var_1_11 >= -32767) VAL [\old(cond)=1, isInitial=1, var_1_10=-25, var_1_11=32766, var_1_1=49/5, var_1_5=8, var_1_6=2147483647, var_1_7=2147483147, var_1_8=0, var_1_9=-256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-25, var_1_11=32766, var_1_1=49/5, var_1_5=8, var_1_6=2147483647, var_1_7=2147483147, var_1_8=0, var_1_9=-256] [L57] RET assume_abort_if_not(var_1_11 >= -32767) VAL [isInitial=1, var_1_10=-25, var_1_11=32766, var_1_1=49/5, var_1_5=8, var_1_6=2147483647, var_1_7=2147483147, var_1_8=0, var_1_9=-256] [L58] CALL assume_abort_if_not(var_1_11 <= 32766) VAL [\old(cond)=1, isInitial=1, var_1_10=-25, var_1_11=32766, var_1_1=49/5, var_1_5=8, var_1_6=2147483647, var_1_7=2147483147, var_1_8=0, var_1_9=-256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-25, var_1_11=32766, var_1_1=49/5, var_1_5=8, var_1_6=2147483647, var_1_7=2147483147, var_1_8=0, var_1_9=-256] [L58] RET assume_abort_if_not(var_1_11 <= 32766) VAL [isInitial=1, var_1_10=-25, var_1_11=32766, var_1_1=49/5, var_1_5=8, var_1_6=2147483647, var_1_7=2147483147, var_1_8=0, var_1_9=-256] [L71] RET updateVariables() [L72] CALL step() [L35] var_1_5 = (((((var_1_6 - 500u)) < (var_1_7)) ? ((var_1_6 - 500u)) : (var_1_7))) [L36] var_1_8 = var_1_9 [L37] var_1_10 = var_1_11 VAL [isInitial=1, var_1_10=32766, var_1_11=32766, var_1_1=49/5, var_1_5=2147483147, var_1_6=2147483647, var_1_7=2147483147, var_1_8=-256, var_1_9=-256] [L38] COND TRUE (var_1_2 <= 8.75f) || var_1_8 [L39] var_1_1 = ((((var_1_4) < 0 ) ? -(var_1_4) : (var_1_4))) VAL [isInitial=1, var_1_10=32766, var_1_11=32766, var_1_1=3674304901, var_1_4=3674304901, var_1_5=2147483147, var_1_6=2147483647, var_1_7=2147483147, var_1_8=-256, var_1_9=-256] [L72] RET step() [L73] CALL, EXPR property() [L63-L64] return (((((var_1_2 <= 8.75f) || var_1_8) ? (var_1_1 == ((float) ((((var_1_4) < 0 ) ? -(var_1_4) : (var_1_4))))) : 1) && (var_1_5 == ((unsigned long int) (((((var_1_6 - 500u)) < (var_1_7)) ? ((var_1_6 - 500u)) : (var_1_7)))))) && (var_1_8 == ((unsigned char) var_1_9))) && (var_1_10 == ((signed short int) var_1_11)) ; VAL [\result=0, isInitial=1, var_1_10=32766, var_1_11=32766, var_1_1=3674304901, var_1_4=3674304901, var_1_5=2147483147, var_1_6=2147483647, var_1_7=2147483147, var_1_8=-256, var_1_9=-256] [L73] RET, EXPR property() [L73] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, var_1_10=32766, var_1_11=32766, var_1_1=3674304901, var_1_4=3674304901, var_1_5=2147483147, var_1_6=2147483647, var_1_7=2147483147, var_1_8=-256, var_1_9=-256] [L19] reach_error() VAL [isInitial=1, var_1_10=32766, var_1_11=32766, var_1_1=3674304901, var_1_4=3674304901, var_1_5=2147483147, var_1_6=2147483647, var_1_7=2147483147, var_1_8=-256, var_1_9=-256] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 39 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 0.8s, OverallIterations: 2, TraceHistogramMax: 10, 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, 44 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, 44 mSDtfsCounter, 0 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 32 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=39occurred 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, 136 NumberOfCodeBlocks, 136 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 67 ConstructedInterpolants, 0 QuantifiedInterpolants, 67 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 180/180 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-10 08:15:20,806 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-1.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 02ce82ba0ace3f5b040163bfedd713ab4e5a143077898ba922a6491fc85c9af7 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 08:15:23,076 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 08:15:23,158 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-10 08:15:23,163 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 08:15:23,165 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 08:15:23,199 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 08:15:23,200 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 08:15:23,200 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 08:15:23,201 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 08:15:23,201 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 08:15:23,202 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 08:15:23,202 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 08:15:23,203 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 08:15:23,203 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 08:15:23,204 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 08:15:23,204 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 08:15:23,205 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-10 08:15:23,205 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-10 08:15:23,205 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-10 08:15:23,206 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 08:15:23,206 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-10 08:15:23,210 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 08:15:23,210 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-10 08:15:23,210 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-10 08:15:23,210 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-10 08:15:23,211 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 08:15:23,211 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-10 08:15:23,211 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-10 08:15:23,211 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-10 08:15:23,211 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 08:15:23,212 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 08:15:23,212 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 08:15:23,212 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 08:15:23,212 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 08:15:23,213 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 08:15:23,214 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 08:15:23,215 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 08:15:23,215 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-10 08:15:23,216 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-10 08:15:23,216 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-10 08:15:23,216 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 08:15:23,216 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 08:15:23,217 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 08:15:23,217 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 08:15:23,217 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 -> 02ce82ba0ace3f5b040163bfedd713ab4e5a143077898ba922a6491fc85c9af7 [2024-11-10 08:15:23,567 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 08:15:23,590 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 08:15:23,594 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 08:15:23,595 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 08:15:23,595 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 08:15:23,596 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-1.i [2024-11-10 08:15:25,137 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 08:15:25,348 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 08:15:25,350 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-1.i [2024-11-10 08:15:25,361 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/37d2c9c3f/bbe6d6ae1b8240b78ea30513f2071328/FLAG488acb9d2 [2024-11-10 08:15:25,380 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/37d2c9c3f/bbe6d6ae1b8240b78ea30513f2071328 [2024-11-10 08:15:25,384 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 08:15:25,386 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 08:15:25,387 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 08:15:25,387 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 08:15:25,392 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 08:15:25,395 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 08:15:25" (1/1) ... [2024-11-10 08:15:25,396 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6ca4c43f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:15:25, skipping insertion in model container [2024-11-10 08:15:25,397 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 08:15:25" (1/1) ... [2024-11-10 08:15:25,420 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 08:15:25,622 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-1.i[914,927] [2024-11-10 08:15:25,660 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 08:15:25,678 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 08:15:25,690 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-1.i[914,927] [2024-11-10 08:15:25,708 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 08:15:25,732 INFO L204 MainTranslator]: Completed translation [2024-11-10 08:15:25,733 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:15:25 WrapperNode [2024-11-10 08:15:25,733 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 08:15:25,734 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 08:15:25,734 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 08:15:25,734 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 08:15:25,741 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:15:25" (1/1) ... [2024-11-10 08:15:25,752 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:15:25" (1/1) ... [2024-11-10 08:15:25,776 INFO L138 Inliner]: procedures = 27, calls = 23, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 76 [2024-11-10 08:15:25,777 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 08:15:25,779 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 08:15:25,779 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 08:15:25,779 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 08:15:25,788 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:15:25" (1/1) ... [2024-11-10 08:15:25,789 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:15:25" (1/1) ... [2024-11-10 08:15:25,795 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:15:25" (1/1) ... [2024-11-10 08:15:25,816 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-10 08:15:25,816 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:15:25" (1/1) ... [2024-11-10 08:15:25,816 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:15:25" (1/1) ... [2024-11-10 08:15:25,828 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:15:25" (1/1) ... [2024-11-10 08:15:25,829 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:15:25" (1/1) ... [2024-11-10 08:15:25,832 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:15:25" (1/1) ... [2024-11-10 08:15:25,834 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:15:25" (1/1) ... [2024-11-10 08:15:25,836 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 08:15:25,837 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 08:15:25,837 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 08:15:25,837 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 08:15:25,838 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:15:25" (1/1) ... [2024-11-10 08:15:25,843 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 08:15:25,856 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 08:15:25,873 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-10 08:15:25,879 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-10 08:15:25,924 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 08:15:25,924 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-10 08:15:25,924 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-10 08:15:25,924 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-10 08:15:25,925 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 08:15:25,926 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 08:15:26,000 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 08:15:26,003 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 08:15:26,204 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2024-11-10 08:15:26,205 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 08:15:26,220 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 08:15:26,220 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 08:15:26,221 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 08:15:26 BoogieIcfgContainer [2024-11-10 08:15:26,221 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 08:15:26,223 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 08:15:26,223 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 08:15:26,227 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 08:15:26,227 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 08:15:25" (1/3) ... [2024-11-10 08:15:26,229 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@b8f75b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 08:15:26, skipping insertion in model container [2024-11-10 08:15:26,229 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:15:25" (2/3) ... [2024-11-10 08:15:26,229 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@b8f75b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 08:15:26, skipping insertion in model container [2024-11-10 08:15:26,229 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 08:15:26" (3/3) ... [2024-11-10 08:15:26,231 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount10_file-1.i [2024-11-10 08:15:26,250 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 08:15:26,250 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-10 08:15:26,328 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 08:15:26,336 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;@1d69f101, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 08:15:26,337 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-10 08:15:26,341 INFO L276 IsEmpty]: Start isEmpty. Operand has 39 states, 26 states have (on average 1.2307692307692308) internal successors, (32), 27 states have internal predecessors, (32), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-11-10 08:15:26,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2024-11-10 08:15:26,352 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 08:15:26,352 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 08:15:26,353 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 08:15:26,359 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 08:15:26,359 INFO L85 PathProgramCache]: Analyzing trace with hash -621264280, now seen corresponding path program 1 times [2024-11-10 08:15:26,373 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 08:15:26,374 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [311795194] [2024-11-10 08:15:26,374 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 08:15:26,374 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-10 08:15:26,375 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 08:15:26,378 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-10 08:15:26,380 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-10 08:15:26,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:15:26,590 INFO L255 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-10 08:15:26,601 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 08:15:26,639 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 162 trivial. 0 not checked. [2024-11-10 08:15:26,639 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 08:15:26,640 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 08:15:26,640 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [311795194] [2024-11-10 08:15:26,641 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [311795194] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 08:15:26,642 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 08:15:26,642 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 08:15:26,644 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1812555158] [2024-11-10 08:15:26,644 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 08:15:26,649 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-10 08:15:26,649 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 08:15:26,672 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-10 08:15:26,673 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 08:15:26,675 INFO L87 Difference]: Start difference. First operand has 39 states, 26 states have (on average 1.2307692307692308) internal successors, (32), 27 states have internal predecessors, (32), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand has 2 states, 2 states have (on average 11.5) internal successors, (23), 2 states have internal predecessors, (23), 1 states have call successors, (10), 1 states have call predecessors, (10), 2 states have return successors, (10), 2 states have call predecessors, (10), 1 states have call successors, (10) [2024-11-10 08:15:26,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 08:15:26,699 INFO L93 Difference]: Finished difference Result 70 states and 107 transitions. [2024-11-10 08:15:26,701 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-10 08:15:26,703 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 11.5) internal successors, (23), 2 states have internal predecessors, (23), 1 states have call successors, (10), 1 states have call predecessors, (10), 2 states have return successors, (10), 2 states have call predecessors, (10), 1 states have call successors, (10) Word has length 68 [2024-11-10 08:15:26,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 08:15:26,709 INFO L225 Difference]: With dead ends: 70 [2024-11-10 08:15:26,710 INFO L226 Difference]: Without dead ends: 34 [2024-11-10 08:15:26,714 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 67 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-10 08:15:26,719 INFO L432 NwaCegarLoop]: 44 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, 44 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-10 08:15:26,720 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 08:15:26,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2024-11-10 08:15:26,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2024-11-10 08:15:26,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 22 states have (on average 1.0909090909090908) internal successors, (24), 22 states have internal predecessors, (24), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-11-10 08:15:26,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 44 transitions. [2024-11-10 08:15:26,756 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 44 transitions. Word has length 68 [2024-11-10 08:15:26,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 08:15:26,756 INFO L471 AbstractCegarLoop]: Abstraction has 34 states and 44 transitions. [2024-11-10 08:15:26,757 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 11.5) internal successors, (23), 2 states have internal predecessors, (23), 1 states have call successors, (10), 1 states have call predecessors, (10), 2 states have return successors, (10), 2 states have call predecessors, (10), 1 states have call successors, (10) [2024-11-10 08:15:26,757 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 44 transitions. [2024-11-10 08:15:26,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2024-11-10 08:15:26,759 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 08:15:26,759 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 08:15:26,767 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-10 08:15:26,963 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-10 08:15:26,964 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 08:15:26,965 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 08:15:26,965 INFO L85 PathProgramCache]: Analyzing trace with hash 311612518, now seen corresponding path program 1 times [2024-11-10 08:15:26,966 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 08:15:26,966 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [196884391] [2024-11-10 08:15:26,967 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 08:15:26,967 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-10 08:15:26,967 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 08:15:26,969 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-10 08:15:26,970 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-10 08:15:27,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:15:27,148 INFO L255 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-10 08:15:27,154 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 08:15:33,360 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 43 proven. 24 refuted. 0 times theorem prover too weak. 113 trivial. 0 not checked. [2024-11-10 08:15:33,360 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 08:15:37,642 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 3 proven. 24 refuted. 0 times theorem prover too weak. 153 trivial. 0 not checked. [2024-11-10 08:15:37,643 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 08:15:37,643 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [196884391] [2024-11-10 08:15:37,643 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [196884391] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 08:15:37,643 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-10 08:15:37,643 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 16 [2024-11-10 08:15:37,644 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1831435658] [2024-11-10 08:15:37,644 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-10 08:15:37,645 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-10 08:15:37,645 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 08:15:37,647 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-10 08:15:37,647 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=181, Unknown=0, NotChecked=0, Total=240 [2024-11-10 08:15:37,648 INFO L87 Difference]: Start difference. First operand 34 states and 44 transitions. Second operand has 16 states, 16 states have (on average 2.4375) internal successors, (39), 16 states have internal predecessors, (39), 3 states have call successors, (18), 2 states have call predecessors, (18), 4 states have return successors, (19), 3 states have call predecessors, (19), 3 states have call successors, (19) [2024-11-10 08:15:38,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 08:15:38,975 INFO L93 Difference]: Finished difference Result 65 states and 74 transitions. [2024-11-10 08:15:38,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-10 08:15:38,976 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.4375) internal successors, (39), 16 states have internal predecessors, (39), 3 states have call successors, (18), 2 states have call predecessors, (18), 4 states have return successors, (19), 3 states have call predecessors, (19), 3 states have call successors, (19) Word has length 68 [2024-11-10 08:15:38,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 08:15:38,980 INFO L225 Difference]: With dead ends: 65 [2024-11-10 08:15:38,981 INFO L226 Difference]: Without dead ends: 62 [2024-11-10 08:15:38,982 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 120 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=153, Invalid=447, Unknown=0, NotChecked=0, Total=600 [2024-11-10 08:15:38,983 INFO L432 NwaCegarLoop]: 35 mSDtfsCounter, 64 mSDsluCounter, 140 mSDsCounter, 0 mSdLazyCounter, 224 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 175 SdHoareTripleChecker+Invalid, 232 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 224 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-10 08:15:38,984 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 175 Invalid, 232 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 224 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-10 08:15:38,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2024-11-10 08:15:39,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 49. [2024-11-10 08:15:39,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 34 states have (on average 1.0588235294117647) internal successors, (36), 35 states have internal predecessors, (36), 11 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (11), 10 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-10 08:15:39,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 58 transitions. [2024-11-10 08:15:39,004 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 58 transitions. Word has length 68 [2024-11-10 08:15:39,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 08:15:39,005 INFO L471 AbstractCegarLoop]: Abstraction has 49 states and 58 transitions. [2024-11-10 08:15:39,005 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.4375) internal successors, (39), 16 states have internal predecessors, (39), 3 states have call successors, (18), 2 states have call predecessors, (18), 4 states have return successors, (19), 3 states have call predecessors, (19), 3 states have call successors, (19) [2024-11-10 08:15:39,006 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 58 transitions. [2024-11-10 08:15:39,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2024-11-10 08:15:39,009 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 08:15:39,009 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 08:15:39,018 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-11-10 08:15:39,209 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-10 08:15:39,210 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 08:15:39,211 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 08:15:39,211 INFO L85 PathProgramCache]: Analyzing trace with hash 340241669, now seen corresponding path program 1 times [2024-11-10 08:15:39,211 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 08:15:39,212 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1833332765] [2024-11-10 08:15:39,212 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 08:15:39,212 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-10 08:15:39,212 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 08:15:39,213 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-10 08:15:39,215 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-10 08:15:39,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:15:39,335 INFO L255 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-10 08:15:39,348 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 08:15:41,391 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 79 proven. 6 refuted. 0 times theorem prover too weak. 95 trivial. 0 not checked. [2024-11-10 08:15:41,392 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 08:15:42,608 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 21 proven. 6 refuted. 0 times theorem prover too weak. 153 trivial. 0 not checked. [2024-11-10 08:15:42,608 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 08:15:42,609 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1833332765] [2024-11-10 08:15:42,609 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1833332765] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 08:15:42,609 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-10 08:15:42,609 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 13 [2024-11-10 08:15:42,609 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1785626760] [2024-11-10 08:15:42,610 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-10 08:15:42,610 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-10 08:15:42,610 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 08:15:42,611 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-10 08:15:42,613 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2024-11-10 08:15:42,613 INFO L87 Difference]: Start difference. First operand 49 states and 58 transitions. Second operand has 13 states, 13 states have (on average 2.5384615384615383) internal successors, (33), 13 states have internal predecessors, (33), 2 states have call successors, (12), 2 states have call predecessors, (12), 4 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-11-10 08:15:42,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 08:15:42,987 INFO L93 Difference]: Finished difference Result 68 states and 76 transitions. [2024-11-10 08:15:42,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-10 08:15:42,987 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.5384615384615383) internal successors, (33), 13 states have internal predecessors, (33), 2 states have call successors, (12), 2 states have call predecessors, (12), 4 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 68 [2024-11-10 08:15:42,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 08:15:42,988 INFO L225 Difference]: With dead ends: 68 [2024-11-10 08:15:42,988 INFO L226 Difference]: Without dead ends: 0 [2024-11-10 08:15:42,989 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 122 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=100, Invalid=320, Unknown=0, NotChecked=0, Total=420 [2024-11-10 08:15:42,990 INFO L432 NwaCegarLoop]: 39 mSDtfsCounter, 54 mSDsluCounter, 210 mSDsCounter, 0 mSdLazyCounter, 226 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 249 SdHoareTripleChecker+Invalid, 241 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 226 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 08:15:42,990 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 249 Invalid, 241 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 226 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 08:15:42,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-10 08:15:42,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-10 08:15:42,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 08:15:42,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-10 08:15:42,992 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 68 [2024-11-10 08:15:42,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 08:15:42,992 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-10 08:15:42,992 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.5384615384615383) internal successors, (33), 13 states have internal predecessors, (33), 2 states have call successors, (12), 2 states have call predecessors, (12), 4 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-11-10 08:15:42,992 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-10 08:15:42,992 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-10 08:15:42,995 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-10 08:15:43,003 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-10 08:15:43,195 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-10 08:15:43,199 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2024-11-10 08:15:43,202 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-11-10 08:15:44,337 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-10 08:15:44,354 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: currentRoundingMode [2024-11-10 08:15:44,355 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: currentRoundingMode [2024-11-10 08:15:44,355 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: currentRoundingMode [2024-11-10 08:15:44,355 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: currentRoundingMode [2024-11-10 08:15:44,356 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: currentRoundingMode [2024-11-10 08:15:44,356 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: currentRoundingMode [2024-11-10 08:15:44,356 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: currentRoundingMode [2024-11-10 08:15:44,356 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: currentRoundingMode [2024-11-10 08:15:44,361 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.11 08:15:44 BoogieIcfgContainer [2024-11-10 08:15:44,361 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-10 08:15:44,365 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-10 08:15:44,365 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-10 08:15:44,365 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-10 08:15:44,366 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 08:15:26" (3/4) ... [2024-11-10 08:15:44,368 INFO L143 WitnessPrinter]: Generating witness for correct program [2024-11-10 08:15:44,380 INFO L393 IcfgBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2024-11-10 08:15:44,383 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 21 nodes and edges [2024-11-10 08:15:44,384 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 8 nodes and edges [2024-11-10 08:15:44,384 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-11-10 08:15:44,384 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-10 08:15:44,479 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-10 08:15:44,480 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-10 08:15:44,480 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-10 08:15:44,481 INFO L158 Benchmark]: Toolchain (without parser) took 19095.41ms. Allocated memory was 77.6MB in the beginning and 469.8MB in the end (delta: 392.2MB). Free memory was 44.3MB in the beginning and 382.7MB in the end (delta: -338.4MB). Peak memory consumption was 53.4MB. Max. memory is 16.1GB. [2024-11-10 08:15:44,481 INFO L158 Benchmark]: CDTParser took 1.12ms. Allocated memory is still 56.6MB. Free memory was 38.5MB in the beginning and 38.5MB in the end (delta: 29.5kB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-10 08:15:44,481 INFO L158 Benchmark]: CACSL2BoogieTranslator took 346.51ms. Allocated memory is still 77.6MB. Free memory was 44.1MB in the beginning and 50.3MB in the end (delta: -6.2MB). Peak memory consumption was 8.9MB. Max. memory is 16.1GB. [2024-11-10 08:15:44,482 INFO L158 Benchmark]: Boogie Procedure Inliner took 42.64ms. Allocated memory is still 77.6MB. Free memory was 50.3MB in the beginning and 48.7MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-10 08:15:44,482 INFO L158 Benchmark]: Boogie Preprocessor took 57.78ms. Allocated memory is still 77.6MB. Free memory was 48.7MB in the beginning and 46.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-10 08:15:44,482 INFO L158 Benchmark]: IcfgBuilder took 383.95ms. Allocated memory is still 77.6MB. Free memory was 46.6MB in the beginning and 33.7MB in the end (delta: 13.0MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-10 08:15:44,483 INFO L158 Benchmark]: TraceAbstraction took 18137.72ms. Allocated memory was 77.6MB in the beginning and 469.8MB in the end (delta: 392.2MB). Free memory was 33.0MB in the beginning and 387.9MB in the end (delta: -355.0MB). Peak memory consumption was 38.2MB. Max. memory is 16.1GB. [2024-11-10 08:15:44,483 INFO L158 Benchmark]: Witness Printer took 115.08ms. Allocated memory is still 469.8MB. Free memory was 387.9MB in the beginning and 382.7MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-10 08:15:44,484 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.12ms. Allocated memory is still 56.6MB. Free memory was 38.5MB in the beginning and 38.5MB in the end (delta: 29.5kB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 346.51ms. Allocated memory is still 77.6MB. Free memory was 44.1MB in the beginning and 50.3MB in the end (delta: -6.2MB). Peak memory consumption was 8.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 42.64ms. Allocated memory is still 77.6MB. Free memory was 50.3MB in the beginning and 48.7MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 57.78ms. Allocated memory is still 77.6MB. Free memory was 48.7MB in the beginning and 46.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * IcfgBuilder took 383.95ms. Allocated memory is still 77.6MB. Free memory was 46.6MB in the beginning and 33.7MB in the end (delta: 13.0MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * TraceAbstraction took 18137.72ms. Allocated memory was 77.6MB in the beginning and 469.8MB in the end (delta: 392.2MB). Free memory was 33.0MB in the beginning and 387.9MB in the end (delta: -355.0MB). Peak memory consumption was 38.2MB. Max. memory is 16.1GB. * Witness Printer took 115.08ms. Allocated memory is still 469.8MB. Free memory was 387.9MB in the beginning and 382.7MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: currentRoundingMode - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: currentRoundingMode - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: currentRoundingMode - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: currentRoundingMode - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: currentRoundingMode - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: currentRoundingMode - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: currentRoundingMode - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: currentRoundingMode * 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 - PositiveResult [Line: 19]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 39 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 16.9s, OverallIterations: 3, TraceHistogramMax: 10, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 129 SdHoareTripleChecker+Valid, 0.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 118 mSDsluCounter, 468 SdHoareTripleChecker+Invalid, 0.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 350 mSDsCounter, 23 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 450 IncrementalHoareTripleChecker+Invalid, 473 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 23 mSolverCounterUnsat, 118 mSDtfsCounter, 450 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 352 GetRequests, 309 SyntacticMatches, 1 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 119 ImplicationChecksByTransitivity, 2.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=49occurred in iteration=2, InterpolantAutomatonStates: 33, 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, 3 MinimizatonAttempts, 13 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 13.8s InterpolantComputationTime, 204 NumberOfCodeBlocks, 204 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 335 ConstructedInterpolants, 2 QuantifiedInterpolants, 2610 SizeOfPredicates, 32 NumberOfNonLiveVariables, 348 ConjunctsInSsa, 25 ConjunctsInUnsatCore, 5 InterpolantComputations, 1 PerfectInterpolantSequences, 840/900 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 - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 69]: Location Invariant Derived location invariant: null - ProcedureContractResult [Line: 20]: Procedure Contract for assume_abort_if_not Derived contract for procedure assume_abort_if_not. Ensures: ((0 != cond) && (((((((((((isInitial == \old(isInitial)) && (var_1_1 == \old(var_1_1))) && (var_1_2 == \old(var_1_2))) && (var_1_4 == \old(var_1_4))) && (var_1_5 == \old(var_1_5))) && (var_1_6 == \old(var_1_6))) && (var_1_7 == \old(var_1_7))) && (var_1_8 == \old(var_1_8))) && (var_1_9 == \old(var_1_9))) && (var_1_10 == \old(var_1_10))) && (var_1_11 == \old(var_1_11)))) RESULT: Ultimate proved your program to be correct! [2024-11-10 08:15:44,533 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE