./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-18.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a046e57d 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_codestructure_steplocals_file-18.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 2db4ee6ab2547d99b135ecffc9585a13a3b138179a031ae5abb4b8a595740e3e --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-13 00:10:11,888 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-13 00:10:11,963 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-13 00:10:11,967 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-13 00:10:11,967 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-13 00:10:12,002 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-13 00:10:12,003 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-13 00:10:12,003 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-13 00:10:12,004 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-13 00:10:12,006 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-13 00:10:12,006 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-13 00:10:12,006 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-13 00:10:12,007 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-13 00:10:12,007 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-13 00:10:12,009 INFO L153 SettingsManager]: * Use SBE=true [2024-10-13 00:10:12,010 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-13 00:10:12,010 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-13 00:10:12,010 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-13 00:10:12,011 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-13 00:10:12,011 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-13 00:10:12,011 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-13 00:10:12,012 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-13 00:10:12,016 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-13 00:10:12,017 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-13 00:10:12,017 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-13 00:10:12,017 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-13 00:10:12,017 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-13 00:10:12,018 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-13 00:10:12,018 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-13 00:10:12,018 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-13 00:10:12,018 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-13 00:10:12,019 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-13 00:10:12,019 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 00:10:12,019 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-13 00:10:12,020 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-13 00:10:12,020 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-13 00:10:12,020 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-13 00:10:12,020 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-13 00:10:12,020 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-13 00:10:12,021 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-13 00:10:12,021 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-13 00:10:12,021 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-13 00:10:12,022 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 -> 2db4ee6ab2547d99b135ecffc9585a13a3b138179a031ae5abb4b8a595740e3e [2024-10-13 00:10:12,353 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-13 00:10:12,382 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-13 00:10:12,387 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-13 00:10:12,389 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-13 00:10:12,389 INFO L274 PluginConnector]: CDTParser initialized [2024-10-13 00:10:12,390 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-18.i [2024-10-13 00:10:13,897 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-13 00:10:14,171 INFO L384 CDTParser]: Found 1 translation units. [2024-10-13 00:10:14,172 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-18.i [2024-10-13 00:10:14,184 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/73fdda564/db08529525cf406fbaee1e726182887d/FLAGebeb97431 [2024-10-13 00:10:14,510 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/73fdda564/db08529525cf406fbaee1e726182887d [2024-10-13 00:10:14,513 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-13 00:10:14,514 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-13 00:10:14,515 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-13 00:10:14,515 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-13 00:10:14,521 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-13 00:10:14,521 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 12:10:14" (1/1) ... [2024-10-13 00:10:14,522 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@12c930b2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:10:14, skipping insertion in model container [2024-10-13 00:10:14,523 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 12:10:14" (1/1) ... [2024-10-13 00:10:14,567 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 00:10:14,757 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-18.i[917,930] [2024-10-13 00:10:14,809 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 00:10:14,821 INFO L200 MainTranslator]: Completed pre-run [2024-10-13 00:10:14,833 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-18.i[917,930] [2024-10-13 00:10:14,858 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 00:10:14,878 INFO L204 MainTranslator]: Completed translation [2024-10-13 00:10:14,879 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:10:14 WrapperNode [2024-10-13 00:10:14,879 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-13 00:10:14,880 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-13 00:10:14,881 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-13 00:10:14,881 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-13 00:10:14,888 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:10:14" (1/1) ... [2024-10-13 00:10:14,899 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:10:14" (1/1) ... [2024-10-13 00:10:14,940 INFO L138 Inliner]: procedures = 26, calls = 32, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 143 [2024-10-13 00:10:14,940 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-13 00:10:14,944 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-13 00:10:14,945 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-13 00:10:14,945 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-13 00:10:14,963 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:10:14" (1/1) ... [2024-10-13 00:10:14,963 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:10:14" (1/1) ... [2024-10-13 00:10:14,967 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:10:14" (1/1) ... [2024-10-13 00:10:14,986 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-13 00:10:14,988 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:10:14" (1/1) ... [2024-10-13 00:10:14,988 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:10:14" (1/1) ... [2024-10-13 00:10:15,003 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:10:14" (1/1) ... [2024-10-13 00:10:15,007 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:10:14" (1/1) ... [2024-10-13 00:10:15,009 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:10:14" (1/1) ... [2024-10-13 00:10:15,014 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:10:14" (1/1) ... [2024-10-13 00:10:15,019 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-13 00:10:15,020 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-13 00:10:15,020 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-13 00:10:15,020 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-13 00:10:15,021 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:10:14" (1/1) ... [2024-10-13 00:10:15,026 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 00:10:15,038 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 00:10:15,059 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-13 00:10:15,062 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-13 00:10:15,114 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-13 00:10:15,115 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-13 00:10:15,116 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-13 00:10:15,116 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-13 00:10:15,116 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-13 00:10:15,117 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-13 00:10:15,217 INFO L238 CfgBuilder]: Building ICFG [2024-10-13 00:10:15,227 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-13 00:10:15,553 INFO L? ?]: Removed 14 outVars from TransFormulas that were not future-live. [2024-10-13 00:10:15,555 INFO L287 CfgBuilder]: Performing block encoding [2024-10-13 00:10:15,602 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-13 00:10:15,603 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-13 00:10:15,603 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 12:10:15 BoogieIcfgContainer [2024-10-13 00:10:15,604 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-13 00:10:15,606 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-13 00:10:15,606 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-13 00:10:15,609 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-13 00:10:15,610 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 12:10:14" (1/3) ... [2024-10-13 00:10:15,610 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@22db5280 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 12:10:15, skipping insertion in model container [2024-10-13 00:10:15,611 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:10:14" (2/3) ... [2024-10-13 00:10:15,611 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@22db5280 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 12:10:15, skipping insertion in model container [2024-10-13 00:10:15,611 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 12:10:15" (3/3) ... [2024-10-13 00:10:15,612 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_codestructure_steplocals_file-18.i [2024-10-13 00:10:15,631 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-13 00:10:15,631 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-13 00:10:15,701 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-13 00:10:15,708 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;@6c17aa58, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-13 00:10:15,708 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-13 00:10:15,712 INFO L276 IsEmpty]: Start isEmpty. Operand has 59 states, 37 states have (on average 1.4324324324324325) internal successors, (53), 38 states have internal predecessors, (53), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-10-13 00:10:15,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2024-10-13 00:10:15,722 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 00:10:15,723 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 00:10:15,724 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 00:10:15,729 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 00:10:15,729 INFO L85 PathProgramCache]: Analyzing trace with hash 424614068, now seen corresponding path program 1 times [2024-10-13 00:10:15,738 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 00:10:15,738 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [141558686] [2024-10-13 00:10:15,739 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 00:10:15,739 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 00:10:15,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:10:16,017 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 00:10:16,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:10:16,036 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 00:10:16,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:10:16,045 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 00:10:16,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:10:16,057 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-13 00:10:16,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:10:16,074 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-13 00:10:16,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:10:16,088 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-13 00:10:16,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:10:16,094 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-13 00:10:16,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:10:16,107 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-13 00:10:16,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:10:16,121 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-10-13 00:10:16,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:10:16,133 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-13 00:10:16,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:10:16,143 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-13 00:10:16,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:10:16,157 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-13 00:10:16,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:10:16,164 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-13 00:10:16,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:10:16,171 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-13 00:10:16,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:10:16,178 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-10-13 00:10:16,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:10:16,183 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-10-13 00:10:16,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:10:16,189 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-10-13 00:10:16,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:10:16,195 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-10-13 00:10:16,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:10:16,200 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-13 00:10:16,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:10:16,213 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-10-13 00:10:16,214 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 00:10:16,214 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [141558686] [2024-10-13 00:10:16,216 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [141558686] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 00:10:16,216 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 00:10:16,217 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 00:10:16,219 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1787424608] [2024-10-13 00:10:16,220 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 00:10:16,225 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-13 00:10:16,226 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 00:10:16,254 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-13 00:10:16,255 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-13 00:10:16,257 INFO L87 Difference]: Start difference. First operand has 59 states, 37 states have (on average 1.4324324324324325) internal successors, (53), 38 states have internal predecessors, (53), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) Second operand has 2 states, 2 states have (on average 15.0) internal successors, (30), 2 states have internal predecessors, (30), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2024-10-13 00:10:16,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 00:10:16,298 INFO L93 Difference]: Finished difference Result 115 states and 199 transitions. [2024-10-13 00:10:16,301 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-13 00:10:16,302 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 15.0) internal successors, (30), 2 states have internal predecessors, (30), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) Word has length 122 [2024-10-13 00:10:16,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 00:10:16,314 INFO L225 Difference]: With dead ends: 115 [2024-10-13 00:10:16,314 INFO L226 Difference]: Without dead ends: 57 [2024-10-13 00:10:16,320 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 59 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-13 00:10:16,327 INFO L432 NwaCegarLoop]: 83 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, 83 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-13 00:10:16,328 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 83 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 00:10:16,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2024-10-13 00:10:16,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2024-10-13 00:10:16,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 36 states have (on average 1.3333333333333333) internal successors, (48), 36 states have internal predecessors, (48), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-10-13 00:10:16,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 86 transitions. [2024-10-13 00:10:16,381 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 86 transitions. Word has length 122 [2024-10-13 00:10:16,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 00:10:16,384 INFO L471 AbstractCegarLoop]: Abstraction has 57 states and 86 transitions. [2024-10-13 00:10:16,385 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 15.0) internal successors, (30), 2 states have internal predecessors, (30), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2024-10-13 00:10:16,385 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 86 transitions. [2024-10-13 00:10:16,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2024-10-13 00:10:16,390 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 00:10:16,391 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 00:10:16,391 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-13 00:10:16,392 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 00:10:16,392 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 00:10:16,392 INFO L85 PathProgramCache]: Analyzing trace with hash -968456322, now seen corresponding path program 1 times [2024-10-13 00:10:16,393 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 00:10:16,393 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2112722939] [2024-10-13 00:10:16,393 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 00:10:16,393 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 00:10:16,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 00:10:16,610 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-13 00:10:16,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 00:10:16,765 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-13 00:10:16,765 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-13 00:10:16,768 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-13 00:10:16,770 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-13 00:10:16,774 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1] [2024-10-13 00:10:16,882 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-13 00:10:16,886 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.10 12:10:16 BoogieIcfgContainer [2024-10-13 00:10:16,887 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-13 00:10:16,888 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-13 00:10:16,888 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-13 00:10:16,888 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-13 00:10:16,889 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 12:10:15" (3/4) ... [2024-10-13 00:10:16,891 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-13 00:10:16,893 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-13 00:10:16,897 INFO L158 Benchmark]: Toolchain (without parser) took 2379.93ms. Allocated memory is still 176.2MB. Free memory was 145.1MB in the beginning and 58.9MB in the end (delta: 86.2MB). Peak memory consumption was 84.6MB. Max. memory is 16.1GB. [2024-10-13 00:10:16,897 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 104.9MB. Free memory is still 76.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-13 00:10:16,897 INFO L158 Benchmark]: CACSL2BoogieTranslator took 364.48ms. Allocated memory is still 176.2MB. Free memory was 145.1MB in the beginning and 129.8MB in the end (delta: 15.3MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-10-13 00:10:16,898 INFO L158 Benchmark]: Boogie Procedure Inliner took 60.16ms. Allocated memory is still 176.2MB. Free memory was 129.8MB in the beginning and 126.7MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-13 00:10:16,898 INFO L158 Benchmark]: Boogie Preprocessor took 74.64ms. Allocated memory is still 176.2MB. Free memory was 126.7MB in the beginning and 123.5MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-13 00:10:16,898 INFO L158 Benchmark]: RCFGBuilder took 583.75ms. Allocated memory is still 176.2MB. Free memory was 123.5MB in the beginning and 131.2MB in the end (delta: -7.7MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-10-13 00:10:16,899 INFO L158 Benchmark]: TraceAbstraction took 1281.48ms. Allocated memory is still 176.2MB. Free memory was 131.2MB in the beginning and 58.9MB in the end (delta: 72.4MB). Peak memory consumption was 73.4MB. Max. memory is 16.1GB. [2024-10-13 00:10:16,903 INFO L158 Benchmark]: Witness Printer took 5.31ms. Allocated memory is still 176.2MB. Free memory is still 58.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-13 00:10:16,905 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.16ms. Allocated memory is still 104.9MB. Free memory is still 76.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 364.48ms. Allocated memory is still 176.2MB. Free memory was 145.1MB in the beginning and 129.8MB in the end (delta: 15.3MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 60.16ms. Allocated memory is still 176.2MB. Free memory was 129.8MB in the beginning and 126.7MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 74.64ms. Allocated memory is still 176.2MB. Free memory was 126.7MB in the beginning and 123.5MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 583.75ms. Allocated memory is still 176.2MB. Free memory was 123.5MB in the beginning and 131.2MB in the end (delta: -7.7MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * TraceAbstraction took 1281.48ms. Allocated memory is still 176.2MB. Free memory was 131.2MB in the beginning and 58.9MB in the end (delta: 72.4MB). Peak memory consumption was 73.4MB. Max. memory is 16.1GB. * Witness Printer took 5.31ms. Allocated memory is still 176.2MB. Free memory is still 58.9MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 131, overapproximation of someBinaryArithmeticDOUBLEoperation at line 87, overapproximation of someBinaryDOUBLEComparisonOperation at line 131, overapproximation of someBinaryArithmeticFLOAToperation at line 62. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed char var_1_1 = -1; [L23] float var_1_2 = 50.5; [L24] float var_1_3 = 32.4; [L25] float var_1_4 = 5.5; [L26] float var_1_5 = 255.475; [L27] float var_1_6 = 127.25; [L28] unsigned char var_1_7 = 0; [L29] signed char var_1_8 = -5; [L30] signed char var_1_9 = 2; [L31] unsigned char var_1_10 = 16; [L32] unsigned char var_1_11 = 16; [L33] float var_1_12 = 10000000.8; [L34] float var_1_13 = 127.7; [L35] float var_1_14 = 199.2; [L36] float var_1_15 = 999999.5; [L37] signed long int var_1_16 = -8; [L38] signed long int var_1_17 = 32; [L39] signed short int var_1_18 = -8; [L40] double var_1_19 = 5.4; [L135] isInitial = 1 [L136] FCALL initially() [L137] COND TRUE 1 [L138] FCALL updateLastVariables() [L139] CALL updateVariables() [L95] var_1_2 = __VERIFIER_nondet_float() [L96] CALL assume_abort_if_not((var_1_2 >= -922337.2036854776000e+13F && var_1_2 <= -1.0e-20F) || (var_1_2 <= 9223372.036854776000e+12F && var_1_2 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=16, var_1_11=16, var_1_12=50000004/5, var_1_13=1277/10, var_1_14=996/5, var_1_15=1999999/2, var_1_16=-8, var_1_17=32, var_1_18=-8, var_1_19=27/5, var_1_1=-1, var_1_3=162/5, var_1_4=11/2, var_1_5=10219/40, var_1_6=509/4, var_1_7=0, var_1_8=-5, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=16, var_1_11=16, var_1_12=50000004/5, var_1_13=1277/10, var_1_14=996/5, var_1_15=1999999/2, var_1_16=-8, var_1_17=32, var_1_18=-8, var_1_19=27/5, var_1_1=-1, var_1_3=162/5, var_1_4=11/2, var_1_5=10219/40, var_1_6=509/4, var_1_7=0, var_1_8=-5, var_1_9=2] [L96] RET assume_abort_if_not((var_1_2 >= -922337.2036854776000e+13F && var_1_2 <= -1.0e-20F) || (var_1_2 <= 9223372.036854776000e+12F && var_1_2 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=16, var_1_11=16, var_1_12=50000004/5, var_1_13=1277/10, var_1_14=996/5, var_1_15=1999999/2, var_1_16=-8, var_1_17=32, var_1_18=-8, var_1_19=27/5, var_1_1=-1, var_1_3=162/5, var_1_4=11/2, var_1_5=10219/40, var_1_6=509/4, var_1_7=0, var_1_8=-5, var_1_9=2] [L97] var_1_3 = __VERIFIER_nondet_float() [L98] CALL assume_abort_if_not((var_1_3 >= -922337.2036854776000e+13F && var_1_3 <= -1.0e-20F) || (var_1_3 <= 9223372.036854776000e+12F && var_1_3 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=16, var_1_11=16, var_1_12=50000004/5, var_1_13=1277/10, var_1_14=996/5, var_1_15=1999999/2, var_1_16=-8, var_1_17=32, var_1_18=-8, var_1_19=27/5, var_1_1=-1, var_1_4=11/2, var_1_5=10219/40, var_1_6=509/4, var_1_7=0, var_1_8=-5, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=16, var_1_11=16, var_1_12=50000004/5, var_1_13=1277/10, var_1_14=996/5, var_1_15=1999999/2, var_1_16=-8, var_1_17=32, var_1_18=-8, var_1_19=27/5, var_1_1=-1, var_1_4=11/2, var_1_5=10219/40, var_1_6=509/4, var_1_7=0, var_1_8=-5, var_1_9=2] [L98] RET assume_abort_if_not((var_1_3 >= -922337.2036854776000e+13F && var_1_3 <= -1.0e-20F) || (var_1_3 <= 9223372.036854776000e+12F && var_1_3 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=16, var_1_11=16, var_1_12=50000004/5, var_1_13=1277/10, var_1_14=996/5, var_1_15=1999999/2, var_1_16=-8, var_1_17=32, var_1_18=-8, var_1_19=27/5, var_1_1=-1, var_1_4=11/2, var_1_5=10219/40, var_1_6=509/4, var_1_7=0, var_1_8=-5, var_1_9=2] [L99] CALL assume_abort_if_not(var_1_3 != 0.0F) VAL [\old(cond)=1, isInitial=1, var_1_10=16, var_1_11=16, var_1_12=50000004/5, var_1_13=1277/10, var_1_14=996/5, var_1_15=1999999/2, var_1_16=-8, var_1_17=32, var_1_18=-8, var_1_19=27/5, var_1_1=-1, var_1_4=11/2, var_1_5=10219/40, var_1_6=509/4, var_1_7=0, var_1_8=-5, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=16, var_1_11=16, var_1_12=50000004/5, var_1_13=1277/10, var_1_14=996/5, var_1_15=1999999/2, var_1_16=-8, var_1_17=32, var_1_18=-8, var_1_19=27/5, var_1_1=-1, var_1_4=11/2, var_1_5=10219/40, var_1_6=509/4, var_1_7=0, var_1_8=-5, var_1_9=2] [L99] RET assume_abort_if_not(var_1_3 != 0.0F) VAL [isInitial=1, var_1_10=16, var_1_11=16, var_1_12=50000004/5, var_1_13=1277/10, var_1_14=996/5, var_1_15=1999999/2, var_1_16=-8, var_1_17=32, var_1_18=-8, var_1_19=27/5, var_1_1=-1, var_1_4=11/2, var_1_5=10219/40, var_1_6=509/4, var_1_7=0, var_1_8=-5, var_1_9=2] [L100] var_1_4 = __VERIFIER_nondet_float() [L101] CALL assume_abort_if_not((var_1_4 >= 0.0F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 9223372.036854776000e+12F && var_1_4 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=16, var_1_11=16, var_1_12=50000004/5, var_1_13=1277/10, var_1_14=996/5, var_1_15=1999999/2, var_1_16=-8, var_1_17=32, var_1_18=-8, var_1_19=27/5, var_1_1=-1, var_1_5=10219/40, var_1_6=509/4, var_1_7=0, var_1_8=-5, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=16, var_1_11=16, var_1_12=50000004/5, var_1_13=1277/10, var_1_14=996/5, var_1_15=1999999/2, var_1_16=-8, var_1_17=32, var_1_18=-8, var_1_19=27/5, var_1_1=-1, var_1_5=10219/40, var_1_6=509/4, var_1_7=0, var_1_8=-5, var_1_9=2] [L101] RET assume_abort_if_not((var_1_4 >= 0.0F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 9223372.036854776000e+12F && var_1_4 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=16, var_1_11=16, var_1_12=50000004/5, var_1_13=1277/10, var_1_14=996/5, var_1_15=1999999/2, var_1_16=-8, var_1_17=32, var_1_18=-8, var_1_19=27/5, var_1_1=-1, var_1_5=10219/40, var_1_6=509/4, var_1_7=0, var_1_8=-5, var_1_9=2] [L102] var_1_5 = __VERIFIER_nondet_float() [L103] CALL assume_abort_if_not((var_1_5 >= 0.0F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 9223372.036854776000e+12F && var_1_5 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=16, var_1_11=16, var_1_12=50000004/5, var_1_13=1277/10, var_1_14=996/5, var_1_15=1999999/2, var_1_16=-8, var_1_17=32, var_1_18=-8, var_1_19=27/5, var_1_1=-1, var_1_6=509/4, var_1_7=0, var_1_8=-5, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=16, var_1_11=16, var_1_12=50000004/5, var_1_13=1277/10, var_1_14=996/5, var_1_15=1999999/2, var_1_16=-8, var_1_17=32, var_1_18=-8, var_1_19=27/5, var_1_1=-1, var_1_6=509/4, var_1_7=0, var_1_8=-5, var_1_9=2] [L103] RET assume_abort_if_not((var_1_5 >= 0.0F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 9223372.036854776000e+12F && var_1_5 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=16, var_1_11=16, var_1_12=50000004/5, var_1_13=1277/10, var_1_14=996/5, var_1_15=1999999/2, var_1_16=-8, var_1_17=32, var_1_18=-8, var_1_19=27/5, var_1_1=-1, var_1_6=509/4, var_1_7=0, var_1_8=-5, var_1_9=2] [L104] var_1_6 = __VERIFIER_nondet_float() [L105] CALL assume_abort_if_not((var_1_6 >= -922337.2036854776000e+13F && var_1_6 <= -1.0e-20F) || (var_1_6 <= 9223372.036854776000e+12F && var_1_6 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=16, var_1_11=16, var_1_12=50000004/5, var_1_13=1277/10, var_1_14=996/5, var_1_15=1999999/2, var_1_16=-8, var_1_17=32, var_1_18=-8, var_1_19=27/5, var_1_1=-1, var_1_7=0, var_1_8=-5, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=16, var_1_11=16, var_1_12=50000004/5, var_1_13=1277/10, var_1_14=996/5, var_1_15=1999999/2, var_1_16=-8, var_1_17=32, var_1_18=-8, var_1_19=27/5, var_1_1=-1, var_1_7=0, var_1_8=-5, var_1_9=2] [L105] RET assume_abort_if_not((var_1_6 >= -922337.2036854776000e+13F && var_1_6 <= -1.0e-20F) || (var_1_6 <= 9223372.036854776000e+12F && var_1_6 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=16, var_1_11=16, var_1_12=50000004/5, var_1_13=1277/10, var_1_14=996/5, var_1_15=1999999/2, var_1_16=-8, var_1_17=32, var_1_18=-8, var_1_19=27/5, var_1_1=-1, var_1_7=0, var_1_8=-5, var_1_9=2] [L106] var_1_7 = __VERIFIER_nondet_uchar() [L107] CALL assume_abort_if_not(var_1_7 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=16, var_1_11=16, var_1_12=50000004/5, var_1_13=1277/10, var_1_14=996/5, var_1_15=1999999/2, var_1_16=-8, var_1_17=32, var_1_18=-8, var_1_19=27/5, var_1_1=-1, var_1_8=-5, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=16, var_1_11=16, var_1_12=50000004/5, var_1_13=1277/10, var_1_14=996/5, var_1_15=1999999/2, var_1_16=-8, var_1_17=32, var_1_18=-8, var_1_19=27/5, var_1_1=-1, var_1_8=-5, var_1_9=2] [L107] RET assume_abort_if_not(var_1_7 >= 0) VAL [isInitial=1, var_1_10=16, var_1_11=16, var_1_12=50000004/5, var_1_13=1277/10, var_1_14=996/5, var_1_15=1999999/2, var_1_16=-8, var_1_17=32, var_1_18=-8, var_1_19=27/5, var_1_1=-1, var_1_8=-5, var_1_9=2] [L108] CALL assume_abort_if_not(var_1_7 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=16, var_1_11=16, var_1_12=50000004/5, var_1_13=1277/10, var_1_14=996/5, var_1_15=1999999/2, var_1_16=-8, var_1_17=32, var_1_18=-8, var_1_19=27/5, var_1_1=-1, var_1_7=1, var_1_8=-5, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=16, var_1_11=16, var_1_12=50000004/5, var_1_13=1277/10, var_1_14=996/5, var_1_15=1999999/2, var_1_16=-8, var_1_17=32, var_1_18=-8, var_1_19=27/5, var_1_1=-1, var_1_7=1, var_1_8=-5, var_1_9=2] [L108] RET assume_abort_if_not(var_1_7 <= 1) VAL [isInitial=1, var_1_10=16, var_1_11=16, var_1_12=50000004/5, var_1_13=1277/10, var_1_14=996/5, var_1_15=1999999/2, var_1_16=-8, var_1_17=32, var_1_18=-8, var_1_19=27/5, var_1_1=-1, var_1_7=1, var_1_8=-5, var_1_9=2] [L109] var_1_8 = __VERIFIER_nondet_char() [L110] CALL assume_abort_if_not(var_1_8 >= -127) VAL [\old(cond)=1, isInitial=1, var_1_10=16, var_1_11=16, var_1_12=50000004/5, var_1_13=1277/10, var_1_14=996/5, var_1_15=1999999/2, var_1_16=-8, var_1_17=32, var_1_18=-8, var_1_19=27/5, var_1_1=-1, var_1_7=1, var_1_8=125, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=16, var_1_11=16, var_1_12=50000004/5, var_1_13=1277/10, var_1_14=996/5, var_1_15=1999999/2, var_1_16=-8, var_1_17=32, var_1_18=-8, var_1_19=27/5, var_1_1=-1, var_1_7=1, var_1_8=125, var_1_9=2] [L110] RET assume_abort_if_not(var_1_8 >= -127) VAL [isInitial=1, var_1_10=16, var_1_11=16, var_1_12=50000004/5, var_1_13=1277/10, var_1_14=996/5, var_1_15=1999999/2, var_1_16=-8, var_1_17=32, var_1_18=-8, var_1_19=27/5, var_1_1=-1, var_1_7=1, var_1_8=125, var_1_9=2] [L111] CALL assume_abort_if_not(var_1_8 <= 126) VAL [\old(cond)=1, isInitial=1, var_1_10=16, var_1_11=16, var_1_12=50000004/5, var_1_13=1277/10, var_1_14=996/5, var_1_15=1999999/2, var_1_16=-8, var_1_17=32, var_1_18=-8, var_1_19=27/5, var_1_1=-1, var_1_7=1, var_1_8=125, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=16, var_1_11=16, var_1_12=50000004/5, var_1_13=1277/10, var_1_14=996/5, var_1_15=1999999/2, var_1_16=-8, var_1_17=32, var_1_18=-8, var_1_19=27/5, var_1_1=-1, var_1_7=1, var_1_8=125, var_1_9=2] [L111] RET assume_abort_if_not(var_1_8 <= 126) VAL [isInitial=1, var_1_10=16, var_1_11=16, var_1_12=50000004/5, var_1_13=1277/10, var_1_14=996/5, var_1_15=1999999/2, var_1_16=-8, var_1_17=32, var_1_18=-8, var_1_19=27/5, var_1_1=-1, var_1_7=1, var_1_8=125, var_1_9=2] [L112] var_1_9 = __VERIFIER_nondet_char() [L113] CALL assume_abort_if_not(var_1_9 >= -127) VAL [\old(cond)=1, isInitial=1, var_1_10=16, var_1_11=16, var_1_12=50000004/5, var_1_13=1277/10, var_1_14=996/5, var_1_15=1999999/2, var_1_16=-8, var_1_17=32, var_1_18=-8, var_1_19=27/5, var_1_1=-1, var_1_7=1, var_1_8=125, var_1_9=126] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=16, var_1_11=16, var_1_12=50000004/5, var_1_13=1277/10, var_1_14=996/5, var_1_15=1999999/2, var_1_16=-8, var_1_17=32, var_1_18=-8, var_1_19=27/5, var_1_1=-1, var_1_7=1, var_1_8=125, var_1_9=126] [L113] RET assume_abort_if_not(var_1_9 >= -127) VAL [isInitial=1, var_1_10=16, var_1_11=16, var_1_12=50000004/5, var_1_13=1277/10, var_1_14=996/5, var_1_15=1999999/2, var_1_16=-8, var_1_17=32, var_1_18=-8, var_1_19=27/5, var_1_1=-1, var_1_7=1, var_1_8=125, var_1_9=126] [L114] CALL assume_abort_if_not(var_1_9 <= 126) VAL [\old(cond)=1, isInitial=1, var_1_10=16, var_1_11=16, var_1_12=50000004/5, var_1_13=1277/10, var_1_14=996/5, var_1_15=1999999/2, var_1_16=-8, var_1_17=32, var_1_18=-8, var_1_19=27/5, var_1_1=-1, var_1_7=1, var_1_8=125, var_1_9=126] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=16, var_1_11=16, var_1_12=50000004/5, var_1_13=1277/10, var_1_14=996/5, var_1_15=1999999/2, var_1_16=-8, var_1_17=32, var_1_18=-8, var_1_19=27/5, var_1_1=-1, var_1_7=1, var_1_8=125, var_1_9=126] [L114] RET assume_abort_if_not(var_1_9 <= 126) VAL [isInitial=1, var_1_10=16, var_1_11=16, var_1_12=50000004/5, var_1_13=1277/10, var_1_14=996/5, var_1_15=1999999/2, var_1_16=-8, var_1_17=32, var_1_18=-8, var_1_19=27/5, var_1_1=-1, var_1_7=1, var_1_8=125, var_1_9=126] [L115] var_1_11 = __VERIFIER_nondet_uchar() [L116] CALL assume_abort_if_not(var_1_11 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=16, var_1_12=50000004/5, var_1_13=1277/10, var_1_14=996/5, var_1_15=1999999/2, var_1_16=-8, var_1_17=32, var_1_18=-8, var_1_19=27/5, var_1_1=-1, var_1_7=1, var_1_8=125, var_1_9=126] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=16, var_1_12=50000004/5, var_1_13=1277/10, var_1_14=996/5, var_1_15=1999999/2, var_1_16=-8, var_1_17=32, var_1_18=-8, var_1_19=27/5, var_1_1=-1, var_1_7=1, var_1_8=125, var_1_9=126] [L116] RET assume_abort_if_not(var_1_11 >= 0) VAL [isInitial=1, var_1_10=16, var_1_12=50000004/5, var_1_13=1277/10, var_1_14=996/5, var_1_15=1999999/2, var_1_16=-8, var_1_17=32, var_1_18=-8, var_1_19=27/5, var_1_1=-1, var_1_7=1, var_1_8=125, var_1_9=126] [L117] CALL assume_abort_if_not(var_1_11 <= 254) VAL [\old(cond)=1, isInitial=1, var_1_10=16, var_1_11=125, var_1_12=50000004/5, var_1_13=1277/10, var_1_14=996/5, var_1_15=1999999/2, var_1_16=-8, var_1_17=32, var_1_18=-8, var_1_19=27/5, var_1_1=-1, var_1_7=1, var_1_8=125, var_1_9=126] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=16, var_1_11=125, var_1_12=50000004/5, var_1_13=1277/10, var_1_14=996/5, var_1_15=1999999/2, var_1_16=-8, var_1_17=32, var_1_18=-8, var_1_19=27/5, var_1_1=-1, var_1_7=1, var_1_8=125, var_1_9=126] [L117] RET assume_abort_if_not(var_1_11 <= 254) VAL [isInitial=1, var_1_10=16, var_1_11=125, var_1_12=50000004/5, var_1_13=1277/10, var_1_14=996/5, var_1_15=1999999/2, var_1_16=-8, var_1_17=32, var_1_18=-8, var_1_19=27/5, var_1_1=-1, var_1_7=1, var_1_8=125, var_1_9=126] [L118] var_1_13 = __VERIFIER_nondet_float() [L119] CALL assume_abort_if_not((var_1_13 >= -922337.2036854765600e+13F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854765600e+12F && var_1_13 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=16, var_1_11=125, var_1_12=50000004/5, var_1_14=996/5, var_1_15=1999999/2, var_1_16=-8, var_1_17=32, var_1_18=-8, var_1_19=27/5, var_1_1=-1, var_1_7=1, var_1_8=125, var_1_9=126] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=16, var_1_11=125, var_1_12=50000004/5, var_1_14=996/5, var_1_15=1999999/2, var_1_16=-8, var_1_17=32, var_1_18=-8, var_1_19=27/5, var_1_1=-1, var_1_7=1, var_1_8=125, var_1_9=126] [L119] RET assume_abort_if_not((var_1_13 >= -922337.2036854765600e+13F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854765600e+12F && var_1_13 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=16, var_1_11=125, var_1_12=50000004/5, var_1_14=996/5, var_1_15=1999999/2, var_1_16=-8, var_1_17=32, var_1_18=-8, var_1_19=27/5, var_1_1=-1, var_1_7=1, var_1_8=125, var_1_9=126] [L120] var_1_14 = __VERIFIER_nondet_float() [L121] CALL assume_abort_if_not((var_1_14 >= -461168.6018427382800e+13F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 4611686.018427382800e+12F && var_1_14 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=16, var_1_11=125, var_1_12=50000004/5, var_1_15=1999999/2, var_1_16=-8, var_1_17=32, var_1_18=-8, var_1_19=27/5, var_1_1=-1, var_1_7=1, var_1_8=125, var_1_9=126] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=16, var_1_11=125, var_1_12=50000004/5, var_1_15=1999999/2, var_1_16=-8, var_1_17=32, var_1_18=-8, var_1_19=27/5, var_1_1=-1, var_1_7=1, var_1_8=125, var_1_9=126] [L121] RET assume_abort_if_not((var_1_14 >= -461168.6018427382800e+13F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 4611686.018427382800e+12F && var_1_14 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=16, var_1_11=125, var_1_12=50000004/5, var_1_15=1999999/2, var_1_16=-8, var_1_17=32, var_1_18=-8, var_1_19=27/5, var_1_1=-1, var_1_7=1, var_1_8=125, var_1_9=126] [L122] var_1_15 = __VERIFIER_nondet_float() [L123] CALL assume_abort_if_not((var_1_15 >= -461168.6018427382800e+13F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 4611686.018427382800e+12F && var_1_15 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=16, var_1_11=125, var_1_12=50000004/5, var_1_16=-8, var_1_17=32, var_1_18=-8, var_1_19=27/5, var_1_1=-1, var_1_7=1, var_1_8=125, var_1_9=126] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=16, var_1_11=125, var_1_12=50000004/5, var_1_16=-8, var_1_17=32, var_1_18=-8, var_1_19=27/5, var_1_1=-1, var_1_7=1, var_1_8=125, var_1_9=126] [L123] RET assume_abort_if_not((var_1_15 >= -461168.6018427382800e+13F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 4611686.018427382800e+12F && var_1_15 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=16, var_1_11=125, var_1_12=50000004/5, var_1_16=-8, var_1_17=32, var_1_18=-8, var_1_19=27/5, var_1_1=-1, var_1_7=1, var_1_8=125, var_1_9=126] [L124] var_1_17 = __VERIFIER_nondet_long() [L125] CALL assume_abort_if_not(var_1_17 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=16, var_1_11=125, var_1_12=50000004/5, var_1_16=-8, var_1_17=2147483646, var_1_18=-8, var_1_19=27/5, var_1_1=-1, var_1_7=1, var_1_8=125, var_1_9=126] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=16, var_1_11=125, var_1_12=50000004/5, var_1_16=-8, var_1_17=2147483646, var_1_18=-8, var_1_19=27/5, var_1_1=-1, var_1_7=1, var_1_8=125, var_1_9=126] [L125] RET assume_abort_if_not(var_1_17 >= 0) VAL [isInitial=1, var_1_10=16, var_1_11=125, var_1_12=50000004/5, var_1_16=-8, var_1_17=2147483646, var_1_18=-8, var_1_19=27/5, var_1_1=-1, var_1_7=1, var_1_8=125, var_1_9=126] [L126] CALL assume_abort_if_not(var_1_17 <= 2147483646) VAL [\old(cond)=1, isInitial=1, var_1_10=16, var_1_11=125, var_1_12=50000004/5, var_1_16=-8, var_1_17=2147483646, var_1_18=-8, var_1_19=27/5, var_1_1=-1, var_1_7=1, var_1_8=125, var_1_9=126] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=16, var_1_11=125, var_1_12=50000004/5, var_1_16=-8, var_1_17=2147483646, var_1_18=-8, var_1_19=27/5, var_1_1=-1, var_1_7=1, var_1_8=125, var_1_9=126] [L126] RET assume_abort_if_not(var_1_17 <= 2147483646) VAL [isInitial=1, var_1_10=16, var_1_11=125, var_1_12=50000004/5, var_1_16=-8, var_1_17=2147483646, var_1_18=-8, var_1_19=27/5, var_1_1=-1, var_1_7=1, var_1_8=125, var_1_9=126] [L139] RET updateVariables() [L140] CALL step() [L44] COND FALSE !((var_1_2 / var_1_3) > ((var_1_4 - var_1_5) * var_1_6)) [L51] var_1_1 = var_1_8 VAL [isInitial=1, var_1_10=16, var_1_11=125, var_1_12=50000004/5, var_1_16=-8, var_1_17=2147483646, var_1_18=-8, var_1_19=27/5, var_1_1=125, var_1_7=1, var_1_8=125, var_1_9=126] [L53] signed char stepLocal_0 = var_1_1; VAL [isInitial=1, stepLocal_0=125, var_1_10=16, var_1_11=125, var_1_12=50000004/5, var_1_16=-8, var_1_17=2147483646, var_1_18=-8, var_1_19=27/5, var_1_1=125, var_1_7=1, var_1_8=125, var_1_9=126] [L54] COND FALSE !(var_1_9 < stepLocal_0) [L59] var_1_10 = var_1_11 VAL [isInitial=1, var_1_10=125, var_1_11=125, var_1_12=50000004/5, var_1_16=-8, var_1_17=2147483646, var_1_18=-8, var_1_19=27/5, var_1_1=125, var_1_7=1, var_1_8=125, var_1_9=126] [L61] COND TRUE var_1_5 <= (var_1_6 / var_1_3) [L62] var_1_12 = ((((var_1_13) > ((var_1_14 + var_1_15))) ? (var_1_13) : ((var_1_14 + var_1_15)))) VAL [isInitial=1, var_1_10=125, var_1_11=125, var_1_12=2147483776, var_1_13=2147483776, var_1_16=-8, var_1_17=2147483646, var_1_18=-8, var_1_19=27/5, var_1_1=125, var_1_7=1, var_1_8=125, var_1_9=126] [L66] COND TRUE \read(var_1_7) [L67] var_1_16 = var_1_8 VAL [isInitial=1, var_1_10=125, var_1_11=125, var_1_12=2147483776, var_1_13=2147483776, var_1_16=125, var_1_17=2147483646, var_1_18=-8, var_1_19=27/5, var_1_1=125, var_1_7=1, var_1_8=125, var_1_9=126] [L71] signed long int stepLocal_1 = var_1_10 + var_1_17; VAL [isInitial=1, stepLocal_1=2147483771, var_1_10=125, var_1_11=125, var_1_12=2147483776, var_1_13=2147483776, var_1_16=125, var_1_17=2147483646, var_1_18=-8, var_1_19=27/5, var_1_1=125, var_1_7=1, var_1_8=125, var_1_9=126] [L72] COND FALSE !(var_1_16 >= stepLocal_1) [L83] var_1_18 = var_1_8 VAL [isInitial=1, var_1_10=125, var_1_11=125, var_1_12=2147483776, var_1_13=2147483776, var_1_16=125, var_1_17=2147483646, var_1_18=125, var_1_19=27/5, var_1_1=125, var_1_7=1, var_1_8=125, var_1_9=126] [L85] signed char stepLocal_2 = var_1_9; VAL [isInitial=1, stepLocal_2=126, var_1_10=125, var_1_11=125, var_1_12=2147483776, var_1_13=2147483776, var_1_16=125, var_1_17=2147483646, var_1_18=125, var_1_19=27/5, var_1_1=125, var_1_7=1, var_1_8=125, var_1_9=126] [L86] COND TRUE ! (var_1_10 > var_1_1) [L87] var_1_19 = ((((var_1_13) > ((((((0.05 + var_1_15)) < (var_1_14)) ? ((0.05 + var_1_15)) : (var_1_14))))) ? (var_1_13) : ((((((0.05 + var_1_15)) < (var_1_14)) ? ((0.05 + var_1_15)) : (var_1_14)))))) VAL [isInitial=1, stepLocal_2=126, var_1_10=125, var_1_11=125, var_1_12=2147483776, var_1_13=2147483776, var_1_14=2147483776, var_1_16=125, var_1_17=2147483646, var_1_18=125, var_1_19=2147483776, var_1_1=125, var_1_7=1, var_1_8=125, var_1_9=126] [L140] RET step() [L141] CALL, EXPR property() [L131-L132] return (((((((var_1_2 / var_1_3) > ((var_1_4 - var_1_5) * var_1_6)) ? (var_1_7 ? (var_1_1 == ((signed char) var_1_8)) : (var_1_1 == ((signed char) var_1_9))) : (var_1_1 == ((signed char) var_1_8))) && ((var_1_9 < var_1_1) ? (((var_1_4 - var_1_5) > var_1_3) ? (var_1_10 == ((unsigned char) 8)) : 1) : (var_1_10 == ((unsigned char) var_1_11)))) && ((var_1_5 <= (var_1_6 / var_1_3)) ? (var_1_12 == ((float) ((((var_1_13) > ((var_1_14 + var_1_15))) ? (var_1_13) : ((var_1_14 + var_1_15)))))) : (var_1_12 == ((float) var_1_14)))) && (var_1_7 ? (var_1_16 == ((signed long int) var_1_8)) : (var_1_16 == ((signed long int) (var_1_11 - ((((var_1_10 - var_1_17) < 0 ) ? -(var_1_10 - var_1_17) : (var_1_10 - var_1_17)))))))) && ((var_1_16 >= (var_1_10 + var_1_17)) ? ((var_1_5 < 999.5f) ? (var_1_7 ? (var_1_18 == ((signed short int) (var_1_10 + var_1_1))) : (var_1_18 == ((signed short int) var_1_8))) : (var_1_18 == ((signed short int) var_1_9))) : (var_1_18 == ((signed short int) var_1_8)))) && ((! (var_1_10 > var_1_1)) ? (var_1_19 == ((double) ((((var_1_13) > ((((((0.05 + var_1_15)) < (var_1_14)) ? ((0.05 + var_1_15)) : (var_1_14))))) ? (var_1_13) : ((((((0.05 + var_1_15)) < (var_1_14)) ? ((0.05 + var_1_15)) : (var_1_14)))))))) : ((var_1_1 > var_1_9) ? (var_1_19 == ((double) var_1_15)) : 1)) ; [L141] RET, EXPR property() [L141] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, var_1_10=125, var_1_11=125, var_1_12=2147483776, var_1_13=2147483776, var_1_14=2147483776, var_1_16=125, var_1_17=2147483646, var_1_18=125, var_1_19=2147483776, var_1_1=125, var_1_7=1, var_1_8=125, var_1_9=126] [L19] reach_error() VAL [isInitial=1, var_1_10=125, var_1_11=125, var_1_12=2147483776, var_1_13=2147483776, var_1_14=2147483776, var_1_16=125, var_1_17=2147483646, var_1_18=125, var_1_19=2147483776, var_1_1=125, var_1_7=1, var_1_8=125, var_1_9=126] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 59 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.1s, OverallIterations: 2, TraceHistogramMax: 19, 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, 83 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, 83 mSDtfsCounter, 3 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 59 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=59occurred in iteration=0, InterpolantAutomatonStates: 2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.3s InterpolantComputationTime, 244 NumberOfCodeBlocks, 244 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 121 ConstructedInterpolants, 0 QuantifiedInterpolants, 121 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 684/684 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-13 00:10:16,951 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/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_codestructure_steplocals_file-18.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 2db4ee6ab2547d99b135ecffc9585a13a3b138179a031ae5abb4b8a595740e3e --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-13 00:10:19,392 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-13 00:10:19,484 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-10-13 00:10:19,493 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-13 00:10:19,494 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-13 00:10:19,535 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-13 00:10:19,539 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-13 00:10:19,541 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-13 00:10:19,542 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-13 00:10:19,543 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-13 00:10:19,543 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-13 00:10:19,544 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-13 00:10:19,544 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-13 00:10:19,545 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-13 00:10:19,547 INFO L153 SettingsManager]: * Use SBE=true [2024-10-13 00:10:19,547 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-13 00:10:19,548 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-13 00:10:19,548 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-13 00:10:19,552 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-13 00:10:19,553 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-13 00:10:19,553 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-13 00:10:19,553 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-13 00:10:19,554 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-13 00:10:19,554 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-13 00:10:19,554 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-13 00:10:19,554 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-13 00:10:19,555 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-13 00:10:19,555 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-13 00:10:19,555 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-13 00:10:19,555 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-13 00:10:19,556 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-13 00:10:19,556 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-13 00:10:19,557 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-13 00:10:19,557 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-13 00:10:19,557 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 00:10:19,558 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-13 00:10:19,559 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-13 00:10:19,559 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-13 00:10:19,559 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-13 00:10:19,560 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-13 00:10:19,560 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-13 00:10:19,561 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-13 00:10:19,561 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-13 00:10:19,561 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-13 00:10:19,561 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-13 00:10:19,562 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 -> 2db4ee6ab2547d99b135ecffc9585a13a3b138179a031ae5abb4b8a595740e3e [2024-10-13 00:10:19,936 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-13 00:10:19,964 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-13 00:10:19,968 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-13 00:10:19,970 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-13 00:10:19,970 INFO L274 PluginConnector]: CDTParser initialized [2024-10-13 00:10:19,973 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-18.i [2024-10-13 00:10:21,600 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-13 00:10:21,856 INFO L384 CDTParser]: Found 1 translation units. [2024-10-13 00:10:21,857 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-18.i [2024-10-13 00:10:21,868 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cc089e08e/daea6ba6dbe94ed9ae7ecb5756029858/FLAG99e640aa6 [2024-10-13 00:10:22,200 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cc089e08e/daea6ba6dbe94ed9ae7ecb5756029858 [2024-10-13 00:10:22,203 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-13 00:10:22,205 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-13 00:10:22,208 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-13 00:10:22,209 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-13 00:10:22,215 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-13 00:10:22,216 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 12:10:22" (1/1) ... [2024-10-13 00:10:22,219 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4f86254a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:10:22, skipping insertion in model container [2024-10-13 00:10:22,219 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 12:10:22" (1/1) ... [2024-10-13 00:10:22,254 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 00:10:22,451 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-18.i[917,930] [2024-10-13 00:10:22,519 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 00:10:22,550 INFO L200 MainTranslator]: Completed pre-run [2024-10-13 00:10:22,566 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-18.i[917,930] [2024-10-13 00:10:22,594 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 00:10:22,620 INFO L204 MainTranslator]: Completed translation [2024-10-13 00:10:22,620 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:10:22 WrapperNode [2024-10-13 00:10:22,621 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-13 00:10:22,622 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-13 00:10:22,622 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-13 00:10:22,622 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-13 00:10:22,628 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:10:22" (1/1) ... [2024-10-13 00:10:22,639 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:10:22" (1/1) ... [2024-10-13 00:10:22,673 INFO L138 Inliner]: procedures = 27, calls = 32, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 140 [2024-10-13 00:10:22,674 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-13 00:10:22,675 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-13 00:10:22,675 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-13 00:10:22,675 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-13 00:10:22,683 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:10:22" (1/1) ... [2024-10-13 00:10:22,684 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:10:22" (1/1) ... [2024-10-13 00:10:22,689 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:10:22" (1/1) ... [2024-10-13 00:10:22,701 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-13 00:10:22,702 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:10:22" (1/1) ... [2024-10-13 00:10:22,702 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:10:22" (1/1) ... [2024-10-13 00:10:22,713 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:10:22" (1/1) ... [2024-10-13 00:10:22,724 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:10:22" (1/1) ... [2024-10-13 00:10:22,727 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:10:22" (1/1) ... [2024-10-13 00:10:22,729 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:10:22" (1/1) ... [2024-10-13 00:10:22,733 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-13 00:10:22,734 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-13 00:10:22,734 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-13 00:10:22,734 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-13 00:10:22,739 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:10:22" (1/1) ... [2024-10-13 00:10:22,754 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 00:10:22,778 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 00:10:22,795 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-13 00:10:22,802 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-13 00:10:22,838 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-13 00:10:22,838 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-13 00:10:22,838 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-13 00:10:22,838 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-13 00:10:22,838 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-13 00:10:22,838 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-13 00:10:22,920 INFO L238 CfgBuilder]: Building ICFG [2024-10-13 00:10:22,924 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-13 00:10:39,174 INFO L? ?]: Removed 14 outVars from TransFormulas that were not future-live. [2024-10-13 00:10:39,174 INFO L287 CfgBuilder]: Performing block encoding [2024-10-13 00:10:39,244 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-13 00:10:39,244 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-13 00:10:39,244 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 12:10:39 BoogieIcfgContainer [2024-10-13 00:10:39,244 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-13 00:10:39,249 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-13 00:10:39,249 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-13 00:10:39,254 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-13 00:10:39,254 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 12:10:22" (1/3) ... [2024-10-13 00:10:39,255 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3dc938ee and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 12:10:39, skipping insertion in model container [2024-10-13 00:10:39,255 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:10:22" (2/3) ... [2024-10-13 00:10:39,255 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3dc938ee and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 12:10:39, skipping insertion in model container [2024-10-13 00:10:39,256 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 12:10:39" (3/3) ... [2024-10-13 00:10:39,258 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_codestructure_steplocals_file-18.i [2024-10-13 00:10:39,274 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-13 00:10:39,274 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-13 00:10:39,339 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-13 00:10:39,347 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;@5000f947, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-13 00:10:39,347 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-13 00:10:39,352 INFO L276 IsEmpty]: Start isEmpty. Operand has 59 states, 37 states have (on average 1.4324324324324325) internal successors, (53), 38 states have internal predecessors, (53), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-10-13 00:10:39,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2024-10-13 00:10:39,371 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 00:10:39,372 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 00:10:39,372 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 00:10:39,380 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 00:10:39,381 INFO L85 PathProgramCache]: Analyzing trace with hash 424614068, now seen corresponding path program 1 times [2024-10-13 00:10:39,398 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 00:10:39,399 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [558323873] [2024-10-13 00:10:39,399 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 00:10:39,400 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-13 00:10:39,400 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 00:10:39,403 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-13 00:10:39,405 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-13 00:10:40,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:10:40,138 INFO L255 TraceCheckSpWp]: Trace formula consists of 198 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-13 00:10:40,152 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 00:10:40,197 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 356 proven. 0 refuted. 0 times theorem prover too weak. 328 trivial. 0 not checked. [2024-10-13 00:10:40,198 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 00:10:40,199 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 00:10:40,199 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [558323873] [2024-10-13 00:10:40,200 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [558323873] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 00:10:40,200 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 00:10:40,200 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 00:10:40,202 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [522534120] [2024-10-13 00:10:40,202 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 00:10:40,207 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-13 00:10:40,210 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 00:10:40,246 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-13 00:10:40,247 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-13 00:10:40,251 INFO L87 Difference]: Start difference. First operand has 59 states, 37 states have (on average 1.4324324324324325) internal successors, (53), 38 states have internal predecessors, (53), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) Second operand has 2 states, 2 states have (on average 17.0) internal successors, (34), 2 states have internal predecessors, (34), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2024-10-13 00:10:44,533 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.21s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-13 00:10:44,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 00:10:44,535 INFO L93 Difference]: Finished difference Result 115 states and 199 transitions. [2024-10-13 00:10:44,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-13 00:10:44,607 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 17.0) internal successors, (34), 2 states have internal predecessors, (34), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) Word has length 122 [2024-10-13 00:10:44,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 00:10:44,614 INFO L225 Difference]: With dead ends: 115 [2024-10-13 00:10:44,614 INFO L226 Difference]: Without dead ends: 57 [2024-10-13 00:10:44,617 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 121 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-13 00:10:44,620 INFO L432 NwaCegarLoop]: 83 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 83 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2024-10-13 00:10:44,621 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 83 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 1 Unknown, 0 Unchecked, 4.2s Time] [2024-10-13 00:10:44,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2024-10-13 00:10:44,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2024-10-13 00:10:44,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 36 states have (on average 1.3333333333333333) internal successors, (48), 36 states have internal predecessors, (48), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-10-13 00:10:44,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 86 transitions. [2024-10-13 00:10:44,665 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 86 transitions. Word has length 122 [2024-10-13 00:10:44,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 00:10:44,666 INFO L471 AbstractCegarLoop]: Abstraction has 57 states and 86 transitions. [2024-10-13 00:10:44,666 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 17.0) internal successors, (34), 2 states have internal predecessors, (34), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2024-10-13 00:10:44,667 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 86 transitions. [2024-10-13 00:10:44,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2024-10-13 00:10:44,672 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 00:10:44,672 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 00:10:44,693 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-13 00:10:44,873 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-13 00:10:44,873 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 00:10:44,874 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 00:10:44,875 INFO L85 PathProgramCache]: Analyzing trace with hash -968456322, now seen corresponding path program 1 times [2024-10-13 00:10:44,877 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 00:10:44,877 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1216265155] [2024-10-13 00:10:44,878 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 00:10:44,878 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-13 00:10:44,878 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 00:10:44,879 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-13 00:10:44,881 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-13 00:10:46,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:10:46,894 INFO L255 TraceCheckSpWp]: Trace formula consists of 198 conjuncts, 29 conjuncts are in the unsatisfiable core [2024-10-13 00:10:46,910 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 00:11:08,904 WARN L286 SmtUtils]: Spent 8.14s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-10-13 00:11:16,991 WARN L286 SmtUtils]: Spent 8.09s on a formula simplification that was a NOOP. DAG size: 11 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-10-13 00:11:25,128 WARN L286 SmtUtils]: Spent 8.14s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-10-13 00:11:33,272 WARN L286 SmtUtils]: Spent 8.14s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-10-13 00:11:41,413 WARN L286 SmtUtils]: Spent 8.14s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)