./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-49.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 803cd42f Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-49.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 92c32feee421c48ab58fbc8ff43c274cf7615d37c71b93492a69b21460f6fabb --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-803cd42-m [2024-11-22 10:40:52,834 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-22 10:40:52,891 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-22 10:40:52,897 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-22 10:40:52,899 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-22 10:40:52,925 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-22 10:40:52,925 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-22 10:40:52,926 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-22 10:40:52,926 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-22 10:40:52,926 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-22 10:40:52,927 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-22 10:40:52,927 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-22 10:40:52,927 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-22 10:40:52,927 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-22 10:40:52,928 INFO L153 SettingsManager]: * Use SBE=true [2024-11-22 10:40:52,928 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-22 10:40:52,930 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-22 10:40:52,930 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-22 10:40:52,932 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-22 10:40:52,932 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-22 10:40:52,932 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-22 10:40:52,933 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-22 10:40:52,933 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-22 10:40:52,933 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-22 10:40:52,934 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-22 10:40:52,934 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-22 10:40:52,934 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-22 10:40:52,934 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-22 10:40:52,935 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-22 10:40:52,935 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-22 10:40:52,935 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-22 10:40:52,935 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-22 10:40:52,936 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-22 10:40:52,936 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-22 10:40:52,937 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-22 10:40:52,938 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-22 10:40:52,938 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-22 10:40:52,938 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-22 10:40:52,939 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-22 10:40:52,939 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-22 10:40:52,939 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-22 10:40:52,939 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-22 10:40:52,939 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 -> 92c32feee421c48ab58fbc8ff43c274cf7615d37c71b93492a69b21460f6fabb [2024-11-22 10:40:53,188 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-22 10:40:53,210 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-22 10:40:53,213 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-22 10:40:53,214 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-22 10:40:53,215 INFO L274 PluginConnector]: CDTParser initialized [2024-11-22 10:40:53,216 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-49.i [2024-11-22 10:40:54,598 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-22 10:40:54,788 INFO L384 CDTParser]: Found 1 translation units. [2024-11-22 10:40:54,789 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-49.i [2024-11-22 10:40:54,799 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7de763b36/30c4298d496e49a19931fd468bf459fc/FLAGc3a7bde28 [2024-11-22 10:40:55,174 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7de763b36/30c4298d496e49a19931fd468bf459fc [2024-11-22 10:40:55,177 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-22 10:40:55,178 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-22 10:40:55,179 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-22 10:40:55,179 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-22 10:40:55,185 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-22 10:40:55,185 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 10:40:55" (1/1) ... [2024-11-22 10:40:55,186 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@37d5dd53 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:40:55, skipping insertion in model container [2024-11-22 10:40:55,186 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 10:40:55" (1/1) ... [2024-11-22 10:40:55,211 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-22 10:40:55,359 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_loopvsstraightlinecode_25-1loop_file-49.i[915,928] [2024-11-22 10:40:55,421 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-22 10:40:55,428 INFO L200 MainTranslator]: Completed pre-run [2024-11-22 10:40:55,437 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_loopvsstraightlinecode_25-1loop_file-49.i[915,928] [2024-11-22 10:40:55,453 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-22 10:40:55,468 INFO L204 MainTranslator]: Completed translation [2024-11-22 10:40:55,469 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:40:55 WrapperNode [2024-11-22 10:40:55,469 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-22 10:40:55,469 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-22 10:40:55,470 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-22 10:40:55,470 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-22 10:40:55,474 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:40:55" (1/1) ... [2024-11-22 10:40:55,481 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:40:55" (1/1) ... [2024-11-22 10:40:55,536 INFO L138 Inliner]: procedures = 26, calls = 29, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 129 [2024-11-22 10:40:55,536 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-22 10:40:55,537 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-22 10:40:55,537 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-22 10:40:55,537 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-22 10:40:55,548 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:40:55" (1/1) ... [2024-11-22 10:40:55,548 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:40:55" (1/1) ... [2024-11-22 10:40:55,553 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:40:55" (1/1) ... [2024-11-22 10:40:55,572 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-22 10:40:55,573 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:40:55" (1/1) ... [2024-11-22 10:40:55,573 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:40:55" (1/1) ... [2024-11-22 10:40:55,580 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:40:55" (1/1) ... [2024-11-22 10:40:55,585 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:40:55" (1/1) ... [2024-11-22 10:40:55,587 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:40:55" (1/1) ... [2024-11-22 10:40:55,588 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:40:55" (1/1) ... [2024-11-22 10:40:55,592 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-22 10:40:55,593 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-22 10:40:55,593 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-22 10:40:55,593 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-22 10:40:55,594 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:40:55" (1/1) ... [2024-11-22 10:40:55,602 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-22 10:40:55,609 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 10:40:55,623 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-22 10:40:55,626 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-22 10:40:55,664 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-22 10:40:55,665 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-22 10:40:55,665 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-22 10:40:55,665 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-22 10:40:55,665 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-22 10:40:55,665 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-22 10:40:55,731 INFO L238 CfgBuilder]: Building ICFG [2024-11-22 10:40:55,735 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-22 10:40:55,938 INFO L? ?]: Removed 11 outVars from TransFormulas that were not future-live. [2024-11-22 10:40:55,939 INFO L287 CfgBuilder]: Performing block encoding [2024-11-22 10:40:55,955 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-22 10:40:55,956 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-22 10:40:55,957 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 10:40:55 BoogieIcfgContainer [2024-11-22 10:40:55,957 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-22 10:40:55,959 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-22 10:40:55,959 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-22 10:40:55,961 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-22 10:40:55,961 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.11 10:40:55" (1/3) ... [2024-11-22 10:40:55,962 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@42944fbf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 10:40:55, skipping insertion in model container [2024-11-22 10:40:55,962 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:40:55" (2/3) ... [2024-11-22 10:40:55,962 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@42944fbf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 10:40:55, skipping insertion in model container [2024-11-22 10:40:55,962 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 10:40:55" (3/3) ... [2024-11-22 10:40:55,963 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_25-1loop_file-49.i [2024-11-22 10:40:55,976 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-22 10:40:55,976 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-22 10:40:56,019 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-22 10:40:56,024 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;@737bd3f9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-22 10:40:56,024 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-22 10:40:56,027 INFO L276 IsEmpty]: Start isEmpty. Operand has 57 states, 38 states have (on average 1.3157894736842106) internal successors, (50), 39 states have internal predecessors, (50), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-22 10:40:56,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-11-22 10:40:56,035 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 10:40:56,036 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 10:40:56,036 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 10:40:56,039 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 10:40:56,040 INFO L85 PathProgramCache]: Analyzing trace with hash -1804983062, now seen corresponding path program 1 times [2024-11-22 10:40:56,047 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 10:40:56,047 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1084691738] [2024-11-22 10:40:56,047 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 10:40:56,048 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 10:40:56,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 10:40:56,305 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 450 trivial. 0 not checked. [2024-11-22 10:40:56,306 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 10:40:56,306 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1084691738] [2024-11-22 10:40:56,307 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1084691738] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 10:40:56,307 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1024677079] [2024-11-22 10:40:56,307 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 10:40:56,308 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 10:40:56,308 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 10:40:56,311 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-22 10:40:56,313 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-22 10:40:56,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 10:40:56,403 INFO L255 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-22 10:40:56,411 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 10:40:56,438 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 450 trivial. 0 not checked. [2024-11-22 10:40:56,438 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 10:40:56,439 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1024677079] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 10:40:56,439 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-22 10:40:56,439 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2024-11-22 10:40:56,441 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [873057674] [2024-11-22 10:40:56,442 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 10:40:56,445 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-22 10:40:56,446 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 10:40:56,462 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-22 10:40:56,462 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-22 10:40:56,464 INFO L87 Difference]: Start difference. First operand has 57 states, 38 states have (on average 1.3157894736842106) internal successors, (50), 39 states have internal predecessors, (50), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) [2024-11-22 10:40:56,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 10:40:56,486 INFO L93 Difference]: Finished difference Result 111 states and 177 transitions. [2024-11-22 10:40:56,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-22 10:40:56,488 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) Word has length 104 [2024-11-22 10:40:56,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 10:40:56,495 INFO L225 Difference]: With dead ends: 111 [2024-11-22 10:40:56,496 INFO L226 Difference]: Without dead ends: 53 [2024-11-22 10:40:56,499 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 105 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-22 10:40:56,503 INFO L432 NwaCegarLoop]: 79 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, 79 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-22 10:40:56,503 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 10:40:56,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2024-11-22 10:40:56,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2024-11-22 10:40:56,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 35 states have (on average 1.2285714285714286) internal successors, (43), 35 states have internal predecessors, (43), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-22 10:40:56,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 75 transitions. [2024-11-22 10:40:56,563 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 75 transitions. Word has length 104 [2024-11-22 10:40:56,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 10:40:56,563 INFO L471 AbstractCegarLoop]: Abstraction has 53 states and 75 transitions. [2024-11-22 10:40:56,565 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) [2024-11-22 10:40:56,565 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 75 transitions. [2024-11-22 10:40:56,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-11-22 10:40:56,583 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 10:40:56,584 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 10:40:56,602 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-22 10:40:56,788 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2024-11-22 10:40:56,789 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 10:40:56,790 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 10:40:56,791 INFO L85 PathProgramCache]: Analyzing trace with hash 1973034286, now seen corresponding path program 1 times [2024-11-22 10:40:56,791 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 10:40:56,791 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [509201898] [2024-11-22 10:40:56,791 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 10:40:56,791 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 10:40:56,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-22 10:40:56,901 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-22 10:40:56,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-22 10:40:56,991 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-22 10:40:56,992 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-22 10:40:56,993 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-22 10:40:56,994 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-22 10:40:56,997 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1] [2024-11-22 10:40:57,069 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-22 10:40:57,072 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.11 10:40:57 BoogieIcfgContainer [2024-11-22 10:40:57,073 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-22 10:40:57,074 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-22 10:40:57,074 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-22 10:40:57,074 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-22 10:40:57,074 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 10:40:55" (3/4) ... [2024-11-22 10:40:57,076 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-22 10:40:57,077 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-22 10:40:57,078 INFO L158 Benchmark]: Toolchain (without parser) took 1899.99ms. Allocated memory was 163.6MB in the beginning and 218.1MB in the end (delta: 54.5MB). Free memory was 90.1MB in the beginning and 159.1MB in the end (delta: -69.1MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-22 10:40:57,080 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 163.6MB. Free memory is still 114.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-22 10:40:57,080 INFO L158 Benchmark]: CACSL2BoogieTranslator took 290.12ms. Allocated memory is still 163.6MB. Free memory was 89.7MB in the beginning and 74.7MB in the end (delta: 15.1MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-22 10:40:57,080 INFO L158 Benchmark]: Boogie Procedure Inliner took 66.66ms. Allocated memory was 163.6MB in the beginning and 218.1MB in the end (delta: 54.5MB). Free memory was 74.7MB in the beginning and 188.0MB in the end (delta: -113.3MB). Peak memory consumption was 11.7MB. Max. memory is 16.1GB. [2024-11-22 10:40:57,080 INFO L158 Benchmark]: Boogie Preprocessor took 55.48ms. Allocated memory is still 218.1MB. Free memory was 188.0MB in the beginning and 181.0MB in the end (delta: 7.0MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-22 10:40:57,081 INFO L158 Benchmark]: RCFGBuilder took 364.26ms. Allocated memory is still 218.1MB. Free memory was 180.0MB in the beginning and 160.1MB in the end (delta: 19.9MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-11-22 10:40:57,081 INFO L158 Benchmark]: TraceAbstraction took 1114.56ms. Allocated memory is still 218.1MB. Free memory was 159.0MB in the beginning and 159.1MB in the end (delta: -92.7kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-22 10:40:57,081 INFO L158 Benchmark]: Witness Printer took 3.69ms. Allocated memory is still 218.1MB. Free memory is still 159.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-22 10:40:57,084 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18ms. Allocated memory is still 163.6MB. Free memory is still 114.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 290.12ms. Allocated memory is still 163.6MB. Free memory was 89.7MB in the beginning and 74.7MB in the end (delta: 15.1MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 66.66ms. Allocated memory was 163.6MB in the beginning and 218.1MB in the end (delta: 54.5MB). Free memory was 74.7MB in the beginning and 188.0MB in the end (delta: -113.3MB). Peak memory consumption was 11.7MB. Max. memory is 16.1GB. * Boogie Preprocessor took 55.48ms. Allocated memory is still 218.1MB. Free memory was 188.0MB in the beginning and 181.0MB in the end (delta: 7.0MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * RCFGBuilder took 364.26ms. Allocated memory is still 218.1MB. Free memory was 180.0MB in the beginning and 160.1MB in the end (delta: 19.9MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * TraceAbstraction took 1114.56ms. Allocated memory is still 218.1MB. Free memory was 159.0MB in the beginning and 159.1MB in the end (delta: -92.7kB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 3.69ms. Allocated memory is still 218.1MB. Free memory is still 159.1MB. 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 91. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned short int var_1_1 = 4; [L23] float var_1_2 = 1000000000000000.4; [L24] float var_1_3 = 1000.2; [L25] unsigned short int var_1_4 = 256; [L26] unsigned short int var_1_5 = 4; [L27] unsigned short int var_1_6 = 10; [L28] signed short int var_1_8 = 128; [L29] unsigned char var_1_10 = 0; [L30] unsigned char var_1_11 = 0; [L31] unsigned char var_1_12 = 0; [L32] unsigned char var_1_13 = 1; [L33] unsigned char var_1_14 = 0; [L34] signed char var_1_15 = -1; [L35] signed char var_1_16 = 0; VAL [isInitial=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=0, var_1_15=-1, var_1_16=0, var_1_1=4, var_1_2=5000000000000002/5, var_1_3=5001/5, var_1_4=256, var_1_5=4, var_1_6=10, var_1_8=128] [L95] isInitial = 1 [L96] FCALL initially() [L97] int k_loop; [L98] k_loop = 0 VAL [isInitial=1, k_loop=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=0, var_1_15=-1, var_1_16=0, var_1_1=4, var_1_2=5000000000000002/5, var_1_3=5001/5, var_1_4=256, var_1_5=4, var_1_6=10, var_1_8=128] [L98] COND TRUE k_loop < 1 [L99] FCALL updateLastVariables() [L100] CALL updateVariables() [L62] var_1_2 = __VERIFIER_nondet_float() [L63] CALL assume_abort_if_not((var_1_2 >= -922337.2036854776000e+13F && var_1_2 <= -1.0e-20F) || (var_1_2 <= 9223372.036854776000e+12F && var_1_2 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=0, var_1_15=-1, var_1_16=0, var_1_1=4, var_1_3=5001/5, var_1_4=256, var_1_5=4, var_1_6=10, var_1_8=128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=0, var_1_15=-1, var_1_16=0, var_1_1=4, var_1_3=5001/5, var_1_4=256, var_1_5=4, var_1_6=10, var_1_8=128] [L63] RET assume_abort_if_not((var_1_2 >= -922337.2036854776000e+13F && var_1_2 <= -1.0e-20F) || (var_1_2 <= 9223372.036854776000e+12F && var_1_2 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=0, var_1_15=-1, var_1_16=0, var_1_1=4, var_1_3=5001/5, var_1_4=256, var_1_5=4, var_1_6=10, var_1_8=128] [L64] var_1_3 = __VERIFIER_nondet_float() [L65] CALL assume_abort_if_not((var_1_3 >= -922337.2036854776000e+13F && var_1_3 <= -1.0e-20F) || (var_1_3 <= 9223372.036854776000e+12F && var_1_3 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=0, var_1_15=-1, var_1_16=0, var_1_1=4, var_1_4=256, var_1_5=4, var_1_6=10, var_1_8=128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=0, var_1_15=-1, var_1_16=0, var_1_1=4, var_1_4=256, var_1_5=4, var_1_6=10, var_1_8=128] [L65] RET assume_abort_if_not((var_1_3 >= -922337.2036854776000e+13F && var_1_3 <= -1.0e-20F) || (var_1_3 <= 9223372.036854776000e+12F && var_1_3 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=0, var_1_15=-1, var_1_16=0, var_1_1=4, var_1_4=256, var_1_5=4, var_1_6=10, var_1_8=128] [L66] var_1_4 = __VERIFIER_nondet_ushort() [L67] CALL assume_abort_if_not(var_1_4 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=0, var_1_15=-1, var_1_16=0, var_1_1=4, var_1_5=4, var_1_6=10, var_1_8=128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=0, var_1_15=-1, var_1_16=0, var_1_1=4, var_1_5=4, var_1_6=10, var_1_8=128] [L67] RET assume_abort_if_not(var_1_4 >= 0) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=0, var_1_15=-1, var_1_16=0, var_1_1=4, var_1_5=4, var_1_6=10, var_1_8=128] [L68] CALL assume_abort_if_not(var_1_4 <= 65534) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=0, var_1_15=-1, var_1_16=0, var_1_1=4, var_1_4=0, var_1_5=4, var_1_6=10, var_1_8=128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=0, var_1_15=-1, var_1_16=0, var_1_1=4, var_1_4=0, var_1_5=4, var_1_6=10, var_1_8=128] [L68] RET assume_abort_if_not(var_1_4 <= 65534) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=0, var_1_15=-1, var_1_16=0, var_1_1=4, var_1_4=0, var_1_5=4, var_1_6=10, var_1_8=128] [L69] var_1_5 = __VERIFIER_nondet_ushort() [L70] CALL assume_abort_if_not(var_1_5 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=0, var_1_15=-1, var_1_16=0, var_1_1=4, var_1_4=0, var_1_6=10, var_1_8=128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=0, var_1_15=-1, var_1_16=0, var_1_1=4, var_1_4=0, var_1_6=10, var_1_8=128] [L70] RET assume_abort_if_not(var_1_5 >= 0) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=0, var_1_15=-1, var_1_16=0, var_1_1=4, var_1_4=0, var_1_6=10, var_1_8=128] [L71] CALL assume_abort_if_not(var_1_5 <= 65534) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=0, var_1_15=-1, var_1_16=0, var_1_1=4, var_1_4=0, var_1_5=0, var_1_6=10, var_1_8=128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=0, var_1_15=-1, var_1_16=0, var_1_1=4, var_1_4=0, var_1_5=0, var_1_6=10, var_1_8=128] [L71] RET assume_abort_if_not(var_1_5 <= 65534) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=0, var_1_15=-1, var_1_16=0, var_1_1=4, var_1_4=0, var_1_5=0, var_1_6=10, var_1_8=128] [L72] var_1_6 = __VERIFIER_nondet_ushort() [L73] CALL assume_abort_if_not(var_1_6 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=0, var_1_15=-1, var_1_16=0, var_1_1=4, var_1_4=0, var_1_5=0, var_1_8=128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=0, var_1_15=-1, var_1_16=0, var_1_1=4, var_1_4=0, var_1_5=0, var_1_8=128] [L73] RET assume_abort_if_not(var_1_6 >= 0) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=0, var_1_15=-1, var_1_16=0, var_1_1=4, var_1_4=0, var_1_5=0, var_1_8=128] [L74] CALL assume_abort_if_not(var_1_6 <= 65534) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=0, var_1_15=-1, var_1_16=0, var_1_1=4, var_1_4=0, var_1_5=0, var_1_6=0, var_1_8=128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=0, var_1_15=-1, var_1_16=0, var_1_1=4, var_1_4=0, var_1_5=0, var_1_6=0, var_1_8=128] [L74] RET assume_abort_if_not(var_1_6 <= 65534) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=0, var_1_15=-1, var_1_16=0, var_1_1=4, var_1_4=0, var_1_5=0, var_1_6=0, var_1_8=128] [L75] var_1_11 = __VERIFIER_nondet_uchar() [L76] CALL assume_abort_if_not(var_1_11 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_12=0, var_1_13=1, var_1_14=0, var_1_15=-1, var_1_16=0, var_1_1=4, var_1_4=0, var_1_5=0, var_1_6=0, var_1_8=128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_12=0, var_1_13=1, var_1_14=0, var_1_15=-1, var_1_16=0, var_1_1=4, var_1_4=0, var_1_5=0, var_1_6=0, var_1_8=128] [L76] RET assume_abort_if_not(var_1_11 >= 0) VAL [isInitial=1, var_1_10=0, var_1_12=0, var_1_13=1, var_1_14=0, var_1_15=-1, var_1_16=0, var_1_1=4, var_1_4=0, var_1_5=0, var_1_6=0, var_1_8=128] [L77] CALL assume_abort_if_not(var_1_11 <= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=0, var_1_15=-1, var_1_16=0, var_1_1=4, var_1_4=0, var_1_5=0, var_1_6=0, var_1_8=128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=0, var_1_15=-1, var_1_16=0, var_1_1=4, var_1_4=0, var_1_5=0, var_1_6=0, var_1_8=128] [L77] RET assume_abort_if_not(var_1_11 <= 0) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=0, var_1_15=-1, var_1_16=0, var_1_1=4, var_1_4=0, var_1_5=0, var_1_6=0, var_1_8=128] [L78] var_1_12 = __VERIFIER_nondet_uchar() [L79] CALL assume_abort_if_not(var_1_12 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_13=1, var_1_14=0, var_1_15=-1, var_1_16=0, var_1_1=4, var_1_4=0, var_1_5=0, var_1_6=0, var_1_8=128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_13=1, var_1_14=0, var_1_15=-1, var_1_16=0, var_1_1=4, var_1_4=0, var_1_5=0, var_1_6=0, var_1_8=128] [L79] RET assume_abort_if_not(var_1_12 >= 0) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_13=1, var_1_14=0, var_1_15=-1, var_1_16=0, var_1_1=4, var_1_4=0, var_1_5=0, var_1_6=0, var_1_8=128] [L80] CALL assume_abort_if_not(var_1_12 <= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=0, var_1_15=-1, var_1_16=0, var_1_1=4, var_1_4=0, var_1_5=0, var_1_6=0, var_1_8=128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=0, var_1_15=-1, var_1_16=0, var_1_1=4, var_1_4=0, var_1_5=0, var_1_6=0, var_1_8=128] [L80] RET assume_abort_if_not(var_1_12 <= 0) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=0, var_1_15=-1, var_1_16=0, var_1_1=4, var_1_4=0, var_1_5=0, var_1_6=0, var_1_8=128] [L81] var_1_14 = __VERIFIER_nondet_uchar() [L82] CALL assume_abort_if_not(var_1_14 >= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=-255, var_1_15=-1, var_1_16=0, var_1_1=4, var_1_4=0, var_1_5=0, var_1_6=0, var_1_8=128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=-255, var_1_15=-1, var_1_16=0, var_1_1=4, var_1_4=0, var_1_5=0, var_1_6=0, var_1_8=128] [L82] RET assume_abort_if_not(var_1_14 >= 1) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=-255, var_1_15=-1, var_1_16=0, var_1_1=4, var_1_4=0, var_1_5=0, var_1_6=0, var_1_8=128] [L83] CALL assume_abort_if_not(var_1_14 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=-255, var_1_15=-1, var_1_16=0, var_1_1=4, var_1_4=0, var_1_5=0, var_1_6=0, var_1_8=128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=-255, var_1_15=-1, var_1_16=0, var_1_1=4, var_1_4=0, var_1_5=0, var_1_6=0, var_1_8=128] [L83] RET assume_abort_if_not(var_1_14 <= 1) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=-255, var_1_15=-1, var_1_16=0, var_1_1=4, var_1_4=0, var_1_5=0, var_1_6=0, var_1_8=128] [L84] var_1_16 = __VERIFIER_nondet_char() [L85] CALL assume_abort_if_not(var_1_16 >= -127) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=-255, var_1_15=-1, var_1_16=126, var_1_1=4, var_1_4=0, var_1_5=0, var_1_6=0, var_1_8=128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=-255, var_1_15=-1, var_1_16=126, var_1_1=4, var_1_4=0, var_1_5=0, var_1_6=0, var_1_8=128] [L85] RET assume_abort_if_not(var_1_16 >= -127) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=-255, var_1_15=-1, var_1_16=126, var_1_1=4, var_1_4=0, var_1_5=0, var_1_6=0, var_1_8=128] [L86] CALL assume_abort_if_not(var_1_16 <= 126) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=-255, var_1_15=-1, var_1_16=126, var_1_1=4, var_1_4=0, var_1_5=0, var_1_6=0, var_1_8=128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=-255, var_1_15=-1, var_1_16=126, var_1_1=4, var_1_4=0, var_1_5=0, var_1_6=0, var_1_8=128] [L86] RET assume_abort_if_not(var_1_16 <= 126) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=-255, var_1_15=-1, var_1_16=126, var_1_1=4, var_1_4=0, var_1_5=0, var_1_6=0, var_1_8=128] [L100] RET updateVariables() [L101] CALL step() [L39] var_1_13 = var_1_14 [L40] var_1_15 = var_1_16 VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=-255, var_1_14=-255, var_1_15=126, var_1_16=126, var_1_1=4, var_1_4=0, var_1_5=0, var_1_6=0, var_1_8=128] [L41] COND FALSE !(var_1_2 >= 64.5f) [L52] var_1_1 = 50 VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=-255, var_1_14=-255, var_1_15=126, var_1_16=126, var_1_1=50, var_1_4=0, var_1_5=0, var_1_6=0, var_1_8=128] [L54] var_1_8 = ((((var_1_15) < 0 ) ? -(var_1_15) : (var_1_15))) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=-255, var_1_14=-255, var_1_15=126, var_1_16=126, var_1_1=50, var_1_4=0, var_1_5=0, var_1_6=0, var_1_8=126] [L55] EXPR 50 >> var_1_4 VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=-255, var_1_14=-255, var_1_15=126, var_1_16=126, var_1_1=50, var_1_4=0, var_1_5=0, var_1_6=0, var_1_8=126] [L55] COND TRUE (50 >> var_1_4) <= var_1_8 [L56] var_1_10 = ((! (! var_1_11)) || var_1_12) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=-255, var_1_14=-255, var_1_15=126, var_1_16=126, var_1_1=50, var_1_4=0, var_1_5=0, var_1_6=0, var_1_8=126] [L101] RET step() [L102] CALL, EXPR property() [L91] EXPR (((var_1_2 >= 64.5f) ? ((var_1_2 >= var_1_3) ? (var_1_1 == ((unsigned short int) (((((((var_1_4) > (((((var_1_5) > (var_1_6)) ? (var_1_5) : (var_1_6))))) ? (var_1_4) : (((((var_1_5) > (var_1_6)) ? (var_1_5) : (var_1_6)))))) < 0 ) ? -((((var_1_4) > (((((var_1_5) > (var_1_6)) ? (var_1_5) : (var_1_6))))) ? (var_1_4) : (((((var_1_5) > (var_1_6)) ? (var_1_5) : (var_1_6)))))) : ((((var_1_4) > (((((var_1_5) > (var_1_6)) ? (var_1_5) : (var_1_6))))) ? (var_1_4) : (((((var_1_5) > (var_1_6)) ? (var_1_5) : (var_1_6)))))))))) : (var_1_13 ? (var_1_1 == ((unsigned short int) var_1_5)) : (var_1_1 == ((unsigned short int) var_1_6)))) : (var_1_1 == ((unsigned short int) 50))) && (var_1_8 == ((signed short int) ((((var_1_15) < 0 ) ? -(var_1_15) : (var_1_15)))))) && (((50 >> var_1_4) <= var_1_8) ? (var_1_10 == ((unsigned char) ((! (! var_1_11)) || var_1_12))) : (var_1_10 == ((unsigned char) (! var_1_11)))) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=-255, var_1_14=-255, var_1_15=126, var_1_16=126, var_1_1=50, var_1_4=0, var_1_5=0, var_1_6=0, var_1_8=126] [L91-L92] return (((((var_1_2 >= 64.5f) ? ((var_1_2 >= var_1_3) ? (var_1_1 == ((unsigned short int) (((((((var_1_4) > (((((var_1_5) > (var_1_6)) ? (var_1_5) : (var_1_6))))) ? (var_1_4) : (((((var_1_5) > (var_1_6)) ? (var_1_5) : (var_1_6)))))) < 0 ) ? -((((var_1_4) > (((((var_1_5) > (var_1_6)) ? (var_1_5) : (var_1_6))))) ? (var_1_4) : (((((var_1_5) > (var_1_6)) ? (var_1_5) : (var_1_6)))))) : ((((var_1_4) > (((((var_1_5) > (var_1_6)) ? (var_1_5) : (var_1_6))))) ? (var_1_4) : (((((var_1_5) > (var_1_6)) ? (var_1_5) : (var_1_6)))))))))) : (var_1_13 ? (var_1_1 == ((unsigned short int) var_1_5)) : (var_1_1 == ((unsigned short int) var_1_6)))) : (var_1_1 == ((unsigned short int) 50))) && (var_1_8 == ((signed short int) ((((var_1_15) < 0 ) ? -(var_1_15) : (var_1_15)))))) && (((50 >> var_1_4) <= var_1_8) ? (var_1_10 == ((unsigned char) ((! (! var_1_11)) || var_1_12))) : (var_1_10 == ((unsigned char) (! var_1_11))))) && (var_1_13 == ((unsigned char) var_1_14))) && (var_1_15 == ((signed char) var_1_16)) ; [L102] RET, EXPR property() [L102] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=-255, var_1_14=-255, var_1_15=126, var_1_16=126, var_1_1=50, var_1_4=0, var_1_5=0, var_1_6=0, var_1_8=126] [L19] reach_error() VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=-255, var_1_14=-255, var_1_15=126, var_1_16=126, var_1_1=50, var_1_4=0, var_1_5=0, var_1_6=0, var_1_8=126] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 57 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.0s, OverallIterations: 2, TraceHistogramMax: 16, 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, 79 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 0 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 0 IncrementalHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 0 mSolverCounterUnsat, 79 mSDtfsCounter, 0 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 105 GetRequests, 105 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=57occurred in iteration=0, InterpolantAutomatonStates: 2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.2s InterpolantComputationTime, 312 NumberOfCodeBlocks, 312 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 206 ConstructedInterpolants, 0 QuantifiedInterpolants, 206 SizeOfPredicates, 0 NumberOfNonLiveVariables, 241 ConjunctsInSsa, 1 ConjunctsInUnsatCore, 2 InterpolantComputations, 1 PerfectInterpolantSequences, 930/960 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-22 10:40:57,115 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-49.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 92c32feee421c48ab58fbc8ff43c274cf7615d37c71b93492a69b21460f6fabb --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-803cd42-m [2024-11-22 10:40:59,167 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-22 10:40:59,236 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-22 10:40:59,240 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-22 10:40:59,241 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-22 10:40:59,269 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-22 10:40:59,271 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-22 10:40:59,272 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-22 10:40:59,272 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-22 10:40:59,272 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-22 10:40:59,273 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-22 10:40:59,273 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-22 10:40:59,273 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-22 10:40:59,273 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-22 10:40:59,274 INFO L153 SettingsManager]: * Use SBE=true [2024-11-22 10:40:59,274 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-22 10:40:59,276 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-22 10:40:59,277 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-22 10:40:59,279 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-22 10:40:59,279 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-22 10:40:59,279 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-22 10:40:59,279 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-22 10:40:59,280 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-22 10:40:59,280 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-22 10:40:59,280 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-22 10:40:59,280 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-22 10:40:59,280 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-22 10:40:59,280 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-22 10:40:59,281 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-22 10:40:59,281 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-22 10:40:59,281 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-22 10:40:59,281 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-22 10:40:59,281 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-22 10:40:59,282 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-22 10:40:59,282 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-22 10:40:59,283 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-22 10:40:59,283 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-22 10:40:59,283 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-22 10:40:59,283 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-22 10:40:59,284 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-22 10:40:59,284 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-22 10:40:59,284 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-22 10:40:59,284 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-22 10:40:59,284 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-22 10:40:59,284 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 -> 92c32feee421c48ab58fbc8ff43c274cf7615d37c71b93492a69b21460f6fabb [2024-11-22 10:40:59,572 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-22 10:40:59,590 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-22 10:40:59,592 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-22 10:40:59,593 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-22 10:40:59,594 INFO L274 PluginConnector]: CDTParser initialized [2024-11-22 10:40:59,595 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-49.i [2024-11-22 10:41:00,934 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-22 10:41:01,099 INFO L384 CDTParser]: Found 1 translation units. [2024-11-22 10:41:01,099 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-49.i [2024-11-22 10:41:01,117 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4a92ec9eb/b116c82cb6ad40c3a720a2803bab5171/FLAG11fa5acb9 [2024-11-22 10:41:01,481 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4a92ec9eb/b116c82cb6ad40c3a720a2803bab5171 [2024-11-22 10:41:01,483 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-22 10:41:01,484 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-22 10:41:01,485 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-22 10:41:01,485 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-22 10:41:01,489 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-22 10:41:01,489 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 10:41:01" (1/1) ... [2024-11-22 10:41:01,490 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@51640c85 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:41:01, skipping insertion in model container [2024-11-22 10:41:01,490 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 10:41:01" (1/1) ... [2024-11-22 10:41:01,510 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-22 10:41:01,657 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_loopvsstraightlinecode_25-1loop_file-49.i[915,928] [2024-11-22 10:41:01,710 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-22 10:41:01,723 INFO L200 MainTranslator]: Completed pre-run [2024-11-22 10:41:01,733 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_loopvsstraightlinecode_25-1loop_file-49.i[915,928] [2024-11-22 10:41:01,758 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-22 10:41:01,772 INFO L204 MainTranslator]: Completed translation [2024-11-22 10:41:01,773 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:41:01 WrapperNode [2024-11-22 10:41:01,773 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-22 10:41:01,774 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-22 10:41:01,774 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-22 10:41:01,774 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-22 10:41:01,779 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:41:01" (1/1) ... [2024-11-22 10:41:01,792 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:41:01" (1/1) ... [2024-11-22 10:41:01,816 INFO L138 Inliner]: procedures = 27, calls = 29, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 109 [2024-11-22 10:41:01,820 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-22 10:41:01,821 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-22 10:41:01,821 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-22 10:41:01,821 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-22 10:41:01,830 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:41:01" (1/1) ... [2024-11-22 10:41:01,830 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:41:01" (1/1) ... [2024-11-22 10:41:01,836 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:41:01" (1/1) ... [2024-11-22 10:41:01,852 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-22 10:41:01,853 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:41:01" (1/1) ... [2024-11-22 10:41:01,853 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:41:01" (1/1) ... [2024-11-22 10:41:01,871 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:41:01" (1/1) ... [2024-11-22 10:41:01,873 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:41:01" (1/1) ... [2024-11-22 10:41:01,878 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:41:01" (1/1) ... [2024-11-22 10:41:01,879 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:41:01" (1/1) ... [2024-11-22 10:41:01,882 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-22 10:41:01,886 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-22 10:41:01,886 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-22 10:41:01,886 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-22 10:41:01,887 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:41:01" (1/1) ... [2024-11-22 10:41:01,893 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-22 10:41:01,902 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 10:41:01,917 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-22 10:41:01,919 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-22 10:41:01,958 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-22 10:41:01,959 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-22 10:41:01,959 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-22 10:41:01,959 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-22 10:41:01,959 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-22 10:41:01,960 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-22 10:41:02,031 INFO L238 CfgBuilder]: Building ICFG [2024-11-22 10:41:02,033 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-22 10:41:02,220 INFO L? ?]: Removed 9 outVars from TransFormulas that were not future-live. [2024-11-22 10:41:02,220 INFO L287 CfgBuilder]: Performing block encoding [2024-11-22 10:41:02,229 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-22 10:41:02,230 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-22 10:41:02,230 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 10:41:02 BoogieIcfgContainer [2024-11-22 10:41:02,231 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-22 10:41:02,234 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-22 10:41:02,234 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-22 10:41:02,237 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-22 10:41:02,237 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.11 10:41:01" (1/3) ... [2024-11-22 10:41:02,237 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@560aac1b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 10:41:02, skipping insertion in model container [2024-11-22 10:41:02,237 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:41:01" (2/3) ... [2024-11-22 10:41:02,238 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@560aac1b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 10:41:02, skipping insertion in model container [2024-11-22 10:41:02,238 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 10:41:02" (3/3) ... [2024-11-22 10:41:02,239 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_25-1loop_file-49.i [2024-11-22 10:41:02,254 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-22 10:41:02,254 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-22 10:41:02,324 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-22 10:41:02,331 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;@2ba0da5e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-22 10:41:02,332 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-22 10:41:02,336 INFO L276 IsEmpty]: Start isEmpty. Operand has 50 states, 31 states have (on average 1.2903225806451613) internal successors, (40), 32 states have internal predecessors, (40), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-22 10:41:02,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-11-22 10:41:02,346 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 10:41:02,346 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 10:41:02,347 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 10:41:02,353 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 10:41:02,353 INFO L85 PathProgramCache]: Analyzing trace with hash 2117865659, now seen corresponding path program 1 times [2024-11-22 10:41:02,366 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 10:41:02,367 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1406028388] [2024-11-22 10:41:02,367 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 10:41:02,367 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 10:41:02,367 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 10:41:02,373 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-22 10:41:02,373 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-22 10:41:02,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 10:41:02,586 INFO L255 TraceCheckSpWp]: Trace formula consists of 165 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-22 10:41:02,597 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 10:41:02,638 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 134 proven. 0 refuted. 0 times theorem prover too weak. 346 trivial. 0 not checked. [2024-11-22 10:41:02,639 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 10:41:02,639 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 10:41:02,641 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1406028388] [2024-11-22 10:41:02,642 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1406028388] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 10:41:02,642 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 10:41:02,642 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-22 10:41:02,644 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [999984794] [2024-11-22 10:41:02,645 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 10:41:02,650 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-22 10:41:02,651 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 10:41:02,675 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-22 10:41:02,676 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-22 10:41:02,679 INFO L87 Difference]: Start difference. First operand has 50 states, 31 states have (on average 1.2903225806451613) internal successors, (40), 32 states have internal predecessors, (40), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2024-11-22 10:41:02,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 10:41:02,713 INFO L93 Difference]: Finished difference Result 97 states and 157 transitions. [2024-11-22 10:41:02,714 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-22 10:41:02,715 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 101 [2024-11-22 10:41:02,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 10:41:02,724 INFO L225 Difference]: With dead ends: 97 [2024-11-22 10:41:02,725 INFO L226 Difference]: Without dead ends: 46 [2024-11-22 10:41:02,731 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-22 10:41:02,734 INFO L432 NwaCegarLoop]: 69 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, 69 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-22 10:41:02,736 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 10:41:02,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2024-11-22 10:41:02,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2024-11-22 10:41:02,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 28 states have (on average 1.1785714285714286) internal successors, (33), 28 states have internal predecessors, (33), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-22 10:41:02,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 65 transitions. [2024-11-22 10:41:02,776 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 65 transitions. Word has length 101 [2024-11-22 10:41:02,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 10:41:02,776 INFO L471 AbstractCegarLoop]: Abstraction has 46 states and 65 transitions. [2024-11-22 10:41:02,776 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2024-11-22 10:41:02,776 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 65 transitions. [2024-11-22 10:41:02,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-11-22 10:41:02,782 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 10:41:02,782 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 10:41:02,790 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2024-11-22 10:41:02,986 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 10:41:02,987 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 10:41:02,988 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 10:41:02,988 INFO L85 PathProgramCache]: Analyzing trace with hash -357261577, now seen corresponding path program 1 times [2024-11-22 10:41:02,988 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 10:41:02,989 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1778432719] [2024-11-22 10:41:02,989 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 10:41:02,989 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 10:41:02,989 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 10:41:02,992 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-22 10:41:02,992 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-22 10:41:03,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 10:41:03,151 INFO L255 TraceCheckSpWp]: Trace formula consists of 165 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-22 10:41:03,159 INFO L278 TraceCheckSpWp]: Computing forward predicates...