./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-98.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-98.i -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/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 1aab861a420ae258d58e8cdb7baa3d890ad6a0a3ff243e7522ba05d5d977c664 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 07:39:21,885 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 07:39:21,941 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-11 07:39:21,948 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 07:39:21,949 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 07:39:21,975 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 07:39:21,975 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 07:39:21,976 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 07:39:21,976 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 07:39:21,978 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 07:39:21,978 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 07:39:21,978 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 07:39:21,979 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 07:39:21,979 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 07:39:21,980 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 07:39:21,980 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 07:39:21,980 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 07:39:21,981 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 07:39:21,981 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 07:39:21,981 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 07:39:21,981 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 07:39:21,982 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 07:39:21,982 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 07:39:21,982 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 07:39:21,983 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 07:39:21,983 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 07:39:21,983 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 07:39:21,983 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 07:39:21,983 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 07:39:21,984 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 07:39:21,984 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 07:39:21,985 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 07:39:21,985 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 07:39:21,985 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 07:39:21,985 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 07:39:21,985 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 07:39:21,985 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 07:39:21,986 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 07:39:21,986 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 07:39:21,986 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 07:39:21,986 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 07:39:21,987 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 07:39:21,987 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-clean/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-clean/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 -> 1aab861a420ae258d58e8cdb7baa3d890ad6a0a3ff243e7522ba05d5d977c664 [2024-10-11 07:39:22,190 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 07:39:22,210 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 07:39:22,213 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 07:39:22,214 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 07:39:22,215 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 07:39:22,216 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-98.i [2024-10-11 07:39:23,444 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 07:39:23,597 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 07:39:23,598 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-98.i [2024-10-11 07:39:23,608 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/c5333558e/858337926e7747808c327bc4f4a72faa/FLAG0d4fea77f [2024-10-11 07:39:24,003 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/c5333558e/858337926e7747808c327bc4f4a72faa [2024-10-11 07:39:24,005 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 07:39:24,006 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 07:39:24,007 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 07:39:24,007 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 07:39:24,011 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 07:39:24,012 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 07:39:24" (1/1) ... [2024-10-11 07:39:24,014 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1a35b5f1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:39:24, skipping insertion in model container [2024-10-11 07:39:24,014 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 07:39:24" (1/1) ... [2024-10-11 07:39:24,038 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 07:39:24,182 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-98.i[917,930] [2024-10-11 07:39:24,247 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 07:39:24,257 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 07:39:24,266 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-98.i[917,930] [2024-10-11 07:39:24,286 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 07:39:24,300 INFO L204 MainTranslator]: Completed translation [2024-10-11 07:39:24,300 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:39:24 WrapperNode [2024-10-11 07:39:24,301 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 07:39:24,301 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 07:39:24,302 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 07:39:24,302 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 07:39:24,307 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:39:24" (1/1) ... [2024-10-11 07:39:24,317 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:39:24" (1/1) ... [2024-10-11 07:39:24,352 INFO L138 Inliner]: procedures = 26, calls = 41, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 177 [2024-10-11 07:39:24,353 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 07:39:24,353 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 07:39:24,354 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 07:39:24,354 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 07:39:24,365 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:39:24" (1/1) ... [2024-10-11 07:39:24,366 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:39:24" (1/1) ... [2024-10-11 07:39:24,368 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:39:24" (1/1) ... [2024-10-11 07:39:24,381 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-11 07:39:24,381 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:39:24" (1/1) ... [2024-10-11 07:39:24,381 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:39:24" (1/1) ... [2024-10-11 07:39:24,395 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:39:24" (1/1) ... [2024-10-11 07:39:24,401 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:39:24" (1/1) ... [2024-10-11 07:39:24,403 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:39:24" (1/1) ... [2024-10-11 07:39:24,404 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:39:24" (1/1) ... [2024-10-11 07:39:24,410 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 07:39:24,411 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 07:39:24,414 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 07:39:24,414 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 07:39:24,415 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:39:24" (1/1) ... [2024-10-11 07:39:24,419 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 07:39:24,428 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 07:39:24,442 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 07:39:24,444 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 07:39:24,497 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 07:39:24,497 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-11 07:39:24,498 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-11 07:39:24,498 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 07:39:24,499 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 07:39:24,499 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 07:39:24,568 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 07:39:24,570 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 07:39:24,835 INFO L? ?]: Removed 16 outVars from TransFormulas that were not future-live. [2024-10-11 07:39:24,835 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 07:39:24,864 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 07:39:24,865 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-11 07:39:24,865 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 07:39:24 BoogieIcfgContainer [2024-10-11 07:39:24,865 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 07:39:24,868 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 07:39:24,868 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 07:39:24,871 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 07:39:24,871 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 07:39:24" (1/3) ... [2024-10-11 07:39:24,872 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@484ef7ee and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 07:39:24, skipping insertion in model container [2024-10-11 07:39:24,873 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:39:24" (2/3) ... [2024-10-11 07:39:24,873 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@484ef7ee and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 07:39:24, skipping insertion in model container [2024-10-11 07:39:24,873 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 07:39:24" (3/3) ... [2024-10-11 07:39:24,874 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_codestructure_steplocals_file-98.i [2024-10-11 07:39:24,890 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 07:39:24,890 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 07:39:24,935 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 07:39:24,940 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;@36f19d90, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 07:39:24,941 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 07:39:24,944 INFO L276 IsEmpty]: Start isEmpty. Operand has 74 states, 43 states have (on average 1.4186046511627908) internal successors, (61), 44 states have internal predecessors, (61), 28 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2024-10-11 07:39:24,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2024-10-11 07:39:24,960 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 07:39:24,961 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 07:39:24,962 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 07:39:24,966 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 07:39:24,967 INFO L85 PathProgramCache]: Analyzing trace with hash -1885326770, now seen corresponding path program 1 times [2024-10-11 07:39:24,974 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 07:39:24,974 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [49152261] [2024-10-11 07:39:24,974 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 07:39:24,975 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 07:39:25,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:39:25,247 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 07:39:25,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:39:25,258 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 07:39:25,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:39:25,264 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 07:39:25,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:39:25,270 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 07:39:25,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:39:25,277 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 07:39:25,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:39:25,282 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 07:39:25,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:39:25,290 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-11 07:39:25,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:39:25,297 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 07:39:25,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:39:25,304 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-11 07:39:25,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:39:25,311 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-11 07:39:25,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:39:25,316 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-11 07:39:25,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:39:25,323 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 07:39:25,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:39:25,328 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 07:39:25,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:39:25,332 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-11 07:39:25,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:39:25,339 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-11 07:39:25,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:39:25,343 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-11 07:39:25,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:39:25,348 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-11 07:39:25,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:39:25,353 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-11 07:39:25,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:39:25,358 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-11 07:39:25,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:39:25,363 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-11 07:39:25,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:39:25,370 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-11 07:39:25,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:39:25,374 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-11 07:39:25,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:39:25,380 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-10-11 07:39:25,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:39:25,382 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-11 07:39:25,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:39:25,386 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-10-11 07:39:25,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:39:25,391 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-10-11 07:39:25,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:39:25,394 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2024-10-11 07:39:25,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:39:25,396 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-10-11 07:39:25,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:39:25,400 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2024-10-11 07:39:25,400 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 07:39:25,401 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [49152261] [2024-10-11 07:39:25,401 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [49152261] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 07:39:25,401 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 07:39:25,401 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 07:39:25,403 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1773757473] [2024-10-11 07:39:25,403 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 07:39:25,407 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-11 07:39:25,407 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 07:39:25,427 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-11 07:39:25,428 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 07:39:25,430 INFO L87 Difference]: Start difference. First operand has 74 states, 43 states have (on average 1.4186046511627908) internal successors, (61), 44 states have internal predecessors, (61), 28 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) Second operand has 2 states, 2 states have (on average 17.0) internal successors, (34), 2 states have internal predecessors, (34), 2 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 2 states have call successors, (28) [2024-10-11 07:39:25,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 07:39:25,471 INFO L93 Difference]: Finished difference Result 145 states and 260 transitions. [2024-10-11 07:39:25,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-11 07:39:25,474 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 17.0) internal successors, (34), 2 states have internal predecessors, (34), 2 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 2 states have call successors, (28) Word has length 171 [2024-10-11 07:39:25,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 07:39:25,504 INFO L225 Difference]: With dead ends: 145 [2024-10-11 07:39:25,504 INFO L226 Difference]: Without dead ends: 72 [2024-10-11 07:39:25,514 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 86 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 07:39:25,536 INFO L432 NwaCegarLoop]: 108 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 108 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 07:39:25,537 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 108 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 07:39:25,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2024-10-11 07:39:25,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2024-10-11 07:39:25,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 42 states have (on average 1.3333333333333333) internal successors, (56), 42 states have internal predecessors, (56), 28 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2024-10-11 07:39:25,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 112 transitions. [2024-10-11 07:39:25,585 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 112 transitions. Word has length 171 [2024-10-11 07:39:25,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 07:39:25,586 INFO L471 AbstractCegarLoop]: Abstraction has 72 states and 112 transitions. [2024-10-11 07:39:25,586 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 17.0) internal successors, (34), 2 states have internal predecessors, (34), 2 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 2 states have call successors, (28) [2024-10-11 07:39:25,586 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 112 transitions. [2024-10-11 07:39:25,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2024-10-11 07:39:25,589 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 07:39:25,589 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 07:39:25,589 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 07:39:25,589 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 07:39:25,590 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 07:39:25,590 INFO L85 PathProgramCache]: Analyzing trace with hash -1316013482, now seen corresponding path program 1 times [2024-10-11 07:39:25,590 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 07:39:25,590 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [612634504] [2024-10-11 07:39:25,590 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 07:39:25,591 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 07:39:25,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-11 07:39:25,826 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1030550097] [2024-10-11 07:39:25,828 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 07:39:25,829 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 07:39:25,829 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 07:39:25,830 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 07:39:25,832 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-11 07:39:25,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 07:39:25,969 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-11 07:39:26,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 07:39:26,100 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-11 07:39:26,102 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-11 07:39:26,103 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-11 07:39:26,122 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-11 07:39:26,306 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 07:39:26,309 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1] [2024-10-11 07:39:26,401 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-11 07:39:26,403 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.10 07:39:26 BoogieIcfgContainer [2024-10-11 07:39:26,403 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-11 07:39:26,404 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-11 07:39:26,404 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-11 07:39:26,406 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-11 07:39:26,406 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 07:39:24" (3/4) ... [2024-10-11 07:39:26,407 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-11 07:39:26,409 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-11 07:39:26,409 INFO L158 Benchmark]: Toolchain (without parser) took 2402.89ms. Allocated memory is still 201.3MB. Free memory was 130.5MB in the beginning and 101.8MB in the end (delta: 28.7MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. [2024-10-11 07:39:26,409 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 201.3MB. Free memory is still 159.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 07:39:26,412 INFO L158 Benchmark]: CACSL2BoogieTranslator took 293.69ms. Allocated memory is still 201.3MB. Free memory was 130.3MB in the beginning and 114.7MB in the end (delta: 15.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-10-11 07:39:26,412 INFO L158 Benchmark]: Boogie Procedure Inliner took 51.52ms. Allocated memory is still 201.3MB. Free memory was 114.7MB in the beginning and 111.4MB in the end (delta: 3.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-11 07:39:26,412 INFO L158 Benchmark]: Boogie Preprocessor took 57.05ms. Allocated memory is still 201.3MB. Free memory was 111.4MB in the beginning and 107.3MB in the end (delta: 4.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-11 07:39:26,413 INFO L158 Benchmark]: RCFGBuilder took 453.99ms. Allocated memory is still 201.3MB. Free memory was 107.3MB in the beginning and 148.0MB in the end (delta: -40.7MB). Peak memory consumption was 9.4MB. Max. memory is 16.1GB. [2024-10-11 07:39:26,413 INFO L158 Benchmark]: TraceAbstraction took 1535.48ms. Allocated memory is still 201.3MB. Free memory was 148.0MB in the beginning and 101.8MB in the end (delta: 46.2MB). Peak memory consumption was 45.1MB. Max. memory is 16.1GB. [2024-10-11 07:39:26,413 INFO L158 Benchmark]: Witness Printer took 4.94ms. Allocated memory is still 201.3MB. Free memory is still 101.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 07:39:26,414 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.14ms. Allocated memory is still 201.3MB. Free memory is still 159.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 293.69ms. Allocated memory is still 201.3MB. Free memory was 130.3MB in the beginning and 114.7MB in the end (delta: 15.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 51.52ms. Allocated memory is still 201.3MB. Free memory was 114.7MB in the beginning and 111.4MB in the end (delta: 3.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 57.05ms. Allocated memory is still 201.3MB. Free memory was 111.4MB in the beginning and 107.3MB in the end (delta: 4.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 453.99ms. Allocated memory is still 201.3MB. Free memory was 107.3MB in the beginning and 148.0MB in the end (delta: -40.7MB). Peak memory consumption was 9.4MB. Max. memory is 16.1GB. * TraceAbstraction took 1535.48ms. Allocated memory is still 201.3MB. Free memory was 148.0MB in the beginning and 101.8MB in the end (delta: 46.2MB). Peak memory consumption was 45.1MB. Max. memory is 16.1GB. * Witness Printer took 4.94ms. Allocated memory is still 201.3MB. Free memory is still 101.8MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 133, overapproximation of someBinaryArithmeticDOUBLEoperation at line 67, overapproximation of bitwiseAnd at line 133. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed long int var_1_1 = -64; [L23] signed short int var_1_2 = 2; [L24] signed short int var_1_3 = -32; [L25] signed short int var_1_4 = -10; [L26] signed short int var_1_5 = 100; [L27] double var_1_6 = 0.5; [L28] double var_1_7 = 16.5; [L29] double var_1_8 = 7.4; [L30] unsigned short int var_1_9 = 4; [L31] unsigned char var_1_10 = 0; [L32] unsigned long int var_1_11 = 1000000000; [L33] unsigned short int var_1_12 = 256; [L34] signed short int var_1_13 = 16; [L35] signed short int var_1_14 = 64; [L36] unsigned short int var_1_15 = 63836; [L37] unsigned short int var_1_16 = 10; [L38] signed char var_1_17 = -8; [L39] signed char var_1_18 = 8; [L40] signed short int var_1_19 = 50; [L41] signed short int var_1_20 = 10; [L42] signed short int var_1_21 = 10000; [L43] signed char var_1_22 = -2; [L137] isInitial = 1 [L138] FCALL initially() [L139] COND TRUE 1 [L140] FCALL updateLastVariables() [L141] CALL updateVariables() [L87] var_1_2 = __VERIFIER_nondet_short() [L88] CALL assume_abort_if_not(var_1_2 >= -32768) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=16, var_1_14=64, var_1_15=63836, var_1_16=10, var_1_17=-8, var_1_18=8, var_1_19=50, var_1_1=-64, var_1_20=10, var_1_21=10000, var_1_22=-2, var_1_2=1, var_1_3=-32, var_1_4=-10, var_1_5=100, var_1_6=1/2, var_1_7=33/2, var_1_8=37/5, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=16, var_1_14=64, var_1_15=63836, var_1_16=10, var_1_17=-8, var_1_18=8, var_1_19=50, var_1_1=-64, var_1_20=10, var_1_21=10000, var_1_22=-2, var_1_2=1, var_1_3=-32, var_1_4=-10, var_1_5=100, var_1_6=1/2, var_1_7=33/2, var_1_8=37/5, var_1_9=4] [L88] RET assume_abort_if_not(var_1_2 >= -32768) VAL [isInitial=1, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=16, var_1_14=64, var_1_15=63836, var_1_16=10, var_1_17=-8, var_1_18=8, var_1_19=50, var_1_1=-64, var_1_20=10, var_1_21=10000, var_1_22=-2, var_1_2=1, var_1_3=-32, var_1_4=-10, var_1_5=100, var_1_6=1/2, var_1_7=33/2, var_1_8=37/5, var_1_9=4] [L89] CALL assume_abort_if_not(var_1_2 <= 32767) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=16, var_1_14=64, var_1_15=63836, var_1_16=10, var_1_17=-8, var_1_18=8, var_1_19=50, var_1_1=-64, var_1_20=10, var_1_21=10000, var_1_22=-2, var_1_2=1, var_1_3=-32, var_1_4=-10, var_1_5=100, var_1_6=1/2, var_1_7=33/2, var_1_8=37/5, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=16, var_1_14=64, var_1_15=63836, var_1_16=10, var_1_17=-8, var_1_18=8, var_1_19=50, var_1_1=-64, var_1_20=10, var_1_21=10000, var_1_22=-2, var_1_2=1, var_1_3=-32, var_1_4=-10, var_1_5=100, var_1_6=1/2, var_1_7=33/2, var_1_8=37/5, var_1_9=4] [L89] RET assume_abort_if_not(var_1_2 <= 32767) VAL [isInitial=1, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=16, var_1_14=64, var_1_15=63836, var_1_16=10, var_1_17=-8, var_1_18=8, var_1_19=50, var_1_1=-64, var_1_20=10, var_1_21=10000, var_1_22=-2, var_1_2=1, var_1_3=-32, var_1_4=-10, var_1_5=100, var_1_6=1/2, var_1_7=33/2, var_1_8=37/5, var_1_9=4] [L90] var_1_3 = __VERIFIER_nondet_short() [L91] CALL assume_abort_if_not(var_1_3 >= -32768) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=16, var_1_14=64, var_1_15=63836, var_1_16=10, var_1_17=-8, var_1_18=8, var_1_19=50, var_1_1=-64, var_1_20=10, var_1_21=10000, var_1_22=-2, var_1_2=1, var_1_3=1, var_1_4=-10, var_1_5=100, var_1_6=1/2, var_1_7=33/2, var_1_8=37/5, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=16, var_1_14=64, var_1_15=63836, var_1_16=10, var_1_17=-8, var_1_18=8, var_1_19=50, var_1_1=-64, var_1_20=10, var_1_21=10000, var_1_22=-2, var_1_2=1, var_1_3=1, var_1_4=-10, var_1_5=100, var_1_6=1/2, var_1_7=33/2, var_1_8=37/5, var_1_9=4] [L91] RET assume_abort_if_not(var_1_3 >= -32768) VAL [isInitial=1, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=16, var_1_14=64, var_1_15=63836, var_1_16=10, var_1_17=-8, var_1_18=8, var_1_19=50, var_1_1=-64, var_1_20=10, var_1_21=10000, var_1_22=-2, var_1_2=1, var_1_3=1, var_1_4=-10, var_1_5=100, var_1_6=1/2, var_1_7=33/2, var_1_8=37/5, var_1_9=4] [L92] CALL assume_abort_if_not(var_1_3 <= 32767) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=16, var_1_14=64, var_1_15=63836, var_1_16=10, var_1_17=-8, var_1_18=8, var_1_19=50, var_1_1=-64, var_1_20=10, var_1_21=10000, var_1_22=-2, var_1_2=1, var_1_3=1, var_1_4=-10, var_1_5=100, var_1_6=1/2, var_1_7=33/2, var_1_8=37/5, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=16, var_1_14=64, var_1_15=63836, var_1_16=10, var_1_17=-8, var_1_18=8, var_1_19=50, var_1_1=-64, var_1_20=10, var_1_21=10000, var_1_22=-2, var_1_2=1, var_1_3=1, var_1_4=-10, var_1_5=100, var_1_6=1/2, var_1_7=33/2, var_1_8=37/5, var_1_9=4] [L92] RET assume_abort_if_not(var_1_3 <= 32767) VAL [isInitial=1, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=16, var_1_14=64, var_1_15=63836, var_1_16=10, var_1_17=-8, var_1_18=8, var_1_19=50, var_1_1=-64, var_1_20=10, var_1_21=10000, var_1_22=-2, var_1_2=1, var_1_3=1, var_1_4=-10, var_1_5=100, var_1_6=1/2, var_1_7=33/2, var_1_8=37/5, var_1_9=4] [L93] var_1_4 = __VERIFIER_nondet_short() [L94] CALL assume_abort_if_not(var_1_4 >= -32768) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=16, var_1_14=64, var_1_15=63836, var_1_16=10, var_1_17=-8, var_1_18=8, var_1_19=50, var_1_1=-64, var_1_20=10, var_1_21=10000, var_1_22=-2, var_1_2=1, var_1_3=1, var_1_4=2, var_1_5=100, var_1_6=1/2, var_1_7=33/2, var_1_8=37/5, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=16, var_1_14=64, var_1_15=63836, var_1_16=10, var_1_17=-8, var_1_18=8, var_1_19=50, var_1_1=-64, var_1_20=10, var_1_21=10000, var_1_22=-2, var_1_2=1, var_1_3=1, var_1_4=2, var_1_5=100, var_1_6=1/2, var_1_7=33/2, var_1_8=37/5, var_1_9=4] [L94] RET assume_abort_if_not(var_1_4 >= -32768) VAL [isInitial=1, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=16, var_1_14=64, var_1_15=63836, var_1_16=10, var_1_17=-8, var_1_18=8, var_1_19=50, var_1_1=-64, var_1_20=10, var_1_21=10000, var_1_22=-2, var_1_2=1, var_1_3=1, var_1_4=2, var_1_5=100, var_1_6=1/2, var_1_7=33/2, var_1_8=37/5, var_1_9=4] [L95] CALL assume_abort_if_not(var_1_4 <= 32767) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=16, var_1_14=64, var_1_15=63836, var_1_16=10, var_1_17=-8, var_1_18=8, var_1_19=50, var_1_1=-64, var_1_20=10, var_1_21=10000, var_1_22=-2, var_1_2=1, var_1_3=1, var_1_4=2, var_1_5=100, var_1_6=1/2, var_1_7=33/2, var_1_8=37/5, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=16, var_1_14=64, var_1_15=63836, var_1_16=10, var_1_17=-8, var_1_18=8, var_1_19=50, var_1_1=-64, var_1_20=10, var_1_21=10000, var_1_22=-2, var_1_2=1, var_1_3=1, var_1_4=2, var_1_5=100, var_1_6=1/2, var_1_7=33/2, var_1_8=37/5, var_1_9=4] [L95] RET assume_abort_if_not(var_1_4 <= 32767) VAL [isInitial=1, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=16, var_1_14=64, var_1_15=63836, var_1_16=10, var_1_17=-8, var_1_18=8, var_1_19=50, var_1_1=-64, var_1_20=10, var_1_21=10000, var_1_22=-2, var_1_2=1, var_1_3=1, var_1_4=2, var_1_5=100, var_1_6=1/2, var_1_7=33/2, var_1_8=37/5, var_1_9=4] [L96] CALL assume_abort_if_not(var_1_4 != 0) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=16, var_1_14=64, var_1_15=63836, var_1_16=10, var_1_17=-8, var_1_18=8, var_1_19=50, var_1_1=-64, var_1_20=10, var_1_21=10000, var_1_22=-2, var_1_2=1, var_1_3=1, var_1_4=2, var_1_5=100, var_1_6=1/2, var_1_7=33/2, var_1_8=37/5, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=16, var_1_14=64, var_1_15=63836, var_1_16=10, var_1_17=-8, var_1_18=8, var_1_19=50, var_1_1=-64, var_1_20=10, var_1_21=10000, var_1_22=-2, var_1_2=1, var_1_3=1, var_1_4=2, var_1_5=100, var_1_6=1/2, var_1_7=33/2, var_1_8=37/5, var_1_9=4] [L96] RET assume_abort_if_not(var_1_4 != 0) VAL [isInitial=1, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=16, var_1_14=64, var_1_15=63836, var_1_16=10, var_1_17=-8, var_1_18=8, var_1_19=50, var_1_1=-64, var_1_20=10, var_1_21=10000, var_1_22=-2, var_1_2=1, var_1_3=1, var_1_4=2, var_1_5=100, var_1_6=1/2, var_1_7=33/2, var_1_8=37/5, var_1_9=4] [L97] var_1_5 = __VERIFIER_nondet_short() [L98] CALL assume_abort_if_not(var_1_5 >= -32768) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=16, var_1_14=64, var_1_15=63836, var_1_16=10, var_1_17=-8, var_1_18=8, var_1_19=50, var_1_1=-64, var_1_20=10, var_1_21=10000, var_1_22=-2, var_1_2=1, var_1_3=1, var_1_4=2, var_1_5=3, var_1_6=1/2, var_1_7=33/2, var_1_8=37/5, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=16, var_1_14=64, var_1_15=63836, var_1_16=10, var_1_17=-8, var_1_18=8, var_1_19=50, var_1_1=-64, var_1_20=10, var_1_21=10000, var_1_22=-2, var_1_2=1, var_1_3=1, var_1_4=2, var_1_5=3, var_1_6=1/2, var_1_7=33/2, var_1_8=37/5, var_1_9=4] [L98] RET assume_abort_if_not(var_1_5 >= -32768) VAL [isInitial=1, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=16, var_1_14=64, var_1_15=63836, var_1_16=10, var_1_17=-8, var_1_18=8, var_1_19=50, var_1_1=-64, var_1_20=10, var_1_21=10000, var_1_22=-2, var_1_2=1, var_1_3=1, var_1_4=2, var_1_5=3, var_1_6=1/2, var_1_7=33/2, var_1_8=37/5, var_1_9=4] [L99] CALL assume_abort_if_not(var_1_5 <= 32767) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=16, var_1_14=64, var_1_15=63836, var_1_16=10, var_1_17=-8, var_1_18=8, var_1_19=50, var_1_1=-64, var_1_20=10, var_1_21=10000, var_1_22=-2, var_1_2=1, var_1_3=1, var_1_4=2, var_1_5=3, var_1_6=1/2, var_1_7=33/2, var_1_8=37/5, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=16, var_1_14=64, var_1_15=63836, var_1_16=10, var_1_17=-8, var_1_18=8, var_1_19=50, var_1_1=-64, var_1_20=10, var_1_21=10000, var_1_22=-2, var_1_2=1, var_1_3=1, var_1_4=2, var_1_5=3, var_1_6=1/2, var_1_7=33/2, var_1_8=37/5, var_1_9=4] [L99] RET assume_abort_if_not(var_1_5 <= 32767) VAL [isInitial=1, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=16, var_1_14=64, var_1_15=63836, var_1_16=10, var_1_17=-8, var_1_18=8, var_1_19=50, var_1_1=-64, var_1_20=10, var_1_21=10000, var_1_22=-2, var_1_2=1, var_1_3=1, var_1_4=2, var_1_5=3, var_1_6=1/2, var_1_7=33/2, var_1_8=37/5, var_1_9=4] [L100] CALL assume_abort_if_not(var_1_5 != 0) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=16, var_1_14=64, var_1_15=63836, var_1_16=10, var_1_17=-8, var_1_18=8, var_1_19=50, var_1_1=-64, var_1_20=10, var_1_21=10000, var_1_22=-2, var_1_2=1, var_1_3=1, var_1_4=2, var_1_5=3, var_1_6=1/2, var_1_7=33/2, var_1_8=37/5, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=16, var_1_14=64, var_1_15=63836, var_1_16=10, var_1_17=-8, var_1_18=8, var_1_19=50, var_1_1=-64, var_1_20=10, var_1_21=10000, var_1_22=-2, var_1_2=1, var_1_3=1, var_1_4=2, var_1_5=3, var_1_6=1/2, var_1_7=33/2, var_1_8=37/5, var_1_9=4] [L100] RET assume_abort_if_not(var_1_5 != 0) VAL [isInitial=1, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=16, var_1_14=64, var_1_15=63836, var_1_16=10, var_1_17=-8, var_1_18=8, var_1_19=50, var_1_1=-64, var_1_20=10, var_1_21=10000, var_1_22=-2, var_1_2=1, var_1_3=1, var_1_4=2, var_1_5=3, var_1_6=1/2, var_1_7=33/2, var_1_8=37/5, var_1_9=4] [L101] var_1_7 = __VERIFIER_nondet_double() [L102] CALL assume_abort_if_not((var_1_7 >= -461168.6018427382800e+13F && var_1_7 <= -1.0e-20F) || (var_1_7 <= 4611686.018427382800e+12F && var_1_7 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=16, var_1_14=64, var_1_15=63836, var_1_16=10, var_1_17=-8, var_1_18=8, var_1_19=50, var_1_1=-64, var_1_20=10, var_1_21=10000, var_1_22=-2, var_1_2=1, var_1_3=1, var_1_4=2, var_1_5=3, var_1_6=1/2, var_1_8=37/5, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=16, var_1_14=64, var_1_15=63836, var_1_16=10, var_1_17=-8, var_1_18=8, var_1_19=50, var_1_1=-64, var_1_20=10, var_1_21=10000, var_1_22=-2, var_1_2=1, var_1_3=1, var_1_4=2, var_1_5=3, var_1_6=1/2, var_1_8=37/5, var_1_9=4] [L102] RET assume_abort_if_not((var_1_7 >= -461168.6018427382800e+13F && var_1_7 <= -1.0e-20F) || (var_1_7 <= 4611686.018427382800e+12F && var_1_7 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=16, var_1_14=64, var_1_15=63836, var_1_16=10, var_1_17=-8, var_1_18=8, var_1_19=50, var_1_1=-64, var_1_20=10, var_1_21=10000, var_1_22=-2, var_1_2=1, var_1_3=1, var_1_4=2, var_1_5=3, var_1_6=1/2, var_1_8=37/5, var_1_9=4] [L103] var_1_8 = __VERIFIER_nondet_double() [L104] CALL assume_abort_if_not((var_1_8 >= -461168.6018427382800e+13F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 4611686.018427382800e+12F && var_1_8 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=16, var_1_14=64, var_1_15=63836, var_1_16=10, var_1_17=-8, var_1_18=8, var_1_19=50, var_1_1=-64, var_1_20=10, var_1_21=10000, var_1_22=-2, var_1_2=1, var_1_3=1, var_1_4=2, var_1_5=3, var_1_6=1/2, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=16, var_1_14=64, var_1_15=63836, var_1_16=10, var_1_17=-8, var_1_18=8, var_1_19=50, var_1_1=-64, var_1_20=10, var_1_21=10000, var_1_22=-2, var_1_2=1, var_1_3=1, var_1_4=2, var_1_5=3, var_1_6=1/2, var_1_9=4] [L104] RET assume_abort_if_not((var_1_8 >= -461168.6018427382800e+13F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 4611686.018427382800e+12F && var_1_8 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=16, var_1_14=64, var_1_15=63836, var_1_16=10, var_1_17=-8, var_1_18=8, var_1_19=50, var_1_1=-64, var_1_20=10, var_1_21=10000, var_1_22=-2, var_1_2=1, var_1_3=1, var_1_4=2, var_1_5=3, var_1_6=1/2, var_1_9=4] [L105] var_1_10 = __VERIFIER_nondet_uchar() [L106] CALL assume_abort_if_not(var_1_10 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_11=1000000000, var_1_12=256, var_1_13=16, var_1_14=64, var_1_15=63836, var_1_16=10, var_1_17=-8, var_1_18=8, var_1_19=50, var_1_1=-64, var_1_20=10, var_1_21=10000, var_1_22=-2, var_1_2=1, var_1_3=1, var_1_4=2, var_1_5=3, var_1_6=1/2, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=1000000000, var_1_12=256, var_1_13=16, var_1_14=64, var_1_15=63836, var_1_16=10, var_1_17=-8, var_1_18=8, var_1_19=50, var_1_1=-64, var_1_20=10, var_1_21=10000, var_1_22=-2, var_1_2=1, var_1_3=1, var_1_4=2, var_1_5=3, var_1_6=1/2, var_1_9=4] [L106] RET assume_abort_if_not(var_1_10 >= 0) VAL [isInitial=1, var_1_11=1000000000, var_1_12=256, var_1_13=16, var_1_14=64, var_1_15=63836, var_1_16=10, var_1_17=-8, var_1_18=8, var_1_19=50, var_1_1=-64, var_1_20=10, var_1_21=10000, var_1_22=-2, var_1_2=1, var_1_3=1, var_1_4=2, var_1_5=3, var_1_6=1/2, var_1_9=4] [L107] CALL assume_abort_if_not(var_1_10 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=16, var_1_14=64, var_1_15=63836, var_1_16=10, var_1_17=-8, var_1_18=8, var_1_19=50, var_1_1=-64, var_1_20=10, var_1_21=10000, var_1_22=-2, var_1_2=1, var_1_3=1, var_1_4=2, var_1_5=3, var_1_6=1/2, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=16, var_1_14=64, var_1_15=63836, var_1_16=10, var_1_17=-8, var_1_18=8, var_1_19=50, var_1_1=-64, var_1_20=10, var_1_21=10000, var_1_22=-2, var_1_2=1, var_1_3=1, var_1_4=2, var_1_5=3, var_1_6=1/2, var_1_9=4] [L107] RET assume_abort_if_not(var_1_10 <= 1) VAL [isInitial=1, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=16, var_1_14=64, var_1_15=63836, var_1_16=10, var_1_17=-8, var_1_18=8, var_1_19=50, var_1_1=-64, var_1_20=10, var_1_21=10000, var_1_22=-2, var_1_2=1, var_1_3=1, var_1_4=2, var_1_5=3, var_1_6=1/2, var_1_9=4] [L108] var_1_13 = __VERIFIER_nondet_short() [L109] CALL assume_abort_if_not(var_1_13 >= -1) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=-1, var_1_14=64, var_1_15=63836, var_1_16=10, var_1_17=-8, var_1_18=8, var_1_19=50, var_1_1=-64, var_1_20=10, var_1_21=10000, var_1_22=-2, var_1_2=1, var_1_3=1, var_1_4=2, var_1_5=3, var_1_6=1/2, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=-1, var_1_14=64, var_1_15=63836, var_1_16=10, var_1_17=-8, var_1_18=8, var_1_19=50, var_1_1=-64, var_1_20=10, var_1_21=10000, var_1_22=-2, var_1_2=1, var_1_3=1, var_1_4=2, var_1_5=3, var_1_6=1/2, var_1_9=4] [L109] RET assume_abort_if_not(var_1_13 >= -1) VAL [isInitial=1, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=-1, var_1_14=64, var_1_15=63836, var_1_16=10, var_1_17=-8, var_1_18=8, var_1_19=50, var_1_1=-64, var_1_20=10, var_1_21=10000, var_1_22=-2, var_1_2=1, var_1_3=1, var_1_4=2, var_1_5=3, var_1_6=1/2, var_1_9=4] [L110] CALL assume_abort_if_not(var_1_13 <= 32767) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=-1, var_1_14=64, var_1_15=63836, var_1_16=10, var_1_17=-8, var_1_18=8, var_1_19=50, var_1_1=-64, var_1_20=10, var_1_21=10000, var_1_22=-2, var_1_2=1, var_1_3=1, var_1_4=2, var_1_5=3, var_1_6=1/2, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=-1, var_1_14=64, var_1_15=63836, var_1_16=10, var_1_17=-8, var_1_18=8, var_1_19=50, var_1_1=-64, var_1_20=10, var_1_21=10000, var_1_22=-2, var_1_2=1, var_1_3=1, var_1_4=2, var_1_5=3, var_1_6=1/2, var_1_9=4] [L110] RET assume_abort_if_not(var_1_13 <= 32767) VAL [isInitial=1, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=-1, var_1_14=64, var_1_15=63836, var_1_16=10, var_1_17=-8, var_1_18=8, var_1_19=50, var_1_1=-64, var_1_20=10, var_1_21=10000, var_1_22=-2, var_1_2=1, var_1_3=1, var_1_4=2, var_1_5=3, var_1_6=1/2, var_1_9=4] [L111] var_1_14 = __VERIFIER_nondet_short() [L112] CALL assume_abort_if_not(var_1_14 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=-1, var_1_14=0, var_1_15=63836, var_1_16=10, var_1_17=-8, var_1_18=8, var_1_19=50, var_1_1=-64, var_1_20=10, var_1_21=10000, var_1_22=-2, var_1_2=1, var_1_3=1, var_1_4=2, var_1_5=3, var_1_6=1/2, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=-1, var_1_14=0, var_1_15=63836, var_1_16=10, var_1_17=-8, var_1_18=8, var_1_19=50, var_1_1=-64, var_1_20=10, var_1_21=10000, var_1_22=-2, var_1_2=1, var_1_3=1, var_1_4=2, var_1_5=3, var_1_6=1/2, var_1_9=4] [L112] RET assume_abort_if_not(var_1_14 >= 0) VAL [isInitial=1, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=-1, var_1_14=0, var_1_15=63836, var_1_16=10, var_1_17=-8, var_1_18=8, var_1_19=50, var_1_1=-64, var_1_20=10, var_1_21=10000, var_1_22=-2, var_1_2=1, var_1_3=1, var_1_4=2, var_1_5=3, var_1_6=1/2, var_1_9=4] [L113] CALL assume_abort_if_not(var_1_14 <= 32767) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=-1, var_1_14=0, var_1_15=63836, var_1_16=10, var_1_17=-8, var_1_18=8, var_1_19=50, var_1_1=-64, var_1_20=10, var_1_21=10000, var_1_22=-2, var_1_2=1, var_1_3=1, var_1_4=2, var_1_5=3, var_1_6=1/2, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=-1, var_1_14=0, var_1_15=63836, var_1_16=10, var_1_17=-8, var_1_18=8, var_1_19=50, var_1_1=-64, var_1_20=10, var_1_21=10000, var_1_22=-2, var_1_2=1, var_1_3=1, var_1_4=2, var_1_5=3, var_1_6=1/2, var_1_9=4] [L113] RET assume_abort_if_not(var_1_14 <= 32767) VAL [isInitial=1, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=-1, var_1_14=0, var_1_15=63836, var_1_16=10, var_1_17=-8, var_1_18=8, var_1_19=50, var_1_1=-64, var_1_20=10, var_1_21=10000, var_1_22=-2, var_1_2=1, var_1_3=1, var_1_4=2, var_1_5=3, var_1_6=1/2, var_1_9=4] [L114] var_1_15 = __VERIFIER_nondet_ushort() [L115] CALL assume_abort_if_not(var_1_15 >= 32767) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=-1, var_1_14=0, var_1_15=32767, var_1_16=10, var_1_17=-8, var_1_18=8, var_1_19=50, var_1_1=-64, var_1_20=10, var_1_21=10000, var_1_22=-2, var_1_2=1, var_1_3=1, var_1_4=2, var_1_5=3, var_1_6=1/2, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=-1, var_1_14=0, var_1_15=32767, var_1_16=10, var_1_17=-8, var_1_18=8, var_1_19=50, var_1_1=-64, var_1_20=10, var_1_21=10000, var_1_22=-2, var_1_2=1, var_1_3=1, var_1_4=2, var_1_5=3, var_1_6=1/2, var_1_9=4] [L115] RET assume_abort_if_not(var_1_15 >= 32767) VAL [isInitial=1, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=-1, var_1_14=0, var_1_15=32767, var_1_16=10, var_1_17=-8, var_1_18=8, var_1_19=50, var_1_1=-64, var_1_20=10, var_1_21=10000, var_1_22=-2, var_1_2=1, var_1_3=1, var_1_4=2, var_1_5=3, var_1_6=1/2, var_1_9=4] [L116] CALL assume_abort_if_not(var_1_15 <= 65534) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=-1, var_1_14=0, var_1_15=32767, var_1_16=10, var_1_17=-8, var_1_18=8, var_1_19=50, var_1_1=-64, var_1_20=10, var_1_21=10000, var_1_22=-2, var_1_2=1, var_1_3=1, var_1_4=2, var_1_5=3, var_1_6=1/2, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=-1, var_1_14=0, var_1_15=32767, var_1_16=10, var_1_17=-8, var_1_18=8, var_1_19=50, var_1_1=-64, var_1_20=10, var_1_21=10000, var_1_22=-2, var_1_2=1, var_1_3=1, var_1_4=2, var_1_5=3, var_1_6=1/2, var_1_9=4] [L116] RET assume_abort_if_not(var_1_15 <= 65534) VAL [isInitial=1, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=-1, var_1_14=0, var_1_15=32767, var_1_16=10, var_1_17=-8, var_1_18=8, var_1_19=50, var_1_1=-64, var_1_20=10, var_1_21=10000, var_1_22=-2, var_1_2=1, var_1_3=1, var_1_4=2, var_1_5=3, var_1_6=1/2, var_1_9=4] [L117] var_1_16 = __VERIFIER_nondet_ushort() [L118] CALL assume_abort_if_not(var_1_16 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=-1, var_1_14=0, var_1_15=32767, var_1_17=-8, var_1_18=8, var_1_19=50, var_1_1=-64, var_1_20=10, var_1_21=10000, var_1_22=-2, var_1_2=1, var_1_3=1, var_1_4=2, var_1_5=3, var_1_6=1/2, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=-1, var_1_14=0, var_1_15=32767, var_1_17=-8, var_1_18=8, var_1_19=50, var_1_1=-64, var_1_20=10, var_1_21=10000, var_1_22=-2, var_1_2=1, var_1_3=1, var_1_4=2, var_1_5=3, var_1_6=1/2, var_1_9=4] [L118] RET assume_abort_if_not(var_1_16 >= 0) VAL [isInitial=1, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=-1, var_1_14=0, var_1_15=32767, var_1_17=-8, var_1_18=8, var_1_19=50, var_1_1=-64, var_1_20=10, var_1_21=10000, var_1_22=-2, var_1_2=1, var_1_3=1, var_1_4=2, var_1_5=3, var_1_6=1/2, var_1_9=4] [L119] CALL assume_abort_if_not(var_1_16 <= 32767) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=-1, var_1_14=0, var_1_15=32767, var_1_16=32767, var_1_17=-8, var_1_18=8, var_1_19=50, var_1_1=-64, var_1_20=10, var_1_21=10000, var_1_22=-2, var_1_2=1, var_1_3=1, var_1_4=2, var_1_5=3, var_1_6=1/2, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=-1, var_1_14=0, var_1_15=32767, var_1_16=32767, var_1_17=-8, var_1_18=8, var_1_19=50, var_1_1=-64, var_1_20=10, var_1_21=10000, var_1_22=-2, var_1_2=1, var_1_3=1, var_1_4=2, var_1_5=3, var_1_6=1/2, var_1_9=4] [L119] RET assume_abort_if_not(var_1_16 <= 32767) VAL [isInitial=1, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=-1, var_1_14=0, var_1_15=32767, var_1_16=32767, var_1_17=-8, var_1_18=8, var_1_19=50, var_1_1=-64, var_1_20=10, var_1_21=10000, var_1_22=-2, var_1_2=1, var_1_3=1, var_1_4=2, var_1_5=3, var_1_6=1/2, var_1_9=4] [L120] var_1_18 = __VERIFIER_nondet_char() [L121] CALL assume_abort_if_not(var_1_18 >= -127) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=-1, var_1_14=0, var_1_15=32767, var_1_16=32767, var_1_17=-8, var_1_18=-127, var_1_19=50, var_1_1=-64, var_1_20=10, var_1_21=10000, var_1_22=-2, var_1_2=1, var_1_3=1, var_1_4=2, var_1_5=3, var_1_6=1/2, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=-1, var_1_14=0, var_1_15=32767, var_1_16=32767, var_1_17=-8, var_1_18=-127, var_1_19=50, var_1_1=-64, var_1_20=10, var_1_21=10000, var_1_22=-2, var_1_2=1, var_1_3=1, var_1_4=2, var_1_5=3, var_1_6=1/2, var_1_9=4] [L121] RET assume_abort_if_not(var_1_18 >= -127) VAL [isInitial=1, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=-1, var_1_14=0, var_1_15=32767, var_1_16=32767, var_1_17=-8, var_1_18=-127, var_1_19=50, var_1_1=-64, var_1_20=10, var_1_21=10000, var_1_22=-2, var_1_2=1, var_1_3=1, var_1_4=2, var_1_5=3, var_1_6=1/2, var_1_9=4] [L122] CALL assume_abort_if_not(var_1_18 <= 126) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=-1, var_1_14=0, var_1_15=32767, var_1_16=32767, var_1_17=-8, var_1_18=-127, var_1_19=50, var_1_1=-64, var_1_20=10, var_1_21=10000, var_1_22=-2, var_1_2=1, var_1_3=1, var_1_4=2, var_1_5=3, var_1_6=1/2, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=-1, var_1_14=0, var_1_15=32767, var_1_16=32767, var_1_17=-8, var_1_18=-127, var_1_19=50, var_1_1=-64, var_1_20=10, var_1_21=10000, var_1_22=-2, var_1_2=1, var_1_3=1, var_1_4=2, var_1_5=3, var_1_6=1/2, var_1_9=4] [L122] RET assume_abort_if_not(var_1_18 <= 126) VAL [isInitial=1, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=-1, var_1_14=0, var_1_15=32767, var_1_16=32767, var_1_17=-8, var_1_18=-127, var_1_19=50, var_1_1=-64, var_1_20=10, var_1_21=10000, var_1_22=-2, var_1_2=1, var_1_3=1, var_1_4=2, var_1_5=3, var_1_6=1/2, var_1_9=4] [L123] var_1_20 = __VERIFIER_nondet_short() [L124] CALL assume_abort_if_not(var_1_20 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=-1, var_1_14=0, var_1_15=32767, var_1_16=32767, var_1_17=-8, var_1_18=-127, var_1_19=50, var_1_1=-64, var_1_20=8292, var_1_21=10000, var_1_22=-2, var_1_2=1, var_1_3=1, var_1_4=2, var_1_5=3, var_1_6=1/2, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=-1, var_1_14=0, var_1_15=32767, var_1_16=32767, var_1_17=-8, var_1_18=-127, var_1_19=50, var_1_1=-64, var_1_20=8292, var_1_21=10000, var_1_22=-2, var_1_2=1, var_1_3=1, var_1_4=2, var_1_5=3, var_1_6=1/2, var_1_9=4] [L124] RET assume_abort_if_not(var_1_20 >= 0) VAL [isInitial=1, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=-1, var_1_14=0, var_1_15=32767, var_1_16=32767, var_1_17=-8, var_1_18=-127, var_1_19=50, var_1_1=-64, var_1_20=8292, var_1_21=10000, var_1_22=-2, var_1_2=1, var_1_3=1, var_1_4=2, var_1_5=3, var_1_6=1/2, var_1_9=4] [L125] CALL assume_abort_if_not(var_1_20 <= 16383) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=-1, var_1_14=0, var_1_15=32767, var_1_16=32767, var_1_17=-8, var_1_18=-127, var_1_19=50, var_1_1=-64, var_1_20=8292, var_1_21=10000, var_1_22=-2, var_1_2=1, var_1_3=1, var_1_4=2, var_1_5=3, var_1_6=1/2, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=-1, var_1_14=0, var_1_15=32767, var_1_16=32767, var_1_17=-8, var_1_18=-127, var_1_19=50, var_1_1=-64, var_1_20=8292, var_1_21=10000, var_1_22=-2, var_1_2=1, var_1_3=1, var_1_4=2, var_1_5=3, var_1_6=1/2, var_1_9=4] [L125] RET assume_abort_if_not(var_1_20 <= 16383) VAL [isInitial=1, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=-1, var_1_14=0, var_1_15=32767, var_1_16=32767, var_1_17=-8, var_1_18=-127, var_1_19=50, var_1_1=-64, var_1_20=8292, var_1_21=10000, var_1_22=-2, var_1_2=1, var_1_3=1, var_1_4=2, var_1_5=3, var_1_6=1/2, var_1_9=4] [L126] var_1_21 = __VERIFIER_nondet_short() [L127] CALL assume_abort_if_not(var_1_21 >= 8191) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=-1, var_1_14=0, var_1_15=32767, var_1_16=32767, var_1_17=-8, var_1_18=-127, var_1_19=50, var_1_1=-64, var_1_20=8292, var_1_21=8191, var_1_22=-2, var_1_2=1, var_1_3=1, var_1_4=2, var_1_5=3, var_1_6=1/2, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=-1, var_1_14=0, var_1_15=32767, var_1_16=32767, var_1_17=-8, var_1_18=-127, var_1_19=50, var_1_1=-64, var_1_20=8292, var_1_21=8191, var_1_22=-2, var_1_2=1, var_1_3=1, var_1_4=2, var_1_5=3, var_1_6=1/2, var_1_9=4] [L127] RET assume_abort_if_not(var_1_21 >= 8191) VAL [isInitial=1, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=-1, var_1_14=0, var_1_15=32767, var_1_16=32767, var_1_17=-8, var_1_18=-127, var_1_19=50, var_1_1=-64, var_1_20=8292, var_1_21=8191, var_1_22=-2, var_1_2=1, var_1_3=1, var_1_4=2, var_1_5=3, var_1_6=1/2, var_1_9=4] [L128] CALL assume_abort_if_not(var_1_21 <= 16383) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=-1, var_1_14=0, var_1_15=32767, var_1_16=32767, var_1_17=-8, var_1_18=-127, var_1_19=50, var_1_1=-64, var_1_20=8292, var_1_21=8191, var_1_22=-2, var_1_2=1, var_1_3=1, var_1_4=2, var_1_5=3, var_1_6=1/2, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=-1, var_1_14=0, var_1_15=32767, var_1_16=32767, var_1_17=-8, var_1_18=-127, var_1_19=50, var_1_1=-64, var_1_20=8292, var_1_21=8191, var_1_22=-2, var_1_2=1, var_1_3=1, var_1_4=2, var_1_5=3, var_1_6=1/2, var_1_9=4] [L128] RET assume_abort_if_not(var_1_21 <= 16383) VAL [isInitial=1, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=-1, var_1_14=0, var_1_15=32767, var_1_16=32767, var_1_17=-8, var_1_18=-127, var_1_19=50, var_1_1=-64, var_1_20=8292, var_1_21=8191, var_1_22=-2, var_1_2=1, var_1_3=1, var_1_4=2, var_1_5=3, var_1_6=1/2, var_1_9=4] [L141] RET updateVariables() [L142] CALL step() [L47] signed short int stepLocal_3 = var_1_3; VAL [isInitial=1, stepLocal_3=1, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=-1, var_1_14=0, var_1_15=32767, var_1_16=32767, var_1_17=-8, var_1_18=-127, var_1_19=50, var_1_1=-64, var_1_20=8292, var_1_21=8191, var_1_22=-2, var_1_2=1, var_1_3=1, var_1_4=2, var_1_5=3, var_1_6=1/2, var_1_9=4] [L48] EXPR (var_1_3 / var_1_4) & 8 VAL [isInitial=1, stepLocal_3=1, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=-1, var_1_14=0, var_1_15=32767, var_1_16=32767, var_1_17=-8, var_1_18=-127, var_1_19=50, var_1_1=-64, var_1_20=8292, var_1_21=8191, var_1_22=-2, var_1_2=1, var_1_3=1, var_1_4=2, var_1_5=3, var_1_6=1/2, var_1_9=4] [L48] signed long int stepLocal_2 = (var_1_3 / var_1_4) & 8; [L49] signed short int stepLocal_1 = var_1_3; [L50] signed long int stepLocal_0 = var_1_3 / ((((var_1_4) < (var_1_5)) ? (var_1_4) : (var_1_5))); VAL [isInitial=1, stepLocal_0=0, stepLocal_1=1, stepLocal_2=0, stepLocal_3=1, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=-1, var_1_14=0, var_1_15=32767, var_1_16=32767, var_1_17=-8, var_1_18=-127, var_1_19=50, var_1_1=-64, var_1_20=8292, var_1_21=8191, var_1_22=-2, var_1_2=1, var_1_3=1, var_1_4=2, var_1_5=3, var_1_6=1/2, var_1_9=4] [L51] COND FALSE !(var_1_2 <= stepLocal_2) VAL [isInitial=1, stepLocal_0=0, stepLocal_1=1, stepLocal_3=1, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=-1, var_1_14=0, var_1_15=32767, var_1_16=32767, var_1_17=-8, var_1_18=-127, var_1_19=50, var_1_1=-64, var_1_20=8292, var_1_21=8191, var_1_22=-2, var_1_2=1, var_1_3=1, var_1_4=2, var_1_5=3, var_1_6=1/2, var_1_9=4] [L60] COND TRUE stepLocal_1 <= var_1_2 [L61] var_1_1 = var_1_4 VAL [isInitial=1, stepLocal_0=0, stepLocal_3=1, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=-1, var_1_14=0, var_1_15=32767, var_1_16=32767, var_1_17=-8, var_1_18=-127, var_1_19=50, var_1_1=2, var_1_20=8292, var_1_21=8191, var_1_22=-2, var_1_2=1, var_1_3=1, var_1_4=2, var_1_5=3, var_1_6=1/2, var_1_9=4] [L66] COND TRUE var_1_2 <= var_1_3 [L67] var_1_6 = (var_1_7 + var_1_8) VAL [isInitial=1, stepLocal_0=0, stepLocal_3=1, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=-1, var_1_14=0, var_1_15=32767, var_1_16=32767, var_1_17=-8, var_1_18=-127, var_1_19=50, var_1_1=2, var_1_20=8292, var_1_21=8191, var_1_22=-2, var_1_2=1, var_1_3=1, var_1_4=2, var_1_5=3, var_1_9=4] [L69] COND FALSE !(\read(var_1_10)) VAL [isInitial=1, stepLocal_0=0, stepLocal_3=1, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=-1, var_1_14=0, var_1_15=32767, var_1_16=32767, var_1_17=-8, var_1_18=-127, var_1_19=50, var_1_1=2, var_1_20=8292, var_1_21=8191, var_1_22=-2, var_1_2=1, var_1_3=1, var_1_4=2, var_1_5=3, var_1_9=4] [L74] var_1_11 = (((((((2u) > ((3986216790u - var_1_9))) ? (2u) : ((3986216790u - var_1_9)))) < 0 ) ? -((((2u) > ((3986216790u - var_1_9))) ? (2u) : ((3986216790u - var_1_9)))) : ((((2u) > ((3986216790u - var_1_9))) ? (2u) : ((3986216790u - var_1_9)))))) VAL [isInitial=1, stepLocal_0=0, stepLocal_3=1, var_1_10=0, var_1_11=3986216786, var_1_12=256, var_1_13=-1, var_1_14=0, var_1_15=32767, var_1_16=32767, var_1_17=-8, var_1_18=-127, var_1_19=50, var_1_1=2, var_1_20=8292, var_1_21=8191, var_1_22=-2, var_1_2=1, var_1_3=1, var_1_4=2, var_1_5=3, var_1_9=4] [L75] COND TRUE (var_1_5 * (var_1_13 - var_1_14)) <= var_1_3 [L76] var_1_12 = (var_1_15 - ((((var_1_14) > (var_1_16)) ? (var_1_14) : (var_1_16)))) VAL [isInitial=1, stepLocal_0=0, stepLocal_3=1, var_1_10=0, var_1_11=3986216786, var_1_12=0, var_1_13=-1, var_1_14=0, var_1_15=32767, var_1_16=32767, var_1_17=-8, var_1_18=-127, var_1_19=50, var_1_1=2, var_1_20=8292, var_1_21=8191, var_1_22=-2, var_1_2=1, var_1_3=1, var_1_4=2, var_1_5=3, var_1_9=4] [L78] var_1_17 = var_1_18 VAL [isInitial=1, stepLocal_0=0, stepLocal_3=1, var_1_10=0, var_1_11=3986216786, var_1_12=0, var_1_13=-1, var_1_14=0, var_1_15=32767, var_1_16=32767, var_1_17=-127, var_1_18=-127, var_1_19=50, var_1_1=2, var_1_20=8292, var_1_21=8191, var_1_22=-2, var_1_2=1, var_1_3=1, var_1_4=2, var_1_5=3, var_1_9=4] [L79] COND TRUE var_1_13 <= var_1_12 [L80] var_1_19 = ((var_1_17 + 25) + (var_1_20 - (var_1_21 - 1))) VAL [isInitial=1, stepLocal_0=0, stepLocal_3=1, var_1_10=0, var_1_11=3986216786, var_1_12=0, var_1_13=-1, var_1_14=0, var_1_15=32767, var_1_16=32767, var_1_17=-127, var_1_18=-127, var_1_19=0, var_1_1=2, var_1_20=8292, var_1_21=8191, var_1_22=-2, var_1_2=1, var_1_3=1, var_1_4=2, var_1_5=3, var_1_9=4] [L84] var_1_22 = var_1_18 [L142] RET step() [L143] CALL, EXPR property() [L133] EXPR (var_1_3 / var_1_4) & 8 VAL [isInitial=1, var_1_10=0, var_1_11=3986216786, var_1_12=0, var_1_13=-1, var_1_14=0, var_1_15=32767, var_1_16=32767, var_1_17=-127, var_1_18=-127, var_1_19=0, var_1_1=2, var_1_20=8292, var_1_21=8191, var_1_22=-127, var_1_2=1, var_1_3=1, var_1_4=2, var_1_5=3, var_1_9=4] [L133-L134] return ((((((((var_1_2 <= ((var_1_3 / var_1_4) & 8)) ? ((-16 <= var_1_3) ? ((var_1_2 != (var_1_3 / ((((var_1_4) < (var_1_5)) ? (var_1_4) : (var_1_5))))) ? (var_1_1 == ((signed long int) ((((var_1_3) > (var_1_2)) ? (var_1_3) : (var_1_2))))) : (var_1_1 == ((signed long int) ((((var_1_2) < 0 ) ? -(var_1_2) : (var_1_2)))))) : 1) : ((var_1_3 <= var_1_2) ? (var_1_1 == ((signed long int) var_1_4)) : (var_1_1 == ((signed long int) var_1_3)))) && ((var_1_2 <= var_1_3) ? (var_1_6 == ((double) (var_1_7 + var_1_8))) : 1)) && (var_1_10 ? ((var_1_4 < (var_1_1 + var_1_5)) ? (var_1_9 == ((unsigned short int) 16)) : 1) : 1)) && (var_1_11 == ((unsigned long int) (((((((2u) > ((3986216790u - var_1_9))) ? (2u) : ((3986216790u - var_1_9)))) < 0 ) ? -((((2u) > ((3986216790u - var_1_9))) ? (2u) : ((3986216790u - var_1_9)))) : ((((2u) > ((3986216790u - var_1_9))) ? (2u) : ((3986216790u - var_1_9))))))))) && (((var_1_5 * (var_1_13 - var_1_14)) <= var_1_3) ? (var_1_12 == ((unsigned short int) (var_1_15 - ((((var_1_14) > (var_1_16)) ? (var_1_14) : (var_1_16)))))) : 1)) && (var_1_17 == ((signed char) var_1_18))) && ((var_1_13 <= var_1_12) ? (var_1_19 == ((signed short int) ((var_1_17 + 25) + (var_1_20 - (var_1_21 - 1))))) : (var_1_19 == ((signed short int) ((((((((var_1_18) < 0 ) ? -(var_1_18) : (var_1_18)))) > (var_1_17)) ? (((((var_1_18) < 0 ) ? -(var_1_18) : (var_1_18)))) : (var_1_17))))))) && (var_1_22 == ((signed char) var_1_18)) ; [L143] RET, EXPR property() [L143] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, var_1_10=0, var_1_11=3986216786, var_1_12=0, var_1_13=-1, var_1_14=0, var_1_15=32767, var_1_16=32767, var_1_17=-127, var_1_18=-127, var_1_19=0, var_1_1=2, var_1_20=8292, var_1_21=8191, var_1_22=-127, var_1_2=1, var_1_3=1, var_1_4=2, var_1_5=3, var_1_9=4] [L19] reach_error() VAL [isInitial=1, var_1_10=0, var_1_11=3986216786, var_1_12=0, var_1_13=-1, var_1_14=0, var_1_15=32767, var_1_16=32767, var_1_17=-127, var_1_18=-127, var_1_19=0, var_1_1=2, var_1_20=8292, var_1_21=8191, var_1_22=-127, var_1_2=1, var_1_3=1, var_1_4=2, var_1_5=3, var_1_9=4] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 74 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.4s, OverallIterations: 2, TraceHistogramMax: 28, 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, 108 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 0 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4 IncrementalHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 0 mSolverCounterUnsat, 108 mSDtfsCounter, 4 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 86 GetRequests, 86 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=74occurred 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.3s SatisfiabilityAnalysisTime, 0.3s InterpolantComputationTime, 513 NumberOfCodeBlocks, 513 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 170 ConstructedInterpolants, 0 QuantifiedInterpolants, 170 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 1512/1512 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-10-11 07:39:26,445 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-98.i -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/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 1aab861a420ae258d58e8cdb7baa3d890ad6a0a3ff243e7522ba05d5d977c664 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 07:39:28,233 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 07:39:28,296 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-10-11 07:39:28,301 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 07:39:28,301 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 07:39:28,327 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 07:39:28,327 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 07:39:28,328 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 07:39:28,329 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 07:39:28,330 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 07:39:28,330 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 07:39:28,330 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 07:39:28,331 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 07:39:28,331 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 07:39:28,331 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 07:39:28,331 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 07:39:28,332 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 07:39:28,332 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 07:39:28,334 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 07:39:28,334 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 07:39:28,334 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 07:39:28,335 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 07:39:28,335 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 07:39:28,335 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-11 07:39:28,335 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-11 07:39:28,335 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 07:39:28,336 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-11 07:39:28,336 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 07:39:28,336 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 07:39:28,336 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 07:39:28,336 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 07:39:28,337 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 07:39:28,337 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 07:39:28,337 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 07:39:28,337 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 07:39:28,337 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 07:39:28,337 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 07:39:28,337 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 07:39:28,338 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-11 07:39:28,338 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-11 07:39:28,338 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 07:39:28,340 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 07:39:28,340 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 07:39:28,340 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 07:39:28,340 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-11 07:39:28,341 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate-clean/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-clean/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 -> 1aab861a420ae258d58e8cdb7baa3d890ad6a0a3ff243e7522ba05d5d977c664 [2024-10-11 07:39:28,576 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 07:39:28,591 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 07:39:28,593 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 07:39:28,594 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 07:39:28,594 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 07:39:28,596 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-98.i [2024-10-11 07:39:29,867 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 07:39:30,058 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 07:39:30,059 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-98.i [2024-10-11 07:39:30,073 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/b25d856ea/4d98e30aca804a7e996325937dae2d7e/FLAGc7962bec4 [2024-10-11 07:39:30,087 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/b25d856ea/4d98e30aca804a7e996325937dae2d7e [2024-10-11 07:39:30,089 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 07:39:30,090 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 07:39:30,093 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 07:39:30,093 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 07:39:30,097 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 07:39:30,098 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 07:39:30" (1/1) ... [2024-10-11 07:39:30,100 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@62e60b82 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:39:30, skipping insertion in model container [2024-10-11 07:39:30,100 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 07:39:30" (1/1) ... [2024-10-11 07:39:30,124 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 07:39:30,275 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-98.i[917,930] [2024-10-11 07:39:30,340 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 07:39:30,354 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 07:39:30,365 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-98.i[917,930] [2024-10-11 07:39:30,388 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 07:39:30,406 INFO L204 MainTranslator]: Completed translation [2024-10-11 07:39:30,407 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:39:30 WrapperNode [2024-10-11 07:39:30,407 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 07:39:30,408 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 07:39:30,408 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 07:39:30,408 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 07:39:30,413 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:39:30" (1/1) ... [2024-10-11 07:39:30,420 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:39:30" (1/1) ... [2024-10-11 07:39:30,446 INFO L138 Inliner]: procedures = 27, calls = 41, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 151 [2024-10-11 07:39:30,446 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 07:39:30,447 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 07:39:30,447 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 07:39:30,447 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 07:39:30,457 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:39:30" (1/1) ... [2024-10-11 07:39:30,457 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:39:30" (1/1) ... [2024-10-11 07:39:30,466 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:39:30" (1/1) ... [2024-10-11 07:39:30,479 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-11 07:39:30,479 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:39:30" (1/1) ... [2024-10-11 07:39:30,480 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:39:30" (1/1) ... [2024-10-11 07:39:30,493 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:39:30" (1/1) ... [2024-10-11 07:39:30,500 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:39:30" (1/1) ... [2024-10-11 07:39:30,505 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:39:30" (1/1) ... [2024-10-11 07:39:30,510 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:39:30" (1/1) ... [2024-10-11 07:39:30,512 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 07:39:30,513 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 07:39:30,514 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 07:39:30,514 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 07:39:30,516 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:39:30" (1/1) ... [2024-10-11 07:39:30,520 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 07:39:30,528 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 07:39:30,540 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 07:39:30,542 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 07:39:30,571 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 07:39:30,571 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-11 07:39:30,571 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-11 07:39:30,571 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-11 07:39:30,571 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 07:39:30,572 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 07:39:30,637 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 07:39:30,639 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 07:39:31,405 INFO L? ?]: Removed 16 outVars from TransFormulas that were not future-live. [2024-10-11 07:39:31,407 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 07:39:31,468 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 07:39:31,468 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-11 07:39:31,469 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 07:39:31 BoogieIcfgContainer [2024-10-11 07:39:31,469 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 07:39:31,473 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 07:39:31,473 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 07:39:31,475 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 07:39:31,476 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 07:39:30" (1/3) ... [2024-10-11 07:39:31,476 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3844ffca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 07:39:31, skipping insertion in model container [2024-10-11 07:39:31,477 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:39:30" (2/3) ... [2024-10-11 07:39:31,477 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3844ffca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 07:39:31, skipping insertion in model container [2024-10-11 07:39:31,478 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 07:39:31" (3/3) ... [2024-10-11 07:39:31,479 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_codestructure_steplocals_file-98.i [2024-10-11 07:39:31,491 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 07:39:31,492 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 07:39:31,548 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 07:39:31,554 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;@37c7e196, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 07:39:31,554 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 07:39:31,558 INFO L276 IsEmpty]: Start isEmpty. Operand has 66 states, 35 states have (on average 1.4) internal successors, (49), 36 states have internal predecessors, (49), 28 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2024-10-11 07:39:31,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2024-10-11 07:39:31,569 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 07:39:31,570 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 07:39:31,570 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 07:39:31,574 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 07:39:31,575 INFO L85 PathProgramCache]: Analyzing trace with hash -20561520, now seen corresponding path program 1 times [2024-10-11 07:39:31,587 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 07:39:31,588 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [123881796] [2024-10-11 07:39:31,588 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 07:39:31,588 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 07:39:31,589 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 07:39:31,591 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 07:39:31,592 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-10-11 07:39:31,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:39:31,843 INFO L255 TraceCheckSpWp]: Trace formula consists of 266 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-11 07:39:31,851 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 07:39:31,895 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 774 proven. 0 refuted. 0 times theorem prover too weak. 738 trivial. 0 not checked. [2024-10-11 07:39:31,895 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 07:39:31,895 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 07:39:31,895 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [123881796] [2024-10-11 07:39:31,896 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [123881796] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 07:39:31,896 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 07:39:31,896 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 07:39:31,899 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1991672409] [2024-10-11 07:39:31,900 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 07:39:31,904 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-11 07:39:31,906 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 07:39:31,920 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-11 07:39:31,921 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 07:39:31,923 INFO L87 Difference]: Start difference. First operand has 66 states, 35 states have (on average 1.4) internal successors, (49), 36 states have internal predecessors, (49), 28 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) Second operand has 2 states, 2 states have (on average 17.0) internal successors, (34), 2 states have internal predecessors, (34), 2 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) [2024-10-11 07:39:32,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 07:39:32,177 INFO L93 Difference]: Finished difference Result 129 states and 236 transitions. [2024-10-11 07:39:32,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-11 07:39:32,194 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 17.0) internal successors, (34), 2 states have internal predecessors, (34), 2 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) Word has length 167 [2024-10-11 07:39:32,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 07:39:32,199 INFO L225 Difference]: With dead ends: 129 [2024-10-11 07:39:32,199 INFO L226 Difference]: Without dead ends: 64 [2024-10-11 07:39:32,202 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 166 GetRequests, 166 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 07:39:32,204 INFO L432 NwaCegarLoop]: 97 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 97 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 07:39:32,205 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 97 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 07:39:32,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2024-10-11 07:39:32,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2024-10-11 07:39:32,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 34 states have (on average 1.2941176470588236) internal successors, (44), 34 states have internal predecessors, (44), 28 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2024-10-11 07:39:32,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 100 transitions. [2024-10-11 07:39:32,240 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 100 transitions. Word has length 167 [2024-10-11 07:39:32,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 07:39:32,241 INFO L471 AbstractCegarLoop]: Abstraction has 64 states and 100 transitions. [2024-10-11 07:39:32,243 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 17.0) internal successors, (34), 2 states have internal predecessors, (34), 2 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) [2024-10-11 07:39:32,243 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 100 transitions. [2024-10-11 07:39:32,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2024-10-11 07:39:32,247 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 07:39:32,247 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 07:39:32,260 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-10-11 07:39:32,448 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 07:39:32,449 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 07:39:32,449 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 07:39:32,449 INFO L85 PathProgramCache]: Analyzing trace with hash -750088808, now seen corresponding path program 1 times [2024-10-11 07:39:32,450 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 07:39:32,450 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1714541548] [2024-10-11 07:39:32,450 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 07:39:32,450 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 07:39:32,450 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 07:39:32,453 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 07:39:32,454 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-10-11 07:39:32,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:39:32,821 INFO L255 TraceCheckSpWp]: Trace formula consists of 266 conjuncts, 23 conjuncts are in the unsatisfiable core [2024-10-11 07:39:32,829 INFO L278 TraceCheckSpWp]: Computing forward predicates...