./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-69.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c7c6ca5d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_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-?-c7c6ca5-m [2024-11-09 00:34:31,176 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 00:34:31,242 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-09 00:34:31,246 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 00:34:31,246 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 00:34:31,274 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 00:34:31,275 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 00:34:31,275 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 00:34:31,276 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 00:34:31,276 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 00:34:31,277 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 00:34:31,277 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 00:34:31,279 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 00:34:31,279 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 00:34:31,281 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 00:34:31,281 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 00:34:31,282 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-09 00:34:31,282 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 00:34:31,282 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 00:34:31,282 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 00:34:31,283 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 00:34:31,283 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-09 00:34:31,283 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 00:34:31,284 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-09 00:34:31,284 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 00:34:31,284 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 00:34:31,284 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-09 00:34:31,288 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 00:34:31,289 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 00:34:31,289 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 00:34:31,289 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 00:34:31,289 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 00:34:31,289 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 00:34:31,290 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 00:34:31,290 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 00:34:31,290 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-09 00:34:31,290 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-09 00:34:31,291 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-09 00:34:31,291 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 00:34:31,291 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 00:34:31,291 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 00:34:31,294 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 00:34:31,294 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-11-09 00:34:31,527 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 00:34:31,551 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 00:34:31,555 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 00:34:31,556 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 00:34:31,557 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 00:34:31,558 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-69.i [2024-11-09 00:34:33,061 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 00:34:33,244 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 00:34:33,244 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-69.i [2024-11-09 00:34:33,253 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a94c1120a/0695423437f240f5a20274aa52cfe044/FLAG179058e63 [2024-11-09 00:34:33,622 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a94c1120a/0695423437f240f5a20274aa52cfe044 [2024-11-09 00:34:33,624 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 00:34:33,625 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 00:34:33,626 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 00:34:33,626 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 00:34:33,630 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 00:34:33,631 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 12:34:33" (1/1) ... [2024-11-09 00:34:33,632 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5a15aa3c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:34:33, skipping insertion in model container [2024-11-09 00:34:33,632 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 12:34:33" (1/1) ... [2024-11-09 00:34:33,654 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 00:34:33,811 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-69.i[915,928] [2024-11-09 00:34:33,847 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 00:34:33,854 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 00:34:33,864 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-69.i[915,928] [2024-11-09 00:34:33,874 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 00:34:33,893 INFO L204 MainTranslator]: Completed translation [2024-11-09 00:34:33,894 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:34:33 WrapperNode [2024-11-09 00:34:33,894 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 00:34:33,895 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 00:34:33,895 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 00:34:33,895 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 00:34:33,902 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:34:33" (1/1) ... [2024-11-09 00:34:33,909 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:34:33" (1/1) ... [2024-11-09 00:34:33,938 INFO L138 Inliner]: procedures = 26, calls = 24, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 76 [2024-11-09 00:34:33,938 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 00:34:33,939 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 00:34:33,939 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 00:34:33,939 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 00:34:33,958 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:34:33" (1/1) ... [2024-11-09 00:34:33,959 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:34:33" (1/1) ... [2024-11-09 00:34:33,961 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:34:33" (1/1) ... [2024-11-09 00:34:33,973 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-09 00:34:33,974 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:34:33" (1/1) ... [2024-11-09 00:34:33,974 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:34:33" (1/1) ... [2024-11-09 00:34:33,978 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:34:33" (1/1) ... [2024-11-09 00:34:33,981 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:34:33" (1/1) ... [2024-11-09 00:34:33,982 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:34:33" (1/1) ... [2024-11-09 00:34:33,983 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:34:33" (1/1) ... [2024-11-09 00:34:33,985 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 00:34:33,990 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 00:34:33,990 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 00:34:33,990 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 00:34:33,991 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:34:33" (1/1) ... [2024-11-09 00:34:33,997 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 00:34:34,010 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 00:34:34,026 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-09 00:34:34,029 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-09 00:34:34,070 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 00:34:34,070 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-09 00:34:34,070 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-09 00:34:34,070 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-09 00:34:34,070 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 00:34:34,070 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 00:34:34,163 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 00:34:34,165 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 00:34:34,352 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2024-11-09 00:34:34,352 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 00:34:34,364 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 00:34:34,364 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-09 00:34:34,364 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 12:34:34 BoogieIcfgContainer [2024-11-09 00:34:34,364 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 00:34:34,367 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 00:34:34,367 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 00:34:34,370 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 00:34:34,371 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 12:34:33" (1/3) ... [2024-11-09 00:34:34,371 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@58e5296a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 12:34:34, skipping insertion in model container [2024-11-09 00:34:34,371 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:34:33" (2/3) ... [2024-11-09 00:34:34,372 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@58e5296a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 12:34:34, skipping insertion in model container [2024-11-09 00:34:34,372 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 12:34:34" (3/3) ... [2024-11-09 00:34:34,373 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount10_file-69.i [2024-11-09 00:34:34,388 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 00:34:34,388 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-09 00:34:34,440 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 00:34:34,448 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@415b57da, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 00:34:34,448 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-09 00:34:34,452 INFO L276 IsEmpty]: Start isEmpty. Operand has 38 states, 24 states have (on average 1.2916666666666667) internal successors, (31), 25 states have internal predecessors, (31), 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-11-09 00:34:34,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2024-11-09 00:34:34,462 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 00:34:34,464 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, 1, 1, 1] [2024-11-09 00:34:34,464 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 00:34:34,470 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 00:34:34,471 INFO L85 PathProgramCache]: Analyzing trace with hash -1785575530, now seen corresponding path program 1 times [2024-11-09 00:34:34,479 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 00:34:34,480 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [548570180] [2024-11-09 00:34:34,480 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 00:34:34,481 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:34:34,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:34:34,684 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 00:34:34,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:34:34,693 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-09 00:34:34,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:34:34,699 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-09 00:34:34,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:34:34,703 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-09 00:34:34,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:34:34,709 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-09 00:34:34,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:34:34,715 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-09 00:34:34,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:34:34,724 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-09 00:34:34,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:34:34,728 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-09 00:34:34,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:34:34,734 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-09 00:34:34,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:34:34,739 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-09 00:34:34,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:34:34,744 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-09 00:34:34,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:34:34,751 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-11-09 00:34:34,751 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 00:34:34,752 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [548570180] [2024-11-09 00:34:34,752 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [548570180] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 00:34:34,753 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 00:34:34,753 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 00:34:34,754 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1299219709] [2024-11-09 00:34:34,755 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 00:34:34,759 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-09 00:34:34,759 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 00:34:34,789 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-09 00:34:34,790 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-09 00:34:34,792 INFO L87 Difference]: Start difference. First operand has 38 states, 24 states have (on average 1.2916666666666667) internal successors, (31), 25 states have internal predecessors, (31), 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 9.5) internal successors, (19), 2 states have internal predecessors, (19), 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-11-09 00:34:34,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 00:34:34,817 INFO L93 Difference]: Finished difference Result 69 states and 111 transitions. [2024-11-09 00:34:34,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-09 00:34:34,820 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 9.5) internal successors, (19), 2 states have internal predecessors, (19), 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 71 [2024-11-09 00:34:34,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 00:34:34,825 INFO L225 Difference]: With dead ends: 69 [2024-11-09 00:34:34,826 INFO L226 Difference]: Without dead ends: 34 [2024-11-09 00:34:34,830 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-11-09 00:34:34,833 INFO L432 NwaCegarLoop]: 46 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 46 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 00:34:34,834 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 00:34:34,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2024-11-09 00:34:34,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2024-11-09 00:34:34,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 21 states have (on average 1.1428571428571428) internal successors, (24), 21 states have internal predecessors, (24), 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-11-09 00:34:34,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 46 transitions. [2024-11-09 00:34:34,873 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 46 transitions. Word has length 71 [2024-11-09 00:34:34,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 00:34:34,873 INFO L471 AbstractCegarLoop]: Abstraction has 34 states and 46 transitions. [2024-11-09 00:34:34,873 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 9.5) internal successors, (19), 2 states have internal predecessors, (19), 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-11-09 00:34:34,873 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 46 transitions. [2024-11-09 00:34:34,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2024-11-09 00:34:34,876 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 00:34:34,876 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, 1, 1, 1] [2024-11-09 00:34:34,876 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-09 00:34:34,877 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 00:34:34,877 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 00:34:34,878 INFO L85 PathProgramCache]: Analyzing trace with hash 1357657816, now seen corresponding path program 1 times [2024-11-09 00:34:34,878 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 00:34:34,878 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1084373484] [2024-11-09 00:34:34,878 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 00:34:34,879 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:34:35,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 00:34:35,020 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 00:34:35,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 00:34:35,118 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 00:34:35,119 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-09 00:34:35,120 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-09 00:34:35,122 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-09 00:34:35,124 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1] [2024-11-09 00:34:35,173 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-09 00:34:35,177 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.11 12:34:35 BoogieIcfgContainer [2024-11-09 00:34:35,177 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-09 00:34:35,178 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-09 00:34:35,178 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-09 00:34:35,178 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-09 00:34:35,178 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 12:34:34" (3/4) ... [2024-11-09 00:34:35,181 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-09 00:34:35,182 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-09 00:34:35,183 INFO L158 Benchmark]: Toolchain (without parser) took 1557.51ms. Allocated memory is still 155.2MB. Free memory was 85.8MB in the beginning and 72.8MB in the end (delta: 13.0MB). Peak memory consumption was 13.7MB. Max. memory is 16.1GB. [2024-11-09 00:34:35,184 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 113.2MB. Free memory is still 73.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 00:34:35,185 INFO L158 Benchmark]: CACSL2BoogieTranslator took 268.32ms. Allocated memory is still 155.2MB. Free memory was 85.6MB in the beginning and 72.5MB in the end (delta: 13.1MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-09 00:34:35,185 INFO L158 Benchmark]: Boogie Procedure Inliner took 43.25ms. Allocated memory is still 155.2MB. Free memory was 72.3MB in the beginning and 70.4MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 00:34:35,185 INFO L158 Benchmark]: Boogie Preprocessor took 46.20ms. Allocated memory is still 155.2MB. Free memory was 70.4MB in the beginning and 68.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-09 00:34:35,186 INFO L158 Benchmark]: RCFGBuilder took 374.83ms. Allocated memory is still 155.2MB. Free memory was 68.3MB in the beginning and 116.8MB in the end (delta: -48.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-11-09 00:34:35,186 INFO L158 Benchmark]: TraceAbstraction took 810.30ms. Allocated memory is still 155.2MB. Free memory was 116.1MB in the beginning and 73.5MB in the end (delta: 42.6MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. [2024-11-09 00:34:35,187 INFO L158 Benchmark]: Witness Printer took 4.43ms. Allocated memory is still 155.2MB. Free memory was 73.5MB in the beginning and 72.8MB in the end (delta: 727.0kB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-09 00:34:35,191 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 113.2MB. Free memory is still 73.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 268.32ms. Allocated memory is still 155.2MB. Free memory was 85.6MB in the beginning and 72.5MB in the end (delta: 13.1MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 43.25ms. Allocated memory is still 155.2MB. Free memory was 72.3MB in the beginning and 70.4MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 46.20ms. Allocated memory is still 155.2MB. Free memory was 70.4MB in the beginning and 68.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 374.83ms. Allocated memory is still 155.2MB. Free memory was 68.3MB in the beginning and 116.8MB in the end (delta: -48.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * TraceAbstraction took 810.30ms. Allocated memory is still 155.2MB. Free memory was 116.1MB in the beginning and 73.5MB in the end (delta: 42.6MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. * Witness Printer took 4.43ms. Allocated memory is still 155.2MB. Free memory was 73.5MB in the beginning and 72.8MB in the end (delta: 727.0kB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 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; VAL [isInitial=0, 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] [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)) ; VAL [\result=0, 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] [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, 38 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 0.7s, 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, 46 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 0 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 0 IncrementalHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 0 mSolverCounterUnsat, 46 mSDtfsCounter, 0 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=38occurred in iteration=0, InterpolantAutomatonStates: 2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 142 NumberOfCodeBlocks, 142 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 70 ConstructedInterpolants, 0 QuantifiedInterpolants, 70 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-11-09 00:34:35,225 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-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-?-c7c6ca5-m [2024-11-09 00:34:37,445 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 00:34:37,517 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-09 00:34:37,523 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 00:34:37,524 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 00:34:37,562 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 00:34:37,564 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 00:34:37,564 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 00:34:37,565 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 00:34:37,565 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 00:34:37,566 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 00:34:37,567 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 00:34:37,567 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 00:34:37,568 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 00:34:37,570 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 00:34:37,570 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 00:34:37,571 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-09 00:34:37,571 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 00:34:37,571 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 00:34:37,571 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 00:34:37,572 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-09 00:34:37,575 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 00:34:37,576 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-09 00:34:37,576 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-09 00:34:37,576 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-09 00:34:37,576 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 00:34:37,577 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-09 00:34:37,577 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 00:34:37,577 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-09 00:34:37,577 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 00:34:37,578 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 00:34:37,579 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 00:34:37,579 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 00:34:37,580 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 00:34:37,580 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 00:34:37,580 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 00:34:37,581 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 00:34:37,581 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-09 00:34:37,581 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-09 00:34:37,582 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-09 00:34:37,582 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 00:34:37,582 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 00:34:37,582 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 00:34:37,583 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 00:34:37,583 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-11-09 00:34:37,891 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 00:34:37,915 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 00:34:37,918 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 00:34:37,920 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 00:34:37,920 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 00:34:37,921 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-69.i [2024-11-09 00:34:39,487 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 00:34:39,704 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 00:34:39,707 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-69.i [2024-11-09 00:34:39,719 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8d6aed44e/2999255c56d04bb0a8db66fe345498eb/FLAG2756945e5 [2024-11-09 00:34:39,737 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8d6aed44e/2999255c56d04bb0a8db66fe345498eb [2024-11-09 00:34:39,740 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 00:34:39,741 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 00:34:39,744 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 00:34:39,744 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 00:34:39,749 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 00:34:39,750 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 12:34:39" (1/1) ... [2024-11-09 00:34:39,753 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3ecf4a71 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:34:39, skipping insertion in model container [2024-11-09 00:34:39,753 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 12:34:39" (1/1) ... [2024-11-09 00:34:39,784 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 00:34:39,976 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-69.i[915,928] [2024-11-09 00:34:40,011 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 00:34:40,028 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 00:34:40,041 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-69.i[915,928] [2024-11-09 00:34:40,058 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 00:34:40,084 INFO L204 MainTranslator]: Completed translation [2024-11-09 00:34:40,084 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:34:40 WrapperNode [2024-11-09 00:34:40,084 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 00:34:40,085 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 00:34:40,085 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 00:34:40,086 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 00:34:40,092 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:34:40" (1/1) ... [2024-11-09 00:34:40,106 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:34:40" (1/1) ... [2024-11-09 00:34:40,130 INFO L138 Inliner]: procedures = 27, calls = 24, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 76 [2024-11-09 00:34:40,133 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 00:34:40,134 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 00:34:40,134 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 00:34:40,135 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 00:34:40,144 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:34:40" (1/1) ... [2024-11-09 00:34:40,144 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:34:40" (1/1) ... [2024-11-09 00:34:40,146 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:34:40" (1/1) ... [2024-11-09 00:34:40,164 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-09 00:34:40,165 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:34:40" (1/1) ... [2024-11-09 00:34:40,166 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:34:40" (1/1) ... [2024-11-09 00:34:40,177 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:34:40" (1/1) ... [2024-11-09 00:34:40,184 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:34:40" (1/1) ... [2024-11-09 00:34:40,186 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:34:40" (1/1) ... [2024-11-09 00:34:40,187 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:34:40" (1/1) ... [2024-11-09 00:34:40,189 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 00:34:40,190 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 00:34:40,190 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 00:34:40,190 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 00:34:40,191 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:34:40" (1/1) ... [2024-11-09 00:34:40,196 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 00:34:40,209 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 00:34:40,225 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-09 00:34:40,228 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-09 00:34:40,278 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 00:34:40,279 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-09 00:34:40,279 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-09 00:34:40,279 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-09 00:34:40,279 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 00:34:40,279 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 00:34:40,343 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 00:34:40,345 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 00:34:40,543 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2024-11-09 00:34:40,545 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 00:34:40,560 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 00:34:40,561 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-09 00:34:40,561 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 12:34:40 BoogieIcfgContainer [2024-11-09 00:34:40,561 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 00:34:40,563 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 00:34:40,564 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 00:34:40,567 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 00:34:40,567 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 12:34:39" (1/3) ... [2024-11-09 00:34:40,568 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3ba4ff19 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 12:34:40, skipping insertion in model container [2024-11-09 00:34:40,569 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:34:40" (2/3) ... [2024-11-09 00:34:40,569 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3ba4ff19 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 12:34:40, skipping insertion in model container [2024-11-09 00:34:40,570 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 12:34:40" (3/3) ... [2024-11-09 00:34:40,571 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount10_file-69.i [2024-11-09 00:34:40,588 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 00:34:40,588 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-09 00:34:40,654 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 00:34:40,660 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;@7aaccc4c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 00:34:40,660 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-09 00:34:40,664 INFO L276 IsEmpty]: Start isEmpty. Operand has 38 states, 24 states have (on average 1.2916666666666667) internal successors, (31), 25 states have internal predecessors, (31), 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-11-09 00:34:40,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2024-11-09 00:34:40,672 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 00:34:40,673 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, 1, 1, 1] [2024-11-09 00:34:40,673 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 00:34:40,677 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 00:34:40,677 INFO L85 PathProgramCache]: Analyzing trace with hash -1785575530, now seen corresponding path program 1 times [2024-11-09 00:34:40,690 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 00:34:40,691 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [266047996] [2024-11-09 00:34:40,691 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 00:34:40,692 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 00:34:40,695 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 00:34:40,696 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 00:34:40,698 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-09 00:34:40,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:34:40,840 INFO L255 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-09 00:34:40,858 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 00:34:40,892 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 164 trivial. 0 not checked. [2024-11-09 00:34:40,892 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 00:34:40,893 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 00:34:40,893 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [266047996] [2024-11-09 00:34:40,893 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [266047996] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 00:34:40,893 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 00:34:40,894 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 00:34:40,897 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1275800941] [2024-11-09 00:34:40,898 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 00:34:40,902 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-09 00:34:40,902 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 00:34:40,925 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-09 00:34:40,925 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-09 00:34:40,928 INFO L87 Difference]: Start difference. First operand has 38 states, 24 states have (on average 1.2916666666666667) internal successors, (31), 25 states have internal predecessors, (31), 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 11.5) internal successors, (23), 2 states have internal predecessors, (23), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-11-09 00:34:40,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 00:34:40,953 INFO L93 Difference]: Finished difference Result 69 states and 111 transitions. [2024-11-09 00:34:40,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-09 00:34:40,957 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 11.5) internal successors, (23), 2 states have internal predecessors, (23), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 71 [2024-11-09 00:34:40,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 00:34:40,964 INFO L225 Difference]: With dead ends: 69 [2024-11-09 00:34:40,965 INFO L226 Difference]: Without dead ends: 34 [2024-11-09 00:34:40,969 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-09 00:34:40,975 INFO L432 NwaCegarLoop]: 45 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 00:34:40,976 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 00:34:40,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2024-11-09 00:34:41,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2024-11-09 00:34:41,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 21 states have (on average 1.0952380952380953) internal successors, (23), 21 states have internal predecessors, (23), 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-11-09 00:34:41,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 45 transitions. [2024-11-09 00:34:41,022 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 45 transitions. Word has length 71 [2024-11-09 00:34:41,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 00:34:41,023 INFO L471 AbstractCegarLoop]: Abstraction has 34 states and 45 transitions. [2024-11-09 00:34:41,024 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 11.5) internal successors, (23), 2 states have internal predecessors, (23), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-11-09 00:34:41,024 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 45 transitions. [2024-11-09 00:34:41,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2024-11-09 00:34:41,027 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 00:34:41,028 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, 1, 1, 1, 1] [2024-11-09 00:34:41,035 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2024-11-09 00:34:41,229 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 00:34:41,230 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 00:34:41,230 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 00:34:41,230 INFO L85 PathProgramCache]: Analyzing trace with hash -1097840993, now seen corresponding path program 1 times [2024-11-09 00:34:41,231 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 00:34:41,232 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1656884959] [2024-11-09 00:34:41,232 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 00:34:41,232 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 00:34:41,232 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 00:34:41,235 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 00:34:41,236 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-09 00:34:41,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:34:41,366 INFO L255 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 23 conjuncts are in the unsatisfiable core [2024-11-09 00:34:41,373 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 00:34:44,950 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 181 proven. 21 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-11-09 00:34:44,951 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 00:34:46,376 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 00:34:46,377 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1656884959] [2024-11-09 00:34:46,377 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1656884959] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 00:34:46,377 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [231789453] [2024-11-09 00:34:46,378 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 00:34:46,378 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-09 00:34:46,378 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-09 00:34:46,381 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-11-09 00:34:46,383 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-11-09 00:34:46,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:34:46,674 INFO L255 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 23 conjuncts are in the unsatisfiable core [2024-11-09 00:34:46,683 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 00:34:48,439 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 170 proven. 27 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2024-11-09 00:34:48,439 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 00:34:49,587 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2024-11-09 00:34:49,588 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [231789453] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-09 00:34:49,588 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-11-09 00:34:49,588 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [21, 18] total 43 [2024-11-09 00:34:49,589 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1788993105] [2024-11-09 00:34:49,589 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 00:34:49,589 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-09 00:34:49,590 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 00:34:49,591 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-09 00:34:49,593 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=368, Invalid=1794, Unknown=0, NotChecked=0, Total=2162 [2024-11-09 00:34:49,594 INFO L87 Difference]: Start difference. First operand 34 states and 45 transitions. Second operand has 9 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 8 states have internal predecessors, (23), 1 states have call successors, (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-11-09 00:34:49,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 00:34:49,912 INFO L93 Difference]: Finished difference Result 65 states and 85 transitions. [2024-11-09 00:34:49,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-09 00:34:49,913 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 8 states have internal predecessors, (23), 1 states have call successors, (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 72 [2024-11-09 00:34:49,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 00:34:49,915 INFO L225 Difference]: With dead ends: 65 [2024-11-09 00:34:49,915 INFO L226 Difference]: Without dead ends: 63 [2024-11-09 00:34:49,916 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 223 GetRequests, 176 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 999 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=384, Invalid=1968, Unknown=0, NotChecked=0, Total=2352 [2024-11-09 00:34:49,917 INFO L432 NwaCegarLoop]: 54 mSDtfsCounter, 47 mSDsluCounter, 146 mSDsCounter, 0 mSdLazyCounter, 169 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 200 SdHoareTripleChecker+Invalid, 180 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 169 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 00:34:49,918 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 200 Invalid, 180 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 169 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 00:34:49,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2024-11-09 00:34:49,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 58. [2024-11-09 00:34:49,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 34 states have (on average 1.0588235294117647) internal successors, (36), 35 states have internal predecessors, (36), 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-11-09 00:34:49,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 78 transitions. [2024-11-09 00:34:49,933 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 78 transitions. Word has length 72 [2024-11-09 00:34:49,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 00:34:49,934 INFO L471 AbstractCegarLoop]: Abstraction has 58 states and 78 transitions. [2024-11-09 00:34:49,934 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 8 states have internal predecessors, (23), 1 states have call successors, (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-11-09 00:34:49,934 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 78 transitions. [2024-11-09 00:34:49,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2024-11-09 00:34:49,937 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 00:34:49,937 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, 1, 1, 1, 1] [2024-11-09 00:34:49,942 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (4)] Ended with exit code 0 [2024-11-09 00:34:50,142 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2024-11-09 00:34:50,338 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-11-09 00:34:50,338 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 00:34:50,339 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 00:34:50,339 INFO L85 PathProgramCache]: Analyzing trace with hash -1095993951, now seen corresponding path program 1 times [2024-11-09 00:34:50,340 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 00:34:50,340 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [60845716] [2024-11-09 00:34:50,340 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 00:34:50,340 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 00:34:50,341 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 00:34:50,344 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 00:34:50,345 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-11-09 00:34:50,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:34:50,422 INFO L255 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 23 conjuncts are in the unsatisfiable core [2024-11-09 00:34:50,426 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 00:34:52,076 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 181 proven. 21 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-11-09 00:34:52,077 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 00:34:52,988 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 00:34:52,989 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [60845716] [2024-11-09 00:34:52,989 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [60845716] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 00:34:52,989 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [2008102359] [2024-11-09 00:34:52,989 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 00:34:52,989 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-09 00:34:52,989 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-09 00:34:52,992 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-11-09 00:34:52,993 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-11-09 00:34:53,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:34:53,228 INFO L255 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-09 00:34:53,231 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 00:34:54,509 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2024-11-09 00:34:54,509 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 00:34:54,509 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [2008102359] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 00:34:54,510 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-09 00:34:54,510 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [21] total 27 [2024-11-09 00:34:54,510 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1949956629] [2024-11-09 00:34:54,510 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 00:34:54,510 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-09 00:34:54,510 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 00:34:54,511 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-09 00:34:54,512 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=179, Invalid=877, Unknown=0, NotChecked=0, Total=1056 [2024-11-09 00:34:54,512 INFO L87 Difference]: Start difference. First operand 58 states and 78 transitions. Second operand has 9 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 8 states have internal predecessors, (23), 1 states have call successors, (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-11-09 00:34:55,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 00:34:55,331 INFO L93 Difference]: Finished difference Result 89 states and 117 transitions. [2024-11-09 00:34:55,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-09 00:34:55,332 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 8 states have internal predecessors, (23), 1 states have call successors, (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 72 [2024-11-09 00:34:55,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 00:34:55,333 INFO L225 Difference]: With dead ends: 89 [2024-11-09 00:34:55,333 INFO L226 Difference]: Without dead ends: 0 [2024-11-09 00:34:55,334 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 119 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 500 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=231, Invalid=1409, Unknown=0, NotChecked=0, Total=1640 [2024-11-09 00:34:55,335 INFO L432 NwaCegarLoop]: 48 mSDtfsCounter, 55 mSDsluCounter, 162 mSDsCounter, 0 mSdLazyCounter, 248 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 210 SdHoareTripleChecker+Invalid, 253 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 248 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-09 00:34:55,335 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 210 Invalid, 253 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 248 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-09 00:34:55,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-09 00:34:55,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-09 00:34:55,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 00:34:55,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-09 00:34:55,337 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 72 [2024-11-09 00:34:55,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 00:34:55,337 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-09 00:34:55,337 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 8 states have internal predecessors, (23), 1 states have call successors, (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-11-09 00:34:55,338 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-09 00:34:55,338 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-09 00:34:55,340 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-09 00:34:55,347 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 (5)] Ended with exit code 0 [2024-11-09 00:34:55,549 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (6)] Forceful destruction successful, exit code 0 [2024-11-09 00:34:55,744 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-11-09 00:34:55,748 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2024-11-09 00:34:55,750 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-11-09 00:34:57,190 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-09 00:34:57,198 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: currentRoundingMode [2024-11-09 00:34:57,200 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: currentRoundingMode [2024-11-09 00:34:57,200 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: currentRoundingMode [2024-11-09 00:34:57,200 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: currentRoundingMode [2024-11-09 00:34:57,208 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.11 12:34:57 BoogieIcfgContainer [2024-11-09 00:34:57,209 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-09 00:34:57,209 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-09 00:34:57,209 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-09 00:34:57,210 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-09 00:34:57,210 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 12:34:40" (3/4) ... [2024-11-09 00:34:57,212 INFO L142 WitnessPrinter]: Generating witness for correct program [2024-11-09 00:34:57,216 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2024-11-09 00:34:57,220 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 15 nodes and edges [2024-11-09 00:34:57,221 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2024-11-09 00:34:57,221 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-11-09 00:34:57,221 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-09 00:34:57,313 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-09 00:34:57,313 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-09 00:34:57,313 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-09 00:34:57,314 INFO L158 Benchmark]: Toolchain (without parser) took 17572.70ms. Allocated memory was 69.2MB in the beginning and 509.6MB in the end (delta: 440.4MB). Free memory was 34.4MB in the beginning and 271.6MB in the end (delta: -237.2MB). Peak memory consumption was 203.5MB. Max. memory is 16.1GB. [2024-11-09 00:34:57,314 INFO L158 Benchmark]: CDTParser took 1.76ms. Allocated memory is still 52.4MB. Free memory is still 29.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 00:34:57,314 INFO L158 Benchmark]: CACSL2BoogieTranslator took 340.65ms. Allocated memory is still 69.2MB. Free memory was 34.2MB in the beginning and 36.7MB in the end (delta: -2.5MB). Peak memory consumption was 2.7MB. Max. memory is 16.1GB. [2024-11-09 00:34:57,315 INFO L158 Benchmark]: Boogie Procedure Inliner took 47.75ms. Allocated memory is still 69.2MB. Free memory was 36.7MB in the beginning and 34.9MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-09 00:34:57,315 INFO L158 Benchmark]: Boogie Preprocessor took 55.16ms. Allocated memory is still 69.2MB. Free memory was 34.7MB in the beginning and 32.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-09 00:34:57,315 INFO L158 Benchmark]: RCFGBuilder took 371.21ms. Allocated memory is still 69.2MB. Free memory was 32.6MB in the beginning and 40.7MB in the end (delta: -8.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-09 00:34:57,315 INFO L158 Benchmark]: TraceAbstraction took 16645.38ms. Allocated memory was 69.2MB in the beginning and 509.6MB in the end (delta: 440.4MB). Free memory was 40.2MB in the beginning and 276.8MB in the end (delta: -236.7MB). Peak memory consumption was 203.1MB. Max. memory is 16.1GB. [2024-11-09 00:34:57,316 INFO L158 Benchmark]: Witness Printer took 104.08ms. Allocated memory is still 509.6MB. Free memory was 276.8MB in the beginning and 271.6MB in the end (delta: 5.2MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-09 00:34:57,318 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.76ms. Allocated memory is still 52.4MB. Free memory is still 29.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 340.65ms. Allocated memory is still 69.2MB. Free memory was 34.2MB in the beginning and 36.7MB in the end (delta: -2.5MB). Peak memory consumption was 2.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 47.75ms. Allocated memory is still 69.2MB. Free memory was 36.7MB in the beginning and 34.9MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 55.16ms. Allocated memory is still 69.2MB. Free memory was 34.7MB in the beginning and 32.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 371.21ms. Allocated memory is still 69.2MB. Free memory was 32.6MB in the beginning and 40.7MB in the end (delta: -8.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 16645.38ms. Allocated memory was 69.2MB in the beginning and 509.6MB in the end (delta: 440.4MB). Free memory was 40.2MB in the beginning and 276.8MB in the end (delta: -236.7MB). Peak memory consumption was 203.1MB. Max. memory is 16.1GB. * Witness Printer took 104.08ms. Allocated memory is still 509.6MB. Free memory was 276.8MB in the beginning and 271.6MB 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, 38 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 15.1s, OverallIterations: 3, TraceHistogramMax: 11, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 122 SdHoareTripleChecker+Valid, 0.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 102 mSDsluCounter, 455 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 308 mSDsCounter, 16 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 417 IncrementalHoareTripleChecker+Invalid, 433 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 16 mSolverCounterUnsat, 147 mSDtfsCounter, 417 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 451 GetRequests, 365 SyntacticMatches, 0 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1499 ImplicationChecksByTransitivity, 3.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=58occurred in iteration=2, InterpolantAutomatonStates: 26, 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, 5 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 11.8s InterpolantComputationTime, 359 NumberOfCodeBlocks, 359 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 425 ConstructedInterpolants, 0 QuantifiedInterpolants, 2800 SizeOfPredicates, 41 NumberOfNonLiveVariables, 588 ConjunctsInSsa, 83 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-11-09 00:34:57,365 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