./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-60.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 4a390ef5 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-60.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 06dfea34f20cf44667f72790239eb3b7ea493d794e5649e0b17ceb748f3093ee --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4a390ef-m [2024-10-24 08:56:55,548 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-24 08:56:55,618 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-24 08:56:55,622 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-24 08:56:55,622 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-24 08:56:55,655 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-24 08:56:55,656 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-24 08:56:55,656 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-24 08:56:55,657 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-24 08:56:55,659 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-24 08:56:55,661 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-24 08:56:55,661 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-24 08:56:55,662 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-24 08:56:55,662 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-24 08:56:55,662 INFO L153 SettingsManager]: * Use SBE=true [2024-10-24 08:56:55,662 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-24 08:56:55,663 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-24 08:56:55,663 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-24 08:56:55,663 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-24 08:56:55,663 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-24 08:56:55,664 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-24 08:56:55,665 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-24 08:56:55,665 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-24 08:56:55,666 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-24 08:56:55,666 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-24 08:56:55,666 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-24 08:56:55,666 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-24 08:56:55,667 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-24 08:56:55,667 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-24 08:56:55,667 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-24 08:56:55,667 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-24 08:56:55,668 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-24 08:56:55,668 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 08:56:55,668 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-24 08:56:55,668 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-24 08:56:55,679 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-24 08:56:55,679 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-24 08:56:55,679 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-24 08:56:55,680 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-24 08:56:55,680 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-24 08:56:55,680 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-24 08:56:55,682 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-24 08:56:55,682 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 -> 06dfea34f20cf44667f72790239eb3b7ea493d794e5649e0b17ceb748f3093ee [2024-10-24 08:56:55,927 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-24 08:56:55,954 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-24 08:56:55,957 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-24 08:56:55,959 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-24 08:56:55,959 INFO L274 PluginConnector]: CDTParser initialized [2024-10-24 08:56:55,960 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-60.i [2024-10-24 08:56:57,410 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-24 08:56:57,587 INFO L384 CDTParser]: Found 1 translation units. [2024-10-24 08:56:57,588 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-60.i [2024-10-24 08:56:57,595 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/250a5eaec/e761e686cb1543da9f2c58fbc936721e/FLAGf6235dc60 [2024-10-24 08:56:57,984 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/250a5eaec/e761e686cb1543da9f2c58fbc936721e [2024-10-24 08:56:57,986 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-24 08:56:57,987 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-24 08:56:57,988 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-24 08:56:57,988 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-24 08:56:57,994 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-24 08:56:57,994 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 08:56:57" (1/1) ... [2024-10-24 08:56:57,995 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7116ccd9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:56:57, skipping insertion in model container [2024-10-24 08:56:57,995 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 08:56:57" (1/1) ... [2024-10-24 08:56:58,022 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 08:56:58,227 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-60.i[916,929] [2024-10-24 08:56:58,280 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 08:56:58,295 INFO L200 MainTranslator]: Completed pre-run [2024-10-24 08:56:58,307 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-60.i[916,929] [2024-10-24 08:56:58,332 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 08:56:58,358 INFO L204 MainTranslator]: Completed translation [2024-10-24 08:56:58,359 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:56:58 WrapperNode [2024-10-24 08:56:58,359 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-24 08:56:58,360 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-24 08:56:58,360 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-24 08:56:58,360 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-24 08:56:58,367 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:56:58" (1/1) ... [2024-10-24 08:56:58,380 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:56:58" (1/1) ... [2024-10-24 08:56:58,413 INFO L138 Inliner]: procedures = 26, calls = 35, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 130 [2024-10-24 08:56:58,413 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-24 08:56:58,414 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-24 08:56:58,414 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-24 08:56:58,414 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-24 08:56:58,424 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:56:58" (1/1) ... [2024-10-24 08:56:58,427 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:56:58" (1/1) ... [2024-10-24 08:56:58,429 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:56:58" (1/1) ... [2024-10-24 08:56:58,443 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-24 08:56:58,443 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:56:58" (1/1) ... [2024-10-24 08:56:58,444 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:56:58" (1/1) ... [2024-10-24 08:56:58,448 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:56:58" (1/1) ... [2024-10-24 08:56:58,451 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:56:58" (1/1) ... [2024-10-24 08:56:58,453 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:56:58" (1/1) ... [2024-10-24 08:56:58,454 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:56:58" (1/1) ... [2024-10-24 08:56:58,456 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-24 08:56:58,457 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-24 08:56:58,457 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-24 08:56:58,457 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-24 08:56:58,462 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:56:58" (1/1) ... [2024-10-24 08:56:58,471 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 08:56:58,485 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 08:56:58,503 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-10-24 08:56:58,506 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-10-24 08:56:58,559 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-24 08:56:58,560 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-24 08:56:58,560 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-24 08:56:58,560 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-24 08:56:58,560 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-24 08:56:58,560 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-24 08:56:58,626 INFO L238 CfgBuilder]: Building ICFG [2024-10-24 08:56:58,628 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-24 08:56:58,907 INFO L? ?]: Removed 10 outVars from TransFormulas that were not future-live. [2024-10-24 08:56:58,907 INFO L287 CfgBuilder]: Performing block encoding [2024-10-24 08:56:58,954 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-24 08:56:58,954 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-24 08:56:58,955 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 08:56:58 BoogieIcfgContainer [2024-10-24 08:56:58,955 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-24 08:56:58,957 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-24 08:56:58,957 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-24 08:56:58,961 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-24 08:56:58,961 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 08:56:57" (1/3) ... [2024-10-24 08:56:58,961 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1f951b95 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 08:56:58, skipping insertion in model container [2024-10-24 08:56:58,962 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:56:58" (2/3) ... [2024-10-24 08:56:58,962 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1f951b95 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 08:56:58, skipping insertion in model container [2024-10-24 08:56:58,962 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 08:56:58" (3/3) ... [2024-10-24 08:56:58,963 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_floatingpointinfluence_no-floats_file-60.i [2024-10-24 08:56:58,978 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-24 08:56:58,978 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-24 08:56:59,042 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-24 08:56:59,049 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;@51e42509, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-24 08:56:59,050 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-24 08:56:59,053 INFO L276 IsEmpty]: Start isEmpty. Operand has 55 states, 30 states have (on average 1.4) internal successors, (42), 31 states have internal predecessors, (42), 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-10-24 08:56:59,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2024-10-24 08:56:59,063 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 08:56:59,064 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] [2024-10-24 08:56:59,065 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 08:56:59,069 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 08:56:59,069 INFO L85 PathProgramCache]: Analyzing trace with hash 1664830328, now seen corresponding path program 1 times [2024-10-24 08:56:59,077 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 08:56:59,077 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1879694978] [2024-10-24 08:56:59,078 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 08:56:59,078 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 08:56:59,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:56:59,292 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 08:56:59,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:56:59,309 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 08:56:59,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:56:59,320 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 08:56:59,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:56:59,330 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 08:56:59,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:56:59,337 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 08:56:59,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:56:59,342 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 08:56:59,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:56:59,346 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 08:56:59,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:56:59,351 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-24 08:56:59,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:56:59,359 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-24 08:56:59,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:56:59,366 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-24 08:56:59,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:56:59,379 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-24 08:56:59,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:56:59,384 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 08:56:59,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:56:59,395 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 08:56:59,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:56:59,403 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-24 08:56:59,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:56:59,409 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-24 08:56:59,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:56:59,417 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-24 08:56:59,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:56:59,426 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-24 08:56:59,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:56:59,434 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-24 08:56:59,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:56:59,465 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-24 08:56:59,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:56:59,475 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-24 08:56:59,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:56:59,490 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-24 08:56:59,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:56:59,507 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-24 08:56:59,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:56:59,520 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2024-10-24 08:56:59,525 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 08:56:59,526 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1879694978] [2024-10-24 08:56:59,526 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1879694978] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 08:56:59,527 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 08:56:59,527 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 08:56:59,528 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1387900724] [2024-10-24 08:56:59,529 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 08:56:59,538 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-24 08:56:59,556 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 08:56:59,586 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-24 08:56:59,587 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-24 08:56:59,589 INFO L87 Difference]: Start difference. First operand has 55 states, 30 states have (on average 1.4) internal successors, (42), 31 states have internal predecessors, (42), 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 12.0) internal successors, (24), 2 states have internal predecessors, (24), 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-10-24 08:56:59,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 08:56:59,650 INFO L93 Difference]: Finished difference Result 107 states and 192 transitions. [2024-10-24 08:56:59,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-24 08:56:59,654 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 2 states have call successors, (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 131 [2024-10-24 08:56:59,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 08:56:59,664 INFO L225 Difference]: With dead ends: 107 [2024-10-24 08:56:59,664 INFO L226 Difference]: Without dead ends: 53 [2024-10-24 08:56:59,668 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-10-24 08:56:59,673 INFO L432 NwaCegarLoop]: 78 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 78 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 08:56:59,674 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 78 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 08:56:59,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2024-10-24 08:56:59,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2024-10-24 08:56:59,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 29 states have (on average 1.2758620689655173) internal successors, (37), 29 states have internal predecessors, (37), 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-10-24 08:56:59,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 81 transitions. [2024-10-24 08:56:59,728 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 81 transitions. Word has length 131 [2024-10-24 08:56:59,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 08:56:59,731 INFO L471 AbstractCegarLoop]: Abstraction has 53 states and 81 transitions. [2024-10-24 08:56:59,732 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 2 states have call successors, (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-10-24 08:56:59,732 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 81 transitions. [2024-10-24 08:56:59,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2024-10-24 08:56:59,738 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 08:56:59,739 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] [2024-10-24 08:56:59,739 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-24 08:56:59,739 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 08:56:59,740 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 08:56:59,741 INFO L85 PathProgramCache]: Analyzing trace with hash 1120922168, now seen corresponding path program 1 times [2024-10-24 08:56:59,741 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 08:56:59,741 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1241084027] [2024-10-24 08:56:59,741 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 08:56:59,742 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 08:56:59,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-24 08:56:59,884 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-24 08:56:59,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-24 08:57:00,018 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-24 08:57:00,019 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-24 08:57:00,021 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-24 08:57:00,024 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-24 08:57:00,028 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1] [2024-10-24 08:57:00,134 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-24 08:57:00,137 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.10 08:57:00 BoogieIcfgContainer [2024-10-24 08:57:00,137 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-24 08:57:00,141 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-24 08:57:00,142 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-24 08:57:00,142 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-24 08:57:00,142 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 08:56:58" (3/4) ... [2024-10-24 08:57:00,144 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-24 08:57:00,145 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-24 08:57:00,146 INFO L158 Benchmark]: Toolchain (without parser) took 2158.95ms. Allocated memory is still 169.9MB. Free memory was 114.1MB in the beginning and 96.4MB in the end (delta: 17.7MB). Peak memory consumption was 17.6MB. Max. memory is 16.1GB. [2024-10-24 08:57:00,146 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 169.9MB. Free memory is still 136.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-24 08:57:00,147 INFO L158 Benchmark]: CACSL2BoogieTranslator took 371.32ms. Allocated memory is still 169.9MB. Free memory was 113.8MB in the beginning and 99.9MB in the end (delta: 13.9MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-10-24 08:57:00,147 INFO L158 Benchmark]: Boogie Procedure Inliner took 53.39ms. Allocated memory is still 169.9MB. Free memory was 99.9MB in the beginning and 97.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-24 08:57:00,148 INFO L158 Benchmark]: Boogie Preprocessor took 42.10ms. Allocated memory is still 169.9MB. Free memory was 97.8MB in the beginning and 95.3MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-24 08:57:00,149 INFO L158 Benchmark]: RCFGBuilder took 498.24ms. Allocated memory is still 169.9MB. Free memory was 95.3MB in the beginning and 76.4MB in the end (delta: 18.9MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-10-24 08:57:00,150 INFO L158 Benchmark]: TraceAbstraction took 1179.71ms. Allocated memory is still 169.9MB. Free memory was 76.0MB in the beginning and 97.6MB in the end (delta: -21.6MB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-24 08:57:00,150 INFO L158 Benchmark]: Witness Printer took 4.05ms. Allocated memory is still 169.9MB. Free memory was 97.6MB in the beginning and 96.4MB in the end (delta: 1.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-24 08:57:00,152 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.17ms. Allocated memory is still 169.9MB. Free memory is still 136.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 371.32ms. Allocated memory is still 169.9MB. Free memory was 113.8MB in the beginning and 99.9MB in the end (delta: 13.9MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 53.39ms. Allocated memory is still 169.9MB. Free memory was 99.9MB in the beginning and 97.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 42.10ms. Allocated memory is still 169.9MB. Free memory was 97.8MB in the beginning and 95.3MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 498.24ms. Allocated memory is still 169.9MB. Free memory was 95.3MB in the beginning and 76.4MB in the end (delta: 18.9MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * TraceAbstraction took 1179.71ms. Allocated memory is still 169.9MB. Free memory was 76.0MB in the beginning and 97.6MB in the end (delta: -21.6MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 4.05ms. Allocated memory is still 169.9MB. Free memory was 97.6MB in the beginning and 96.4MB in the end (delta: 1.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of to_int at line 106. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed long int var_1_1 = 9999; [L23] signed long int var_1_2 = 64; [L24] signed long int var_1_3 = 31; [L25] signed long int var_1_4 = 1; [L26] unsigned char var_1_5 = 2; [L27] signed long int var_1_6 = 10; [L28] signed long int var_1_7 = 5; [L29] unsigned char var_1_8 = 1; [L30] unsigned char var_1_9 = 1; [L31] signed long int var_1_10 = 64; [L32] signed long int var_1_11 = 32; [L33] signed long int var_1_12 = 10; [L34] signed long int var_1_13 = 4; [L35] signed long int var_1_14 = 999; [L36] signed long int var_1_15 = 2; [L37] signed long int var_1_16 = 8; [L38] signed long int last_1_var_1_16 = 8; [L110] isInitial = 1 [L111] FCALL initially() [L112] COND TRUE 1 [L113] CALL updateLastVariables() [L103] last_1_var_1_16 = var_1_16 [L113] RET updateLastVariables() [L114] CALL updateVariables() [L68] var_1_2 = __VERIFIER_nondet_long() [L69] CALL assume_abort_if_not(var_1_2 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=8, var_1_10=64, var_1_11=32, var_1_12=10, var_1_13=4, var_1_14=999, var_1_15=2, var_1_16=8, var_1_1=9999, var_1_2=1, var_1_3=31, var_1_4=1, var_1_5=2, var_1_6=10, var_1_7=5, var_1_8=1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=8, var_1_10=64, var_1_11=32, var_1_12=10, var_1_13=4, var_1_14=999, var_1_15=2, var_1_16=8, var_1_1=9999, var_1_2=1, var_1_3=31, var_1_4=1, var_1_5=2, var_1_6=10, var_1_7=5, var_1_8=1, var_1_9=1] [L69] RET assume_abort_if_not(var_1_2 >= 0) VAL [isInitial=1, last_1_var_1_16=8, var_1_10=64, var_1_11=32, var_1_12=10, var_1_13=4, var_1_14=999, var_1_15=2, var_1_16=8, var_1_1=9999, var_1_2=1, var_1_3=31, var_1_4=1, var_1_5=2, var_1_6=10, var_1_7=5, var_1_8=1, var_1_9=1] [L70] CALL assume_abort_if_not(var_1_2 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=8, var_1_10=64, var_1_11=32, var_1_12=10, var_1_13=4, var_1_14=999, var_1_15=2, var_1_16=8, var_1_1=9999, var_1_2=1, var_1_3=31, var_1_4=1, var_1_5=2, var_1_6=10, var_1_7=5, var_1_8=1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=8, var_1_10=64, var_1_11=32, var_1_12=10, var_1_13=4, var_1_14=999, var_1_15=2, var_1_16=8, var_1_1=9999, var_1_2=1, var_1_3=31, var_1_4=1, var_1_5=2, var_1_6=10, var_1_7=5, var_1_8=1, var_1_9=1] [L70] RET assume_abort_if_not(var_1_2 <= 2147483647) VAL [isInitial=1, last_1_var_1_16=8, var_1_10=64, var_1_11=32, var_1_12=10, var_1_13=4, var_1_14=999, var_1_15=2, var_1_16=8, var_1_1=9999, var_1_2=1, var_1_3=31, var_1_4=1, var_1_5=2, var_1_6=10, var_1_7=5, var_1_8=1, var_1_9=1] [L71] var_1_3 = __VERIFIER_nondet_long() [L72] CALL assume_abort_if_not(var_1_3 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=8, var_1_10=64, var_1_11=32, var_1_12=10, var_1_13=4, var_1_14=999, var_1_15=2, var_1_16=8, var_1_1=9999, var_1_2=1, var_1_3=1, var_1_4=1, var_1_5=2, var_1_6=10, var_1_7=5, var_1_8=1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=8, var_1_10=64, var_1_11=32, var_1_12=10, var_1_13=4, var_1_14=999, var_1_15=2, var_1_16=8, var_1_1=9999, var_1_2=1, var_1_3=1, var_1_4=1, var_1_5=2, var_1_6=10, var_1_7=5, var_1_8=1, var_1_9=1] [L72] RET assume_abort_if_not(var_1_3 >= 0) VAL [isInitial=1, last_1_var_1_16=8, var_1_10=64, var_1_11=32, var_1_12=10, var_1_13=4, var_1_14=999, var_1_15=2, var_1_16=8, var_1_1=9999, var_1_2=1, var_1_3=1, var_1_4=1, var_1_5=2, var_1_6=10, var_1_7=5, var_1_8=1, var_1_9=1] [L73] CALL assume_abort_if_not(var_1_3 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=8, var_1_10=64, var_1_11=32, var_1_12=10, var_1_13=4, var_1_14=999, var_1_15=2, var_1_16=8, var_1_1=9999, var_1_2=1, var_1_3=1, var_1_4=1, var_1_5=2, var_1_6=10, var_1_7=5, var_1_8=1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=8, var_1_10=64, var_1_11=32, var_1_12=10, var_1_13=4, var_1_14=999, var_1_15=2, var_1_16=8, var_1_1=9999, var_1_2=1, var_1_3=1, var_1_4=1, var_1_5=2, var_1_6=10, var_1_7=5, var_1_8=1, var_1_9=1] [L73] RET assume_abort_if_not(var_1_3 <= 2147483647) VAL [isInitial=1, last_1_var_1_16=8, var_1_10=64, var_1_11=32, var_1_12=10, var_1_13=4, var_1_14=999, var_1_15=2, var_1_16=8, var_1_1=9999, var_1_2=1, var_1_3=1, var_1_4=1, var_1_5=2, var_1_6=10, var_1_7=5, var_1_8=1, var_1_9=1] [L74] var_1_5 = __VERIFIER_nondet_uchar() [L75] CALL assume_abort_if_not(var_1_5 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=8, var_1_10=64, var_1_11=32, var_1_12=10, var_1_13=4, var_1_14=999, var_1_15=2, var_1_16=8, var_1_1=9999, var_1_2=1, var_1_3=1, var_1_4=1, var_1_6=10, var_1_7=5, var_1_8=1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=8, var_1_10=64, var_1_11=32, var_1_12=10, var_1_13=4, var_1_14=999, var_1_15=2, var_1_16=8, var_1_1=9999, var_1_2=1, var_1_3=1, var_1_4=1, var_1_6=10, var_1_7=5, var_1_8=1, var_1_9=1] [L75] RET assume_abort_if_not(var_1_5 >= 0) VAL [isInitial=1, last_1_var_1_16=8, var_1_10=64, var_1_11=32, var_1_12=10, var_1_13=4, var_1_14=999, var_1_15=2, var_1_16=8, var_1_1=9999, var_1_2=1, var_1_3=1, var_1_4=1, var_1_6=10, var_1_7=5, var_1_8=1, var_1_9=1] [L76] CALL assume_abort_if_not(var_1_5 <= 255) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=8, var_1_10=64, var_1_11=32, var_1_12=10, var_1_13=4, var_1_14=999, var_1_15=2, var_1_16=8, var_1_1=9999, var_1_2=1, var_1_3=1, var_1_4=1, var_1_6=10, var_1_7=5, var_1_8=1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=8, var_1_10=64, var_1_11=32, var_1_12=10, var_1_13=4, var_1_14=999, var_1_15=2, var_1_16=8, var_1_1=9999, var_1_2=1, var_1_3=1, var_1_4=1, var_1_6=10, var_1_7=5, var_1_8=1, var_1_9=1] [L76] RET assume_abort_if_not(var_1_5 <= 255) VAL [isInitial=1, last_1_var_1_16=8, var_1_10=64, var_1_11=32, var_1_12=10, var_1_13=4, var_1_14=999, var_1_15=2, var_1_16=8, var_1_1=9999, var_1_2=1, var_1_3=1, var_1_4=1, var_1_6=10, var_1_7=5, var_1_8=1, var_1_9=1] [L77] var_1_6 = __VERIFIER_nondet_long() [L78] CALL assume_abort_if_not(var_1_6 >= -2147483648) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=8, var_1_10=64, var_1_11=32, var_1_12=10, var_1_13=4, var_1_14=999, var_1_15=2, var_1_16=8, var_1_1=9999, var_1_2=1, var_1_3=1, var_1_4=1, var_1_6=5, var_1_7=5, var_1_8=1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=8, var_1_10=64, var_1_11=32, var_1_12=10, var_1_13=4, var_1_14=999, var_1_15=2, var_1_16=8, var_1_1=9999, var_1_2=1, var_1_3=1, var_1_4=1, var_1_6=5, var_1_7=5, var_1_8=1, var_1_9=1] [L78] RET assume_abort_if_not(var_1_6 >= -2147483648) VAL [isInitial=1, last_1_var_1_16=8, var_1_10=64, var_1_11=32, var_1_12=10, var_1_13=4, var_1_14=999, var_1_15=2, var_1_16=8, var_1_1=9999, var_1_2=1, var_1_3=1, var_1_4=1, var_1_6=5, var_1_7=5, var_1_8=1, var_1_9=1] [L79] CALL assume_abort_if_not(var_1_6 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=8, var_1_10=64, var_1_11=32, var_1_12=10, var_1_13=4, var_1_14=999, var_1_15=2, var_1_16=8, var_1_1=9999, var_1_2=1, var_1_3=1, var_1_4=1, var_1_6=5, var_1_7=5, var_1_8=1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=8, var_1_10=64, var_1_11=32, var_1_12=10, var_1_13=4, var_1_14=999, var_1_15=2, var_1_16=8, var_1_1=9999, var_1_2=1, var_1_3=1, var_1_4=1, var_1_6=5, var_1_7=5, var_1_8=1, var_1_9=1] [L79] RET assume_abort_if_not(var_1_6 <= 2147483647) VAL [isInitial=1, last_1_var_1_16=8, var_1_10=64, var_1_11=32, var_1_12=10, var_1_13=4, var_1_14=999, var_1_15=2, var_1_16=8, var_1_1=9999, var_1_2=1, var_1_3=1, var_1_4=1, var_1_6=5, var_1_7=5, var_1_8=1, var_1_9=1] [L80] var_1_8 = __VERIFIER_nondet_uchar() [L81] CALL assume_abort_if_not(var_1_8 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=8, var_1_10=64, var_1_11=32, var_1_12=10, var_1_13=4, var_1_14=999, var_1_15=2, var_1_16=8, var_1_1=9999, var_1_2=1, var_1_3=1, var_1_4=1, var_1_6=5, var_1_7=5, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=8, var_1_10=64, var_1_11=32, var_1_12=10, var_1_13=4, var_1_14=999, var_1_15=2, var_1_16=8, var_1_1=9999, var_1_2=1, var_1_3=1, var_1_4=1, var_1_6=5, var_1_7=5, var_1_9=1] [L81] RET assume_abort_if_not(var_1_8 >= 0) VAL [isInitial=1, last_1_var_1_16=8, var_1_10=64, var_1_11=32, var_1_12=10, var_1_13=4, var_1_14=999, var_1_15=2, var_1_16=8, var_1_1=9999, var_1_2=1, var_1_3=1, var_1_4=1, var_1_6=5, var_1_7=5, var_1_9=1] [L82] CALL assume_abort_if_not(var_1_8 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=8, var_1_10=64, var_1_11=32, var_1_12=10, var_1_13=4, var_1_14=999, var_1_15=2, var_1_16=8, var_1_1=9999, var_1_2=1, var_1_3=1, var_1_4=1, var_1_6=5, var_1_7=5, var_1_8=1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=8, var_1_10=64, var_1_11=32, var_1_12=10, var_1_13=4, var_1_14=999, var_1_15=2, var_1_16=8, var_1_1=9999, var_1_2=1, var_1_3=1, var_1_4=1, var_1_6=5, var_1_7=5, var_1_8=1, var_1_9=1] [L82] RET assume_abort_if_not(var_1_8 <= 1) VAL [isInitial=1, last_1_var_1_16=8, var_1_10=64, var_1_11=32, var_1_12=10, var_1_13=4, var_1_14=999, var_1_15=2, var_1_16=8, var_1_1=9999, var_1_2=1, var_1_3=1, var_1_4=1, var_1_6=5, var_1_7=5, var_1_8=1, var_1_9=1] [L83] var_1_9 = __VERIFIER_nondet_uchar() [L84] CALL assume_abort_if_not(var_1_9 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=8, var_1_10=64, var_1_11=32, var_1_12=10, var_1_13=4, var_1_14=999, var_1_15=2, var_1_16=8, var_1_1=9999, var_1_2=1, var_1_3=1, var_1_4=1, var_1_6=5, var_1_7=5, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=8, var_1_10=64, var_1_11=32, var_1_12=10, var_1_13=4, var_1_14=999, var_1_15=2, var_1_16=8, var_1_1=9999, var_1_2=1, var_1_3=1, var_1_4=1, var_1_6=5, var_1_7=5, var_1_8=1] [L84] RET assume_abort_if_not(var_1_9 >= 0) VAL [isInitial=1, last_1_var_1_16=8, var_1_10=64, var_1_11=32, var_1_12=10, var_1_13=4, var_1_14=999, var_1_15=2, var_1_16=8, var_1_1=9999, var_1_2=1, var_1_3=1, var_1_4=1, var_1_6=5, var_1_7=5, var_1_8=1] [L85] CALL assume_abort_if_not(var_1_9 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=8, var_1_10=64, var_1_11=32, var_1_12=10, var_1_13=4, var_1_14=999, var_1_15=2, var_1_16=8, var_1_1=9999, var_1_2=1, var_1_3=1, var_1_4=1, var_1_6=5, var_1_7=5, var_1_8=1, var_1_9=-255] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=8, var_1_10=64, var_1_11=32, var_1_12=10, var_1_13=4, var_1_14=999, var_1_15=2, var_1_16=8, var_1_1=9999, var_1_2=1, var_1_3=1, var_1_4=1, var_1_6=5, var_1_7=5, var_1_8=1, var_1_9=-255] [L85] RET assume_abort_if_not(var_1_9 <= 1) VAL [isInitial=1, last_1_var_1_16=8, var_1_10=64, var_1_11=32, var_1_12=10, var_1_13=4, var_1_14=999, var_1_15=2, var_1_16=8, var_1_1=9999, var_1_2=1, var_1_3=1, var_1_4=1, var_1_6=5, var_1_7=5, var_1_8=1, var_1_9=-255] [L86] var_1_10 = __VERIFIER_nondet_long() [L87] CALL assume_abort_if_not(var_1_10 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=8, var_1_10=0, var_1_11=32, var_1_12=10, var_1_13=4, var_1_14=999, var_1_15=2, var_1_16=8, var_1_1=9999, var_1_2=1, var_1_3=1, var_1_4=1, var_1_6=5, var_1_7=5, var_1_8=1, var_1_9=-255] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=8, var_1_10=0, var_1_11=32, var_1_12=10, var_1_13=4, var_1_14=999, var_1_15=2, var_1_16=8, var_1_1=9999, var_1_2=1, var_1_3=1, var_1_4=1, var_1_6=5, var_1_7=5, var_1_8=1, var_1_9=-255] [L87] RET assume_abort_if_not(var_1_10 >= 0) VAL [isInitial=1, last_1_var_1_16=8, var_1_10=0, var_1_11=32, var_1_12=10, var_1_13=4, var_1_14=999, var_1_15=2, var_1_16=8, var_1_1=9999, var_1_2=1, var_1_3=1, var_1_4=1, var_1_6=5, var_1_7=5, var_1_8=1, var_1_9=-255] [L88] CALL assume_abort_if_not(var_1_10 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=8, var_1_10=0, var_1_11=32, var_1_12=10, var_1_13=4, var_1_14=999, var_1_15=2, var_1_16=8, var_1_1=9999, var_1_2=1, var_1_3=1, var_1_4=1, var_1_6=5, var_1_7=5, var_1_8=1, var_1_9=-255] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=8, var_1_10=0, var_1_11=32, var_1_12=10, var_1_13=4, var_1_14=999, var_1_15=2, var_1_16=8, var_1_1=9999, var_1_2=1, var_1_3=1, var_1_4=1, var_1_6=5, var_1_7=5, var_1_8=1, var_1_9=-255] [L88] RET assume_abort_if_not(var_1_10 <= 2147483647) VAL [isInitial=1, last_1_var_1_16=8, var_1_10=0, var_1_11=32, var_1_12=10, var_1_13=4, var_1_14=999, var_1_15=2, var_1_16=8, var_1_1=9999, var_1_2=1, var_1_3=1, var_1_4=1, var_1_6=5, var_1_7=5, var_1_8=1, var_1_9=-255] [L89] var_1_11 = __VERIFIER_nondet_long() [L90] CALL assume_abort_if_not(var_1_11 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=8, var_1_10=0, var_1_11=0, var_1_12=10, var_1_13=4, var_1_14=999, var_1_15=2, var_1_16=8, var_1_1=9999, var_1_2=1, var_1_3=1, var_1_4=1, var_1_6=5, var_1_7=5, var_1_8=1, var_1_9=-255] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=8, var_1_10=0, var_1_11=0, var_1_12=10, var_1_13=4, var_1_14=999, var_1_15=2, var_1_16=8, var_1_1=9999, var_1_2=1, var_1_3=1, var_1_4=1, var_1_6=5, var_1_7=5, var_1_8=1, var_1_9=-255] [L90] RET assume_abort_if_not(var_1_11 >= 0) VAL [isInitial=1, last_1_var_1_16=8, var_1_10=0, var_1_11=0, var_1_12=10, var_1_13=4, var_1_14=999, var_1_15=2, var_1_16=8, var_1_1=9999, var_1_2=1, var_1_3=1, var_1_4=1, var_1_6=5, var_1_7=5, var_1_8=1, var_1_9=-255] [L91] CALL assume_abort_if_not(var_1_11 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=8, var_1_10=0, var_1_11=0, var_1_12=10, var_1_13=4, var_1_14=999, var_1_15=2, var_1_16=8, var_1_1=9999, var_1_2=1, var_1_3=1, var_1_4=1, var_1_6=5, var_1_7=5, var_1_8=1, var_1_9=-255] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=8, var_1_10=0, var_1_11=0, var_1_12=10, var_1_13=4, var_1_14=999, var_1_15=2, var_1_16=8, var_1_1=9999, var_1_2=1, var_1_3=1, var_1_4=1, var_1_6=5, var_1_7=5, var_1_8=1, var_1_9=-255] [L91] RET assume_abort_if_not(var_1_11 <= 2147483647) VAL [isInitial=1, last_1_var_1_16=8, var_1_10=0, var_1_11=0, var_1_12=10, var_1_13=4, var_1_14=999, var_1_15=2, var_1_16=8, var_1_1=9999, var_1_2=1, var_1_3=1, var_1_4=1, var_1_6=5, var_1_7=5, var_1_8=1, var_1_9=-255] [L92] var_1_12 = __VERIFIER_nondet_long() [L93] CALL assume_abort_if_not(var_1_12 >= -2147483648) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=8, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=4, var_1_14=999, var_1_15=2, var_1_16=8, var_1_1=9999, var_1_2=1, var_1_3=1, var_1_4=1, var_1_6=5, var_1_7=5, var_1_8=1, var_1_9=-255] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=8, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=4, var_1_14=999, var_1_15=2, var_1_16=8, var_1_1=9999, var_1_2=1, var_1_3=1, var_1_4=1, var_1_6=5, var_1_7=5, var_1_8=1, var_1_9=-255] [L93] RET assume_abort_if_not(var_1_12 >= -2147483648) VAL [isInitial=1, last_1_var_1_16=8, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=4, var_1_14=999, var_1_15=2, var_1_16=8, var_1_1=9999, var_1_2=1, var_1_3=1, var_1_4=1, var_1_6=5, var_1_7=5, var_1_8=1, var_1_9=-255] [L94] CALL assume_abort_if_not(var_1_12 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=8, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=4, var_1_14=999, var_1_15=2, var_1_16=8, var_1_1=9999, var_1_2=1, var_1_3=1, var_1_4=1, var_1_6=5, var_1_7=5, var_1_8=1, var_1_9=-255] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=8, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=4, var_1_14=999, var_1_15=2, var_1_16=8, var_1_1=9999, var_1_2=1, var_1_3=1, var_1_4=1, var_1_6=5, var_1_7=5, var_1_8=1, var_1_9=-255] [L94] RET assume_abort_if_not(var_1_12 <= 2147483647) VAL [isInitial=1, last_1_var_1_16=8, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=4, var_1_14=999, var_1_15=2, var_1_16=8, var_1_1=9999, var_1_2=1, var_1_3=1, var_1_4=1, var_1_6=5, var_1_7=5, var_1_8=1, var_1_9=-255] [L95] var_1_13 = __VERIFIER_nondet_long() [L96] CALL assume_abort_if_not(var_1_13 >= -2147483648) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=8, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=-1, var_1_14=999, var_1_15=2, var_1_16=8, var_1_1=9999, var_1_2=1, var_1_3=1, var_1_4=1, var_1_6=5, var_1_7=5, var_1_8=1, var_1_9=-255] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=8, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=-1, var_1_14=999, var_1_15=2, var_1_16=8, var_1_1=9999, var_1_2=1, var_1_3=1, var_1_4=1, var_1_6=5, var_1_7=5, var_1_8=1, var_1_9=-255] [L96] RET assume_abort_if_not(var_1_13 >= -2147483648) VAL [isInitial=1, last_1_var_1_16=8, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=-1, var_1_14=999, var_1_15=2, var_1_16=8, var_1_1=9999, var_1_2=1, var_1_3=1, var_1_4=1, var_1_6=5, var_1_7=5, var_1_8=1, var_1_9=-255] [L97] CALL assume_abort_if_not(var_1_13 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=8, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=-1, var_1_14=999, var_1_15=2, var_1_16=8, var_1_1=9999, var_1_2=1, var_1_3=1, var_1_4=1, var_1_6=5, var_1_7=5, var_1_8=1, var_1_9=-255] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=8, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=-1, var_1_14=999, var_1_15=2, var_1_16=8, var_1_1=9999, var_1_2=1, var_1_3=1, var_1_4=1, var_1_6=5, var_1_7=5, var_1_8=1, var_1_9=-255] [L97] RET assume_abort_if_not(var_1_13 <= 2147483647) VAL [isInitial=1, last_1_var_1_16=8, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=-1, var_1_14=999, var_1_15=2, var_1_16=8, var_1_1=9999, var_1_2=1, var_1_3=1, var_1_4=1, var_1_6=5, var_1_7=5, var_1_8=1, var_1_9=-255] [L98] var_1_14 = __VERIFIER_nondet_long() [L99] CALL assume_abort_if_not(var_1_14 >= -2147483648) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=8, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=-1, var_1_14=1, var_1_15=2, var_1_16=8, var_1_1=9999, var_1_2=1, var_1_3=1, var_1_4=1, var_1_6=5, var_1_7=5, var_1_8=1, var_1_9=-255] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=8, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=-1, var_1_14=1, var_1_15=2, var_1_16=8, var_1_1=9999, var_1_2=1, var_1_3=1, var_1_4=1, var_1_6=5, var_1_7=5, var_1_8=1, var_1_9=-255] [L99] RET assume_abort_if_not(var_1_14 >= -2147483648) VAL [isInitial=1, last_1_var_1_16=8, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=-1, var_1_14=1, var_1_15=2, var_1_16=8, var_1_1=9999, var_1_2=1, var_1_3=1, var_1_4=1, var_1_6=5, var_1_7=5, var_1_8=1, var_1_9=-255] [L100] CALL assume_abort_if_not(var_1_14 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=8, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=-1, var_1_14=1, var_1_15=2, var_1_16=8, var_1_1=9999, var_1_2=1, var_1_3=1, var_1_4=1, var_1_6=5, var_1_7=5, var_1_8=1, var_1_9=-255] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=8, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=-1, var_1_14=1, var_1_15=2, var_1_16=8, var_1_1=9999, var_1_2=1, var_1_3=1, var_1_4=1, var_1_6=5, var_1_7=5, var_1_8=1, var_1_9=-255] [L100] RET assume_abort_if_not(var_1_14 <= 2147483647) VAL [isInitial=1, last_1_var_1_16=8, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=-1, var_1_14=1, var_1_15=2, var_1_16=8, var_1_1=9999, var_1_2=1, var_1_3=1, var_1_4=1, var_1_6=5, var_1_7=5, var_1_8=1, var_1_9=-255] [L114] RET updateVariables() [L115] CALL step() [L42] var_1_1 = (var_1_2 - var_1_3) VAL [isInitial=1, last_1_var_1_16=8, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=-1, var_1_14=1, var_1_15=2, var_1_16=8, var_1_1=0, var_1_2=1, var_1_3=1, var_1_4=1, var_1_6=5, var_1_7=5, var_1_8=1, var_1_9=-255] [L43] COND FALSE !((- var_1_5) >= var_1_6) VAL [isInitial=1, last_1_var_1_16=8, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=-1, var_1_14=1, var_1_15=2, var_1_16=8, var_1_1=0, var_1_2=1, var_1_3=1, var_1_4=1, var_1_5=4, var_1_6=5, var_1_7=5, var_1_8=1, var_1_9=-255] [L52] unsigned char stepLocal_0 = var_1_9; VAL [isInitial=1, last_1_var_1_16=8, stepLocal_0=-255, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=-1, var_1_14=1, var_1_15=2, var_1_16=8, var_1_1=0, var_1_2=1, var_1_3=1, var_1_4=1, var_1_5=4, var_1_6=5, var_1_7=5, var_1_8=1, var_1_9=-255] [L53] COND TRUE var_1_8 && stepLocal_0 [L54] var_1_7 = ((var_1_10 - var_1_11) + (var_1_12 + (var_1_13 + var_1_14))) VAL [isInitial=1, last_1_var_1_16=8, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=-1, var_1_14=1, var_1_15=2, var_1_16=8, var_1_1=0, var_1_2=1, var_1_3=1, var_1_4=1, var_1_5=4, var_1_6=5, var_1_7=0, var_1_8=1, var_1_9=-255] [L56] var_1_15 = 500.25 VAL [isInitial=1, last_1_var_1_16=8, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=-1, var_1_14=1, var_1_16=8, var_1_1=0, var_1_2=1, var_1_3=1, var_1_4=1, var_1_5=4, var_1_6=5, var_1_7=0, var_1_8=1, var_1_9=-255] [L57] COND FALSE !(var_1_2 > last_1_var_1_16) [L64] var_1_16 = var_1_12 VAL [isInitial=1, last_1_var_1_16=8, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=-1, var_1_14=1, var_1_16=0, var_1_1=0, var_1_2=1, var_1_3=1, var_1_4=1, var_1_5=4, var_1_6=5, var_1_7=0, var_1_8=1, var_1_9=-255] [L115] RET step() [L116] CALL, EXPR property() [L106-L107] return ((((var_1_1 == ((signed long int) (var_1_2 - var_1_3))) && (((- var_1_5) >= var_1_6) ? ((var_1_6 > var_1_5) ? ((var_1_3 == var_1_1) ? (var_1_4 == ((signed long int) (256 - (var_1_5 + 5)))) : (var_1_4 == ((signed long int) var_1_5))) : 1) : 1)) && ((var_1_8 && var_1_9) ? (var_1_7 == ((signed long int) ((var_1_10 - var_1_11) + (var_1_12 + (var_1_13 + var_1_14))))) : 1)) && (var_1_15 == ((signed long int) 500.25))) && ((var_1_2 > last_1_var_1_16) ? (var_1_9 ? ((var_1_3 <= ((((last_1_var_1_16) < (var_1_11)) ? (last_1_var_1_16) : (var_1_11)))) ? (var_1_16 == ((signed long int) (var_1_14 + var_1_11))) : 1) : 1) : (var_1_16 == ((signed long int) var_1_12))) ; [L116] RET, EXPR property() [L116] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_16=8, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=-1, var_1_14=1, var_1_15=10000, var_1_16=0, var_1_1=0, var_1_2=1, var_1_3=1, var_1_4=1, var_1_5=4, var_1_6=5, var_1_7=0, var_1_8=1, var_1_9=-255] [L19] reach_error() VAL [isInitial=1, last_1_var_1_16=8, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=-1, var_1_14=1, var_1_15=10000, var_1_16=0, var_1_1=0, var_1_2=1, var_1_3=1, var_1_4=1, var_1_5=4, var_1_6=5, var_1_7=0, var_1_8=1, var_1_9=-255] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 55 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.0s, 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, 78 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 0 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3 IncrementalHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 0 mSolverCounterUnsat, 78 mSDtfsCounter, 3 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=55occurred in iteration=0, InterpolantAutomatonStates: 2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.3s InterpolantComputationTime, 262 NumberOfCodeBlocks, 262 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 130 ConstructedInterpolants, 0 QuantifiedInterpolants, 130 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-10-24 08:57:00,191 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-60.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 06dfea34f20cf44667f72790239eb3b7ea493d794e5649e0b17ceb748f3093ee --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4a390ef-m [2024-10-24 08:57:02,359 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-24 08:57:02,444 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-10-24 08:57:02,451 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-24 08:57:02,452 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-24 08:57:02,483 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-24 08:57:02,486 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-24 08:57:02,486 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-24 08:57:02,487 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-24 08:57:02,488 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-24 08:57:02,488 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-24 08:57:02,488 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-24 08:57:02,489 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-24 08:57:02,489 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-24 08:57:02,489 INFO L153 SettingsManager]: * Use SBE=true [2024-10-24 08:57:02,490 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-24 08:57:02,490 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-24 08:57:02,490 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-24 08:57:02,490 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-24 08:57:02,491 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-24 08:57:02,491 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-24 08:57:02,496 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-24 08:57:02,496 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-24 08:57:02,497 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-24 08:57:02,497 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-24 08:57:02,497 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-24 08:57:02,497 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-24 08:57:02,498 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-24 08:57:02,498 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-24 08:57:02,498 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-24 08:57:02,498 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-24 08:57:02,499 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-24 08:57:02,499 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-24 08:57:02,499 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-24 08:57:02,499 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 08:57:02,499 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-24 08:57:02,500 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-24 08:57:02,500 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-24 08:57:02,500 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-24 08:57:02,501 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-24 08:57:02,501 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-24 08:57:02,502 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-24 08:57:02,502 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-24 08:57:02,502 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-24 08:57:02,502 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-24 08:57:02,502 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 -> 06dfea34f20cf44667f72790239eb3b7ea493d794e5649e0b17ceb748f3093ee [2024-10-24 08:57:02,802 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-24 08:57:02,825 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-24 08:57:02,827 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-24 08:57:02,828 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-24 08:57:02,830 INFO L274 PluginConnector]: CDTParser initialized [2024-10-24 08:57:02,831 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-60.i [2024-10-24 08:57:04,337 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-24 08:57:04,567 INFO L384 CDTParser]: Found 1 translation units. [2024-10-24 08:57:04,569 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-60.i [2024-10-24 08:57:04,580 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0fe43af6e/2a661c396b9244b4978c866935eff166/FLAG5dfae15c8 [2024-10-24 08:57:04,917 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0fe43af6e/2a661c396b9244b4978c866935eff166 [2024-10-24 08:57:04,919 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-24 08:57:04,920 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-24 08:57:04,923 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-24 08:57:04,923 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-24 08:57:04,928 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-24 08:57:04,929 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 08:57:04" (1/1) ... [2024-10-24 08:57:04,930 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@53833499 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:57:04, skipping insertion in model container [2024-10-24 08:57:04,930 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 08:57:04" (1/1) ... [2024-10-24 08:57:04,956 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 08:57:05,136 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-60.i[916,929] [2024-10-24 08:57:05,183 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 08:57:05,198 INFO L200 MainTranslator]: Completed pre-run [2024-10-24 08:57:05,210 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-60.i[916,929] [2024-10-24 08:57:05,235 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 08:57:05,260 INFO L204 MainTranslator]: Completed translation [2024-10-24 08:57:05,261 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:57:05 WrapperNode [2024-10-24 08:57:05,261 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-24 08:57:05,273 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-24 08:57:05,274 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-24 08:57:05,274 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-24 08:57:05,281 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:57:05" (1/1) ... [2024-10-24 08:57:05,299 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:57:05" (1/1) ... [2024-10-24 08:57:05,330 INFO L138 Inliner]: procedures = 27, calls = 35, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 122 [2024-10-24 08:57:05,331 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-24 08:57:05,332 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-24 08:57:05,332 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-24 08:57:05,333 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-24 08:57:05,343 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:57:05" (1/1) ... [2024-10-24 08:57:05,343 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:57:05" (1/1) ... [2024-10-24 08:57:05,346 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:57:05" (1/1) ... [2024-10-24 08:57:05,362 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-24 08:57:05,366 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:57:05" (1/1) ... [2024-10-24 08:57:05,366 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:57:05" (1/1) ... [2024-10-24 08:57:05,373 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:57:05" (1/1) ... [2024-10-24 08:57:05,380 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:57:05" (1/1) ... [2024-10-24 08:57:05,384 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:57:05" (1/1) ... [2024-10-24 08:57:05,389 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:57:05" (1/1) ... [2024-10-24 08:57:05,392 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-24 08:57:05,395 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-24 08:57:05,395 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-24 08:57:05,396 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-24 08:57:05,396 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:57:05" (1/1) ... [2024-10-24 08:57:05,402 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 08:57:05,411 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 08:57:05,426 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-10-24 08:57:05,431 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-10-24 08:57:05,472 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-24 08:57:05,473 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-24 08:57:05,473 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-24 08:57:05,473 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-24 08:57:05,474 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-24 08:57:05,474 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-24 08:57:05,565 INFO L238 CfgBuilder]: Building ICFG [2024-10-24 08:57:05,567 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-24 08:57:05,850 INFO L? ?]: Removed 10 outVars from TransFormulas that were not future-live. [2024-10-24 08:57:05,851 INFO L287 CfgBuilder]: Performing block encoding [2024-10-24 08:57:05,906 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-24 08:57:05,907 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-24 08:57:05,907 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 08:57:05 BoogieIcfgContainer [2024-10-24 08:57:05,908 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-24 08:57:05,910 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-24 08:57:05,911 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-24 08:57:05,914 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-24 08:57:05,914 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 08:57:04" (1/3) ... [2024-10-24 08:57:05,916 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@26672703 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 08:57:05, skipping insertion in model container [2024-10-24 08:57:05,916 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:57:05" (2/3) ... [2024-10-24 08:57:05,929 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@26672703 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 08:57:05, skipping insertion in model container [2024-10-24 08:57:05,929 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 08:57:05" (3/3) ... [2024-10-24 08:57:05,931 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_floatingpointinfluence_no-floats_file-60.i [2024-10-24 08:57:05,947 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-24 08:57:05,947 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-24 08:57:06,000 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-24 08:57:06,006 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;@3638b6e9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-24 08:57:06,006 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-24 08:57:06,010 INFO L276 IsEmpty]: Start isEmpty. Operand has 55 states, 30 states have (on average 1.4) internal successors, (42), 31 states have internal predecessors, (42), 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-10-24 08:57:06,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2024-10-24 08:57:06,021 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 08:57:06,022 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] [2024-10-24 08:57:06,022 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 08:57:06,026 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 08:57:06,026 INFO L85 PathProgramCache]: Analyzing trace with hash 1664830328, now seen corresponding path program 1 times [2024-10-24 08:57:06,036 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 08:57:06,037 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [954034084] [2024-10-24 08:57:06,037 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 08:57:06,037 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 08:57:06,037 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 08:57:06,040 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-10-24 08:57:06,041 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-10-24 08:57:06,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:57:06,226 INFO L255 TraceCheckSpWp]: Trace formula consists of 208 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-24 08:57:06,236 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 08:57:06,298 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 194 proven. 0 refuted. 0 times theorem prover too weak. 730 trivial. 0 not checked. [2024-10-24 08:57:06,302 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 08:57:06,303 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 08:57:06,303 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [954034084] [2024-10-24 08:57:06,304 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [954034084] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 08:57:06,304 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 08:57:06,304 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 08:57:06,306 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2114983016] [2024-10-24 08:57:06,306 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 08:57:06,313 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-24 08:57:06,313 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 08:57:06,338 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-24 08:57:06,339 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-24 08:57:06,342 INFO L87 Difference]: Start difference. First operand has 55 states, 30 states have (on average 1.4) internal successors, (42), 31 states have internal predecessors, (42), 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 14.0) internal successors, (28), 2 states have internal predecessors, (28), 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-10-24 08:57:06,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 08:57:06,398 INFO L93 Difference]: Finished difference Result 107 states and 192 transitions. [2024-10-24 08:57:06,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-24 08:57:06,402 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 2 states have call successors, (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 131 [2024-10-24 08:57:06,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 08:57:06,410 INFO L225 Difference]: With dead ends: 107 [2024-10-24 08:57:06,411 INFO L226 Difference]: Without dead ends: 53 [2024-10-24 08:57:06,415 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 130 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-24 08:57:06,429 INFO L432 NwaCegarLoop]: 78 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 78 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 08:57:06,432 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 78 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 08:57:06,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2024-10-24 08:57:06,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2024-10-24 08:57:06,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 29 states have (on average 1.2758620689655173) internal successors, (37), 29 states have internal predecessors, (37), 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-10-24 08:57:06,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 81 transitions. [2024-10-24 08:57:06,478 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 81 transitions. Word has length 131 [2024-10-24 08:57:06,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 08:57:06,480 INFO L471 AbstractCegarLoop]: Abstraction has 53 states and 81 transitions. [2024-10-24 08:57:06,480 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 2 states have call successors, (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-10-24 08:57:06,480 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 81 transitions. [2024-10-24 08:57:06,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2024-10-24 08:57:06,486 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 08:57:06,486 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] [2024-10-24 08:57:06,492 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-10-24 08:57:06,687 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-10-24 08:57:06,688 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 08:57:06,688 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 08:57:06,689 INFO L85 PathProgramCache]: Analyzing trace with hash 1120922168, now seen corresponding path program 1 times [2024-10-24 08:57:06,690 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 08:57:06,690 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1467999731] [2024-10-24 08:57:06,690 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 08:57:06,691 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 08:57:06,691 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 08:57:06,692 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-10-24 08:57:06,694 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-10-24 08:57:06,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:57:06,799 INFO L255 TraceCheckSpWp]: Trace formula consists of 208 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-24 08:57:06,808 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 08:57:22,694 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2024-10-24 08:57:22,694 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 08:57:22,695 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 08:57:22,695 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1467999731] [2024-10-24 08:57:22,696 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1467999731] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 08:57:22,697 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 08:57:22,697 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-24 08:57:22,698 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1507932665] [2024-10-24 08:57:22,698 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 08:57:22,700 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-24 08:57:22,701 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 08:57:22,702 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-24 08:57:22,702 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2024-10-24 08:57:22,703 INFO L87 Difference]: Start difference. First operand 53 states and 81 transitions. Second operand has 8 states, 8 states have (on average 3.0) internal successors, (24), 8 states have internal predecessors, (24), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-10-24 08:57:23,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 08:57:23,268 INFO L93 Difference]: Finished difference Result 82 states and 117 transitions. [2024-10-24 08:57:23,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-24 08:57:23,270 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.0) internal successors, (24), 8 states have internal predecessors, (24), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 131 [2024-10-24 08:57:23,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 08:57:23,273 INFO L225 Difference]: With dead ends: 82 [2024-10-24 08:57:23,273 INFO L226 Difference]: Without dead ends: 80 [2024-10-24 08:57:23,274 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 124 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2024-10-24 08:57:23,275 INFO L432 NwaCegarLoop]: 73 mSDtfsCounter, 64 mSDsluCounter, 186 mSDsCounter, 0 mSdLazyCounter, 99 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 259 SdHoareTripleChecker+Invalid, 100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 99 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-24 08:57:23,276 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 259 Invalid, 100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 99 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-24 08:57:23,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2024-10-24 08:57:23,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 59. [2024-10-24 08:57:23,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 35 states have (on average 1.2857142857142858) internal successors, (45), 35 states have internal predecessors, (45), 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-10-24 08:57:23,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 89 transitions. [2024-10-24 08:57:23,290 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 89 transitions. Word has length 131 [2024-10-24 08:57:23,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 08:57:23,292 INFO L471 AbstractCegarLoop]: Abstraction has 59 states and 89 transitions. [2024-10-24 08:57:23,292 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.0) internal successors, (24), 8 states have internal predecessors, (24), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-10-24 08:57:23,293 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 89 transitions. [2024-10-24 08:57:23,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2024-10-24 08:57:23,295 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 08:57:23,295 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] [2024-10-24 08:57:23,301 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 (3)] Ended with exit code 0 [2024-10-24 08:57:23,495 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 08:57:23,496 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 08:57:23,497 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 08:57:23,497 INFO L85 PathProgramCache]: Analyzing trace with hash 1178180470, now seen corresponding path program 1 times [2024-10-24 08:57:23,498 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 08:57:23,498 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [191574724] [2024-10-24 08:57:23,498 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 08:57:23,498 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 08:57:23,499 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 08:57:23,500 INFO L229 MonitoredProcess]: Starting monitored process 4 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-10-24 08:57:23,502 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 (4)] Waiting until timeout for monitored process [2024-10-24 08:57:23,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:57:23,607 INFO L255 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-10-24 08:57:23,613 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 08:57:49,555 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 483 proven. 30 refuted. 0 times theorem prover too weak. 411 trivial. 0 not checked. [2024-10-24 08:57:49,555 INFO L311 TraceCheckSpWp]: Computing backward predicates...