./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-69.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 4a390ef5 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 /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-69.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 be2af847ca6e6b21a33c086089fa377d9cd33581334f785b17b8fcc9e5016299 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4a390ef-m [2024-10-24 10:20:04,152 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-24 10:20:04,217 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-24 10:20:04,224 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-24 10:20:04,225 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-24 10:20:04,251 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-24 10:20:04,252 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-24 10:20:04,253 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-24 10:20:04,254 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-24 10:20:04,255 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-24 10:20:04,255 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-24 10:20:04,256 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-24 10:20:04,256 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-24 10:20:04,257 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-24 10:20:04,258 INFO L153 SettingsManager]: * Use SBE=true [2024-10-24 10:20:04,258 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-24 10:20:04,258 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-24 10:20:04,259 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-24 10:20:04,260 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-24 10:20:04,260 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-24 10:20:04,261 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-24 10:20:04,261 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-24 10:20:04,265 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-24 10:20:04,265 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-24 10:20:04,266 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-24 10:20:04,266 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-24 10:20:04,266 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-24 10:20:04,266 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-24 10:20:04,267 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-24 10:20:04,267 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-24 10:20:04,267 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-24 10:20:04,267 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-24 10:20:04,268 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 10:20:04,268 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-24 10:20:04,268 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-24 10:20:04,268 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-24 10:20:04,268 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-24 10:20:04,269 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-24 10:20:04,269 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-24 10:20:04,269 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-24 10:20:04,269 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-24 10:20:04,270 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-24 10:20:04,270 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 -> be2af847ca6e6b21a33c086089fa377d9cd33581334f785b17b8fcc9e5016299 [2024-10-24 10:20:04,526 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-24 10:20:04,549 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-24 10:20:04,552 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-24 10:20:04,553 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-24 10:20:04,554 INFO L274 PluginConnector]: CDTParser initialized [2024-10-24 10:20:04,555 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-69.i [2024-10-24 10:20:06,039 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-24 10:20:06,228 INFO L384 CDTParser]: Found 1 translation units. [2024-10-24 10:20:06,229 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-69.i [2024-10-24 10:20:06,236 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ce80dc541/273325630f1447d9ac90dbf0e1fd7ab7/FLAG3046c64cb [2024-10-24 10:20:06,248 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ce80dc541/273325630f1447d9ac90dbf0e1fd7ab7 [2024-10-24 10:20:06,251 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-24 10:20:06,252 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-24 10:20:06,254 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-24 10:20:06,254 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-24 10:20:06,260 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-24 10:20:06,261 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 10:20:06" (1/1) ... [2024-10-24 10:20:06,262 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@65d650c4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:20:06, skipping insertion in model container [2024-10-24 10:20:06,262 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 10:20:06" (1/1) ... [2024-10-24 10:20:06,285 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 10:20:06,443 WARN L248 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-69.i[915,928] [2024-10-24 10:20:06,468 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 10:20:06,479 INFO L200 MainTranslator]: Completed pre-run [2024-10-24 10:20:06,490 WARN L248 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-69.i[915,928] [2024-10-24 10:20:06,500 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 10:20:06,517 INFO L204 MainTranslator]: Completed translation [2024-10-24 10:20:06,517 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:20:06 WrapperNode [2024-10-24 10:20:06,518 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-24 10:20:06,519 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-24 10:20:06,519 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-24 10:20:06,519 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-24 10:20:06,526 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:20:06" (1/1) ... [2024-10-24 10:20:06,533 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:20:06" (1/1) ... [2024-10-24 10:20:06,557 INFO L138 Inliner]: procedures = 26, calls = 24, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 76 [2024-10-24 10:20:06,558 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-24 10:20:06,562 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-24 10:20:06,562 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-24 10:20:06,562 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-24 10:20:06,573 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:20:06" (1/1) ... [2024-10-24 10:20:06,573 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:20:06" (1/1) ... [2024-10-24 10:20:06,575 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:20:06" (1/1) ... [2024-10-24 10:20:06,595 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-10-24 10:20:06,596 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:20:06" (1/1) ... [2024-10-24 10:20:06,596 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:20:06" (1/1) ... [2024-10-24 10:20:06,600 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:20:06" (1/1) ... [2024-10-24 10:20:06,603 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:20:06" (1/1) ... [2024-10-24 10:20:06,604 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:20:06" (1/1) ... [2024-10-24 10:20:06,605 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:20:06" (1/1) ... [2024-10-24 10:20:06,607 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-24 10:20:06,608 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-24 10:20:06,608 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-24 10:20:06,608 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-24 10:20:06,609 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:20:06" (1/1) ... [2024-10-24 10:20:06,618 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 10:20:06,629 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 10:20:06,647 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-10-24 10:20:06,651 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-10-24 10:20:06,699 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-24 10:20:06,699 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-24 10:20:06,699 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-24 10:20:06,700 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-24 10:20:06,700 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-24 10:20:06,700 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-24 10:20:06,771 INFO L238 CfgBuilder]: Building ICFG [2024-10-24 10:20:06,776 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-24 10:20:06,994 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2024-10-24 10:20:06,995 INFO L287 CfgBuilder]: Performing block encoding [2024-10-24 10:20:07,047 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-24 10:20:07,048 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-24 10:20:07,048 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 10:20:07 BoogieIcfgContainer [2024-10-24 10:20:07,049 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-24 10:20:07,051 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-24 10:20:07,053 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-24 10:20:07,056 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-24 10:20:07,057 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 10:20:06" (1/3) ... [2024-10-24 10:20:07,058 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2ada0bc5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 10:20:07, skipping insertion in model container [2024-10-24 10:20:07,058 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:20:06" (2/3) ... [2024-10-24 10:20:07,059 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2ada0bc5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 10:20:07, skipping insertion in model container [2024-10-24 10:20:07,060 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 10:20:07" (3/3) ... [2024-10-24 10:20:07,061 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount10_file-69.i [2024-10-24 10:20:07,077 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-24 10:20:07,077 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-24 10:20:07,168 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-24 10:20:07,191 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;@404eea9a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-24 10:20:07,192 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-24 10:20:07,197 INFO L276 IsEmpty]: Start isEmpty. Operand has 32 states, 18 states have (on average 1.3888888888888888) internal successors, (25), 19 states have internal predecessors, (25), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-10-24 10:20:07,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2024-10-24 10:20:07,206 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 10:20:07,207 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-24 10:20:07,207 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 10:20:07,213 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 10:20:07,213 INFO L85 PathProgramCache]: Analyzing trace with hash 1980465210, now seen corresponding path program 1 times [2024-10-24 10:20:07,221 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 10:20:07,222 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1958378718] [2024-10-24 10:20:07,222 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 10:20:07,222 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 10:20:07,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:20:07,396 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 10:20:07,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:20:07,409 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 10:20:07,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:20:07,419 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 10:20:07,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:20:07,426 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 10:20:07,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:20:07,432 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 10:20:07,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:20:07,436 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 10:20:07,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:20:07,441 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 10:20:07,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:20:07,445 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-24 10:20:07,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:20:07,451 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-24 10:20:07,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:20:07,457 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-24 10:20:07,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:20:07,462 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-24 10:20:07,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:20:07,469 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-10-24 10:20:07,470 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 10:20:07,470 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1958378718] [2024-10-24 10:20:07,471 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1958378718] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 10:20:07,471 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 10:20:07,471 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 10:20:07,472 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1060471419] [2024-10-24 10:20:07,473 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 10:20:07,477 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-24 10:20:07,478 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 10:20:07,502 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-24 10:20:07,503 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-24 10:20:07,504 INFO L87 Difference]: Start difference. First operand has 32 states, 18 states have (on average 1.3888888888888888) internal successors, (25), 19 states have internal predecessors, (25), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand has 2 states, 2 states have (on average 7.5) internal successors, (15), 2 states have internal predecessors, (15), 2 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 2 states have call successors, (11) [2024-10-24 10:20:07,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 10:20:07,552 INFO L93 Difference]: Finished difference Result 61 states and 103 transitions. [2024-10-24 10:20:07,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-24 10:20:07,556 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 7.5) internal successors, (15), 2 states have internal predecessors, (15), 2 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 2 states have call successors, (11) Word has length 67 [2024-10-24 10:20:07,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 10:20:07,563 INFO L225 Difference]: With dead ends: 61 [2024-10-24 10:20:07,563 INFO L226 Difference]: Without dead ends: 30 [2024-10-24 10:20:07,568 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 35 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-10-24 10:20:07,572 INFO L432 NwaCegarLoop]: 39 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 39 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 10:20:07,574 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 39 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 10:20:07,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2024-10-24 10:20:07,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2024-10-24 10:20:07,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 17 states have internal predecessors, (20), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-10-24 10:20:07,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 42 transitions. [2024-10-24 10:20:07,665 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 42 transitions. Word has length 67 [2024-10-24 10:20:07,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 10:20:07,666 INFO L471 AbstractCegarLoop]: Abstraction has 30 states and 42 transitions. [2024-10-24 10:20:07,666 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 7.5) internal successors, (15), 2 states have internal predecessors, (15), 2 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 2 states have call successors, (11) [2024-10-24 10:20:07,666 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 42 transitions. [2024-10-24 10:20:07,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2024-10-24 10:20:07,670 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 10:20:07,670 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-24 10:20:07,670 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-24 10:20:07,671 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 10:20:07,672 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 10:20:07,672 INFO L85 PathProgramCache]: Analyzing trace with hash -134897480, now seen corresponding path program 1 times [2024-10-24 10:20:07,672 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 10:20:07,672 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2089542116] [2024-10-24 10:20:07,672 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 10:20:07,673 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 10:20:07,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-24 10:20:07,785 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-24 10:20:07,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-24 10:20:07,885 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-24 10:20:07,885 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-24 10:20:07,888 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-24 10:20:07,890 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-24 10:20:07,894 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1] [2024-10-24 10:20:07,959 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-24 10:20:07,966 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.10 10:20:07 BoogieIcfgContainer [2024-10-24 10:20:07,967 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-24 10:20:07,968 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-24 10:20:07,969 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-24 10:20:07,969 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-24 10:20:07,969 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 10:20:07" (3/4) ... [2024-10-24 10:20:07,973 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-24 10:20:07,974 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-24 10:20:07,976 INFO L158 Benchmark]: Toolchain (without parser) took 1722.58ms. Allocated memory was 167.8MB in the beginning and 218.1MB in the end (delta: 50.3MB). Free memory was 97.0MB in the beginning and 171.7MB in the end (delta: -74.7MB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-24 10:20:07,977 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 167.8MB. Free memory is still 120.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-24 10:20:07,980 INFO L158 Benchmark]: CACSL2BoogieTranslator took 263.69ms. Allocated memory is still 167.8MB. Free memory was 96.8MB in the beginning and 83.7MB in the end (delta: 13.1MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-10-24 10:20:07,980 INFO L158 Benchmark]: Boogie Procedure Inliner took 39.00ms. Allocated memory is still 167.8MB. Free memory was 83.7MB in the beginning and 81.9MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-24 10:20:07,980 INFO L158 Benchmark]: Boogie Preprocessor took 45.38ms. Allocated memory is still 167.8MB. Free memory was 81.8MB in the beginning and 79.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-24 10:20:07,981 INFO L158 Benchmark]: RCFGBuilder took 440.92ms. Allocated memory is still 167.8MB. Free memory was 79.5MB in the beginning and 64.4MB in the end (delta: 15.1MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-10-24 10:20:07,981 INFO L158 Benchmark]: TraceAbstraction took 916.22ms. Allocated memory was 167.8MB in the beginning and 218.1MB in the end (delta: 50.3MB). Free memory was 63.9MB in the beginning and 171.7MB in the end (delta: -107.8MB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-24 10:20:07,982 INFO L158 Benchmark]: Witness Printer took 5.75ms. Allocated memory is still 218.1MB. Free memory is still 171.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-24 10:20:07,986 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.21ms. Allocated memory is still 167.8MB. Free memory is still 120.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 263.69ms. Allocated memory is still 167.8MB. Free memory was 96.8MB in the beginning and 83.7MB in the end (delta: 13.1MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 39.00ms. Allocated memory is still 167.8MB. Free memory was 83.7MB in the beginning and 81.9MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 45.38ms. Allocated memory is still 167.8MB. Free memory was 81.8MB in the beginning and 79.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 440.92ms. Allocated memory is still 167.8MB. Free memory was 79.5MB in the beginning and 64.4MB in the end (delta: 15.1MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * TraceAbstraction took 916.22ms. Allocated memory was 167.8MB in the beginning and 218.1MB in the end (delta: 50.3MB). Free memory was 63.9MB in the beginning and 171.7MB in the end (delta: -107.8MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 5.75ms. Allocated memory is still 218.1MB. Free memory is still 171.7MB. 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 64. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned char var_1_1 = 0; [L23] unsigned char var_1_3 = 1; [L24] unsigned char var_1_4 = 0; [L25] unsigned char var_1_5 = 0; [L26] unsigned char var_1_6 = 0; [L27] unsigned char var_1_7 = 1; [L28] float var_1_8 = 127.4; [L29] float var_1_9 = 24.75; [L68] isInitial = 1 [L69] FCALL initially() [L70] COND TRUE 1 [L71] FCALL updateLastVariables() [L72] CALL updateVariables() [L43] var_1_3 = __VERIFIER_nondet_uchar() [L44] CALL assume_abort_if_not(var_1_3 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_1=0, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=637/5, var_1_9=99/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=0, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=637/5, var_1_9=99/4] [L44] RET assume_abort_if_not(var_1_3 >= 0) VAL [isInitial=1, var_1_1=0, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=637/5, var_1_9=99/4] [L45] CALL assume_abort_if_not(var_1_3 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_1=0, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=637/5, var_1_9=99/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=0, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=637/5, var_1_9=99/4] [L45] RET assume_abort_if_not(var_1_3 <= 1) VAL [isInitial=1, var_1_1=0, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=637/5, var_1_9=99/4] [L46] var_1_4 = __VERIFIER_nondet_uchar() [L47] CALL assume_abort_if_not(var_1_4 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_1=0, var_1_3=1, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=637/5, var_1_9=99/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=0, var_1_3=1, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=637/5, var_1_9=99/4] [L47] RET assume_abort_if_not(var_1_4 >= 0) VAL [isInitial=1, var_1_1=0, var_1_3=1, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=637/5, var_1_9=99/4] [L48] CALL assume_abort_if_not(var_1_4 <= 0) VAL [\old(cond)=1, isInitial=1, var_1_1=0, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=637/5, var_1_9=99/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=0, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=637/5, var_1_9=99/4] [L48] RET assume_abort_if_not(var_1_4 <= 0) VAL [isInitial=1, var_1_1=0, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=637/5, var_1_9=99/4] [L49] var_1_5 = __VERIFIER_nondet_uchar() [L50] CALL assume_abort_if_not(var_1_5 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_1=0, var_1_3=1, var_1_4=0, var_1_6=0, var_1_7=1, var_1_8=637/5, var_1_9=99/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=0, var_1_3=1, var_1_4=0, var_1_6=0, var_1_7=1, var_1_8=637/5, var_1_9=99/4] [L50] RET assume_abort_if_not(var_1_5 >= 0) VAL [isInitial=1, var_1_1=0, var_1_3=1, var_1_4=0, var_1_6=0, var_1_7=1, var_1_8=637/5, var_1_9=99/4] [L51] CALL assume_abort_if_not(var_1_5 <= 0) VAL [\old(cond)=1, isInitial=1, var_1_1=0, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=637/5, var_1_9=99/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=0, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=637/5, var_1_9=99/4] [L51] RET assume_abort_if_not(var_1_5 <= 0) VAL [isInitial=1, var_1_1=0, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=637/5, var_1_9=99/4] [L52] var_1_6 = __VERIFIER_nondet_uchar() [L53] CALL assume_abort_if_not(var_1_6 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_1=0, var_1_3=1, var_1_4=0, var_1_5=0, var_1_7=1, var_1_8=637/5, var_1_9=99/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=0, var_1_3=1, var_1_4=0, var_1_5=0, var_1_7=1, var_1_8=637/5, var_1_9=99/4] [L53] RET assume_abort_if_not(var_1_6 >= 0) VAL [isInitial=1, var_1_1=0, var_1_3=1, var_1_4=0, var_1_5=0, var_1_7=1, var_1_8=637/5, var_1_9=99/4] [L54] CALL assume_abort_if_not(var_1_6 <= 0) VAL [\old(cond)=1, isInitial=1, var_1_1=0, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=637/5, var_1_9=99/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=0, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=637/5, var_1_9=99/4] [L54] RET assume_abort_if_not(var_1_6 <= 0) VAL [isInitial=1, var_1_1=0, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=637/5, var_1_9=99/4] [L55] var_1_7 = __VERIFIER_nondet_uchar() [L56] CALL assume_abort_if_not(var_1_7 >= 1) VAL [\old(cond)=1, isInitial=1, var_1_1=0, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=637/5, var_1_9=99/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=0, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=637/5, var_1_9=99/4] [L56] RET assume_abort_if_not(var_1_7 >= 1) VAL [isInitial=1, var_1_1=0, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=637/5, var_1_9=99/4] [L57] CALL assume_abort_if_not(var_1_7 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_1=0, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=637/5, var_1_9=99/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=0, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=637/5, var_1_9=99/4] [L57] RET assume_abort_if_not(var_1_7 <= 1) VAL [isInitial=1, var_1_1=0, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=637/5, var_1_9=99/4] [L58] var_1_9 = __VERIFIER_nondet_float() [L59] CALL assume_abort_if_not((var_1_9 >= -922337.2036854765600e+13F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 9223372.036854765600e+12F && var_1_9 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_1=0, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=637/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=0, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=637/5] [L59] RET assume_abort_if_not((var_1_9 >= -922337.2036854765600e+13F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 9223372.036854765600e+12F && var_1_9 >= 1.0e-20F )) VAL [isInitial=1, var_1_1=0, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=637/5] [L72] RET updateVariables() [L73] CALL step() [L33] var_1_8 = var_1_9 VAL [isInitial=1, var_1_1=0, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=132, var_1_9=132] [L34] COND FALSE !(1.875f != ((((63.1f) > (var_1_8)) ? (63.1f) : (var_1_8)))) VAL [isInitial=1, var_1_1=0, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=132, var_1_9=132] [L73] RET step() [L74] CALL, EXPR property() [L64-L65] return ((1.875f != ((((63.1f) > (var_1_8)) ? (63.1f) : (var_1_8)))) ? (var_1_3 ? (var_1_1 == ((unsigned char) ((var_1_4 || var_1_5) || var_1_6))) : (var_1_1 == ((unsigned char) (! var_1_7)))) : 1) && (var_1_8 == ((float) var_1_9)) ; [L74] RET, EXPR property() [L74] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, var_1_1=0, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=132, var_1_9=132] [L19] reach_error() VAL [isInitial=1, var_1_1=0, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=132, var_1_9=132] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 32 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 0.8s, OverallIterations: 2, TraceHistogramMax: 11, 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, 39 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 0 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3 IncrementalHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 0 mSolverCounterUnsat, 39 mSDtfsCounter, 3 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 35 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=32occurred 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.1s AutomataMinimizationTime, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.2s InterpolantComputationTime, 134 NumberOfCodeBlocks, 134 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 66 ConstructedInterpolants, 0 QuantifiedInterpolants, 66 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 220/220 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-10-24 10:20:08,026 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 /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-69.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 be2af847ca6e6b21a33c086089fa377d9cd33581334f785b17b8fcc9e5016299 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4a390ef-m [2024-10-24 10:20:10,195 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-24 10:20:10,279 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-10-24 10:20:10,286 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-24 10:20:10,287 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-24 10:20:10,318 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-24 10:20:10,323 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-24 10:20:10,323 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-24 10:20:10,324 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-24 10:20:10,324 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-24 10:20:10,324 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-24 10:20:10,324 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-24 10:20:10,325 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-24 10:20:10,326 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-24 10:20:10,326 INFO L153 SettingsManager]: * Use SBE=true [2024-10-24 10:20:10,326 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-24 10:20:10,329 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-24 10:20:10,329 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-24 10:20:10,329 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-24 10:20:10,329 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-24 10:20:10,330 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-24 10:20:10,333 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-24 10:20:10,333 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-24 10:20:10,333 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-24 10:20:10,334 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-24 10:20:10,334 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-24 10:20:10,334 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-24 10:20:10,334 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-24 10:20:10,335 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-24 10:20:10,335 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-24 10:20:10,335 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-24 10:20:10,335 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-24 10:20:10,335 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-24 10:20:10,336 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-24 10:20:10,336 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 10:20:10,337 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-24 10:20:10,338 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-24 10:20:10,338 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-24 10:20:10,339 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-24 10:20:10,339 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-24 10:20:10,340 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-24 10:20:10,340 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-24 10:20:10,340 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-24 10:20:10,340 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-24 10:20:10,341 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-24 10:20:10,341 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 -> be2af847ca6e6b21a33c086089fa377d9cd33581334f785b17b8fcc9e5016299 [2024-10-24 10:20:10,678 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-24 10:20:10,699 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-24 10:20:10,702 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-24 10:20:10,703 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-24 10:20:10,704 INFO L274 PluginConnector]: CDTParser initialized [2024-10-24 10:20:10,706 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-69.i [2024-10-24 10:20:12,272 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-24 10:20:12,469 INFO L384 CDTParser]: Found 1 translation units. [2024-10-24 10:20:12,469 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-69.i [2024-10-24 10:20:12,476 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d6c99c8ec/be09ddccdd3048398b5278189e8cdf42/FLAG2c3987555 [2024-10-24 10:20:12,488 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d6c99c8ec/be09ddccdd3048398b5278189e8cdf42 [2024-10-24 10:20:12,489 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-24 10:20:12,490 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-24 10:20:12,493 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-24 10:20:12,493 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-24 10:20:12,499 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-24 10:20:12,500 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 10:20:12" (1/1) ... [2024-10-24 10:20:12,502 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@443f7385 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:20:12, skipping insertion in model container [2024-10-24 10:20:12,502 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 10:20:12" (1/1) ... [2024-10-24 10:20:12,523 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 10:20:12,699 WARN L248 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-69.i[915,928] [2024-10-24 10:20:12,739 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 10:20:12,760 INFO L200 MainTranslator]: Completed pre-run [2024-10-24 10:20:12,772 WARN L248 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-69.i[915,928] [2024-10-24 10:20:12,790 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 10:20:12,815 INFO L204 MainTranslator]: Completed translation [2024-10-24 10:20:12,816 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:20:12 WrapperNode [2024-10-24 10:20:12,816 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-24 10:20:12,817 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-24 10:20:12,817 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-24 10:20:12,817 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-24 10:20:12,823 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:20:12" (1/1) ... [2024-10-24 10:20:12,836 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:20:12" (1/1) ... [2024-10-24 10:20:12,876 INFO L138 Inliner]: procedures = 27, calls = 24, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 76 [2024-10-24 10:20:12,878 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-24 10:20:12,879 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-24 10:20:12,879 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-24 10:20:12,879 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-24 10:20:12,889 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:20:12" (1/1) ... [2024-10-24 10:20:12,890 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:20:12" (1/1) ... [2024-10-24 10:20:12,892 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:20:12" (1/1) ... [2024-10-24 10:20:12,906 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-10-24 10:20:12,906 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:20:12" (1/1) ... [2024-10-24 10:20:12,906 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:20:12" (1/1) ... [2024-10-24 10:20:12,920 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:20:12" (1/1) ... [2024-10-24 10:20:12,927 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:20:12" (1/1) ... [2024-10-24 10:20:12,932 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:20:12" (1/1) ... [2024-10-24 10:20:12,933 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:20:12" (1/1) ... [2024-10-24 10:20:12,939 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-24 10:20:12,940 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-24 10:20:12,940 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-24 10:20:12,941 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-24 10:20:12,945 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:20:12" (1/1) ... [2024-10-24 10:20:12,950 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 10:20:12,961 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 10:20:12,976 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-10-24 10:20:12,982 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-10-24 10:20:13,034 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-24 10:20:13,034 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-24 10:20:13,034 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-24 10:20:13,034 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-24 10:20:13,036 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-24 10:20:13,036 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-24 10:20:13,119 INFO L238 CfgBuilder]: Building ICFG [2024-10-24 10:20:13,122 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-24 10:20:13,314 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2024-10-24 10:20:13,314 INFO L287 CfgBuilder]: Performing block encoding [2024-10-24 10:20:13,382 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-24 10:20:13,383 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-24 10:20:13,383 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 10:20:13 BoogieIcfgContainer [2024-10-24 10:20:13,383 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-24 10:20:13,389 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-24 10:20:13,389 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-24 10:20:13,394 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-24 10:20:13,395 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 10:20:12" (1/3) ... [2024-10-24 10:20:13,395 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@111948ff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 10:20:13, skipping insertion in model container [2024-10-24 10:20:13,395 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:20:12" (2/3) ... [2024-10-24 10:20:13,396 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@111948ff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 10:20:13, skipping insertion in model container [2024-10-24 10:20:13,396 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 10:20:13" (3/3) ... [2024-10-24 10:20:13,397 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount10_file-69.i [2024-10-24 10:20:13,421 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-24 10:20:13,421 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-24 10:20:13,486 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-24 10:20:13,494 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;@272c536a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-24 10:20:13,495 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-24 10:20:13,499 INFO L276 IsEmpty]: Start isEmpty. Operand has 32 states, 18 states have (on average 1.3888888888888888) internal successors, (25), 19 states have internal predecessors, (25), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-10-24 10:20:13,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2024-10-24 10:20:13,509 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 10:20:13,509 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-24 10:20:13,510 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 10:20:13,518 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 10:20:13,519 INFO L85 PathProgramCache]: Analyzing trace with hash 1980465210, now seen corresponding path program 1 times [2024-10-24 10:20:13,534 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 10:20:13,535 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1776631338] [2024-10-24 10:20:13,535 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 10:20:13,535 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-10-24 10:20:13,536 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 10:20:13,539 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-10-24 10:20:13,540 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-10-24 10:20:13,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:20:13,690 INFO L255 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-24 10:20:13,698 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 10:20:13,728 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-10-24 10:20:13,729 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 10:20:13,732 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 10:20:13,732 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1776631338] [2024-10-24 10:20:13,733 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1776631338] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 10:20:13,733 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 10:20:13,733 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 10:20:13,735 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [442762379] [2024-10-24 10:20:13,736 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 10:20:13,740 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-24 10:20:13,740 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 10:20:13,762 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-24 10:20:13,762 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-24 10:20:13,764 INFO L87 Difference]: Start difference. First operand has 32 states, 18 states have (on average 1.3888888888888888) internal successors, (25), 19 states have internal predecessors, (25), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand has 2 states, 2 states have (on average 7.5) internal successors, (15), 2 states have internal predecessors, (15), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-24 10:20:13,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 10:20:13,794 INFO L93 Difference]: Finished difference Result 61 states and 103 transitions. [2024-10-24 10:20:13,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-24 10:20:13,797 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 7.5) internal successors, (15), 2 states have internal predecessors, (15), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 67 [2024-10-24 10:20:13,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 10:20:13,801 INFO L225 Difference]: With dead ends: 61 [2024-10-24 10:20:13,802 INFO L226 Difference]: Without dead ends: 30 [2024-10-24 10:20:13,804 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 66 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-10-24 10:20:13,808 INFO L432 NwaCegarLoop]: 38 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 10:20:13,809 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 38 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 10:20:13,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2024-10-24 10:20:13,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2024-10-24 10:20:13,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 17 states have (on average 1.1176470588235294) internal successors, (19), 17 states have internal predecessors, (19), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-10-24 10:20:13,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 41 transitions. [2024-10-24 10:20:13,845 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 41 transitions. Word has length 67 [2024-10-24 10:20:13,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 10:20:13,846 INFO L471 AbstractCegarLoop]: Abstraction has 30 states and 41 transitions. [2024-10-24 10:20:13,846 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 7.5) internal successors, (15), 2 states have internal predecessors, (15), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-24 10:20:13,847 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 41 transitions. [2024-10-24 10:20:13,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2024-10-24 10:20:13,851 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 10:20:13,851 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-24 10:20:13,857 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-10-24 10:20:14,052 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-10-24 10:20:14,052 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 10:20:14,053 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 10:20:14,053 INFO L85 PathProgramCache]: Analyzing trace with hash 103958247, now seen corresponding path program 1 times [2024-10-24 10:20:14,054 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 10:20:14,054 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [276073130] [2024-10-24 10:20:14,055 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 10:20:14,055 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-10-24 10:20:14,055 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 10:20:14,058 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-10-24 10:20:14,059 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-10-24 10:20:14,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:20:14,172 INFO L255 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 20 conjuncts are in the unsatisfiable core [2024-10-24 10:20:14,180 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 10:20:17,572 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 181 proven. 21 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-10-24 10:20:17,572 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 10:20:18,964 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 10:20:18,964 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [276073130] [2024-10-24 10:20:18,964 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [276073130] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 10:20:18,965 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1151710239] [2024-10-24 10:20:18,965 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 10:20:18,965 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-10-24 10:20:18,965 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-10-24 10:20:18,968 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-10-24 10:20:18,970 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (4)] Waiting until timeout for monitored process [2024-10-24 10:20:19,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:20:19,293 INFO L255 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 20 conjuncts are in the unsatisfiable core [2024-10-24 10:20:19,297 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 10:20:21,109 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 170 proven. 27 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2024-10-24 10:20:21,110 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 10:20:22,412 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2024-10-24 10:20:22,413 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1151710239] provided 1 perfect and 1 imperfect interpolant sequences [2024-10-24 10:20:22,413 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-10-24 10:20:22,413 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [20, 17] total 41 [2024-10-24 10:20:22,414 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [961595615] [2024-10-24 10:20:22,414 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 10:20:22,414 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-24 10:20:22,414 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 10:20:22,418 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-24 10:20:22,420 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=363, Invalid=1617, Unknown=0, NotChecked=0, Total=1980 [2024-10-24 10:20:22,422 INFO L87 Difference]: Start difference. First operand 30 states and 41 transitions. Second operand has 8 states, 8 states have (on average 2.375) internal successors, (19), 7 states have internal predecessors, (19), 1 states have call successors, (11), 1 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-24 10:20:22,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 10:20:22,686 INFO L93 Difference]: Finished difference Result 58 states and 78 transitions. [2024-10-24 10:20:22,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-24 10:20:22,687 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.375) internal successors, (19), 7 states have internal predecessors, (19), 1 states have call successors, (11), 1 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 1 states have call successors, (11) Word has length 68 [2024-10-24 10:20:22,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 10:20:22,688 INFO L225 Difference]: With dead ends: 58 [2024-10-24 10:20:22,689 INFO L226 Difference]: Without dead ends: 56 [2024-10-24 10:20:22,690 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 209 GetRequests, 165 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 912 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=371, Invalid=1699, Unknown=0, NotChecked=0, Total=2070 [2024-10-24 10:20:22,691 INFO L432 NwaCegarLoop]: 47 mSDtfsCounter, 53 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 106 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 112 SdHoareTripleChecker+Invalid, 134 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 106 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-24 10:20:22,691 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 112 Invalid, 134 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 106 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-24 10:20:22,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2024-10-24 10:20:22,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 52. [2024-10-24 10:20:22,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 28 states have (on average 1.0714285714285714) internal successors, (30), 29 states have internal predecessors, (30), 21 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 20 states have call predecessors, (21), 21 states have call successors, (21) [2024-10-24 10:20:22,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 72 transitions. [2024-10-24 10:20:22,712 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 72 transitions. Word has length 68 [2024-10-24 10:20:22,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 10:20:22,712 INFO L471 AbstractCegarLoop]: Abstraction has 52 states and 72 transitions. [2024-10-24 10:20:22,713 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.375) internal successors, (19), 7 states have internal predecessors, (19), 1 states have call successors, (11), 1 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-24 10:20:22,713 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 72 transitions. [2024-10-24 10:20:22,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2024-10-24 10:20:22,714 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 10:20:22,715 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-24 10:20:22,719 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (4)] Forceful destruction successful, exit code 0 [2024-10-24 10:20:22,919 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-10-24 10:20:23,115 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,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-10-24 10:20:23,116 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 10:20:23,116 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 10:20:23,116 INFO L85 PathProgramCache]: Analyzing trace with hash 104017829, now seen corresponding path program 1 times [2024-10-24 10:20:23,117 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 10:20:23,117 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [428354309] [2024-10-24 10:20:23,117 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 10:20:23,117 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-10-24 10:20:23,117 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 10:20:23,121 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-10-24 10:20:23,122 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-10-24 10:20:23,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:20:23,196 INFO L255 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 20 conjuncts are in the unsatisfiable core [2024-10-24 10:20:23,199 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 10:20:24,764 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 181 proven. 21 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-10-24 10:20:24,764 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 10:20:25,661 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 10:20:25,661 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [428354309] [2024-10-24 10:20:25,661 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [428354309] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 10:20:25,661 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [742449496] [2024-10-24 10:20:25,661 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 10:20:25,662 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-10-24 10:20:25,662 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-10-24 10:20:25,663 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-10-24 10:20:25,664 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (6)] Waiting until timeout for monitored process [2024-10-24 10:20:25,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:20:25,894 INFO L255 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-10-24 10:20:25,896 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 10:20:27,050 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2024-10-24 10:20:27,050 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 10:20:27,051 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [742449496] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 10:20:27,051 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-24 10:20:27,051 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [20] total 26 [2024-10-24 10:20:27,051 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2124961918] [2024-10-24 10:20:27,051 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 10:20:27,052 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-24 10:20:27,052 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 10:20:27,053 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-24 10:20:27,053 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=174, Invalid=756, Unknown=0, NotChecked=0, Total=930 [2024-10-24 10:20:27,053 INFO L87 Difference]: Start difference. First operand 52 states and 72 transitions. Second operand has 8 states, 8 states have (on average 2.375) internal successors, (19), 7 states have internal predecessors, (19), 1 states have call successors, (11), 1 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-24 10:20:27,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 10:20:27,778 INFO L93 Difference]: Finished difference Result 82 states and 110 transitions. [2024-10-24 10:20:27,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-24 10:20:27,779 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.375) internal successors, (19), 7 states have internal predecessors, (19), 1 states have call successors, (11), 1 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 1 states have call successors, (11) Word has length 68 [2024-10-24 10:20:27,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 10:20:27,780 INFO L225 Difference]: With dead ends: 82 [2024-10-24 10:20:27,780 INFO L226 Difference]: Without dead ends: 0 [2024-10-24 10:20:27,781 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 112 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 432 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=219, Invalid=1187, Unknown=0, NotChecked=0, Total=1406 [2024-10-24 10:20:27,782 INFO L432 NwaCegarLoop]: 38 mSDtfsCounter, 52 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 226 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 118 SdHoareTripleChecker+Invalid, 231 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 226 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-24 10:20:27,785 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 118 Invalid, 231 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 226 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-24 10:20:27,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-10-24 10:20:27,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-10-24 10:20:27,787 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-10-24 10:20:27,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-10-24 10:20:27,788 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 68 [2024-10-24 10:20:27,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 10:20:27,788 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-24 10:20:27,788 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.375) internal successors, (19), 7 states have internal predecessors, (19), 1 states have call successors, (11), 1 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-24 10:20:27,788 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-10-24 10:20:27,788 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-10-24 10:20:27,791 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-24 10:20:27,798 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-10-24 10:20:27,996 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (6)] Ended with exit code 0 [2024-10-24 10:20:28,192 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,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2024-10-24 10:20:28,195 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2024-10-24 10:20:28,197 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-10-24 10:20:29,501 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-24 10:20:29,511 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: currentRoundingMode [2024-10-24 10:20:29,512 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: currentRoundingMode [2024-10-24 10:20:29,512 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: currentRoundingMode [2024-10-24 10:20:29,512 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: currentRoundingMode [2024-10-24 10:20:29,521 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.10 10:20:29 BoogieIcfgContainer [2024-10-24 10:20:29,521 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-24 10:20:29,522 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-24 10:20:29,522 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-24 10:20:29,522 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-24 10:20:29,523 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 10:20:13" (3/4) ... [2024-10-24 10:20:29,526 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-10-24 10:20:29,530 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2024-10-24 10:20:29,536 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 17 nodes and edges [2024-10-24 10:20:29,536 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 8 nodes and edges [2024-10-24 10:20:29,536 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-10-24 10:20:29,536 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-10-24 10:20:29,645 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-24 10:20:29,645 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-10-24 10:20:29,645 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-24 10:20:29,646 INFO L158 Benchmark]: Toolchain (without parser) took 17155.57ms. Allocated memory was 62.9MB in the beginning and 425.7MB in the end (delta: 362.8MB). Free memory was 40.7MB in the beginning and 369.5MB in the end (delta: -328.8MB). Peak memory consumption was 34.9MB. Max. memory is 16.1GB. [2024-10-24 10:20:29,646 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 48.2MB. Free memory is still 25.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-24 10:20:29,647 INFO L158 Benchmark]: CACSL2BoogieTranslator took 323.62ms. Allocated memory is still 62.9MB. Free memory was 40.4MB in the beginning and 26.9MB in the end (delta: 13.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-10-24 10:20:29,647 INFO L158 Benchmark]: Boogie Procedure Inliner took 60.93ms. Allocated memory is still 62.9MB. Free memory was 26.9MB in the beginning and 43.1MB in the end (delta: -16.2MB). Peak memory consumption was 2.9MB. Max. memory is 16.1GB. [2024-10-24 10:20:29,647 INFO L158 Benchmark]: Boogie Preprocessor took 60.51ms. Allocated memory is still 62.9MB. Free memory was 43.1MB in the beginning and 40.8MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-24 10:20:29,648 INFO L158 Benchmark]: RCFGBuilder took 443.03ms. Allocated memory is still 62.9MB. Free memory was 40.8MB in the beginning and 24.8MB in the end (delta: 15.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-10-24 10:20:29,648 INFO L158 Benchmark]: TraceAbstraction took 16132.51ms. Allocated memory was 62.9MB in the beginning and 425.7MB in the end (delta: 362.8MB). Free memory was 24.3MB in the beginning and 374.8MB in the end (delta: -350.5MB). Peak memory consumption was 238.0MB. Max. memory is 16.1GB. [2024-10-24 10:20:29,648 INFO L158 Benchmark]: Witness Printer took 123.51ms. Allocated memory is still 425.7MB. Free memory was 374.8MB in the beginning and 369.5MB in the end (delta: 5.2MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-10-24 10:20:29,649 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 48.2MB. Free memory is still 25.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 323.62ms. Allocated memory is still 62.9MB. Free memory was 40.4MB in the beginning and 26.9MB in the end (delta: 13.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 60.93ms. Allocated memory is still 62.9MB. Free memory was 26.9MB in the beginning and 43.1MB in the end (delta: -16.2MB). Peak memory consumption was 2.9MB. Max. memory is 16.1GB. * Boogie Preprocessor took 60.51ms. Allocated memory is still 62.9MB. Free memory was 43.1MB in the beginning and 40.8MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 443.03ms. Allocated memory is still 62.9MB. Free memory was 40.8MB in the beginning and 24.8MB in the end (delta: 15.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 16132.51ms. Allocated memory was 62.9MB in the beginning and 425.7MB in the end (delta: 362.8MB). Free memory was 24.3MB in the beginning and 374.8MB in the end (delta: -350.5MB). Peak memory consumption was 238.0MB. Max. memory is 16.1GB. * Witness Printer took 123.51ms. Allocated memory is still 425.7MB. Free memory was 374.8MB in the beginning and 369.5MB in the end (delta: 5.2MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: currentRoundingMode - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: currentRoundingMode - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: currentRoundingMode - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: currentRoundingMode * 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, 32 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 14.7s, OverallIterations: 3, TraceHistogramMax: 11, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 125 SdHoareTripleChecker+Valid, 0.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 105 mSDsluCounter, 268 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 145 mSDsCounter, 33 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 335 IncrementalHoareTripleChecker+Invalid, 368 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 33 mSolverCounterUnsat, 123 mSDtfsCounter, 335 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 423 GetRequests, 343 SyntacticMatches, 0 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1344 ImplicationChecksByTransitivity, 3.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=52occurred in iteration=2, InterpolantAutomatonStates: 24, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 3 MinimizatonAttempts, 4 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 11.6s InterpolantComputationTime, 339 NumberOfCodeBlocks, 339 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 401 ConstructedInterpolants, 0 QuantifiedInterpolants, 2753 SizeOfPredicates, 41 NumberOfNonLiveVariables, 558 ConjunctsInSsa, 71 ConjunctsInUnsatCore, 6 InterpolantComputations, 3 PerfectInterpolantSequences, 1251/1320 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: 70]: 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_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))) && (var_1_9 == \old(var_1_9)))) RESULT: Ultimate proved your program to be correct! [2024-10-24 10:20:29,688 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