./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-84.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 023d838f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-84.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 3cf3add05c45b0b04bd0d1457ef1e7330de70f3c21c667f6683e915324786bcc --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 08:19:21,625 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 08:19:21,700 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-10 08:19:21,703 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 08:19:21,703 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 08:19:21,716 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 08:19:21,716 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 08:19:21,717 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 08:19:21,717 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 08:19:21,717 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 08:19:21,718 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 08:19:21,718 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 08:19:21,718 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 08:19:21,719 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 08:19:21,719 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 08:19:21,719 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 08:19:21,720 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-10 08:19:21,720 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-10 08:19:21,720 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-10 08:19:21,720 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-10 08:19:21,721 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 08:19:21,725 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-10 08:19:21,725 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 08:19:21,725 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-10 08:19:21,725 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 08:19:21,726 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-10 08:19:21,726 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-10 08:19:21,726 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 08:19:21,726 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 08:19:21,727 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 08:19:21,727 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 08:19:21,727 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 08:19:21,727 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 08:19:21,727 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 08:19:21,728 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 08:19:21,728 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-10 08:19:21,728 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-10 08:19:21,728 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-10 08:19:21,729 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 08:19:21,729 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 08:19:21,729 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 08:19:21,730 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 08:19:21,730 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 -> 3cf3add05c45b0b04bd0d1457ef1e7330de70f3c21c667f6683e915324786bcc [2024-11-10 08:19:22,049 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 08:19:22,074 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 08:19:22,078 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 08:19:22,079 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 08:19:22,080 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 08:19:22,081 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-84.i [2024-11-10 08:19:23,487 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 08:19:23,705 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 08:19:23,707 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-84.i [2024-11-10 08:19:23,717 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b2d73e3b8/71bacbfec9fb4ffba54c940089806c2e/FLAGbaffaac83 [2024-11-10 08:19:23,732 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b2d73e3b8/71bacbfec9fb4ffba54c940089806c2e [2024-11-10 08:19:23,735 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 08:19:23,737 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 08:19:23,739 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 08:19:23,740 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 08:19:23,744 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 08:19:23,744 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 08:19:23" (1/1) ... [2024-11-10 08:19:23,745 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@65d7a05b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:19:23, skipping insertion in model container [2024-11-10 08:19:23,745 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 08:19:23" (1/1) ... [2024-11-10 08:19:23,776 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 08:19:24,009 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-84.i[915,928] [2024-11-10 08:19:24,050 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 08:19:24,059 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 08:19:24,071 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-84.i[915,928] [2024-11-10 08:19:24,084 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 08:19:24,106 INFO L204 MainTranslator]: Completed translation [2024-11-10 08:19:24,107 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:19:24 WrapperNode [2024-11-10 08:19:24,107 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 08:19:24,108 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 08:19:24,108 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 08:19:24,108 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 08:19:24,114 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:19:24" (1/1) ... [2024-11-10 08:19:24,121 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:19:24" (1/1) ... [2024-11-10 08:19:24,147 INFO L138 Inliner]: procedures = 26, calls = 24, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 101 [2024-11-10 08:19:24,148 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 08:19:24,148 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 08:19:24,149 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 08:19:24,149 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 08:19:24,168 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:19:24" (1/1) ... [2024-11-10 08:19:24,168 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:19:24" (1/1) ... [2024-11-10 08:19:24,172 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:19:24" (1/1) ... [2024-11-10 08:19:24,195 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-10 08:19:24,195 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:19:24" (1/1) ... [2024-11-10 08:19:24,195 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:19:24" (1/1) ... [2024-11-10 08:19:24,199 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:19:24" (1/1) ... [2024-11-10 08:19:24,199 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:19:24" (1/1) ... [2024-11-10 08:19:24,200 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:19:24" (1/1) ... [2024-11-10 08:19:24,201 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:19:24" (1/1) ... [2024-11-10 08:19:24,203 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 08:19:24,204 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 08:19:24,204 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 08:19:24,204 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 08:19:24,205 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:19:24" (1/1) ... [2024-11-10 08:19:24,209 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 08:19:24,219 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 08:19:24,234 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-10 08:19:24,236 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-10 08:19:24,318 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 08:19:24,318 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-10 08:19:24,318 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-10 08:19:24,318 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-10 08:19:24,318 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 08:19:24,318 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 08:19:24,398 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 08:19:24,402 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 08:19:24,641 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L63: havoc property_#t~ite12#1;havoc property_#t~bitwise11#1; [2024-11-10 08:19:24,661 INFO L? ?]: Removed 11 outVars from TransFormulas that were not future-live. [2024-11-10 08:19:24,662 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 08:19:24,679 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 08:19:24,680 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 08:19:24,680 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 08:19:24 BoogieIcfgContainer [2024-11-10 08:19:24,680 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 08:19:24,681 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 08:19:24,685 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 08:19:24,689 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 08:19:24,689 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 08:19:23" (1/3) ... [2024-11-10 08:19:24,692 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@16c3727c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 08:19:24, skipping insertion in model container [2024-11-10 08:19:24,693 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:19:24" (2/3) ... [2024-11-10 08:19:24,695 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@16c3727c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 08:19:24, skipping insertion in model container [2024-11-10 08:19:24,695 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 08:19:24" (3/3) ... [2024-11-10 08:19:24,696 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount10_file-84.i [2024-11-10 08:19:24,710 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 08:19:24,710 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-10 08:19:24,756 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 08:19:24,766 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;@3cd67a35, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 08:19:24,766 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-10 08:19:24,770 INFO L276 IsEmpty]: Start isEmpty. Operand has 53 states, 39 states have (on average 1.3333333333333333) internal successors, (52), 40 states have internal predecessors, (52), 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-10 08:19:24,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2024-11-10 08:19:24,778 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 08:19:24,779 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, 1, 1, 1, 1] [2024-11-10 08:19:24,780 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 08:19:24,784 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 08:19:24,785 INFO L85 PathProgramCache]: Analyzing trace with hash -878206658, now seen corresponding path program 1 times [2024-11-10 08:19:24,791 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 08:19:24,792 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [430734906] [2024-11-10 08:19:24,792 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 08:19:24,792 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 08:19:24,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:19:24,968 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 08:19:24,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:19:24,983 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 08:19:24,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:19:24,990 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 08:19:24,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:19:24,996 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 08:19:25,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:19:25,002 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 08:19:25,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:19:25,009 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 08:19:25,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:19:25,015 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 08:19:25,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:19:25,021 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-10 08:19:25,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:19:25,034 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-10 08:19:25,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:19:25,037 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-10 08:19:25,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:19:25,043 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-10 08:19:25,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:19:25,049 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-10 08:19:25,052 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 08:19:25,052 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [430734906] [2024-11-10 08:19:25,053 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [430734906] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 08:19:25,053 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 08:19:25,053 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 08:19:25,054 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1300366200] [2024-11-10 08:19:25,055 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 08:19:25,059 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-10 08:19:25,059 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 08:19:25,080 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-10 08:19:25,081 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 08:19:25,083 INFO L87 Difference]: Start difference. First operand has 53 states, 39 states have (on average 1.3333333333333333) internal successors, (52), 40 states have internal predecessors, (52), 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 12.0) internal successors, (24), 2 states have internal predecessors, (24), 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-10 08:19:25,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 08:19:25,108 INFO L93 Difference]: Finished difference Result 98 states and 152 transitions. [2024-11-10 08:19:25,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-10 08:19:25,111 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 2 states have call successors, (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 76 [2024-11-10 08:19:25,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 08:19:25,116 INFO L225 Difference]: With dead ends: 98 [2024-11-10 08:19:25,117 INFO L226 Difference]: Without dead ends: 48 [2024-11-10 08:19:25,121 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-10 08:19:25,124 INFO L432 NwaCegarLoop]: 62 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 08:19:25,125 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 62 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 08:19:25,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2024-11-10 08:19:25,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2024-11-10 08:19:25,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 35 states have (on average 1.2) internal successors, (42), 35 states have internal predecessors, (42), 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-10 08:19:25,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 64 transitions. [2024-11-10 08:19:25,160 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 64 transitions. Word has length 76 [2024-11-10 08:19:25,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 08:19:25,161 INFO L471 AbstractCegarLoop]: Abstraction has 48 states and 64 transitions. [2024-11-10 08:19:25,162 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 2 states have call successors, (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-10 08:19:25,162 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 64 transitions. [2024-11-10 08:19:25,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2024-11-10 08:19:25,167 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 08:19:25,167 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, 1, 1, 1, 1] [2024-11-10 08:19:25,168 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-10 08:19:25,168 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 08:19:25,168 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 08:19:25,168 INFO L85 PathProgramCache]: Analyzing trace with hash 350085215, now seen corresponding path program 1 times [2024-11-10 08:19:25,169 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 08:19:25,169 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [329372946] [2024-11-10 08:19:25,169 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 08:19:25,169 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 08:19:25,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 08:19:25,260 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 08:19:25,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 08:19:25,338 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 08:19:25,339 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-10 08:19:25,341 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-10 08:19:25,342 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-10 08:19:25,345 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1] [2024-11-10 08:19:25,394 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-10 08:19:25,397 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.11 08:19:25 BoogieIcfgContainer [2024-11-10 08:19:25,397 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-10 08:19:25,398 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-10 08:19:25,399 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-10 08:19:25,399 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-10 08:19:25,399 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 08:19:24" (3/4) ... [2024-11-10 08:19:25,401 INFO L146 WitnessPrinter]: No result that supports witness generation found [2024-11-10 08:19:25,402 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-10 08:19:25,404 INFO L158 Benchmark]: Toolchain (without parser) took 1665.50ms. Allocated memory is still 211.8MB. Free memory was 182.3MB in the beginning and 125.8MB in the end (delta: 56.5MB). Peak memory consumption was 54.4MB. Max. memory is 16.1GB. [2024-11-10 08:19:25,404 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 111.1MB. Free memory is still 80.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 08:19:25,405 INFO L158 Benchmark]: CACSL2BoogieTranslator took 368.59ms. Allocated memory is still 211.8MB. Free memory was 182.3MB in the beginning and 168.7MB in the end (delta: 13.6MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-10 08:19:25,406 INFO L158 Benchmark]: Boogie Procedure Inliner took 40.31ms. Allocated memory is still 211.8MB. Free memory was 168.7MB in the beginning and 166.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-10 08:19:25,406 INFO L158 Benchmark]: Boogie Preprocessor took 54.44ms. Allocated memory is still 211.8MB. Free memory was 166.6MB in the beginning and 164.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-10 08:19:25,407 INFO L158 Benchmark]: IcfgBuilder took 476.53ms. Allocated memory is still 211.8MB. Free memory was 164.5MB in the beginning and 169.8MB in the end (delta: -5.3MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-11-10 08:19:25,408 INFO L158 Benchmark]: TraceAbstraction took 716.00ms. Allocated memory is still 211.8MB. Free memory was 169.8MB in the beginning and 125.8MB in the end (delta: 44.0MB). Peak memory consumption was 44.0MB. Max. memory is 16.1GB. [2024-11-10 08:19:25,409 INFO L158 Benchmark]: Witness Printer took 4.38ms. Allocated memory is still 211.8MB. Free memory is still 125.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 08:19:25,411 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.15ms. Allocated memory is still 111.1MB. Free memory is still 80.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 368.59ms. Allocated memory is still 211.8MB. Free memory was 182.3MB in the beginning and 168.7MB in the end (delta: 13.6MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 40.31ms. Allocated memory is still 211.8MB. Free memory was 168.7MB in the beginning and 166.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 54.44ms. Allocated memory is still 211.8MB. Free memory was 166.6MB in the beginning and 164.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * IcfgBuilder took 476.53ms. Allocated memory is still 211.8MB. Free memory was 164.5MB in the beginning and 169.8MB in the end (delta: -5.3MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * TraceAbstraction took 716.00ms. Allocated memory is still 211.8MB. Free memory was 169.8MB in the beginning and 125.8MB in the end (delta: 44.0MB). Peak memory consumption was 44.0MB. Max. memory is 16.1GB. * Witness Printer took 4.38ms. Allocated memory is still 211.8MB. Free memory is still 125.8MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 63. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned char var_1_1 = 1; [L23] unsigned short int var_1_2 = 128; [L24] unsigned short int var_1_3 = 0; [L25] unsigned char var_1_4 = 0; [L26] unsigned char var_1_5 = 1; [L27] unsigned char var_1_6 = 0; [L28] float var_1_7 = 49.5; [L29] float var_1_8 = 16.25; VAL [isInitial=0, var_1_1=1, var_1_2=128, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=0, var_1_7=99/2, var_1_8=65/4] [L67] isInitial = 1 [L68] FCALL initially() [L69] COND TRUE 1 [L70] FCALL updateLastVariables() [L71] CALL updateVariables() [L42] var_1_2 = __VERIFIER_nondet_ushort() [L43] CALL assume_abort_if_not(var_1_2 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_1=1, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=0, var_1_7=99/2, var_1_8=65/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=1, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=0, var_1_7=99/2, var_1_8=65/4] [L43] RET assume_abort_if_not(var_1_2 >= 0) VAL [isInitial=1, var_1_1=1, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=0, var_1_7=99/2, var_1_8=65/4] [L44] CALL assume_abort_if_not(var_1_2 <= 65535) VAL [\old(cond)=1, isInitial=1, var_1_1=1, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=0, var_1_7=99/2, var_1_8=65/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=1, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=0, var_1_7=99/2, var_1_8=65/4] [L44] RET assume_abort_if_not(var_1_2 <= 65535) VAL [isInitial=1, var_1_1=1, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=0, var_1_7=99/2, var_1_8=65/4] [L45] var_1_3 = __VERIFIER_nondet_ushort() [L46] CALL assume_abort_if_not(var_1_3 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_1=1, var_1_4=0, var_1_5=1, var_1_6=0, var_1_7=99/2, var_1_8=65/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=1, var_1_4=0, var_1_5=1, var_1_6=0, var_1_7=99/2, var_1_8=65/4] [L46] RET assume_abort_if_not(var_1_3 >= 0) VAL [isInitial=1, var_1_1=1, var_1_4=0, var_1_5=1, var_1_6=0, var_1_7=99/2, var_1_8=65/4] [L47] CALL assume_abort_if_not(var_1_3 <= 65535) VAL [\old(cond)=1, isInitial=1, var_1_1=1, var_1_4=0, var_1_5=1, var_1_6=0, var_1_7=99/2, var_1_8=65/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=1, var_1_4=0, var_1_5=1, var_1_6=0, var_1_7=99/2, var_1_8=65/4] [L47] RET assume_abort_if_not(var_1_3 <= 65535) VAL [isInitial=1, var_1_1=1, var_1_4=0, var_1_5=1, var_1_6=0, var_1_7=99/2, var_1_8=65/4] [L48] var_1_4 = __VERIFIER_nondet_uchar() [L49] CALL assume_abort_if_not(var_1_4 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_1=1, var_1_5=1, var_1_6=0, var_1_7=99/2, var_1_8=65/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=1, var_1_5=1, var_1_6=0, var_1_7=99/2, var_1_8=65/4] [L49] RET assume_abort_if_not(var_1_4 >= 0) VAL [isInitial=1, var_1_1=1, var_1_5=1, var_1_6=0, var_1_7=99/2, var_1_8=65/4] [L50] CALL assume_abort_if_not(var_1_4 <= 0) VAL [\old(cond)=1, isInitial=1, var_1_1=1, var_1_4=0, var_1_5=1, var_1_6=0, var_1_7=99/2, var_1_8=65/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=1, var_1_4=0, var_1_5=1, var_1_6=0, var_1_7=99/2, var_1_8=65/4] [L50] RET assume_abort_if_not(var_1_4 <= 0) VAL [isInitial=1, var_1_1=1, var_1_4=0, var_1_5=1, var_1_6=0, var_1_7=99/2, var_1_8=65/4] [L51] var_1_5 = __VERIFIER_nondet_uchar() [L52] CALL assume_abort_if_not(var_1_5 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_1=1, var_1_4=0, var_1_6=0, var_1_7=99/2, var_1_8=65/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=1, var_1_4=0, var_1_6=0, var_1_7=99/2, var_1_8=65/4] [L52] RET assume_abort_if_not(var_1_5 >= 0) VAL [isInitial=1, var_1_1=1, var_1_4=0, var_1_6=0, var_1_7=99/2, var_1_8=65/4] [L53] CALL assume_abort_if_not(var_1_5 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_1=1, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=99/2, var_1_8=65/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=1, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=99/2, var_1_8=65/4] [L53] RET assume_abort_if_not(var_1_5 <= 1) VAL [isInitial=1, var_1_1=1, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=99/2, var_1_8=65/4] [L54] var_1_6 = __VERIFIER_nondet_uchar() [L55] CALL assume_abort_if_not(var_1_6 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_1=1, var_1_4=0, var_1_5=0, var_1_7=99/2, var_1_8=65/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=1, var_1_4=0, var_1_5=0, var_1_7=99/2, var_1_8=65/4] [L55] RET assume_abort_if_not(var_1_6 >= 0) VAL [isInitial=1, var_1_1=1, var_1_4=0, var_1_5=0, var_1_7=99/2, var_1_8=65/4] [L56] CALL assume_abort_if_not(var_1_6 <= 0) VAL [\old(cond)=1, isInitial=1, var_1_1=1, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=99/2, var_1_8=65/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=1, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=99/2, var_1_8=65/4] [L56] RET assume_abort_if_not(var_1_6 <= 0) VAL [isInitial=1, var_1_1=1, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=99/2, var_1_8=65/4] [L57] var_1_8 = __VERIFIER_nondet_float() [L58] CALL assume_abort_if_not((var_1_8 >= -922337.2036854765600e+13F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 9223372.036854765600e+12F && var_1_8 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_1=1, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=99/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=1, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=99/2] [L58] RET assume_abort_if_not((var_1_8 >= -922337.2036854765600e+13F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 9223372.036854765600e+12F && var_1_8 >= 1.0e-20F )) VAL [isInitial=1, var_1_1=1, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=99/2] [L71] RET updateVariables() [L72] CALL step() [L33] unsigned short int stepLocal_0 = var_1_3; VAL [isInitial=1, stepLocal_0=4, var_1_1=1, var_1_3=4, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=99/2] [L34] COND FALSE !(var_1_2 == stepLocal_0) [L37] var_1_1 = (var_1_4 && (var_1_5 && var_1_6)) VAL [isInitial=1, var_1_1=0, var_1_2=1, var_1_3=4, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=99/2] [L39] var_1_7 = var_1_8 VAL [isInitial=1, var_1_1=0, var_1_2=1, var_1_3=4, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=133, var_1_8=133] [L72] RET step() [L73] CALL, EXPR property() [L63] EXPR (var_1_2 == var_1_3) ? (var_1_1 == ((unsigned char) ((var_1_3 > (50 ^ var_1_2)) && var_1_4))) : (var_1_1 == ((unsigned char) (var_1_4 && (var_1_5 && var_1_6)))) VAL [isInitial=1, var_1_1=0, var_1_2=1, var_1_3=4, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=133, var_1_8=133] [L63-L64] return ((var_1_2 == var_1_3) ? (var_1_1 == ((unsigned char) ((var_1_3 > (50 ^ var_1_2)) && var_1_4))) : (var_1_1 == ((unsigned char) (var_1_4 && (var_1_5 && var_1_6))))) && (var_1_7 == ((float) var_1_8)) ; [L73] RET, EXPR property() [L73] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, var_1_1=0, var_1_2=1, var_1_3=4, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=133, var_1_8=133] [L19] reach_error() VAL [isInitial=1, var_1_1=0, var_1_2=1, var_1_3=4, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=133, var_1_8=133] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 53 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 0.6s, 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, 62 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 0 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2 IncrementalHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 0 mSolverCounterUnsat, 62 mSDtfsCounter, 2 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=53occurred 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.2s InterpolantComputationTime, 152 NumberOfCodeBlocks, 152 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 75 ConstructedInterpolants, 0 QuantifiedInterpolants, 75 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-10 08:19:25,439 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-84.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 3cf3add05c45b0b04bd0d1457ef1e7330de70f3c21c667f6683e915324786bcc --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 08:19:27,920 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 08:19:27,984 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-10 08:19:27,989 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 08:19:27,990 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 08:19:28,014 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 08:19:28,018 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 08:19:28,018 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 08:19:28,019 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 08:19:28,020 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 08:19:28,020 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 08:19:28,020 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 08:19:28,021 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 08:19:28,021 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 08:19:28,022 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 08:19:28,022 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 08:19:28,023 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-10 08:19:28,023 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-10 08:19:28,023 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-10 08:19:28,023 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 08:19:28,023 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-10 08:19:28,027 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 08:19:28,027 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-10 08:19:28,027 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-10 08:19:28,027 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-10 08:19:28,027 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 08:19:28,028 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-10 08:19:28,028 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-10 08:19:28,028 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-10 08:19:28,028 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 08:19:28,028 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 08:19:28,028 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 08:19:28,029 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 08:19:28,029 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 08:19:28,029 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 08:19:28,029 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 08:19:28,030 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 08:19:28,030 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-10 08:19:28,030 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-10 08:19:28,030 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-10 08:19:28,031 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 08:19:28,031 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 08:19:28,031 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 08:19:28,032 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 08:19:28,032 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 -> 3cf3add05c45b0b04bd0d1457ef1e7330de70f3c21c667f6683e915324786bcc [2024-11-10 08:19:28,329 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 08:19:28,353 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 08:19:28,355 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 08:19:28,356 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 08:19:28,356 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 08:19:28,357 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-84.i [2024-11-10 08:19:29,846 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 08:19:30,035 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 08:19:30,035 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-84.i [2024-11-10 08:19:30,046 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9cc5fa2ae/9023123d6871482f91deedf32d5b05f4/FLAG741bf3c68 [2024-11-10 08:19:30,066 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9cc5fa2ae/9023123d6871482f91deedf32d5b05f4 [2024-11-10 08:19:30,070 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 08:19:30,077 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 08:19:30,084 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 08:19:30,084 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 08:19:30,089 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 08:19:30,089 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 08:19:30" (1/1) ... [2024-11-10 08:19:30,090 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@443326b0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:19:30, skipping insertion in model container [2024-11-10 08:19:30,090 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 08:19:30" (1/1) ... [2024-11-10 08:19:30,119 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 08:19:30,274 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-84.i[915,928] [2024-11-10 08:19:30,305 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 08:19:30,324 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 08:19:30,334 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-84.i[915,928] [2024-11-10 08:19:30,348 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 08:19:30,370 INFO L204 MainTranslator]: Completed translation [2024-11-10 08:19:30,370 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:19:30 WrapperNode [2024-11-10 08:19:30,371 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 08:19:30,371 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 08:19:30,371 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 08:19:30,372 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 08:19:30,377 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:19:30" (1/1) ... [2024-11-10 08:19:30,391 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:19:30" (1/1) ... [2024-11-10 08:19:30,411 INFO L138 Inliner]: procedures = 27, calls = 24, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 75 [2024-11-10 08:19:30,412 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 08:19:30,413 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 08:19:30,413 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 08:19:30,413 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 08:19:30,421 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:19:30" (1/1) ... [2024-11-10 08:19:30,422 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:19:30" (1/1) ... [2024-11-10 08:19:30,425 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:19:30" (1/1) ... [2024-11-10 08:19:30,438 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-10 08:19:30,439 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:19:30" (1/1) ... [2024-11-10 08:19:30,439 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:19:30" (1/1) ... [2024-11-10 08:19:30,447 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:19:30" (1/1) ... [2024-11-10 08:19:30,451 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:19:30" (1/1) ... [2024-11-10 08:19:30,452 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:19:30" (1/1) ... [2024-11-10 08:19:30,453 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:19:30" (1/1) ... [2024-11-10 08:19:30,458 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 08:19:30,459 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 08:19:30,459 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 08:19:30,459 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 08:19:30,460 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:19:30" (1/1) ... [2024-11-10 08:19:30,467 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 08:19:30,480 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 08:19:30,494 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-10 08:19:30,502 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-10 08:19:30,546 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 08:19:30,546 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-10 08:19:30,546 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-10 08:19:30,546 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-10 08:19:30,547 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 08:19:30,548 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 08:19:30,612 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 08:19:30,616 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 08:19:30,769 INFO L? ?]: Removed 10 outVars from TransFormulas that were not future-live. [2024-11-10 08:19:30,770 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 08:19:30,783 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 08:19:30,784 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 08:19:30,784 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 08:19:30 BoogieIcfgContainer [2024-11-10 08:19:30,784 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 08:19:30,788 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 08:19:30,788 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 08:19:30,791 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 08:19:30,791 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 08:19:30" (1/3) ... [2024-11-10 08:19:30,792 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6bab5c29 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 08:19:30, skipping insertion in model container [2024-11-10 08:19:30,793 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:19:30" (2/3) ... [2024-11-10 08:19:30,793 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6bab5c29 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 08:19:30, skipping insertion in model container [2024-11-10 08:19:30,793 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 08:19:30" (3/3) ... [2024-11-10 08:19:30,794 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount10_file-84.i [2024-11-10 08:19:30,808 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 08:19:30,809 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-10 08:19:30,865 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 08:19:30,872 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;@befa750, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 08:19:30,873 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-10 08:19:30,876 INFO L276 IsEmpty]: Start isEmpty. Operand has 41 states, 27 states have (on average 1.2222222222222223) internal successors, (33), 28 states have internal predecessors, (33), 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-10 08:19:30,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2024-11-10 08:19:30,885 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 08:19:30,886 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, 1, 1] [2024-11-10 08:19:30,886 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 08:19:30,890 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 08:19:30,890 INFO L85 PathProgramCache]: Analyzing trace with hash -776395735, now seen corresponding path program 1 times [2024-11-10 08:19:30,905 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 08:19:30,905 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1885951631] [2024-11-10 08:19:30,906 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 08:19:30,906 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 08:19:30,910 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 08:19:30,913 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-10 08:19:30,914 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-10 08:19:31,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:19:31,058 INFO L255 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-10 08:19:31,068 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 08:19:31,093 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-10 08:19:31,094 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 08:19:31,094 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 08:19:31,094 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1885951631] [2024-11-10 08:19:31,095 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1885951631] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 08:19:31,095 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 08:19:31,095 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 08:19:31,096 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1857604971] [2024-11-10 08:19:31,097 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 08:19:31,100 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-10 08:19:31,100 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 08:19:31,116 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-10 08:19:31,117 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 08:19:31,118 INFO L87 Difference]: Start difference. First operand has 41 states, 27 states have (on average 1.2222222222222223) internal successors, (33), 28 states have internal predecessors, (33), 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 13.0) internal successors, (26), 2 states have internal predecessors, (26), 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-10 08:19:31,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 08:19:31,134 INFO L93 Difference]: Finished difference Result 74 states and 114 transitions. [2024-11-10 08:19:31,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-10 08:19:31,135 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 states have internal predecessors, (26), 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 74 [2024-11-10 08:19:31,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 08:19:31,140 INFO L225 Difference]: With dead ends: 74 [2024-11-10 08:19:31,140 INFO L226 Difference]: Without dead ends: 36 [2024-11-10 08:19:31,143 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 08:19:31,145 INFO L432 NwaCegarLoop]: 47 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, 47 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 08:19:31,146 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 08:19:31,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2024-11-10 08:19:31,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2024-11-10 08:19:31,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 23 states have (on average 1.0869565217391304) internal successors, (25), 23 states have internal predecessors, (25), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-10 08:19:31,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 47 transitions. [2024-11-10 08:19:31,185 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 47 transitions. Word has length 74 [2024-11-10 08:19:31,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 08:19:31,185 INFO L471 AbstractCegarLoop]: Abstraction has 36 states and 47 transitions. [2024-11-10 08:19:31,185 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 states have internal predecessors, (26), 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-10 08:19:31,185 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 47 transitions. [2024-11-10 08:19:31,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2024-11-10 08:19:31,187 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 08:19:31,188 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, 1, 1] [2024-11-10 08:19:31,194 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-10 08:19:31,388 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 08:19:31,389 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 08:19:31,390 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 08:19:31,390 INFO L85 PathProgramCache]: Analyzing trace with hash 2013706122, now seen corresponding path program 1 times [2024-11-10 08:19:31,390 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 08:19:31,391 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1318221100] [2024-11-10 08:19:31,391 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 08:19:31,392 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 08:19:31,392 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 08:19:31,394 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-10 08:19:31,396 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-10 08:19:31,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:19:31,489 INFO L255 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-11-10 08:19:31,510 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 08:19:32,806 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 135 proven. 12 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked. [2024-11-10 08:19:32,807 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 08:19:33,251 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 08:19:33,251 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1318221100] [2024-11-10 08:19:33,251 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1318221100] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 08:19:33,252 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1637131199] [2024-11-10 08:19:33,252 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 08:19:33,252 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-10 08:19:33,253 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-10 08:19:33,255 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-10 08:19:33,256 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-10 08:19:33,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:19:33,406 INFO L255 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-11-10 08:19:33,413 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 08:19:34,080 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 135 proven. 12 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked. [2024-11-10 08:19:34,080 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 08:19:34,835 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-10 08:19:34,836 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1637131199] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-10 08:19:34,836 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-11-10 08:19:34,836 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [12, 13] total 29 [2024-11-10 08:19:34,836 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1975494964] [2024-11-10 08:19:34,836 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 08:19:34,837 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-10 08:19:34,837 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 08:19:34,838 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-10 08:19:34,841 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=204, Invalid=852, Unknown=0, NotChecked=0, Total=1056 [2024-11-10 08:19:34,841 INFO L87 Difference]: Start difference. First operand 36 states and 47 transitions. Second operand has 10 states, 10 states have (on average 2.5) internal successors, (25), 9 states have internal predecessors, (25), 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-10 08:19:35,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 08:19:35,558 INFO L93 Difference]: Finished difference Result 54 states and 64 transitions. [2024-11-10 08:19:35,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-10 08:19:35,558 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.5) internal successors, (25), 9 states have internal predecessors, (25), 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 74 [2024-11-10 08:19:35,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 08:19:35,560 INFO L225 Difference]: With dead ends: 54 [2024-11-10 08:19:35,561 INFO L226 Difference]: Without dead ends: 51 [2024-11-10 08:19:35,562 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 234 GetRequests, 197 SyntacticMatches, 1 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 486 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=262, Invalid=1144, Unknown=0, NotChecked=0, Total=1406 [2024-11-10 08:19:35,563 INFO L432 NwaCegarLoop]: 41 mSDtfsCounter, 81 mSDsluCounter, 114 mSDsCounter, 0 mSdLazyCounter, 136 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 155 SdHoareTripleChecker+Invalid, 166 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 136 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-10 08:19:35,564 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 155 Invalid, 166 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 136 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-10 08:19:35,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2024-11-10 08:19:35,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 44. [2024-11-10 08:19:35,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 30 states have (on average 1.0666666666666667) internal successors, (32), 30 states have internal predecessors, (32), 11 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-10 08:19:35,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 54 transitions. [2024-11-10 08:19:35,580 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 54 transitions. Word has length 74 [2024-11-10 08:19:35,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 08:19:35,581 INFO L471 AbstractCegarLoop]: Abstraction has 44 states and 54 transitions. [2024-11-10 08:19:35,581 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.5) internal successors, (25), 9 states have internal predecessors, (25), 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-10 08:19:35,581 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 54 transitions. [2024-11-10 08:19:35,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2024-11-10 08:19:35,584 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 08:19:35,584 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, 1, 1] [2024-11-10 08:19:35,591 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (4)] Forceful destruction successful, exit code 0 [2024-11-10 08:19:35,789 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-10 08:19:35,988 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-10 08:19:35,989 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 08:19:35,993 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 08:19:35,994 INFO L85 PathProgramCache]: Analyzing trace with hash 1126202441, now seen corresponding path program 1 times [2024-11-10 08:19:35,994 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 08:19:35,994 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [442547805] [2024-11-10 08:19:35,994 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 08:19:35,994 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 08:19:35,994 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 08:19:35,998 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-10 08:19:36,003 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-10 08:19:36,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:19:36,047 INFO L255 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-11-10 08:19:36,049 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 08:19:37,124 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 135 proven. 12 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked. [2024-11-10 08:19:37,125 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 08:19:37,523 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 08:19:37,524 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [442547805] [2024-11-10 08:19:37,524 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [442547805] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 08:19:37,524 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [665602203] [2024-11-10 08:19:37,525 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 08:19:37,525 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-10 08:19:37,525 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-10 08:19:37,527 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-10 08:19:37,530 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-10 08:19:37,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:19:37,679 INFO L255 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-11-10 08:19:37,682 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 08:19:38,241 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 135 proven. 12 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked. [2024-11-10 08:19:38,242 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 08:19:38,666 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-10 08:19:38,666 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [665602203] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-10 08:19:38,667 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-11-10 08:19:38,667 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [12, 13] total 29 [2024-11-10 08:19:38,667 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1181405947] [2024-11-10 08:19:38,667 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 08:19:38,667 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-10 08:19:38,667 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 08:19:38,668 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-10 08:19:38,668 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=178, Invalid=752, Unknown=0, NotChecked=0, Total=930 [2024-11-10 08:19:38,669 INFO L87 Difference]: Start difference. First operand 44 states and 54 transitions. Second operand has 10 states, 10 states have (on average 2.5) internal successors, (25), 9 states have internal predecessors, (25), 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-10 08:19:38,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 08:19:38,904 INFO L93 Difference]: Finished difference Result 51 states and 61 transitions. [2024-11-10 08:19:38,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-10 08:19:38,905 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.5) internal successors, (25), 9 states have internal predecessors, (25), 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 74 [2024-11-10 08:19:38,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 08:19:38,906 INFO L225 Difference]: With dead ends: 51 [2024-11-10 08:19:38,906 INFO L226 Difference]: Without dead ends: 0 [2024-11-10 08:19:38,906 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 232 GetRequests, 199 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 403 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=213, Invalid=909, Unknown=0, NotChecked=0, Total=1122 [2024-11-10 08:19:38,907 INFO L432 NwaCegarLoop]: 41 mSDtfsCounter, 77 mSDsluCounter, 89 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 130 SdHoareTripleChecker+Invalid, 104 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 08:19:38,917 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 130 Invalid, 104 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 08:19:38,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-10 08:19:38,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-10 08:19:38,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 08:19:38,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-10 08:19:38,918 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 74 [2024-11-10 08:19:38,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 08:19:38,919 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-10 08:19:38,919 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.5) internal successors, (25), 9 states have internal predecessors, (25), 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-10 08:19:38,919 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-10 08:19:38,919 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-10 08:19:38,921 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-10 08:19:38,940 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-10 08:19:39,125 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (6)] Ended with exit code 0 [2024-11-10 08:19:39,322 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-10 08:19:39,325 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2024-11-10 08:19:39,327 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-11-10 08:19:39,605 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-10 08:19:39,615 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Missing case for function ~fp.eq~32 [2024-11-10 08:19:39,625 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.11 08:19:39 BoogieIcfgContainer [2024-11-10 08:19:39,625 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-10 08:19:39,626 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-10 08:19:39,626 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-10 08:19:39,626 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-10 08:19:39,627 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 08:19:30" (3/4) ... [2024-11-10 08:19:39,629 INFO L143 WitnessPrinter]: Generating witness for correct program [2024-11-10 08:19:39,633 INFO L393 IcfgBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2024-11-10 08:19:39,636 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 21 nodes and edges [2024-11-10 08:19:39,637 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 8 nodes and edges [2024-11-10 08:19:39,637 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-11-10 08:19:39,637 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-10 08:19:39,754 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-10 08:19:39,755 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-10 08:19:39,755 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-10 08:19:39,755 INFO L158 Benchmark]: Toolchain (without parser) took 9680.41ms. Allocated memory was 69.2MB in the beginning and 325.1MB in the end (delta: 255.9MB). Free memory was 33.7MB in the beginning and 269.8MB in the end (delta: -236.1MB). Peak memory consumption was 18.5MB. Max. memory is 16.1GB. [2024-11-10 08:19:39,755 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 50.3MB. Free memory is still 26.3MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 08:19:39,756 INFO L158 Benchmark]: CACSL2BoogieTranslator took 286.69ms. Allocated memory is still 69.2MB. Free memory was 49.4MB in the beginning and 35.3MB in the end (delta: 14.1MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-10 08:19:39,756 INFO L158 Benchmark]: Boogie Procedure Inliner took 40.96ms. Allocated memory is still 69.2MB. Free memory was 35.3MB in the beginning and 33.5MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-10 08:19:39,756 INFO L158 Benchmark]: Boogie Preprocessor took 45.40ms. Allocated memory is still 69.2MB. Free memory was 33.5MB in the beginning and 31.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-10 08:19:39,756 INFO L158 Benchmark]: IcfgBuilder took 324.90ms. Allocated memory is still 69.2MB. Free memory was 31.4MB in the beginning and 37.4MB in the end (delta: -6.0MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-10 08:19:39,756 INFO L158 Benchmark]: TraceAbstraction took 8837.78ms. Allocated memory was 69.2MB in the beginning and 325.1MB in the end (delta: 255.9MB). Free memory was 36.7MB in the beginning and 275.1MB in the end (delta: -238.3MB). Peak memory consumption was 16.0MB. Max. memory is 16.1GB. [2024-11-10 08:19:39,756 INFO L158 Benchmark]: Witness Printer took 128.82ms. Allocated memory is still 325.1MB. Free memory was 275.1MB in the beginning and 269.8MB in the end (delta: 5.2MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-10 08:19:39,762 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.12ms. Allocated memory is still 50.3MB. Free memory is still 26.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 286.69ms. Allocated memory is still 69.2MB. Free memory was 49.4MB in the beginning and 35.3MB in the end (delta: 14.1MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 40.96ms. Allocated memory is still 69.2MB. Free memory was 35.3MB in the beginning and 33.5MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 45.40ms. Allocated memory is still 69.2MB. Free memory was 33.5MB in the beginning and 31.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * IcfgBuilder took 324.90ms. Allocated memory is still 69.2MB. Free memory was 31.4MB in the beginning and 37.4MB in the end (delta: -6.0MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * TraceAbstraction took 8837.78ms. Allocated memory was 69.2MB in the beginning and 325.1MB in the end (delta: 255.9MB). Free memory was 36.7MB in the beginning and 275.1MB in the end (delta: -238.3MB). Peak memory consumption was 16.0MB. Max. memory is 16.1GB. * Witness Printer took 128.82ms. Allocated memory is still 325.1MB. Free memory was 275.1MB in the beginning and 269.8MB 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: Missing case for function ~fp.eq~32 * 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, 41 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 8.5s, OverallIterations: 3, TraceHistogramMax: 11, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 158 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 158 mSDsluCounter, 332 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 203 mSDsCounter, 57 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 213 IncrementalHoareTripleChecker+Invalid, 270 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 57 mSolverCounterUnsat, 129 mSDtfsCounter, 213 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 539 GetRequests, 469 SyntacticMatches, 2 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 2 DeprecatedPredicates, 889 ImplicationChecksByTransitivity, 2.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=44occurred in iteration=2, InterpolantAutomatonStates: 23, 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, 7 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 5.7s InterpolantComputationTime, 370 NumberOfCodeBlocks, 370 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 511 ConstructedInterpolants, 8 QuantifiedInterpolants, 2323 SizeOfPredicates, 48 NumberOfNonLiveVariables, 600 ConjunctsInSsa, 63 ConjunctsInUnsatCore, 7 InterpolantComputations, 3 PerfectInterpolantSequences, 1492/1540 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 69]: Location Invariant Derived location invariant: null - ProcedureContractResult [Line: 20]: Procedure Contract for assume_abort_if_not Derived contract for procedure assume_abort_if_not. Ensures: (((((((((isInitial == \old(isInitial)) && (var_1_1 == \old(var_1_1))) && (var_1_2 == \old(var_1_2))) && (var_1_3 == \old(var_1_3))) && (var_1_4 == \old(var_1_4))) && (var_1_5 == \old(var_1_5))) && (var_1_6 == \old(var_1_6))) && (var_1_7 == \old(var_1_7))) && (var_1_8 == \old(var_1_8))) RESULT: Ultimate proved your program to be correct! [2024-11-10 08:19:39,814 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