./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-52.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 023d838f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-52.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 19096ca86d86acc30d8aed0bf6308f75bb4310aad7abc911bc202c5b0fcfab1c --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 06:54:03,921 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 06:54:03,984 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-10 06:54:03,991 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 06:54:03,995 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 06:54:04,048 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 06:54:04,049 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 06:54:04,049 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 06:54:04,049 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 06:54:04,053 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 06:54:04,053 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 06:54:04,054 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 06:54:04,054 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 06:54:04,054 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 06:54:04,055 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 06:54:04,055 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 06:54:04,055 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-10 06:54:04,055 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-10 06:54:04,056 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-10 06:54:04,056 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-10 06:54:04,056 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 06:54:04,057 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-10 06:54:04,057 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 06:54:04,057 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-10 06:54:04,057 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 06:54:04,058 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-10 06:54:04,058 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-10 06:54:04,058 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 06:54:04,058 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 06:54:04,059 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 06:54:04,059 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 06:54:04,059 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 06:54:04,059 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 06:54:04,060 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 06:54:04,060 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 06:54:04,060 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-10 06:54:04,060 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-10 06:54:04,060 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-10 06:54:04,061 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 06:54:04,061 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 06:54:04,061 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 06:54:04,062 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 06:54:04,062 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 19096ca86d86acc30d8aed0bf6308f75bb4310aad7abc911bc202c5b0fcfab1c [2024-11-10 06:54:04,231 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 06:54:04,247 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 06:54:04,249 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 06:54:04,250 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 06:54:04,250 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 06:54:04,251 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-52.i [2024-11-10 06:54:05,561 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 06:54:05,749 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 06:54:05,750 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-52.i [2024-11-10 06:54:05,760 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/15e0b511e/a50adf2785dd42fdac2a5a4dc5ef6778/FLAG819035702 [2024-11-10 06:54:05,775 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/15e0b511e/a50adf2785dd42fdac2a5a4dc5ef6778 [2024-11-10 06:54:05,778 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 06:54:05,779 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 06:54:05,781 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 06:54:05,781 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 06:54:05,785 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 06:54:05,786 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 06:54:05" (1/1) ... [2024-11-10 06:54:05,787 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@742148a6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:54:05, skipping insertion in model container [2024-11-10 06:54:05,787 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 06:54:05" (1/1) ... [2024-11-10 06:54:05,810 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 06:54:05,996 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-52.i[916,929] [2024-11-10 06:54:06,037 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 06:54:06,054 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 06:54:06,076 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-52.i[916,929] [2024-11-10 06:54:06,101 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 06:54:06,122 INFO L204 MainTranslator]: Completed translation [2024-11-10 06:54:06,123 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:54:06 WrapperNode [2024-11-10 06:54:06,123 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 06:54:06,124 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 06:54:06,124 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 06:54:06,124 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 06:54:06,130 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:54:06" (1/1) ... [2024-11-10 06:54:06,143 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:54:06" (1/1) ... [2024-11-10 06:54:06,178 INFO L138 Inliner]: procedures = 26, calls = 35, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 147 [2024-11-10 06:54:06,178 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 06:54:06,179 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 06:54:06,179 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 06:54:06,183 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 06:54:06,193 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:54:06" (1/1) ... [2024-11-10 06:54:06,194 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:54:06" (1/1) ... [2024-11-10 06:54:06,201 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:54:06" (1/1) ... [2024-11-10 06:54:06,220 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-10 06:54:06,224 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:54:06" (1/1) ... [2024-11-10 06:54:06,224 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:54:06" (1/1) ... [2024-11-10 06:54:06,231 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:54:06" (1/1) ... [2024-11-10 06:54:06,232 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:54:06" (1/1) ... [2024-11-10 06:54:06,233 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:54:06" (1/1) ... [2024-11-10 06:54:06,234 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:54:06" (1/1) ... [2024-11-10 06:54:06,239 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 06:54:06,239 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 06:54:06,240 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 06:54:06,240 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 06:54:06,240 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:54:06" (1/1) ... [2024-11-10 06:54:06,250 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 06:54:06,258 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 06:54:06,274 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-10 06:54:06,293 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-10 06:54:06,329 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 06:54:06,330 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-10 06:54:06,330 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-10 06:54:06,330 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-10 06:54:06,330 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 06:54:06,330 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 06:54:06,396 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 06:54:06,399 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 06:54:06,595 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L102: havoc property_#t~ite17#1;havoc property_#t~bitwise16#1;havoc property_#t~short18#1; [2024-11-10 06:54:06,617 INFO L? ?]: Removed 13 outVars from TransFormulas that were not future-live. [2024-11-10 06:54:06,617 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 06:54:06,636 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 06:54:06,636 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 06:54:06,637 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 06:54:06 BoogieIcfgContainer [2024-11-10 06:54:06,637 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 06:54:06,640 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 06:54:06,640 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 06:54:06,644 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 06:54:06,644 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 06:54:05" (1/3) ... [2024-11-10 06:54:06,645 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1a0c3f4f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 06:54:06, skipping insertion in model container [2024-11-10 06:54:06,646 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:54:06" (2/3) ... [2024-11-10 06:54:06,646 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1a0c3f4f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 06:54:06, skipping insertion in model container [2024-11-10 06:54:06,646 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 06:54:06" (3/3) ... [2024-11-10 06:54:06,647 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_floatingpointinfluence_no-floats_file-52.i [2024-11-10 06:54:06,662 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 06:54:06,663 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-10 06:54:06,721 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 06:54:06,728 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;@33f4ef8e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 06:54:06,728 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-10 06:54:06,732 INFO L276 IsEmpty]: Start isEmpty. Operand has 70 states, 45 states have (on average 1.3333333333333333) internal successors, (60), 46 states have internal predecessors, (60), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2024-11-10 06:54:06,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2024-11-10 06:54:06,742 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 06:54:06,743 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 06:54:06,743 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 06:54:06,748 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 06:54:06,748 INFO L85 PathProgramCache]: Analyzing trace with hash 1290878830, now seen corresponding path program 1 times [2024-11-10 06:54:06,756 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 06:54:06,756 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1078731285] [2024-11-10 06:54:06,756 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 06:54:06,757 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 06:54:06,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:54:06,959 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 06:54:06,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:54:06,970 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 06:54:06,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:54:06,980 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 06:54:06,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:54:06,987 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 06:54:06,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:54:06,997 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 06:54:06,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:54:07,001 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 06:54:07,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:54:07,006 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 06:54:07,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:54:07,011 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-10 06:54:07,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:54:07,021 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-10 06:54:07,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:54:07,026 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-10 06:54:07,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:54:07,032 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-10 06:54:07,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:54:07,036 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 06:54:07,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:54:07,040 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 06:54:07,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:54:07,043 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-10 06:54:07,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:54:07,047 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-10 06:54:07,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:54:07,050 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-10 06:54:07,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:54:07,054 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-10 06:54:07,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:54:07,057 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-10 06:54:07,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:54:07,061 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-10 06:54:07,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:54:07,064 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-10 06:54:07,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:54:07,068 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-10 06:54:07,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:54:07,071 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-10 06:54:07,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:54:07,078 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2024-11-10 06:54:07,080 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 06:54:07,081 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1078731285] [2024-11-10 06:54:07,082 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1078731285] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 06:54:07,082 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 06:54:07,082 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 06:54:07,083 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1454687718] [2024-11-10 06:54:07,085 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 06:54:07,089 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-10 06:54:07,090 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 06:54:07,116 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-10 06:54:07,117 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 06:54:07,119 INFO L87 Difference]: Start difference. First operand has 70 states, 45 states have (on average 1.3333333333333333) internal successors, (60), 46 states have internal predecessors, (60), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) Second operand has 2 states, 2 states have (on average 15.5) internal successors, (31), 2 states have internal predecessors, (31), 2 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 2 states have call successors, (22) [2024-11-10 06:54:07,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 06:54:07,148 INFO L93 Difference]: Finished difference Result 132 states and 223 transitions. [2024-11-10 06:54:07,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-10 06:54:07,151 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 15.5) internal successors, (31), 2 states have internal predecessors, (31), 2 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 2 states have call successors, (22) Word has length 138 [2024-11-10 06:54:07,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 06:54:07,161 INFO L225 Difference]: With dead ends: 132 [2024-11-10 06:54:07,161 INFO L226 Difference]: Without dead ends: 65 [2024-11-10 06:54:07,165 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 06:54:07,169 INFO L432 NwaCegarLoop]: 94 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 94 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 06:54:07,170 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 94 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 06:54:07,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2024-11-10 06:54:07,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2024-11-10 06:54:07,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 41 states have (on average 1.2682926829268293) internal successors, (52), 41 states have internal predecessors, (52), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2024-11-10 06:54:07,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 96 transitions. [2024-11-10 06:54:07,212 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 96 transitions. Word has length 138 [2024-11-10 06:54:07,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 06:54:07,213 INFO L471 AbstractCegarLoop]: Abstraction has 65 states and 96 transitions. [2024-11-10 06:54:07,213 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 15.5) internal successors, (31), 2 states have internal predecessors, (31), 2 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 2 states have call successors, (22) [2024-11-10 06:54:07,213 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 96 transitions. [2024-11-10 06:54:07,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2024-11-10 06:54:07,216 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 06:54:07,216 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 06:54:07,216 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-10 06:54:07,216 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 06:54:07,217 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 06:54:07,217 INFO L85 PathProgramCache]: Analyzing trace with hash 1962685454, now seen corresponding path program 1 times [2024-11-10 06:54:07,217 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 06:54:07,217 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [97253087] [2024-11-10 06:54:07,217 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 06:54:07,218 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 06:54:07,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 06:54:07,487 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 06:54:07,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 06:54:07,602 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 06:54:07,602 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-10 06:54:07,603 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-10 06:54:07,605 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-10 06:54:07,607 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1] [2024-11-10 06:54:07,686 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-10 06:54:07,688 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.11 06:54:07 BoogieIcfgContainer [2024-11-10 06:54:07,689 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-10 06:54:07,689 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-10 06:54:07,689 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-10 06:54:07,689 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-10 06:54:07,691 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 06:54:06" (3/4) ... [2024-11-10 06:54:07,693 INFO L146 WitnessPrinter]: No result that supports witness generation found [2024-11-10 06:54:07,694 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-10 06:54:07,696 INFO L158 Benchmark]: Toolchain (without parser) took 1917.52ms. Allocated memory was 134.2MB in the beginning and 241.2MB in the end (delta: 107.0MB). Free memory was 65.4MB in the beginning and 175.2MB in the end (delta: -109.7MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 06:54:07,698 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 134.2MB. Free memory was 100.5MB in the beginning and 100.5MB in the end (delta: 37.6kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 06:54:07,699 INFO L158 Benchmark]: CACSL2BoogieTranslator took 342.72ms. Allocated memory was 134.2MB in the beginning and 241.2MB in the end (delta: 107.0MB). Free memory was 65.3MB in the beginning and 205.8MB in the end (delta: -140.6MB). Peak memory consumption was 11.9MB. Max. memory is 16.1GB. [2024-11-10 06:54:07,699 INFO L158 Benchmark]: Boogie Procedure Inliner took 54.30ms. Allocated memory is still 241.2MB. Free memory was 205.8MB in the beginning and 203.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-10 06:54:07,700 INFO L158 Benchmark]: Boogie Preprocessor took 60.05ms. Allocated memory is still 241.2MB. Free memory was 203.7MB in the beginning and 201.6MB in the end (delta: 2.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-10 06:54:07,700 INFO L158 Benchmark]: IcfgBuilder took 397.64ms. Allocated memory is still 241.2MB. Free memory was 200.6MB in the beginning and 181.7MB in the end (delta: 18.9MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-11-10 06:54:07,701 INFO L158 Benchmark]: TraceAbstraction took 1049.17ms. Allocated memory is still 241.2MB. Free memory was 181.7MB in the beginning and 176.2MB in the end (delta: 5.5MB). Peak memory consumption was 4.4MB. Max. memory is 16.1GB. [2024-11-10 06:54:07,701 INFO L158 Benchmark]: Witness Printer took 4.66ms. Allocated memory is still 241.2MB. Free memory is still 175.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 06:54:07,706 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15ms. Allocated memory is still 134.2MB. Free memory was 100.5MB in the beginning and 100.5MB in the end (delta: 37.6kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 342.72ms. Allocated memory was 134.2MB in the beginning and 241.2MB in the end (delta: 107.0MB). Free memory was 65.3MB in the beginning and 205.8MB in the end (delta: -140.6MB). Peak memory consumption was 11.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 54.30ms. Allocated memory is still 241.2MB. Free memory was 205.8MB in the beginning and 203.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 60.05ms. Allocated memory is still 241.2MB. Free memory was 203.7MB in the beginning and 201.6MB in the end (delta: 2.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * IcfgBuilder took 397.64ms. Allocated memory is still 241.2MB. Free memory was 200.6MB in the beginning and 181.7MB in the end (delta: 18.9MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * TraceAbstraction took 1049.17ms. Allocated memory is still 241.2MB. Free memory was 181.7MB in the beginning and 176.2MB in the end (delta: 5.5MB). Peak memory consumption was 4.4MB. Max. memory is 16.1GB. * Witness Printer took 4.66ms. Allocated memory is still 241.2MB. Free memory is still 175.2MB. 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 102. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed short int var_1_1 = -4; [L23] signed short int var_1_3 = 32; [L24] signed short int var_1_4 = -1; [L25] unsigned char var_1_5 = 1; [L26] unsigned char var_1_6 = 0; [L27] unsigned char var_1_7 = 0; [L28] unsigned char var_1_8 = 1; [L29] unsigned char var_1_9 = 0; [L30] signed long int var_1_10 = 25; [L31] signed long int var_1_11 = 256; [L32] signed long int var_1_12 = 0; [L33] signed long int var_1_13 = 31; [L34] signed long int var_1_14 = 256; [L35] unsigned long int var_1_15 = 8; [L36] unsigned char var_1_16 = 16; VAL [isInitial=0, var_1_10=25, var_1_11=256, var_1_12=0, var_1_13=31, var_1_14=256, var_1_15=8, var_1_16=16, var_1_1=-4, var_1_3=32, var_1_4=-1, var_1_5=1, var_1_6=0, var_1_7=0, var_1_8=1, var_1_9=0] [L106] isInitial = 1 [L107] FCALL initially() [L108] COND TRUE 1 [L109] FCALL updateLastVariables() [L110] CALL updateVariables() [L65] var_1_3 = __VERIFIER_nondet_short() [L66] CALL assume_abort_if_not(var_1_3 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=25, var_1_11=256, var_1_12=0, var_1_13=31, var_1_14=256, var_1_15=8, var_1_16=16, var_1_1=-4, var_1_3=2016, var_1_4=-1, var_1_5=1, var_1_6=0, var_1_7=0, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=25, var_1_11=256, var_1_12=0, var_1_13=31, var_1_14=256, var_1_15=8, var_1_16=16, var_1_1=-4, var_1_3=2016, var_1_4=-1, var_1_5=1, var_1_6=0, var_1_7=0, var_1_8=1, var_1_9=0] [L66] RET assume_abort_if_not(var_1_3 >= 0) VAL [isInitial=1, var_1_10=25, var_1_11=256, var_1_12=0, var_1_13=31, var_1_14=256, var_1_15=8, var_1_16=16, var_1_1=-4, var_1_3=2016, var_1_4=-1, var_1_5=1, var_1_6=0, var_1_7=0, var_1_8=1, var_1_9=0] [L67] CALL assume_abort_if_not(var_1_3 <= 32766) VAL [\old(cond)=1, isInitial=1, var_1_10=25, var_1_11=256, var_1_12=0, var_1_13=31, var_1_14=256, var_1_15=8, var_1_16=16, var_1_1=-4, var_1_3=2016, var_1_4=-1, var_1_5=1, var_1_6=0, var_1_7=0, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=25, var_1_11=256, var_1_12=0, var_1_13=31, var_1_14=256, var_1_15=8, var_1_16=16, var_1_1=-4, var_1_3=2016, var_1_4=-1, var_1_5=1, var_1_6=0, var_1_7=0, var_1_8=1, var_1_9=0] [L67] RET assume_abort_if_not(var_1_3 <= 32766) VAL [isInitial=1, var_1_10=25, var_1_11=256, var_1_12=0, var_1_13=31, var_1_14=256, var_1_15=8, var_1_16=16, var_1_1=-4, var_1_3=2016, var_1_4=-1, var_1_5=1, var_1_6=0, var_1_7=0, var_1_8=1, var_1_9=0] [L68] var_1_4 = __VERIFIER_nondet_short() [L69] CALL assume_abort_if_not(var_1_4 >= -16383) VAL [\old(cond)=1, isInitial=1, var_1_10=25, var_1_11=256, var_1_12=0, var_1_13=31, var_1_14=256, var_1_15=8, var_1_16=16, var_1_1=-4, var_1_3=2016, var_1_4=-16129, var_1_5=1, var_1_6=0, var_1_7=0, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=25, var_1_11=256, var_1_12=0, var_1_13=31, var_1_14=256, var_1_15=8, var_1_16=16, var_1_1=-4, var_1_3=2016, var_1_4=-16129, var_1_5=1, var_1_6=0, var_1_7=0, var_1_8=1, var_1_9=0] [L69] RET assume_abort_if_not(var_1_4 >= -16383) VAL [isInitial=1, var_1_10=25, var_1_11=256, var_1_12=0, var_1_13=31, var_1_14=256, var_1_15=8, var_1_16=16, var_1_1=-4, var_1_3=2016, var_1_4=-16129, var_1_5=1, var_1_6=0, var_1_7=0, var_1_8=1, var_1_9=0] [L70] CALL assume_abort_if_not(var_1_4 <= 16383) VAL [\old(cond)=1, isInitial=1, var_1_10=25, var_1_11=256, var_1_12=0, var_1_13=31, var_1_14=256, var_1_15=8, var_1_16=16, var_1_1=-4, var_1_3=2016, var_1_4=-16129, var_1_5=1, var_1_6=0, var_1_7=0, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=25, var_1_11=256, var_1_12=0, var_1_13=31, var_1_14=256, var_1_15=8, var_1_16=16, var_1_1=-4, var_1_3=2016, var_1_4=-16129, var_1_5=1, var_1_6=0, var_1_7=0, var_1_8=1, var_1_9=0] [L70] RET assume_abort_if_not(var_1_4 <= 16383) VAL [isInitial=1, var_1_10=25, var_1_11=256, var_1_12=0, var_1_13=31, var_1_14=256, var_1_15=8, var_1_16=16, var_1_1=-4, var_1_3=2016, var_1_4=-16129, var_1_5=1, var_1_6=0, var_1_7=0, var_1_8=1, var_1_9=0] [L71] var_1_6 = __VERIFIER_nondet_uchar() [L72] CALL assume_abort_if_not(var_1_6 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=25, var_1_11=256, var_1_12=0, var_1_13=31, var_1_14=256, var_1_15=8, var_1_16=16, var_1_1=-4, var_1_3=2016, var_1_4=-16129, var_1_5=1, var_1_7=0, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=25, var_1_11=256, var_1_12=0, var_1_13=31, var_1_14=256, var_1_15=8, var_1_16=16, var_1_1=-4, var_1_3=2016, var_1_4=-16129, var_1_5=1, var_1_7=0, var_1_8=1, var_1_9=0] [L72] RET assume_abort_if_not(var_1_6 >= 0) VAL [isInitial=1, var_1_10=25, var_1_11=256, var_1_12=0, var_1_13=31, var_1_14=256, var_1_15=8, var_1_16=16, var_1_1=-4, var_1_3=2016, var_1_4=-16129, var_1_5=1, var_1_7=0, var_1_8=1, var_1_9=0] [L73] CALL assume_abort_if_not(var_1_6 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=25, var_1_11=256, var_1_12=0, var_1_13=31, var_1_14=256, var_1_15=8, var_1_16=16, var_1_1=-4, var_1_3=2016, var_1_4=-16129, var_1_5=1, var_1_6=1, var_1_7=0, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=25, var_1_11=256, var_1_12=0, var_1_13=31, var_1_14=256, var_1_15=8, var_1_16=16, var_1_1=-4, var_1_3=2016, var_1_4=-16129, var_1_5=1, var_1_6=1, var_1_7=0, var_1_8=1, var_1_9=0] [L73] RET assume_abort_if_not(var_1_6 <= 1) VAL [isInitial=1, var_1_10=25, var_1_11=256, var_1_12=0, var_1_13=31, var_1_14=256, var_1_15=8, var_1_16=16, var_1_1=-4, var_1_3=2016, var_1_4=-16129, var_1_5=1, var_1_6=1, var_1_7=0, var_1_8=1, var_1_9=0] [L74] var_1_7 = __VERIFIER_nondet_uchar() [L75] CALL assume_abort_if_not(var_1_7 >= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=25, var_1_11=256, var_1_12=0, var_1_13=31, var_1_14=256, var_1_15=8, var_1_16=16, var_1_1=-4, var_1_3=2016, var_1_4=-16129, var_1_5=1, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=25, var_1_11=256, var_1_12=0, var_1_13=31, var_1_14=256, var_1_15=8, var_1_16=16, var_1_1=-4, var_1_3=2016, var_1_4=-16129, var_1_5=1, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=0] [L75] RET assume_abort_if_not(var_1_7 >= 1) VAL [isInitial=1, var_1_10=25, var_1_11=256, var_1_12=0, var_1_13=31, var_1_14=256, var_1_15=8, var_1_16=16, var_1_1=-4, var_1_3=2016, var_1_4=-16129, var_1_5=1, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=0] [L76] CALL assume_abort_if_not(var_1_7 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=25, var_1_11=256, var_1_12=0, var_1_13=31, var_1_14=256, var_1_15=8, var_1_16=16, var_1_1=-4, var_1_3=2016, var_1_4=-16129, var_1_5=1, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=25, var_1_11=256, var_1_12=0, var_1_13=31, var_1_14=256, var_1_15=8, var_1_16=16, var_1_1=-4, var_1_3=2016, var_1_4=-16129, var_1_5=1, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=0] [L76] RET assume_abort_if_not(var_1_7 <= 1) VAL [isInitial=1, var_1_10=25, var_1_11=256, var_1_12=0, var_1_13=31, var_1_14=256, var_1_15=8, var_1_16=16, var_1_1=-4, var_1_3=2016, var_1_4=-16129, var_1_5=1, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=0] [L77] var_1_8 = __VERIFIER_nondet_uchar() [L78] CALL assume_abort_if_not(var_1_8 >= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=25, var_1_11=256, var_1_12=0, var_1_13=31, var_1_14=256, var_1_15=8, var_1_16=16, var_1_1=-4, var_1_3=2016, var_1_4=-16129, var_1_5=1, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=25, var_1_11=256, var_1_12=0, var_1_13=31, var_1_14=256, var_1_15=8, var_1_16=16, var_1_1=-4, var_1_3=2016, var_1_4=-16129, var_1_5=1, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=0] [L78] RET assume_abort_if_not(var_1_8 >= 1) VAL [isInitial=1, var_1_10=25, var_1_11=256, var_1_12=0, var_1_13=31, var_1_14=256, var_1_15=8, var_1_16=16, var_1_1=-4, var_1_3=2016, var_1_4=-16129, var_1_5=1, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=0] [L79] CALL assume_abort_if_not(var_1_8 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=25, var_1_11=256, var_1_12=0, var_1_13=31, var_1_14=256, var_1_15=8, var_1_16=16, var_1_1=-4, var_1_3=2016, var_1_4=-16129, var_1_5=1, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=25, var_1_11=256, var_1_12=0, var_1_13=31, var_1_14=256, var_1_15=8, var_1_16=16, var_1_1=-4, var_1_3=2016, var_1_4=-16129, var_1_5=1, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=0] [L79] RET assume_abort_if_not(var_1_8 <= 1) VAL [isInitial=1, var_1_10=25, var_1_11=256, var_1_12=0, var_1_13=31, var_1_14=256, var_1_15=8, var_1_16=16, var_1_1=-4, var_1_3=2016, var_1_4=-16129, var_1_5=1, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=0] [L80] var_1_9 = __VERIFIER_nondet_uchar() [L81] CALL assume_abort_if_not(var_1_9 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=25, var_1_11=256, var_1_12=0, var_1_13=31, var_1_14=256, var_1_15=8, var_1_16=16, var_1_1=-4, var_1_3=2016, var_1_4=-16129, var_1_5=1, var_1_6=1, var_1_7=1, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=25, var_1_11=256, var_1_12=0, var_1_13=31, var_1_14=256, var_1_15=8, var_1_16=16, var_1_1=-4, var_1_3=2016, var_1_4=-16129, var_1_5=1, var_1_6=1, var_1_7=1, var_1_8=1] [L81] RET assume_abort_if_not(var_1_9 >= 0) VAL [isInitial=1, var_1_10=25, var_1_11=256, var_1_12=0, var_1_13=31, var_1_14=256, var_1_15=8, var_1_16=16, var_1_1=-4, var_1_3=2016, var_1_4=-16129, var_1_5=1, var_1_6=1, var_1_7=1, var_1_8=1] [L82] CALL assume_abort_if_not(var_1_9 <= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=25, var_1_11=256, var_1_12=0, var_1_13=31, var_1_14=256, var_1_15=8, var_1_16=16, var_1_1=-4, var_1_3=2016, var_1_4=-16129, var_1_5=1, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=25, var_1_11=256, var_1_12=0, var_1_13=31, var_1_14=256, var_1_15=8, var_1_16=16, var_1_1=-4, var_1_3=2016, var_1_4=-16129, var_1_5=1, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=0] [L82] RET assume_abort_if_not(var_1_9 <= 0) VAL [isInitial=1, var_1_10=25, var_1_11=256, var_1_12=0, var_1_13=31, var_1_14=256, var_1_15=8, var_1_16=16, var_1_1=-4, var_1_3=2016, var_1_4=-16129, var_1_5=1, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=0] [L83] var_1_11 = __VERIFIER_nondet_long() [L84] CALL assume_abort_if_not(var_1_11 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=25, var_1_11=0, var_1_12=0, var_1_13=31, var_1_14=256, var_1_15=8, var_1_16=16, var_1_1=-4, var_1_3=2016, var_1_4=-16129, var_1_5=1, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=25, var_1_11=0, var_1_12=0, var_1_13=31, var_1_14=256, var_1_15=8, var_1_16=16, var_1_1=-4, var_1_3=2016, var_1_4=-16129, var_1_5=1, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=0] [L84] RET assume_abort_if_not(var_1_11 >= 0) VAL [isInitial=1, var_1_10=25, var_1_11=0, var_1_12=0, var_1_13=31, var_1_14=256, var_1_15=8, var_1_16=16, var_1_1=-4, var_1_3=2016, var_1_4=-16129, var_1_5=1, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=0] [L85] CALL assume_abort_if_not(var_1_11 <= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_10=25, var_1_11=0, var_1_12=0, var_1_13=31, var_1_14=256, var_1_15=8, var_1_16=16, var_1_1=-4, var_1_3=2016, var_1_4=-16129, var_1_5=1, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=25, var_1_11=0, var_1_12=0, var_1_13=31, var_1_14=256, var_1_15=8, var_1_16=16, var_1_1=-4, var_1_3=2016, var_1_4=-16129, var_1_5=1, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=0] [L85] RET assume_abort_if_not(var_1_11 <= 2147483647) VAL [isInitial=1, var_1_10=25, var_1_11=0, var_1_12=0, var_1_13=31, var_1_14=256, var_1_15=8, var_1_16=16, var_1_1=-4, var_1_3=2016, var_1_4=-16129, var_1_5=1, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=0] [L86] var_1_12 = __VERIFIER_nondet_long() [L87] CALL assume_abort_if_not(var_1_12 >= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_10=25, var_1_11=0, var_1_12=2147483647, var_1_13=31, var_1_14=256, var_1_15=8, var_1_16=16, var_1_1=-4, var_1_3=2016, var_1_4=-16129, var_1_5=1, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=25, var_1_11=0, var_1_12=2147483647, var_1_13=31, var_1_14=256, var_1_15=8, var_1_16=16, var_1_1=-4, var_1_3=2016, var_1_4=-16129, var_1_5=1, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=0] [L87] RET assume_abort_if_not(var_1_12 >= 2147483647) VAL [isInitial=1, var_1_10=25, var_1_11=0, var_1_12=2147483647, var_1_13=31, var_1_14=256, var_1_15=8, var_1_16=16, var_1_1=-4, var_1_3=2016, var_1_4=-16129, var_1_5=1, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=0] [L88] CALL assume_abort_if_not(var_1_12 <= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_10=25, var_1_11=0, var_1_12=2147483647, var_1_13=31, var_1_14=256, var_1_15=8, var_1_16=16, var_1_1=-4, var_1_3=2016, var_1_4=-16129, var_1_5=1, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=25, var_1_11=0, var_1_12=2147483647, var_1_13=31, var_1_14=256, var_1_15=8, var_1_16=16, var_1_1=-4, var_1_3=2016, var_1_4=-16129, var_1_5=1, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=0] [L88] RET assume_abort_if_not(var_1_12 <= 2147483647) VAL [isInitial=1, var_1_10=25, var_1_11=0, var_1_12=2147483647, var_1_13=31, var_1_14=256, var_1_15=8, var_1_16=16, var_1_1=-4, var_1_3=2016, var_1_4=-16129, var_1_5=1, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=0] [L89] var_1_13 = __VERIFIER_nondet_long() [L90] CALL assume_abort_if_not(var_1_13 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=25, var_1_11=0, var_1_12=2147483647, var_1_13=2147483646, var_1_14=256, var_1_15=8, var_1_16=16, var_1_1=-4, var_1_3=2016, var_1_4=-16129, var_1_5=1, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=25, var_1_11=0, var_1_12=2147483647, var_1_13=2147483646, var_1_14=256, var_1_15=8, var_1_16=16, var_1_1=-4, var_1_3=2016, var_1_4=-16129, var_1_5=1, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=0] [L90] RET assume_abort_if_not(var_1_13 >= 0) VAL [isInitial=1, var_1_10=25, var_1_11=0, var_1_12=2147483647, var_1_13=2147483646, var_1_14=256, var_1_15=8, var_1_16=16, var_1_1=-4, var_1_3=2016, var_1_4=-16129, var_1_5=1, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=0] [L91] CALL assume_abort_if_not(var_1_13 <= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_10=25, var_1_11=0, var_1_12=2147483647, var_1_13=2147483646, var_1_14=256, var_1_15=8, var_1_16=16, var_1_1=-4, var_1_3=2016, var_1_4=-16129, var_1_5=1, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=25, var_1_11=0, var_1_12=2147483647, var_1_13=2147483646, var_1_14=256, var_1_15=8, var_1_16=16, var_1_1=-4, var_1_3=2016, var_1_4=-16129, var_1_5=1, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=0] [L91] RET assume_abort_if_not(var_1_13 <= 2147483647) VAL [isInitial=1, var_1_10=25, var_1_11=0, var_1_12=2147483647, var_1_13=2147483646, var_1_14=256, var_1_15=8, var_1_16=16, var_1_1=-4, var_1_3=2016, var_1_4=-16129, var_1_5=1, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=0] [L92] var_1_14 = __VERIFIER_nondet_long() [L93] CALL assume_abort_if_not(var_1_14 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=25, var_1_11=0, var_1_12=2147483647, var_1_13=2147483646, var_1_14=0, var_1_15=8, var_1_16=16, var_1_1=-4, var_1_3=2016, var_1_4=-16129, var_1_5=1, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=25, var_1_11=0, var_1_12=2147483647, var_1_13=2147483646, var_1_14=0, var_1_15=8, var_1_16=16, var_1_1=-4, var_1_3=2016, var_1_4=-16129, var_1_5=1, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=0] [L93] RET assume_abort_if_not(var_1_14 >= 0) VAL [isInitial=1, var_1_10=25, var_1_11=0, var_1_12=2147483647, var_1_13=2147483646, var_1_14=0, var_1_15=8, var_1_16=16, var_1_1=-4, var_1_3=2016, var_1_4=-16129, var_1_5=1, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=0] [L94] CALL assume_abort_if_not(var_1_14 <= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_10=25, var_1_11=0, var_1_12=2147483647, var_1_13=2147483646, var_1_14=0, var_1_15=8, var_1_16=16, var_1_1=-4, var_1_3=2016, var_1_4=-16129, var_1_5=1, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=25, var_1_11=0, var_1_12=2147483647, var_1_13=2147483646, var_1_14=0, var_1_15=8, var_1_16=16, var_1_1=-4, var_1_3=2016, var_1_4=-16129, var_1_5=1, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=0] [L94] RET assume_abort_if_not(var_1_14 <= 2147483647) VAL [isInitial=1, var_1_10=25, var_1_11=0, var_1_12=2147483647, var_1_13=2147483646, var_1_14=0, var_1_15=8, var_1_16=16, var_1_1=-4, var_1_3=2016, var_1_4=-16129, var_1_5=1, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=0] [L95] var_1_16 = __VERIFIER_nondet_uchar() [L96] CALL assume_abort_if_not(var_1_16 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=25, var_1_11=0, var_1_12=2147483647, var_1_13=2147483646, var_1_14=0, var_1_15=8, var_1_1=-4, var_1_3=2016, var_1_4=-16129, var_1_5=1, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=25, var_1_11=0, var_1_12=2147483647, var_1_13=2147483646, var_1_14=0, var_1_15=8, var_1_1=-4, var_1_3=2016, var_1_4=-16129, var_1_5=1, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=0] [L96] RET assume_abort_if_not(var_1_16 >= 0) VAL [isInitial=1, var_1_10=25, var_1_11=0, var_1_12=2147483647, var_1_13=2147483646, var_1_14=0, var_1_15=8, var_1_1=-4, var_1_3=2016, var_1_4=-16129, var_1_5=1, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=0] [L97] CALL assume_abort_if_not(var_1_16 <= 30) VAL [\old(cond)=1, isInitial=1, var_1_10=25, var_1_11=0, var_1_12=2147483647, var_1_13=2147483646, var_1_14=0, var_1_15=8, var_1_16=30, var_1_1=-4, var_1_3=2016, var_1_4=-16129, var_1_5=1, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=25, var_1_11=0, var_1_12=2147483647, var_1_13=2147483646, var_1_14=0, var_1_15=8, var_1_16=30, var_1_1=-4, var_1_3=2016, var_1_4=-16129, var_1_5=1, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=0] [L97] RET assume_abort_if_not(var_1_16 <= 30) VAL [isInitial=1, var_1_10=25, var_1_11=0, var_1_12=2147483647, var_1_13=2147483646, var_1_14=0, var_1_15=8, var_1_16=30, var_1_1=-4, var_1_3=2016, var_1_4=-16129, var_1_5=1, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=0] [L110] RET updateVariables() [L111] CALL step() [L40] signed short int stepLocal_0 = var_1_3; VAL [isInitial=1, stepLocal_0=2016, var_1_10=25, var_1_11=0, var_1_12=2147483647, var_1_13=2147483646, var_1_14=0, var_1_15=8, var_1_16=30, var_1_1=-4, var_1_3=2016, var_1_4=-16129, var_1_5=1, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=0] [L41] COND FALSE !(stepLocal_0 > ((var_1_4 / -256) * 32)) [L48] var_1_5 = var_1_9 VAL [isInitial=1, var_1_10=25, var_1_11=0, var_1_12=2147483647, var_1_13=2147483646, var_1_14=0, var_1_15=8, var_1_16=30, var_1_1=-4, var_1_3=2016, var_1_4=-16129, var_1_5=0, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=0] [L50] COND TRUE \read(var_1_7) [L51] var_1_10 = (var_1_11 - (((((var_1_12 - var_1_13)) > (var_1_14)) ? ((var_1_12 - var_1_13)) : (var_1_14)))) VAL [isInitial=1, var_1_10=-1, var_1_11=0, var_1_12=2147483647, var_1_13=2147483646, var_1_14=0, var_1_15=8, var_1_16=30, var_1_1=-4, var_1_3=2016, var_1_4=-16129, var_1_5=0, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=0] [L53] COND TRUE var_1_10 < 63.75 [L54] var_1_1 = (10 - var_1_3) VAL [isInitial=1, var_1_10=-1, var_1_11=0, var_1_12=2147483647, var_1_13=2147483646, var_1_14=0, var_1_15=8, var_1_16=30, var_1_1=-2006, var_1_3=2016, var_1_4=-16129, var_1_5=0, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=0] [L58] COND FALSE !(! (var_1_13 < (127.125 / var_1_12))) VAL [isInitial=1, var_1_10=-1, var_1_11=0, var_1_12=2147483647, var_1_13=2147483646, var_1_14=0, var_1_15=8, var_1_16=30, var_1_1=-2006, var_1_3=2016, var_1_4=-16129, var_1_5=0, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=0] [L111] RET step() [L112] CALL, EXPR property() [L102] EXPR ((((var_1_10 < 63.75) ? (var_1_1 == ((signed short int) (10 - var_1_3))) : (var_1_1 == ((signed short int) (4 + var_1_4)))) && ((var_1_3 > ((var_1_4 / -256) * 32)) ? (var_1_6 ? (var_1_5 == ((unsigned char) (! (var_1_7 && var_1_8)))) : (var_1_5 == ((unsigned char) var_1_8))) : (var_1_5 == ((unsigned char) var_1_9)))) && (var_1_7 ? (var_1_10 == ((signed long int) (var_1_11 - (((((var_1_12 - var_1_13)) > (var_1_14)) ? ((var_1_12 - var_1_13)) : (var_1_14)))))) : 1)) && ((! (var_1_13 < (127.125 / var_1_12))) ? ((var_1_1 <= ((var_1_4 * var_1_3) + (-2 << var_1_16))) ? (var_1_15 == ((unsigned long int) var_1_3)) : 1) : 1) VAL [isInitial=1, var_1_10=-1, var_1_11=0, var_1_12=2147483647, var_1_13=2147483646, var_1_14=0, var_1_15=8, var_1_16=30, var_1_1=-2006, var_1_3=2016, var_1_4=-16129, var_1_5=0, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=0] [L102-L103] return ((((var_1_10 < 63.75) ? (var_1_1 == ((signed short int) (10 - var_1_3))) : (var_1_1 == ((signed short int) (4 + var_1_4)))) && ((var_1_3 > ((var_1_4 / -256) * 32)) ? (var_1_6 ? (var_1_5 == ((unsigned char) (! (var_1_7 && var_1_8)))) : (var_1_5 == ((unsigned char) var_1_8))) : (var_1_5 == ((unsigned char) var_1_9)))) && (var_1_7 ? (var_1_10 == ((signed long int) (var_1_11 - (((((var_1_12 - var_1_13)) > (var_1_14)) ? ((var_1_12 - var_1_13)) : (var_1_14)))))) : 1)) && ((! (var_1_13 < (127.125 / var_1_12))) ? ((var_1_1 <= ((var_1_4 * var_1_3) + (-2 << var_1_16))) ? (var_1_15 == ((unsigned long int) var_1_3)) : 1) : 1) ; [L112] RET, EXPR property() [L112] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, var_1_10=-1, var_1_11=0, var_1_12=2147483647, var_1_13=2147483646, var_1_14=0, var_1_15=8, var_1_16=30, var_1_1=-2006, var_1_3=2016, var_1_4=-16129, var_1_5=0, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=0] [L19] reach_error() VAL [isInitial=1, var_1_10=-1, var_1_11=0, var_1_12=2147483647, var_1_13=2147483646, var_1_14=0, var_1_15=8, var_1_16=30, var_1_1=-2006, var_1_3=2016, var_1_4=-16129, var_1_5=0, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 70 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 0.9s, OverallIterations: 2, TraceHistogramMax: 22, 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, 94 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 0 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2 IncrementalHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 0 mSolverCounterUnsat, 94 mSDtfsCounter, 2 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 68 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=70occurred 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.2s InterpolantComputationTime, 276 NumberOfCodeBlocks, 276 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 137 ConstructedInterpolants, 0 QuantifiedInterpolants, 137 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 924/924 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-10 06:54:07,736 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-52.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 19096ca86d86acc30d8aed0bf6308f75bb4310aad7abc911bc202c5b0fcfab1c --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 06:54:09,918 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 06:54:09,978 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-10 06:54:09,984 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 06:54:09,985 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 06:54:10,013 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 06:54:10,015 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 06:54:10,015 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 06:54:10,016 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 06:54:10,017 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 06:54:10,019 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 06:54:10,020 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 06:54:10,020 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 06:54:10,021 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 06:54:10,021 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 06:54:10,021 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 06:54:10,021 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-10 06:54:10,022 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-10 06:54:10,022 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-10 06:54:10,022 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 06:54:10,022 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-10 06:54:10,024 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 06:54:10,024 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-10 06:54:10,024 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-10 06:54:10,025 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-10 06:54:10,025 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 06:54:10,026 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-10 06:54:10,026 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-10 06:54:10,026 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-10 06:54:10,026 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 06:54:10,027 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 06:54:10,027 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 06:54:10,027 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 06:54:10,028 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 06:54:10,028 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 06:54:10,029 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 06:54:10,029 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 06:54:10,029 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-10 06:54:10,029 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-10 06:54:10,029 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-10 06:54:10,030 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 06:54:10,030 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 06:54:10,030 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 06:54:10,030 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 06:54:10,030 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 19096ca86d86acc30d8aed0bf6308f75bb4310aad7abc911bc202c5b0fcfab1c [2024-11-10 06:54:10,357 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 06:54:10,382 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 06:54:10,385 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 06:54:10,386 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 06:54:10,387 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 06:54:10,388 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-52.i [2024-11-10 06:54:11,849 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 06:54:12,004 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 06:54:12,005 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-52.i [2024-11-10 06:54:12,013 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4d54c6395/f0011ffbc08c43528245f99698825cc4/FLAG3c946890e [2024-11-10 06:54:12,025 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4d54c6395/f0011ffbc08c43528245f99698825cc4 [2024-11-10 06:54:12,027 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 06:54:12,029 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 06:54:12,029 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 06:54:12,030 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 06:54:12,034 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 06:54:12,035 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 06:54:12" (1/1) ... [2024-11-10 06:54:12,035 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@67a39a77 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:54:12, skipping insertion in model container [2024-11-10 06:54:12,036 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 06:54:12" (1/1) ... [2024-11-10 06:54:12,057 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 06:54:12,200 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-52.i[916,929] [2024-11-10 06:54:12,229 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 06:54:12,244 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 06:54:12,254 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-52.i[916,929] [2024-11-10 06:54:12,268 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 06:54:12,287 INFO L204 MainTranslator]: Completed translation [2024-11-10 06:54:12,287 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:54:12 WrapperNode [2024-11-10 06:54:12,288 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 06:54:12,290 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 06:54:12,290 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 06:54:12,290 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 06:54:12,295 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:54:12" (1/1) ... [2024-11-10 06:54:12,314 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:54:12" (1/1) ... [2024-11-10 06:54:12,340 INFO L138 Inliner]: procedures = 27, calls = 35, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 117 [2024-11-10 06:54:12,343 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 06:54:12,344 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 06:54:12,344 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 06:54:12,344 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 06:54:12,352 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:54:12" (1/1) ... [2024-11-10 06:54:12,353 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:54:12" (1/1) ... [2024-11-10 06:54:12,358 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:54:12" (1/1) ... [2024-11-10 06:54:12,374 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-10 06:54:12,377 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:54:12" (1/1) ... [2024-11-10 06:54:12,377 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:54:12" (1/1) ... [2024-11-10 06:54:12,382 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:54:12" (1/1) ... [2024-11-10 06:54:12,386 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:54:12" (1/1) ... [2024-11-10 06:54:12,387 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:54:12" (1/1) ... [2024-11-10 06:54:12,389 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:54:12" (1/1) ... [2024-11-10 06:54:12,394 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 06:54:12,395 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 06:54:12,395 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 06:54:12,395 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 06:54:12,396 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:54:12" (1/1) ... [2024-11-10 06:54:12,417 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 06:54:12,426 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 06:54:12,441 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-10 06:54:12,445 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-10 06:54:12,481 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 06:54:12,481 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-10 06:54:12,481 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-10 06:54:12,481 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-10 06:54:12,481 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 06:54:12,482 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 06:54:12,547 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 06:54:12,548 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 06:54:25,823 INFO L? ?]: Removed 10 outVars from TransFormulas that were not future-live. [2024-11-10 06:54:25,823 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 06:54:25,833 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 06:54:25,834 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 06:54:25,834 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 06:54:25 BoogieIcfgContainer [2024-11-10 06:54:25,834 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 06:54:25,836 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 06:54:25,836 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 06:54:25,839 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 06:54:25,839 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 06:54:12" (1/3) ... [2024-11-10 06:54:25,840 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@40590d5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 06:54:25, skipping insertion in model container [2024-11-10 06:54:25,840 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:54:12" (2/3) ... [2024-11-10 06:54:25,840 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@40590d5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 06:54:25, skipping insertion in model container [2024-11-10 06:54:25,840 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 06:54:25" (3/3) ... [2024-11-10 06:54:25,841 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_floatingpointinfluence_no-floats_file-52.i [2024-11-10 06:54:25,855 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 06:54:25,855 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-10 06:54:25,901 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 06:54:25,906 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;@5e97d465, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 06:54:25,907 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-10 06:54:25,910 INFO L276 IsEmpty]: Start isEmpty. Operand has 61 states, 36 states have (on average 1.3055555555555556) internal successors, (47), 37 states have internal predecessors, (47), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2024-11-10 06:54:25,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2024-11-10 06:54:25,919 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 06:54:25,920 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 06:54:25,920 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 06:54:25,925 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 06:54:25,925 INFO L85 PathProgramCache]: Analyzing trace with hash 683174972, now seen corresponding path program 1 times [2024-11-10 06:54:25,935 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 06:54:25,936 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1921708348] [2024-11-10 06:54:25,936 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 06:54:25,936 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 06:54:25,937 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 06:54:25,939 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-10 06:54:25,941 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-10 06:54:26,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:54:26,545 INFO L255 TraceCheckSpWp]: Trace formula consists of 213 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-10 06:54:26,560 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 06:54:26,614 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 458 proven. 0 refuted. 0 times theorem prover too weak. 466 trivial. 0 not checked. [2024-11-10 06:54:26,615 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 06:54:26,615 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 06:54:26,615 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1921708348] [2024-11-10 06:54:26,616 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1921708348] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 06:54:26,616 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 06:54:26,616 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 06:54:26,617 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [161809960] [2024-11-10 06:54:26,618 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 06:54:26,621 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-10 06:54:26,621 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 06:54:26,636 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-10 06:54:26,637 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 06:54:26,639 INFO L87 Difference]: Start difference. First operand has 61 states, 36 states have (on average 1.3055555555555556) internal successors, (47), 37 states have internal predecessors, (47), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) Second operand has 2 states, 2 states have (on average 16.5) internal successors, (33), 2 states have internal predecessors, (33), 2 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) [2024-11-10 06:54:26,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 06:54:26,659 INFO L93 Difference]: Finished difference Result 114 states and 197 transitions. [2024-11-10 06:54:26,660 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-10 06:54:26,662 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 16.5) internal successors, (33), 2 states have internal predecessors, (33), 2 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) Word has length 136 [2024-11-10 06:54:26,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 06:54:26,667 INFO L225 Difference]: With dead ends: 114 [2024-11-10 06:54:26,667 INFO L226 Difference]: Without dead ends: 56 [2024-11-10 06:54:26,670 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 135 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 06:54:26,672 INFO L432 NwaCegarLoop]: 83 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 83 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 06:54:26,673 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 06:54:26,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2024-11-10 06:54:26,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2024-11-10 06:54:26,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 32 states have (on average 1.21875) internal successors, (39), 32 states have internal predecessors, (39), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2024-11-10 06:54:26,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 83 transitions. [2024-11-10 06:54:26,707 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 83 transitions. Word has length 136 [2024-11-10 06:54:26,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 06:54:26,708 INFO L471 AbstractCegarLoop]: Abstraction has 56 states and 83 transitions. [2024-11-10 06:54:26,708 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 16.5) internal successors, (33), 2 states have internal predecessors, (33), 2 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) [2024-11-10 06:54:26,708 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 83 transitions. [2024-11-10 06:54:26,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2024-11-10 06:54:26,711 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 06:54:26,711 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 06:54:26,731 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-10 06:54:26,914 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 06:54:26,914 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 06:54:26,915 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 06:54:26,915 INFO L85 PathProgramCache]: Analyzing trace with hash -1304950564, now seen corresponding path program 1 times [2024-11-10 06:54:26,916 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 06:54:26,916 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1303183305] [2024-11-10 06:54:26,916 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 06:54:26,916 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 06:54:26,916 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 06:54:26,923 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-10 06:54:26,930 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-10 06:54:27,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:54:27,583 INFO L255 TraceCheckSpWp]: Trace formula consists of 213 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-11-10 06:54:27,593 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 06:54:47,906 WARN L286 SmtUtils]: Spent 8.45s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-10 06:54:56,288 WARN L286 SmtUtils]: Spent 8.38s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-10 06:55:04,656 WARN L286 SmtUtils]: Spent 8.37s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-10 06:55:13,045 WARN L286 SmtUtils]: Spent 8.39s on a formula simplification that was a NOOP. DAG size: 8 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-10 06:55:21,400 WARN L286 SmtUtils]: Spent 8.35s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-10 06:55:29,794 WARN L286 SmtUtils]: Spent 8.39s on a formula simplification that was a NOOP. DAG size: 7 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-10 06:55:38,175 WARN L286 SmtUtils]: Spent 8.38s on a formula simplification that was a NOOP. DAG size: 9 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-10 06:55:46,563 WARN L286 SmtUtils]: Spent 8.39s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)