./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-17.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 803cd42f Calling Ultimate with: /root/.sdkman/candidates/java/current/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-17.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 21420ec07872ebdf13b6707327ac11dfce6dd5da26c087213f4c675ac808eb5c --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-803cd42-m [2024-11-22 11:33:02,062 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-22 11:33:02,119 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-22 11:33:02,124 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-22 11:33:02,126 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-22 11:33:02,154 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-22 11:33:02,154 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-22 11:33:02,154 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-22 11:33:02,155 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-22 11:33:02,157 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-22 11:33:02,157 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-22 11:33:02,157 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-22 11:33:02,158 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-22 11:33:02,158 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-22 11:33:02,158 INFO L153 SettingsManager]: * Use SBE=true [2024-11-22 11:33:02,159 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-22 11:33:02,159 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-22 11:33:02,159 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-22 11:33:02,159 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-22 11:33:02,159 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-22 11:33:02,160 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-22 11:33:02,162 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-22 11:33:02,162 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-22 11:33:02,162 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-22 11:33:02,162 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-22 11:33:02,162 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-22 11:33:02,163 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-22 11:33:02,163 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-22 11:33:02,163 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-22 11:33:02,163 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-22 11:33:02,163 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-22 11:33:02,164 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-22 11:33:02,164 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-22 11:33:02,164 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-22 11:33:02,164 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-22 11:33:02,164 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-22 11:33:02,165 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-22 11:33:02,165 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-22 11:33:02,165 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-22 11:33:02,165 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-22 11:33:02,165 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-22 11:33:02,166 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-22 11:33:02,166 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 -> 21420ec07872ebdf13b6707327ac11dfce6dd5da26c087213f4c675ac808eb5c [2024-11-22 11:33:02,415 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-22 11:33:02,436 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-22 11:33:02,438 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-22 11:33:02,439 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-22 11:33:02,440 INFO L274 PluginConnector]: CDTParser initialized [2024-11-22 11:33:02,441 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-17.i [2024-11-22 11:33:03,673 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-22 11:33:03,817 INFO L384 CDTParser]: Found 1 translation units. [2024-11-22 11:33:03,817 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-17.i [2024-11-22 11:33:03,823 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0e85aa4bd/4f9c01f5748e4ccba14a849efcffe619/FLAG519ec3289 [2024-11-22 11:33:04,227 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0e85aa4bd/4f9c01f5748e4ccba14a849efcffe619 [2024-11-22 11:33:04,230 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-22 11:33:04,231 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-22 11:33:04,233 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-22 11:33:04,233 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-22 11:33:04,237 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-22 11:33:04,238 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 11:33:04" (1/1) ... [2024-11-22 11:33:04,239 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1f2ae1f5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:33:04, skipping insertion in model container [2024-11-22 11:33:04,239 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 11:33:04" (1/1) ... [2024-11-22 11:33:04,257 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-22 11:33:04,433 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-17.i[915,928] [2024-11-22 11:33:04,461 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-22 11:33:04,469 INFO L200 MainTranslator]: Completed pre-run [2024-11-22 11:33:04,479 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-17.i[915,928] [2024-11-22 11:33:04,490 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-22 11:33:04,508 INFO L204 MainTranslator]: Completed translation [2024-11-22 11:33:04,508 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:33:04 WrapperNode [2024-11-22 11:33:04,508 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-22 11:33:04,509 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-22 11:33:04,509 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-22 11:33:04,509 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-22 11:33:04,515 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:33:04" (1/1) ... [2024-11-22 11:33:04,521 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:33:04" (1/1) ... [2024-11-22 11:33:04,537 INFO L138 Inliner]: procedures = 26, calls = 27, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 89 [2024-11-22 11:33:04,538 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-22 11:33:04,539 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-22 11:33:04,539 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-22 11:33:04,539 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-22 11:33:04,548 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:33:04" (1/1) ... [2024-11-22 11:33:04,548 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:33:04" (1/1) ... [2024-11-22 11:33:04,552 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:33:04" (1/1) ... [2024-11-22 11:33:04,562 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-22 11:33:04,562 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:33:04" (1/1) ... [2024-11-22 11:33:04,563 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:33:04" (1/1) ... [2024-11-22 11:33:04,566 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:33:04" (1/1) ... [2024-11-22 11:33:04,574 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:33:04" (1/1) ... [2024-11-22 11:33:04,575 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:33:04" (1/1) ... [2024-11-22 11:33:04,576 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:33:04" (1/1) ... [2024-11-22 11:33:04,577 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-22 11:33:04,578 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-22 11:33:04,578 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-22 11:33:04,578 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-22 11:33:04,579 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:33:04" (1/1) ... [2024-11-22 11:33:04,584 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-22 11:33:04,594 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 11:33:04,608 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-22 11:33:04,610 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-22 11:33:04,645 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-22 11:33:04,646 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-22 11:33:04,646 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-22 11:33:04,646 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-22 11:33:04,646 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-22 11:33:04,646 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-22 11:33:04,705 INFO L238 CfgBuilder]: Building ICFG [2024-11-22 11:33:04,708 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-22 11:33:04,912 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2024-11-22 11:33:04,913 INFO L287 CfgBuilder]: Performing block encoding [2024-11-22 11:33:04,924 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-22 11:33:04,925 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-22 11:33:04,925 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 11:33:04 BoogieIcfgContainer [2024-11-22 11:33:04,925 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-22 11:33:04,927 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-22 11:33:04,927 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-22 11:33:04,930 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-22 11:33:04,930 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.11 11:33:04" (1/3) ... [2024-11-22 11:33:04,931 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3948c85a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 11:33:04, skipping insertion in model container [2024-11-22 11:33:04,931 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:33:04" (2/3) ... [2024-11-22 11:33:04,931 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3948c85a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 11:33:04, skipping insertion in model container [2024-11-22 11:33:04,931 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 11:33:04" (3/3) ... [2024-11-22 11:33:04,932 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount10_file-17.i [2024-11-22 11:33:04,947 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-22 11:33:04,947 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-22 11:33:04,994 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-22 11:33:05,000 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;@4731b439, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-22 11:33:05,000 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-22 11:33:05,004 INFO L276 IsEmpty]: Start isEmpty. Operand has 44 states, 27 states have (on average 1.3333333333333333) internal successors, (36), 28 states have internal predecessors, (36), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-22 11:33:05,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2024-11-22 11:33:05,012 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 11:33:05,013 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-22 11:33:05,013 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 11:33:05,017 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 11:33:05,017 INFO L85 PathProgramCache]: Analyzing trace with hash 755130548, now seen corresponding path program 1 times [2024-11-22 11:33:05,024 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 11:33:05,025 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [638567228] [2024-11-22 11:33:05,025 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 11:33:05,025 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 11:33:05,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 11:33:05,212 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 338 trivial. 0 not checked. [2024-11-22 11:33:05,213 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 11:33:05,213 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [638567228] [2024-11-22 11:33:05,214 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [638567228] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 11:33:05,214 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [250885292] [2024-11-22 11:33:05,215 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 11:33:05,215 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 11:33:05,215 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 11:33:05,217 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-22 11:33:05,218 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-22 11:33:05,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 11:33:05,312 INFO L255 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-22 11:33:05,320 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 11:33:05,335 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 338 trivial. 0 not checked. [2024-11-22 11:33:05,335 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 11:33:05,336 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [250885292] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 11:33:05,336 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-22 11:33:05,336 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2024-11-22 11:33:05,338 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2045566062] [2024-11-22 11:33:05,338 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 11:33:05,342 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-22 11:33:05,343 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 11:33:05,364 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-22 11:33:05,365 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-22 11:33:05,366 INFO L87 Difference]: Start difference. First operand has 44 states, 27 states have (on average 1.3333333333333333) internal successors, (36), 28 states have internal predecessors, (36), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) Second operand has 2 states, 2 states have (on average 11.0) internal successors, (22), 2 states have internal predecessors, (22), 2 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-22 11:33:05,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 11:33:05,389 INFO L93 Difference]: Finished difference Result 81 states and 136 transitions. [2024-11-22 11:33:05,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-22 11:33:05,391 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 11.0) internal successors, (22), 2 states have internal predecessors, (22), 2 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) Word has length 87 [2024-11-22 11:33:05,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 11:33:05,398 INFO L225 Difference]: With dead ends: 81 [2024-11-22 11:33:05,398 INFO L226 Difference]: Without dead ends: 40 [2024-11-22 11:33:05,400 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 88 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-22 11:33:05,403 INFO L432 NwaCegarLoop]: 57 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, 57 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-22 11:33:05,404 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 11:33:05,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2024-11-22 11:33:05,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2024-11-22 11:33:05,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 24 states have internal predecessors, (29), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-22 11:33:05,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 57 transitions. [2024-11-22 11:33:05,439 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 57 transitions. Word has length 87 [2024-11-22 11:33:05,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 11:33:05,439 INFO L471 AbstractCegarLoop]: Abstraction has 40 states and 57 transitions. [2024-11-22 11:33:05,439 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 11.0) internal successors, (22), 2 states have internal predecessors, (22), 2 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-22 11:33:05,440 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 57 transitions. [2024-11-22 11:33:05,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2024-11-22 11:33:05,442 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 11:33:05,442 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-22 11:33:05,449 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-22 11:33:05,643 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2024-11-22 11:33:05,644 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 11:33:05,645 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 11:33:05,645 INFO L85 PathProgramCache]: Analyzing trace with hash -297627592, now seen corresponding path program 1 times [2024-11-22 11:33:05,645 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 11:33:05,645 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1664464377] [2024-11-22 11:33:05,645 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 11:33:05,645 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 11:33:05,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-22 11:33:05,732 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1337155425] [2024-11-22 11:33:05,732 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 11:33:05,734 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 11:33:05,734 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 11:33:05,736 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-22 11:33:05,737 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-22 11:33:05,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-22 11:33:05,821 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-22 11:33:05,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-22 11:33:05,893 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-22 11:33:05,894 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-22 11:33:05,895 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-22 11:33:05,904 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-22 11:33:06,097 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1 [2024-11-22 11:33:06,100 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1] [2024-11-22 11:33:06,165 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-22 11:33:06,168 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.11 11:33:06 BoogieIcfgContainer [2024-11-22 11:33:06,168 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-22 11:33:06,169 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-22 11:33:06,169 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-22 11:33:06,169 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-22 11:33:06,170 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 11:33:04" (3/4) ... [2024-11-22 11:33:06,172 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-22 11:33:06,173 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-22 11:33:06,174 INFO L158 Benchmark]: Toolchain (without parser) took 1943.09ms. Allocated memory is still 157.3MB. Free memory was 84.5MB in the beginning and 49.0MB in the end (delta: 35.5MB). Peak memory consumption was 35.7MB. Max. memory is 16.1GB. [2024-11-22 11:33:06,176 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 157.3MB. Free memory is still 131.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-22 11:33:06,177 INFO L158 Benchmark]: CACSL2BoogieTranslator took 275.73ms. Allocated memory is still 157.3MB. Free memory was 84.3MB in the beginning and 126.6MB in the end (delta: -42.3MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-22 11:33:06,177 INFO L158 Benchmark]: Boogie Procedure Inliner took 28.97ms. Allocated memory is still 157.3MB. Free memory was 126.6MB in the beginning and 125.3MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-22 11:33:06,177 INFO L158 Benchmark]: Boogie Preprocessor took 39.07ms. Allocated memory is still 157.3MB. Free memory was 125.3MB in the beginning and 123.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-22 11:33:06,178 INFO L158 Benchmark]: RCFGBuilder took 346.94ms. Allocated memory is still 157.3MB. Free memory was 123.2MB in the beginning and 109.3MB in the end (delta: 13.9MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-22 11:33:06,178 INFO L158 Benchmark]: TraceAbstraction took 1241.90ms. Allocated memory is still 157.3MB. Free memory was 108.5MB in the beginning and 49.8MB in the end (delta: 58.7MB). Peak memory consumption was 58.7MB. Max. memory is 16.1GB. [2024-11-22 11:33:06,178 INFO L158 Benchmark]: Witness Printer took 4.21ms. Allocated memory is still 157.3MB. Free memory was 49.8MB in the beginning and 49.0MB in the end (delta: 760.5kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-22 11:33:06,180 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18ms. Allocated memory is still 157.3MB. Free memory is still 131.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 275.73ms. Allocated memory is still 157.3MB. Free memory was 84.3MB in the beginning and 126.6MB in the end (delta: -42.3MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 28.97ms. Allocated memory is still 157.3MB. Free memory was 126.6MB in the beginning and 125.3MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 39.07ms. Allocated memory is still 157.3MB. Free memory was 125.3MB in the beginning and 123.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 346.94ms. Allocated memory is still 157.3MB. Free memory was 123.2MB in the beginning and 109.3MB in the end (delta: 13.9MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * TraceAbstraction took 1241.90ms. Allocated memory is still 157.3MB. Free memory was 108.5MB in the beginning and 49.8MB in the end (delta: 58.7MB). Peak memory consumption was 58.7MB. Max. memory is 16.1GB. * Witness Printer took 4.21ms. Allocated memory is still 157.3MB. Free memory was 49.8MB in the beginning and 49.0MB in the end (delta: 760.5kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 75. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] float var_1_1 = 3.6; [L23] signed char var_1_2 = 5; [L24] signed char var_1_3 = -25; [L25] signed long int var_1_4 = -8; [L26] unsigned char var_1_5 = 1; [L27] signed long int var_1_6 = 256; [L28] unsigned char var_1_7 = 0; [L29] float var_1_8 = 4.6; VAL [isInitial=0, var_1_1=18/5, var_1_2=5, var_1_3=-25, var_1_4=-8, var_1_5=1, var_1_6=256, var_1_7=0, var_1_8=23/5] [L79] isInitial = 1 [L80] FCALL initially() [L81] COND TRUE 1 [L82] FCALL updateLastVariables() [L83] CALL updateVariables() [L50] var_1_2 = __VERIFIER_nondet_char() [L51] CALL assume_abort_if_not(var_1_2 >= -128) VAL [\old(cond)=1, isInitial=1, var_1_1=18/5, var_1_2=-1, var_1_3=-25, var_1_4=-8, var_1_5=1, var_1_6=256, var_1_7=0, var_1_8=23/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=18/5, var_1_2=-1, var_1_3=-25, var_1_4=-8, var_1_5=1, var_1_6=256, var_1_7=0, var_1_8=23/5] [L51] RET assume_abort_if_not(var_1_2 >= -128) VAL [isInitial=1, var_1_1=18/5, var_1_2=-1, var_1_3=-25, var_1_4=-8, var_1_5=1, var_1_6=256, var_1_7=0, var_1_8=23/5] [L52] CALL assume_abort_if_not(var_1_2 <= 127) VAL [\old(cond)=1, isInitial=1, var_1_1=18/5, var_1_2=-1, var_1_3=-25, var_1_4=-8, var_1_5=1, var_1_6=256, var_1_7=0, var_1_8=23/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=18/5, var_1_2=-1, var_1_3=-25, var_1_4=-8, var_1_5=1, var_1_6=256, var_1_7=0, var_1_8=23/5] [L52] RET assume_abort_if_not(var_1_2 <= 127) VAL [isInitial=1, var_1_1=18/5, var_1_2=-1, var_1_3=-25, var_1_4=-8, var_1_5=1, var_1_6=256, var_1_7=0, var_1_8=23/5] [L53] var_1_3 = __VERIFIER_nondet_char() [L54] CALL assume_abort_if_not(var_1_3 >= -128) VAL [\old(cond)=1, isInitial=1, var_1_1=18/5, var_1_2=-1, var_1_3=1, var_1_4=-8, var_1_5=1, var_1_6=256, var_1_7=0, var_1_8=23/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=18/5, var_1_2=-1, var_1_3=1, var_1_4=-8, var_1_5=1, var_1_6=256, var_1_7=0, var_1_8=23/5] [L54] RET assume_abort_if_not(var_1_3 >= -128) VAL [isInitial=1, var_1_1=18/5, var_1_2=-1, var_1_3=1, var_1_4=-8, var_1_5=1, var_1_6=256, var_1_7=0, var_1_8=23/5] [L55] CALL assume_abort_if_not(var_1_3 <= 127) VAL [\old(cond)=1, isInitial=1, var_1_1=18/5, var_1_2=-1, var_1_3=1, var_1_4=-8, var_1_5=1, var_1_6=256, var_1_7=0, var_1_8=23/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=18/5, var_1_2=-1, var_1_3=1, var_1_4=-8, var_1_5=1, var_1_6=256, var_1_7=0, var_1_8=23/5] [L55] RET assume_abort_if_not(var_1_3 <= 127) VAL [isInitial=1, var_1_1=18/5, var_1_2=-1, var_1_3=1, var_1_4=-8, var_1_5=1, var_1_6=256, var_1_7=0, var_1_8=23/5] [L56] CALL assume_abort_if_not(var_1_3 != 0) VAL [\old(cond)=1, isInitial=1, var_1_1=18/5, var_1_2=-1, var_1_3=1, var_1_4=-8, var_1_5=1, var_1_6=256, var_1_7=0, var_1_8=23/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=18/5, var_1_2=-1, var_1_3=1, var_1_4=-8, var_1_5=1, var_1_6=256, var_1_7=0, var_1_8=23/5] [L56] RET assume_abort_if_not(var_1_3 != 0) VAL [isInitial=1, var_1_1=18/5, var_1_2=-1, var_1_3=1, var_1_4=-8, var_1_5=1, var_1_6=256, var_1_7=0, var_1_8=23/5] [L57] var_1_4 = __VERIFIER_nondet_long() [L58] CALL assume_abort_if_not(var_1_4 >= -2147483648) VAL [\old(cond)=1, isInitial=1, var_1_1=18/5, var_1_2=-1, var_1_3=1, var_1_4=-1, var_1_5=1, var_1_6=256, var_1_7=0, var_1_8=23/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=18/5, var_1_2=-1, var_1_3=1, var_1_4=-1, var_1_5=1, var_1_6=256, var_1_7=0, var_1_8=23/5] [L58] RET assume_abort_if_not(var_1_4 >= -2147483648) VAL [isInitial=1, var_1_1=18/5, var_1_2=-1, var_1_3=1, var_1_4=-1, var_1_5=1, var_1_6=256, var_1_7=0, var_1_8=23/5] [L59] CALL assume_abort_if_not(var_1_4 <= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_1=18/5, var_1_2=-1, var_1_3=1, var_1_4=-1, var_1_5=1, var_1_6=256, var_1_7=0, var_1_8=23/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=18/5, var_1_2=-1, var_1_3=1, var_1_4=-1, var_1_5=1, var_1_6=256, var_1_7=0, var_1_8=23/5] [L59] RET assume_abort_if_not(var_1_4 <= 2147483647) VAL [isInitial=1, var_1_1=18/5, var_1_2=-1, var_1_3=1, var_1_4=-1, var_1_5=1, var_1_6=256, var_1_7=0, var_1_8=23/5] [L60] var_1_5 = __VERIFIER_nondet_uchar() [L61] CALL assume_abort_if_not(var_1_5 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_1=18/5, var_1_2=-1, var_1_3=1, var_1_4=-1, var_1_6=256, var_1_7=0, var_1_8=23/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=18/5, var_1_2=-1, var_1_3=1, var_1_4=-1, var_1_6=256, var_1_7=0, var_1_8=23/5] [L61] RET assume_abort_if_not(var_1_5 >= 0) VAL [isInitial=1, var_1_1=18/5, var_1_2=-1, var_1_3=1, var_1_4=-1, var_1_6=256, var_1_7=0, var_1_8=23/5] [L62] CALL assume_abort_if_not(var_1_5 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_1=18/5, var_1_2=-1, var_1_3=1, var_1_4=-1, var_1_5=1, var_1_6=256, var_1_7=0, var_1_8=23/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=18/5, var_1_2=-1, var_1_3=1, var_1_4=-1, var_1_5=1, var_1_6=256, var_1_7=0, var_1_8=23/5] [L62] RET assume_abort_if_not(var_1_5 <= 1) VAL [isInitial=1, var_1_1=18/5, var_1_2=-1, var_1_3=1, var_1_4=-1, var_1_5=1, var_1_6=256, var_1_7=0, var_1_8=23/5] [L63] var_1_6 = __VERIFIER_nondet_long() [L64] CALL assume_abort_if_not(var_1_6 >= -2147483648) VAL [\old(cond)=1, isInitial=1, var_1_1=18/5, var_1_2=-1, var_1_3=1, var_1_4=-1, var_1_5=1, var_1_6=2, var_1_7=0, var_1_8=23/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=18/5, var_1_2=-1, var_1_3=1, var_1_4=-1, var_1_5=1, var_1_6=2, var_1_7=0, var_1_8=23/5] [L64] RET assume_abort_if_not(var_1_6 >= -2147483648) VAL [isInitial=1, var_1_1=18/5, var_1_2=-1, var_1_3=1, var_1_4=-1, var_1_5=1, var_1_6=2, var_1_7=0, var_1_8=23/5] [L65] CALL assume_abort_if_not(var_1_6 <= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_1=18/5, var_1_2=-1, var_1_3=1, var_1_4=-1, var_1_5=1, var_1_6=2, var_1_7=0, var_1_8=23/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=18/5, var_1_2=-1, var_1_3=1, var_1_4=-1, var_1_5=1, var_1_6=2, var_1_7=0, var_1_8=23/5] [L65] RET assume_abort_if_not(var_1_6 <= 2147483647) VAL [isInitial=1, var_1_1=18/5, var_1_2=-1, var_1_3=1, var_1_4=-1, var_1_5=1, var_1_6=2, var_1_7=0, var_1_8=23/5] [L66] var_1_7 = __VERIFIER_nondet_uchar() [L67] CALL assume_abort_if_not(var_1_7 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_1=18/5, var_1_2=-1, var_1_3=1, var_1_4=-1, var_1_5=1, var_1_6=2, var_1_8=23/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=18/5, var_1_2=-1, var_1_3=1, var_1_4=-1, var_1_5=1, var_1_6=2, var_1_8=23/5] [L67] RET assume_abort_if_not(var_1_7 >= 0) VAL [isInitial=1, var_1_1=18/5, var_1_2=-1, var_1_3=1, var_1_4=-1, var_1_5=1, var_1_6=2, var_1_8=23/5] [L68] CALL assume_abort_if_not(var_1_7 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_1=18/5, var_1_2=-1, var_1_3=1, var_1_4=-1, var_1_5=1, var_1_6=2, var_1_7=1, var_1_8=23/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=18/5, var_1_2=-1, var_1_3=1, var_1_4=-1, var_1_5=1, var_1_6=2, var_1_7=1, var_1_8=23/5] [L68] RET assume_abort_if_not(var_1_7 <= 1) VAL [isInitial=1, var_1_1=18/5, var_1_2=-1, var_1_3=1, var_1_4=-1, var_1_5=1, var_1_6=2, var_1_7=1, var_1_8=23/5] [L69] var_1_8 = __VERIFIER_nondet_float() [L70] CALL assume_abort_if_not((var_1_8 >= -922337.2036854765600e+13F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 9223372.036854765600e+12F && var_1_8 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_1=18/5, var_1_2=-1, var_1_3=1, var_1_4=-1, var_1_5=1, var_1_6=2, var_1_7=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=18/5, var_1_2=-1, var_1_3=1, var_1_4=-1, var_1_5=1, var_1_6=2, var_1_7=1] [L70] RET assume_abort_if_not((var_1_8 >= -922337.2036854765600e+13F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 9223372.036854765600e+12F && var_1_8 >= 1.0e-20F )) VAL [isInitial=1, var_1_1=18/5, var_1_2=-1, var_1_3=1, var_1_4=-1, var_1_5=1, var_1_6=2, var_1_7=1] [L83] RET updateVariables() [L84] CALL step() [L33] COND FALSE !((var_1_2 / var_1_3) < var_1_4) [L46] var_1_1 = var_1_8 VAL [isInitial=1, var_1_1=2, var_1_2=-1, var_1_3=1, var_1_4=-1, var_1_5=1, var_1_6=2, var_1_7=1, var_1_8=2] [L84] RET step() [L85] CALL, EXPR property() [L75-L76] return ((var_1_2 / var_1_3) < var_1_4) ? (var_1_5 ? ((var_1_4 <= ((((var_1_3) < ((var_1_2 * var_1_6))) ? (var_1_3) : ((var_1_2 * var_1_6))))) ? (var_1_7 ? (var_1_1 == ((float) var_1_8)) : (var_1_1 == ((float) var_1_8))) : (var_1_1 == ((float) var_1_8))) : 1) : (var_1_1 == ((float) var_1_8)) ; VAL [\result=0, isInitial=1, var_1_1=2, var_1_2=-1, var_1_3=1, var_1_4=-1, var_1_5=1, var_1_6=2, var_1_7=1, var_1_8=2] [L85] RET, EXPR property() [L85] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, var_1_1=2, var_1_2=-1, var_1_3=1, var_1_4=-1, var_1_5=1, var_1_6=2, var_1_7=1, var_1_8=2] [L19] reach_error() VAL [isInitial=1, var_1_1=2, var_1_2=-1, var_1_3=1, var_1_4=-1, var_1_5=1, var_1_6=2, var_1_7=1, var_1_8=2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 44 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.1s, OverallIterations: 2, TraceHistogramMax: 14, 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, 57 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, 57 mSDtfsCounter, 0 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 88 GetRequests, 88 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=44occurred 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.2s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 348 NumberOfCodeBlocks, 348 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 172 ConstructedInterpolants, 0 QuantifiedInterpolants, 172 SizeOfPredicates, 0 NumberOfNonLiveVariables, 197 ConjunctsInSsa, 1 ConjunctsInUnsatCore, 2 InterpolantComputations, 1 PerfectInterpolantSequences, 702/728 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-22 11:33:06,208 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/current/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-17.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 21420ec07872ebdf13b6707327ac11dfce6dd5da26c087213f4c675ac808eb5c --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-803cd42-m [2024-11-22 11:33:08,122 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-22 11:33:08,185 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-22 11:33:08,196 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-22 11:33:08,196 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-22 11:33:08,223 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-22 11:33:08,223 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-22 11:33:08,223 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-22 11:33:08,224 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-22 11:33:08,224 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-22 11:33:08,224 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-22 11:33:08,224 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-22 11:33:08,225 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-22 11:33:08,225 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-22 11:33:08,225 INFO L153 SettingsManager]: * Use SBE=true [2024-11-22 11:33:08,225 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-22 11:33:08,226 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-22 11:33:08,226 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-22 11:33:08,228 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-22 11:33:08,228 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-22 11:33:08,229 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-22 11:33:08,229 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-22 11:33:08,229 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-22 11:33:08,232 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-22 11:33:08,232 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-22 11:33:08,232 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-22 11:33:08,232 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-22 11:33:08,233 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-22 11:33:08,233 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-22 11:33:08,233 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-22 11:33:08,233 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-22 11:33:08,233 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-22 11:33:08,233 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-22 11:33:08,234 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-22 11:33:08,234 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-22 11:33:08,234 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-22 11:33:08,234 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-22 11:33:08,234 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-22 11:33:08,234 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-22 11:33:08,234 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-22 11:33:08,234 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-22 11:33:08,236 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-22 11:33:08,236 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-22 11:33:08,236 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-22 11:33:08,236 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 -> 21420ec07872ebdf13b6707327ac11dfce6dd5da26c087213f4c675ac808eb5c [2024-11-22 11:33:08,505 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-22 11:33:08,527 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-22 11:33:08,530 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-22 11:33:08,531 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-22 11:33:08,532 INFO L274 PluginConnector]: CDTParser initialized [2024-11-22 11:33:08,533 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-17.i [2024-11-22 11:33:09,973 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-22 11:33:10,148 INFO L384 CDTParser]: Found 1 translation units. [2024-11-22 11:33:10,149 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-17.i [2024-11-22 11:33:10,155 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/868ccdca9/00c8e7c1880f4576842d7dcba27f869e/FLAG892f901d5 [2024-11-22 11:33:10,168 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/868ccdca9/00c8e7c1880f4576842d7dcba27f869e [2024-11-22 11:33:10,171 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-22 11:33:10,172 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-22 11:33:10,173 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-22 11:33:10,173 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-22 11:33:10,182 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-22 11:33:10,183 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 11:33:10" (1/1) ... [2024-11-22 11:33:10,183 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@146d8c1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:33:10, skipping insertion in model container [2024-11-22 11:33:10,183 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 11:33:10" (1/1) ... [2024-11-22 11:33:10,202 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-22 11:33:10,351 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-17.i[915,928] [2024-11-22 11:33:10,388 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-22 11:33:10,406 INFO L200 MainTranslator]: Completed pre-run [2024-11-22 11:33:10,419 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-17.i[915,928] [2024-11-22 11:33:10,435 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-22 11:33:10,457 INFO L204 MainTranslator]: Completed translation [2024-11-22 11:33:10,458 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:33:10 WrapperNode [2024-11-22 11:33:10,458 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-22 11:33:10,459 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-22 11:33:10,460 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-22 11:33:10,460 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-22 11:33:10,466 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:33:10" (1/1) ... [2024-11-22 11:33:10,479 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:33:10" (1/1) ... [2024-11-22 11:33:10,503 INFO L138 Inliner]: procedures = 27, calls = 27, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 85 [2024-11-22 11:33:10,505 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-22 11:33:10,506 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-22 11:33:10,506 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-22 11:33:10,506 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-22 11:33:10,515 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:33:10" (1/1) ... [2024-11-22 11:33:10,515 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:33:10" (1/1) ... [2024-11-22 11:33:10,518 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:33:10" (1/1) ... [2024-11-22 11:33:10,532 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-22 11:33:10,533 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:33:10" (1/1) ... [2024-11-22 11:33:10,533 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:33:10" (1/1) ... [2024-11-22 11:33:10,537 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:33:10" (1/1) ... [2024-11-22 11:33:10,543 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:33:10" (1/1) ... [2024-11-22 11:33:10,548 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:33:10" (1/1) ... [2024-11-22 11:33:10,551 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:33:10" (1/1) ... [2024-11-22 11:33:10,556 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-22 11:33:10,556 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-22 11:33:10,558 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-22 11:33:10,558 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-22 11:33:10,559 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:33:10" (1/1) ... [2024-11-22 11:33:10,564 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-22 11:33:10,574 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 11:33:10,591 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-22 11:33:10,594 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-22 11:33:10,637 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-22 11:33:10,638 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-22 11:33:10,638 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-22 11:33:10,638 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-22 11:33:10,638 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-22 11:33:10,639 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-22 11:33:10,708 INFO L238 CfgBuilder]: Building ICFG [2024-11-22 11:33:10,711 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-22 11:33:10,947 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2024-11-22 11:33:10,947 INFO L287 CfgBuilder]: Performing block encoding [2024-11-22 11:33:10,961 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-22 11:33:10,962 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-22 11:33:10,962 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 11:33:10 BoogieIcfgContainer [2024-11-22 11:33:10,962 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-22 11:33:10,964 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-22 11:33:10,964 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-22 11:33:10,966 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-22 11:33:10,967 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.11 11:33:10" (1/3) ... [2024-11-22 11:33:10,967 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7e4f3903 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 11:33:10, skipping insertion in model container [2024-11-22 11:33:10,967 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:33:10" (2/3) ... [2024-11-22 11:33:10,968 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7e4f3903 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 11:33:10, skipping insertion in model container [2024-11-22 11:33:10,968 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 11:33:10" (3/3) ... [2024-11-22 11:33:10,969 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount10_file-17.i [2024-11-22 11:33:10,984 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-22 11:33:10,984 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-22 11:33:11,040 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-22 11:33:11,045 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;@7508d39e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-22 11:33:11,046 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-22 11:33:11,049 INFO L276 IsEmpty]: Start isEmpty. Operand has 44 states, 27 states have (on average 1.3333333333333333) internal successors, (36), 28 states have internal predecessors, (36), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-22 11:33:11,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2024-11-22 11:33:11,058 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 11:33:11,058 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-22 11:33:11,059 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 11:33:11,063 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 11:33:11,063 INFO L85 PathProgramCache]: Analyzing trace with hash 755130548, now seen corresponding path program 1 times [2024-11-22 11:33:11,075 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 11:33:11,076 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [431084558] [2024-11-22 11:33:11,076 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 11:33:11,077 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-22 11:33:11,079 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 11:33:11,080 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-22 11:33:11,081 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-22 11:33:11,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 11:33:11,257 INFO L255 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-22 11:33:11,264 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 11:33:11,295 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 170 proven. 0 refuted. 0 times theorem prover too weak. 194 trivial. 0 not checked. [2024-11-22 11:33:11,295 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 11:33:11,296 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 11:33:11,296 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [431084558] [2024-11-22 11:33:11,297 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [431084558] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 11:33:11,297 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 11:33:11,297 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-22 11:33:11,299 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1142476274] [2024-11-22 11:33:11,299 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 11:33:11,303 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-22 11:33:11,303 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 11:33:11,326 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-22 11:33:11,327 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-22 11:33:11,330 INFO L87 Difference]: Start difference. First operand has 44 states, 27 states have (on average 1.3333333333333333) internal successors, (36), 28 states have internal predecessors, (36), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) Second operand has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-22 11:33:11,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 11:33:11,355 INFO L93 Difference]: Finished difference Result 81 states and 136 transitions. [2024-11-22 11:33:11,356 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-22 11:33:11,358 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 87 [2024-11-22 11:33:11,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 11:33:11,365 INFO L225 Difference]: With dead ends: 81 [2024-11-22 11:33:11,366 INFO L226 Difference]: Without dead ends: 40 [2024-11-22 11:33:11,369 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 86 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-22 11:33:11,373 INFO L432 NwaCegarLoop]: 57 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, 57 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-22 11:33:11,374 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 11:33:11,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2024-11-22 11:33:11,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2024-11-22 11:33:11,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 24 states have internal predecessors, (29), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-22 11:33:11,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 57 transitions. [2024-11-22 11:33:11,409 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 57 transitions. Word has length 87 [2024-11-22 11:33:11,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 11:33:11,409 INFO L471 AbstractCegarLoop]: Abstraction has 40 states and 57 transitions. [2024-11-22 11:33:11,409 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-22 11:33:11,409 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 57 transitions. [2024-11-22 11:33:11,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2024-11-22 11:33:11,412 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 11:33:11,412 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-22 11:33:11,419 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 (2)] Forceful destruction successful, exit code 0 [2024-11-22 11:33:11,614 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-22 11:33:11,615 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 11:33:11,615 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 11:33:11,616 INFO L85 PathProgramCache]: Analyzing trace with hash -297627592, now seen corresponding path program 1 times [2024-11-22 11:33:11,616 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 11:33:11,616 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [662250013] [2024-11-22 11:33:11,616 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 11:33:11,617 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-22 11:33:11,617 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 11:33:11,619 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-22 11:33:11,636 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-22 11:33:11,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 11:33:11,752 INFO L255 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-22 11:33:11,762 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 11:33:12,630 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2024-11-22 11:33:12,630 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 11:33:12,630 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 11:33:12,631 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [662250013] [2024-11-22 11:33:12,631 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [662250013] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 11:33:12,631 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 11:33:12,631 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-22 11:33:12,631 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1402767737] [2024-11-22 11:33:12,631 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 11:33:12,632 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-22 11:33:12,632 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 11:33:12,633 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-22 11:33:12,633 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-11-22 11:33:12,634 INFO L87 Difference]: Start difference. First operand 40 states and 57 transitions. Second operand has 9 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 8 states have internal predecessors, (23), 1 states have call successors, (14), 1 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-22 11:33:14,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 11:33:14,607 INFO L93 Difference]: Finished difference Result 54 states and 70 transitions. [2024-11-22 11:33:14,615 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-22 11:33:14,616 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 8 states have internal predecessors, (23), 1 states have call successors, (14), 1 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 1 states have call successors, (14) Word has length 87 [2024-11-22 11:33:14,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 11:33:14,617 INFO L225 Difference]: With dead ends: 54 [2024-11-22 11:33:14,617 INFO L226 Difference]: Without dead ends: 52 [2024-11-22 11:33:14,618 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 79 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=65, Invalid=175, Unknown=0, NotChecked=0, Total=240 [2024-11-22 11:33:14,618 INFO L432 NwaCegarLoop]: 36 mSDtfsCounter, 52 mSDsluCounter, 126 mSDsCounter, 0 mSdLazyCounter, 182 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 162 SdHoareTripleChecker+Invalid, 219 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 182 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-22 11:33:14,619 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 162 Invalid, 219 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 182 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-22 11:33:14,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2024-11-22 11:33:14,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 47. [2024-11-22 11:33:14,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 30 states have (on average 1.1666666666666667) internal successors, (35), 30 states have internal predecessors, (35), 14 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-22 11:33:14,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 63 transitions. [2024-11-22 11:33:14,634 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 63 transitions. Word has length 87 [2024-11-22 11:33:14,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 11:33:14,635 INFO L471 AbstractCegarLoop]: Abstraction has 47 states and 63 transitions. [2024-11-22 11:33:14,635 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 8 states have internal predecessors, (23), 1 states have call successors, (14), 1 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-22 11:33:14,635 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 63 transitions. [2024-11-22 11:33:14,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2024-11-22 11:33:14,636 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 11:33:14,636 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-22 11:33:14,644 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-22 11:33:14,837 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-22 11:33:14,837 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 11:33:14,838 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 11:33:14,838 INFO L85 PathProgramCache]: Analyzing trace with hash -1213783843, now seen corresponding path program 1 times [2024-11-22 11:33:14,839 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 11:33:14,839 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [931305957] [2024-11-22 11:33:14,839 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 11:33:14,839 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-22 11:33:14,839 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 11:33:14,842 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-22 11:33:14,842 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-22 11:33:14,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 11:33:14,956 INFO L255 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-22 11:33:14,961 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 11:33:15,340 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-22 11:33:15,340 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 11:33:15,340 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 11:33:15,341 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [931305957] [2024-11-22 11:33:15,341 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [931305957] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 11:33:15,341 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 11:33:15,341 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-22 11:33:15,341 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1584272974] [2024-11-22 11:33:15,341 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 11:33:15,341 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-22 11:33:15,341 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 11:33:15,342 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-22 11:33:15,342 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-22 11:33:15,342 INFO L87 Difference]: Start difference. First operand 47 states and 63 transitions. Second operand has 6 states, 6 states have (on average 3.5) internal successors, (21), 6 states have internal predecessors, (21), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-22 11:33:16,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 11:33:16,045 INFO L93 Difference]: Finished difference Result 58 states and 74 transitions. [2024-11-22 11:33:16,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-22 11:33:16,053 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.5) internal successors, (21), 6 states have internal predecessors, (21), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 88 [2024-11-22 11:33:16,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 11:33:16,054 INFO L225 Difference]: With dead ends: 58 [2024-11-22 11:33:16,054 INFO L226 Difference]: Without dead ends: 56 [2024-11-22 11:33:16,055 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 83 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-11-22 11:33:16,056 INFO L432 NwaCegarLoop]: 58 mSDtfsCounter, 22 mSDsluCounter, 152 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 210 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-22 11:33:16,056 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 210 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-22 11:33:16,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2024-11-22 11:33:16,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 47. [2024-11-22 11:33:16,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 30 states have (on average 1.1666666666666667) internal successors, (35), 30 states have internal predecessors, (35), 14 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-22 11:33:16,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 63 transitions. [2024-11-22 11:33:16,064 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 63 transitions. Word has length 88 [2024-11-22 11:33:16,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 11:33:16,065 INFO L471 AbstractCegarLoop]: Abstraction has 47 states and 63 transitions. [2024-11-22 11:33:16,065 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.5) internal successors, (21), 6 states have internal predecessors, (21), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-22 11:33:16,065 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 63 transitions. [2024-11-22 11:33:16,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2024-11-22 11:33:16,066 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 11:33:16,068 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-22 11:33:16,076 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-22 11:33:16,269 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-22 11:33:16,270 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 11:33:16,270 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 11:33:16,270 INFO L85 PathProgramCache]: Analyzing trace with hash 619147791, now seen corresponding path program 1 times [2024-11-22 11:33:16,271 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 11:33:16,271 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [527138225] [2024-11-22 11:33:16,271 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 11:33:16,271 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-22 11:33:16,271 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 11:33:16,274 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-22 11:33:16,275 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-11-22 11:33:16,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 11:33:16,390 INFO L255 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-22 11:33:16,394 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 11:33:17,988 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2024-11-22 11:33:17,988 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 11:33:17,988 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 11:33:17,989 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [527138225] [2024-11-22 11:33:17,989 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [527138225] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 11:33:17,989 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 11:33:17,989 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-22 11:33:17,989 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1307556232] [2024-11-22 11:33:17,991 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 11:33:17,992 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-22 11:33:17,992 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 11:33:17,992 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-22 11:33:17,993 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2024-11-22 11:33:17,993 INFO L87 Difference]: Start difference. First operand 47 states and 63 transitions. Second operand has 11 states, 11 states have (on average 2.272727272727273) internal successors, (25), 10 states have internal predecessors, (25), 1 states have call successors, (14), 1 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-22 11:33:20,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 11:33:20,917 INFO L93 Difference]: Finished difference Result 58 states and 74 transitions. [2024-11-22 11:33:20,924 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-22 11:33:20,925 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.272727272727273) internal successors, (25), 10 states have internal predecessors, (25), 1 states have call successors, (14), 1 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 1 states have call successors, (14) Word has length 89 [2024-11-22 11:33:20,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 11:33:20,925 INFO L225 Difference]: With dead ends: 58 [2024-11-22 11:33:20,925 INFO L226 Difference]: Without dead ends: 0 [2024-11-22 11:33:20,926 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 79 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=100, Invalid=280, Unknown=0, NotChecked=0, Total=380 [2024-11-22 11:33:20,927 INFO L432 NwaCegarLoop]: 41 mSDtfsCounter, 47 mSDsluCounter, 163 mSDsCounter, 0 mSdLazyCounter, 283 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 204 SdHoareTripleChecker+Invalid, 322 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 283 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2024-11-22 11:33:20,928 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 204 Invalid, 322 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 283 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2024-11-22 11:33:20,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-22 11:33:20,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-22 11:33:20,929 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-22 11:33:20,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-22 11:33:20,929 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 89 [2024-11-22 11:33:20,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 11:33:20,929 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-22 11:33:20,930 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.272727272727273) internal successors, (25), 10 states have internal predecessors, (25), 1 states have call successors, (14), 1 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-22 11:33:20,930 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-22 11:33:20,930 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-22 11:33:20,932 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-22 11:33:20,941 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 (5)] Forceful destruction successful, exit code 0 [2024-11-22 11:33:21,133 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /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-22 11:33:21,135 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2024-11-22 11:33:21,137 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-11-22 11:33:21,781 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-22 11:33:21,794 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~roundNearestTiesToEven [2024-11-22 11:33:21,794 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~roundNearestTiesToEven [2024-11-22 11:33:21,794 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~roundNearestTiesToEven [2024-11-22 11:33:21,795 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~roundNearestTiesToEven [2024-11-22 11:33:21,795 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: currentRoundingMode [2024-11-22 11:33:21,795 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~roundNearestTiesToEven [2024-11-22 11:33:21,799 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: currentRoundingMode [2024-11-22 11:33:21,800 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~roundNearestTiesToEven [2024-11-22 11:33:21,800 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: currentRoundingMode [2024-11-22 11:33:21,800 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~roundNearestTiesToEven [2024-11-22 11:33:21,805 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.11 11:33:21 BoogieIcfgContainer [2024-11-22 11:33:21,805 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-22 11:33:21,806 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-22 11:33:21,806 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-22 11:33:21,806 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-22 11:33:21,806 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 11:33:10" (3/4) ... [2024-11-22 11:33:21,808 INFO L142 WitnessPrinter]: Generating witness for correct program [2024-11-22 11:33:21,811 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2024-11-22 11:33:21,814 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 15 nodes and edges [2024-11-22 11:33:21,814 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2024-11-22 11:33:21,814 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-11-22 11:33:21,814 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-22 11:33:21,893 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-22 11:33:21,893 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-22 11:33:21,893 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-22 11:33:21,894 INFO L158 Benchmark]: Toolchain (without parser) took 11721.64ms. Allocated memory was 65.0MB in the beginning and 79.7MB in the end (delta: 14.7MB). Free memory was 33.2MB in the beginning and 34.4MB in the end (delta: -1.2MB). Peak memory consumption was 14.6MB. Max. memory is 16.1GB. [2024-11-22 11:33:21,894 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 48.2MB. Free memory is still 31.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-22 11:33:21,894 INFO L158 Benchmark]: CACSL2BoogieTranslator took 285.32ms. Allocated memory is still 65.0MB. Free memory was 33.0MB in the beginning and 36.9MB in the end (delta: -4.0MB). Peak memory consumption was 9.3MB. Max. memory is 16.1GB. [2024-11-22 11:33:21,894 INFO L158 Benchmark]: Boogie Procedure Inliner took 46.34ms. Allocated memory is still 65.0MB. Free memory was 36.9MB in the beginning and 35.1MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-22 11:33:21,895 INFO L158 Benchmark]: Boogie Preprocessor took 49.78ms. Allocated memory is still 65.0MB. Free memory was 35.1MB in the beginning and 32.7MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-22 11:33:21,895 INFO L158 Benchmark]: RCFGBuilder took 405.99ms. Allocated memory is still 65.0MB. Free memory was 32.7MB in the beginning and 36.8MB in the end (delta: -4.0MB). Peak memory consumption was 8.1MB. Max. memory is 16.1GB. [2024-11-22 11:33:21,895 INFO L158 Benchmark]: TraceAbstraction took 10841.46ms. Allocated memory was 65.0MB in the beginning and 79.7MB in the end (delta: 14.7MB). Free memory was 35.9MB in the beginning and 39.2MB in the end (delta: -3.3MB). Peak memory consumption was 28.6MB. Max. memory is 16.1GB. [2024-11-22 11:33:21,895 INFO L158 Benchmark]: Witness Printer took 87.43ms. Allocated memory is still 79.7MB. Free memory was 39.2MB in the beginning and 34.4MB in the end (delta: 4.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-22 11:33:21,897 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16ms. Allocated memory is still 48.2MB. Free memory is still 31.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 285.32ms. Allocated memory is still 65.0MB. Free memory was 33.0MB in the beginning and 36.9MB in the end (delta: -4.0MB). Peak memory consumption was 9.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 46.34ms. Allocated memory is still 65.0MB. Free memory was 36.9MB in the beginning and 35.1MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 49.78ms. Allocated memory is still 65.0MB. Free memory was 35.1MB in the beginning and 32.7MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 405.99ms. Allocated memory is still 65.0MB. Free memory was 32.7MB in the beginning and 36.8MB in the end (delta: -4.0MB). Peak memory consumption was 8.1MB. Max. memory is 16.1GB. * TraceAbstraction took 10841.46ms. Allocated memory was 65.0MB in the beginning and 79.7MB in the end (delta: 14.7MB). Free memory was 35.9MB in the beginning and 39.2MB in the end (delta: -3.3MB). Peak memory consumption was 28.6MB. Max. memory is 16.1GB. * Witness Printer took 87.43ms. Allocated memory is still 79.7MB. Free memory was 39.2MB in the beginning and 34.4MB in the end (delta: 4.8MB). 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: ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: currentRoundingMode - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: currentRoundingMode - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: currentRoundingMode - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~roundNearestTiesToEven * 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, 44 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 10.1s, OverallIterations: 4, TraceHistogramMax: 14, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 5.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 123 SdHoareTripleChecker+Valid, 3.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 121 mSDsluCounter, 633 SdHoareTripleChecker+Invalid, 2.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 441 mSDsCounter, 76 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 506 IncrementalHoareTripleChecker+Invalid, 582 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 76 mSolverCounterUnsat, 192 mSDtfsCounter, 506 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 365 GetRequests, 327 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 3.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=47occurred in iteration=2, InterpolantAutomatonStates: 34, 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, 4 MinimizatonAttempts, 14 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 2.9s InterpolantComputationTime, 351 NumberOfCodeBlocks, 351 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 347 ConstructedInterpolants, 0 QuantifiedInterpolants, 962 SizeOfPredicates, 20 NumberOfNonLiveVariables, 558 ConjunctsInSsa, 31 ConjunctsInUnsatCore, 4 InterpolantComputations, 4 PerfectInterpolantSequences, 1456/1456 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: 81]: Loop Invariant Derived loop 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_3 == \old(var_1_3))) && (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)))) RESULT: Ultimate proved your program to be correct! [2024-11-22 11:33:21,920 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE