./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/float-benchs/filter1.c.v+lhb-reducer.c --full-output -ea --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 03d7b7b3 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -ea -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/float-benchs/filter1.c.v+lhb-reducer.c -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.graphml --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 27e2c506f8c4790ab21ed41c19bd1ea2839907b43d1ff7cacbbc276ad919ab4e --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 16:21:49,258 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 16:21:49,265 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 16:21:49,288 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 16:21:49,289 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 16:21:49,289 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 16:21:49,290 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 16:21:49,292 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 16:21:49,293 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 16:21:49,293 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 16:21:49,294 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 16:21:49,295 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 16:21:49,295 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 16:21:49,296 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 16:21:49,297 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 16:21:49,298 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 16:21:49,298 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 16:21:49,299 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 16:21:49,300 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 16:21:49,301 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 16:21:49,304 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 16:21:49,305 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 16:21:49,306 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 16:21:49,308 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 16:21:49,310 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 16:21:49,315 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 16:21:49,315 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 16:21:49,315 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 16:21:49,316 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 16:21:49,316 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 16:21:49,316 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 16:21:49,317 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 16:21:49,317 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 16:21:49,318 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 16:21:49,318 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 16:21:49,319 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 16:21:49,321 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 16:21:49,321 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 16:21:49,321 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 16:21:49,322 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 16:21:49,322 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 16:21:49,323 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-02-20 16:21:49,337 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 16:21:49,343 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 16:21:49,343 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 16:21:49,343 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 16:21:49,344 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 16:21:49,344 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 16:21:49,345 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 16:21:49,345 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 16:21:49,345 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 16:21:49,345 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 16:21:49,346 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 16:21:49,346 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 16:21:49,346 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 16:21:49,346 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 16:21:49,346 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 16:21:49,346 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 16:21:49,346 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 16:21:49,347 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 16:21:49,347 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 16:21:49,347 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 16:21:49,347 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 16:21:49,347 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 16:21:49,347 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 16:21:49,347 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 16:21:49,348 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 16:21:49,348 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 16:21:49,348 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 16:21:49,348 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 16:21:49,348 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 16:21:49,348 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 16:21:49,348 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 16:21:49,349 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 16:21:49,349 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 16:21:49,349 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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.graphml 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 -> 27e2c506f8c4790ab21ed41c19bd1ea2839907b43d1ff7cacbbc276ad919ab4e [2022-02-20 16:21:49,517 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 16:21:49,530 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 16:21:49,531 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 16:21:49,532 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 16:21:49,533 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 16:21:49,533 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/float-benchs/filter1.c.v+lhb-reducer.c [2022-02-20 16:21:49,585 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/497750afa/f495d129a01a4fcf86a0d72d2d29c4a5/FLAG7b14f198d [2022-02-20 16:21:49,924 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 16:21:49,925 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-benchs/filter1.c.v+lhb-reducer.c [2022-02-20 16:21:49,929 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/497750afa/f495d129a01a4fcf86a0d72d2d29c4a5/FLAG7b14f198d [2022-02-20 16:21:49,941 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/497750afa/f495d129a01a4fcf86a0d72d2d29c4a5 [2022-02-20 16:21:49,942 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 16:21:49,943 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 16:21:49,944 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 16:21:49,945 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 16:21:49,950 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 16:21:49,951 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 04:21:49" (1/1) ... [2022-02-20 16:21:49,952 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@23c2a12 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:21:49, skipping insertion in model container [2022-02-20 16:21:49,952 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 04:21:49" (1/1) ... [2022-02-20 16:21:49,960 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 16:21:49,978 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 16:21:50,082 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-benchs/filter1.c.v+lhb-reducer.c[1355,1368] [2022-02-20 16:21:50,100 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-benchs/filter1.c.v+lhb-reducer.c[2394,2407] [2022-02-20 16:21:50,112 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 16:21:50,122 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 16:21:50,133 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-benchs/filter1.c.v+lhb-reducer.c[1355,1368] [2022-02-20 16:21:50,136 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-benchs/filter1.c.v+lhb-reducer.c[2394,2407] [2022-02-20 16:21:50,138 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 16:21:50,147 INFO L208 MainTranslator]: Completed translation [2022-02-20 16:21:50,147 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:21:50 WrapperNode [2022-02-20 16:21:50,147 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 16:21:50,148 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 16:21:50,148 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 16:21:50,149 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 16:21:50,153 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:21:50" (1/1) ... [2022-02-20 16:21:50,158 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:21:50" (1/1) ... [2022-02-20 16:21:50,172 INFO L137 Inliner]: procedures = 15, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 122 [2022-02-20 16:21:50,173 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 16:21:50,174 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 16:21:50,174 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 16:21:50,174 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 16:21:50,179 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:21:50" (1/1) ... [2022-02-20 16:21:50,179 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:21:50" (1/1) ... [2022-02-20 16:21:50,180 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:21:50" (1/1) ... [2022-02-20 16:21:50,180 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:21:50" (1/1) ... [2022-02-20 16:21:50,184 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:21:50" (1/1) ... [2022-02-20 16:21:50,186 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:21:50" (1/1) ... [2022-02-20 16:21:50,186 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:21:50" (1/1) ... [2022-02-20 16:21:50,187 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 16:21:50,188 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 16:21:50,188 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 16:21:50,188 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 16:21:50,189 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:21:50" (1/1) ... [2022-02-20 16:21:50,194 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 16:21:50,200 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 16:21:50,223 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-02-20 16:21:50,231 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-02-20 16:21:50,255 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 16:21:50,256 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 16:21:50,256 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 16:21:50,256 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 16:21:50,296 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 16:21:50,297 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 16:21:50,482 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 16:21:50,489 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 16:21:50,489 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-02-20 16:21:50,490 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 04:21:50 BoogieIcfgContainer [2022-02-20 16:21:50,490 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 16:21:50,492 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 16:21:50,492 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 16:21:50,502 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 16:21:50,502 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 04:21:49" (1/3) ... [2022-02-20 16:21:50,502 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@130b43b4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 04:21:50, skipping insertion in model container [2022-02-20 16:21:50,503 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:21:50" (2/3) ... [2022-02-20 16:21:50,503 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@130b43b4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 04:21:50, skipping insertion in model container [2022-02-20 16:21:50,503 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 04:21:50" (3/3) ... [2022-02-20 16:21:50,504 INFO L111 eAbstractionObserver]: Analyzing ICFG filter1.c.v+lhb-reducer.c [2022-02-20 16:21:50,507 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 16:21:50,507 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-02-20 16:21:50,553 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 16:21:50,560 INFO L339 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, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, 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, mLoopAccelerationTechnique=FAST_UPR [2022-02-20 16:21:50,562 INFO L340 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2022-02-20 16:21:50,581 INFO L276 IsEmpty]: Start isEmpty. Operand has 33 states, 30 states have (on average 1.6) internal successors, (48), 32 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:21:50,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-02-20 16:21:50,588 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:21:50,588 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 16:21:50,589 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:21:50,595 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:21:50,595 INFO L85 PathProgramCache]: Analyzing trace with hash 775758574, now seen corresponding path program 1 times [2022-02-20 16:21:50,604 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 16:21:50,605 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1199798800] [2022-02-20 16:21:50,605 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:21:50,606 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 16:21:50,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:21:50,759 INFO L290 TraceCheckUtils]: 0: Hoare triple {36#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(26, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__tmp_129_0~0 := 0;~__tmp_129_1~0 := 0;~__tmp_129_2~0 := 0;~__return_134~0 := 0; {36#true} is VALID [2022-02-20 16:21:50,759 INFO L290 TraceCheckUtils]: 1: Hoare triple {36#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_~__tmp_2~0#1, main_~__VERIFIER_assert__cond~1#1, main_~main____CPAchecker_TMP_2~1#1, main_~main____CPAchecker_TMP_1~1#1, main_~main____CPAchecker_TMP_0~1#1, main_~__tmp_1~0#1, main_~__VERIFIER_assert__cond~0#1, main_~main____CPAchecker_TMP_2~0#1, main_~main____CPAchecker_TMP_1~0#1, main_~main____CPAchecker_TMP_0~0#1, main_~main__E0~0#1, main_~main__E1~0#1, main_~main__S~0#1, main_~main__i~0#1;havoc main_~main__E0~0#1;havoc main_~main__E1~0#1;havoc main_~main__S~0#1;havoc main_~main__i~0#1;main_~main__E1~0#1 := ~convertINTToDOUBLE(0);main_~main__S~0#1 := ~convertINTToDOUBLE(0);main_~main__i~0#1 := 0; {36#true} is VALID [2022-02-20 16:21:50,759 INFO L290 TraceCheckUtils]: 2: Hoare triple {36#true} assume main_~main__i~0#1 <= 1000000;main_~main__E0~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~main____CPAchecker_TMP_0~0#1; {36#true} is VALID [2022-02-20 16:21:50,760 INFO L290 TraceCheckUtils]: 3: Hoare triple {36#true} assume ~someBinaryDOUBLEComparisonOperation(main_~main__E0~0#1, ~someUnaryDOUBLEoperation(1.0)); {36#true} is VALID [2022-02-20 16:21:50,760 INFO L290 TraceCheckUtils]: 4: Hoare triple {36#true} assume ~someBinaryDOUBLEComparisonOperation(main_~main__E0~0#1, 1.0);main_~main____CPAchecker_TMP_0~0#1 := 1; {38#(= |ULTIMATE.start_main_~main____CPAchecker_TMP_0~0#1| 1)} is VALID [2022-02-20 16:21:50,760 INFO L290 TraceCheckUtils]: 5: Hoare triple {38#(= |ULTIMATE.start_main_~main____CPAchecker_TMP_0~0#1| 1)} assume 0 != main_~main____CPAchecker_TMP_0~0#1;havoc main_~main____CPAchecker_TMP_1~0#1;assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~main____CPAchecker_TMP_1~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; {36#true} is VALID [2022-02-20 16:21:50,761 INFO L290 TraceCheckUtils]: 6: Hoare triple {36#true} assume !(0 == main_~main____CPAchecker_TMP_1~0#1);main_~main__S~0#1 := ~convertINTToDOUBLE(0); {36#true} is VALID [2022-02-20 16:21:50,761 INFO L290 TraceCheckUtils]: 7: Hoare triple {36#true} main_~main__E1~0#1 := main_~main__E0~0#1;havoc main_~main____CPAchecker_TMP_2~0#1; {36#true} is VALID [2022-02-20 16:21:50,761 INFO L290 TraceCheckUtils]: 8: Hoare triple {36#true} assume ~someBinaryDOUBLEComparisonOperation(main_~main__S~0#1, ~someUnaryDOUBLEoperation(10000.0)); {36#true} is VALID [2022-02-20 16:21:50,762 INFO L290 TraceCheckUtils]: 9: Hoare triple {36#true} assume ~someBinaryDOUBLEComparisonOperation(main_~main__S~0#1, 10000.0);main_~main____CPAchecker_TMP_2~0#1 := 1; {39#(not (= |ULTIMATE.start_main_~main____CPAchecker_TMP_2~0#1| 0))} is VALID [2022-02-20 16:21:50,763 INFO L290 TraceCheckUtils]: 10: Hoare triple {39#(not (= |ULTIMATE.start_main_~main____CPAchecker_TMP_2~0#1| 0))} havoc main_~__tmp_1~0#1;main_~__tmp_1~0#1 := main_~main____CPAchecker_TMP_2~0#1;havoc main_~__VERIFIER_assert__cond~0#1;main_~__VERIFIER_assert__cond~0#1 := main_~__tmp_1~0#1; {40#(not (= |ULTIMATE.start_main_~__VERIFIER_assert__cond~0#1| 0))} is VALID [2022-02-20 16:21:50,764 INFO L290 TraceCheckUtils]: 11: Hoare triple {40#(not (= |ULTIMATE.start_main_~__VERIFIER_assert__cond~0#1| 0))} assume 0 == main_~__VERIFIER_assert__cond~0#1; {37#false} is VALID [2022-02-20 16:21:50,764 INFO L290 TraceCheckUtils]: 12: Hoare triple {37#false} assume !false; {37#false} is VALID [2022-02-20 16:21:50,764 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 16:21:50,765 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 16:21:50,765 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1199798800] [2022-02-20 16:21:50,765 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1199798800] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 16:21:50,766 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 16:21:50,766 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 16:21:50,767 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1391642302] [2022-02-20 16:21:50,767 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 16:21:50,770 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2022-02-20 16:21:50,772 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 16:21:50,774 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:21:50,819 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 13 edges. 13 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:21:50,819 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 16:21:50,820 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 16:21:50,838 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 16:21:50,839 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 16:21:50,842 INFO L87 Difference]: Start difference. First operand has 33 states, 30 states have (on average 1.6) internal successors, (48), 32 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:21:51,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:21:51,035 INFO L93 Difference]: Finished difference Result 45 states and 59 transitions. [2022-02-20 16:21:51,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-02-20 16:21:51,036 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2022-02-20 16:21:51,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 16:21:51,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:21:51,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 59 transitions. [2022-02-20 16:21:51,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:21:51,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 59 transitions. [2022-02-20 16:21:51,042 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 59 transitions. [2022-02-20 16:21:51,084 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 59 edges. 59 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:21:51,091 INFO L225 Difference]: With dead ends: 45 [2022-02-20 16:21:51,091 INFO L226 Difference]: Without dead ends: 34 [2022-02-20 16:21:51,093 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-02-20 16:21:51,096 INFO L933 BasicCegarLoop]: 44 mSDtfsCounter, 44 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 131 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 16:21:51,097 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [44 Valid, 131 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 16:21:51,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2022-02-20 16:21:51,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 32. [2022-02-20 16:21:51,116 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 16:21:51,117 INFO L82 GeneralOperation]: Start isEquivalent. First operand 34 states. Second operand has 32 states, 30 states have (on average 1.3333333333333333) internal successors, (40), 31 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:21:51,117 INFO L74 IsIncluded]: Start isIncluded. First operand 34 states. Second operand has 32 states, 30 states have (on average 1.3333333333333333) internal successors, (40), 31 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:21:51,118 INFO L87 Difference]: Start difference. First operand 34 states. Second operand has 32 states, 30 states have (on average 1.3333333333333333) internal successors, (40), 31 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:21:51,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:21:51,121 INFO L93 Difference]: Finished difference Result 34 states and 42 transitions. [2022-02-20 16:21:51,121 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 42 transitions. [2022-02-20 16:21:51,121 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:21:51,121 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:21:51,122 INFO L74 IsIncluded]: Start isIncluded. First operand has 32 states, 30 states have (on average 1.3333333333333333) internal successors, (40), 31 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 34 states. [2022-02-20 16:21:51,122 INFO L87 Difference]: Start difference. First operand has 32 states, 30 states have (on average 1.3333333333333333) internal successors, (40), 31 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 34 states. [2022-02-20 16:21:51,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:21:51,124 INFO L93 Difference]: Finished difference Result 34 states and 42 transitions. [2022-02-20 16:21:51,125 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 42 transitions. [2022-02-20 16:21:51,125 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:21:51,125 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:21:51,125 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 16:21:51,125 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 16:21:51,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 30 states have (on average 1.3333333333333333) internal successors, (40), 31 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:21:51,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 40 transitions. [2022-02-20 16:21:51,129 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 40 transitions. Word has length 13 [2022-02-20 16:21:51,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 16:21:51,129 INFO L470 AbstractCegarLoop]: Abstraction has 32 states and 40 transitions. [2022-02-20 16:21:51,129 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:21:51,129 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 40 transitions. [2022-02-20 16:21:51,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-02-20 16:21:51,130 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:21:51,130 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 16:21:51,130 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 16:21:51,131 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:21:51,131 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:21:51,131 INFO L85 PathProgramCache]: Analyzing trace with hash 843294771, now seen corresponding path program 1 times [2022-02-20 16:21:51,132 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 16:21:51,132 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [579888922] [2022-02-20 16:21:51,132 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:21:51,132 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 16:21:51,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-20 16:21:51,146 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-20 16:21:51,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-20 16:21:51,184 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-20 16:21:51,184 INFO L628 BasicCegarLoop]: Counterexample is feasible [2022-02-20 16:21:51,185 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (1 of 2 remaining) [2022-02-20 16:21:51,186 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2022-02-20 16:21:51,186 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-20 16:21:51,194 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1] [2022-02-20 16:21:51,196 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-02-20 16:21:51,214 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2022-02-20 16:21:51,214 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2022-02-20 16:21:51,214 WARN L170 areAnnotationChecker]: L26 has no Hoare annotation [2022-02-20 16:21:51,214 WARN L170 areAnnotationChecker]: L26 has no Hoare annotation [2022-02-20 16:21:51,214 WARN L170 areAnnotationChecker]: L30 has no Hoare annotation [2022-02-20 16:21:51,215 WARN L170 areAnnotationChecker]: L30 has no Hoare annotation [2022-02-20 16:21:51,215 WARN L170 areAnnotationChecker]: L194 has no Hoare annotation [2022-02-20 16:21:51,215 WARN L170 areAnnotationChecker]: L32 has no Hoare annotation [2022-02-20 16:21:51,215 WARN L170 areAnnotationChecker]: L32 has no Hoare annotation [2022-02-20 16:21:51,215 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-02-20 16:21:51,215 WARN L170 areAnnotationChecker]: L35 has no Hoare annotation [2022-02-20 16:21:51,215 WARN L170 areAnnotationChecker]: L35 has no Hoare annotation [2022-02-20 16:21:51,215 WARN L170 areAnnotationChecker]: L39 has no Hoare annotation [2022-02-20 16:21:51,215 WARN L170 areAnnotationChecker]: L39 has no Hoare annotation [2022-02-20 16:21:51,215 WARN L170 areAnnotationChecker]: L174 has no Hoare annotation [2022-02-20 16:21:51,215 WARN L170 areAnnotationChecker]: L45 has no Hoare annotation [2022-02-20 16:21:51,215 WARN L170 areAnnotationChecker]: L45 has no Hoare annotation [2022-02-20 16:21:51,215 WARN L170 areAnnotationChecker]: L47 has no Hoare annotation [2022-02-20 16:21:51,215 WARN L170 areAnnotationChecker]: L47 has no Hoare annotation [2022-02-20 16:21:51,215 WARN L170 areAnnotationChecker]: L168 has no Hoare annotation [2022-02-20 16:21:51,215 WARN L170 areAnnotationChecker]: L163 has no Hoare annotation [2022-02-20 16:21:51,215 WARN L170 areAnnotationChecker]: L56 has no Hoare annotation [2022-02-20 16:21:51,215 WARN L170 areAnnotationChecker]: L56 has no Hoare annotation [2022-02-20 16:21:51,215 WARN L170 areAnnotationChecker]: L58 has no Hoare annotation [2022-02-20 16:21:51,215 WARN L170 areAnnotationChecker]: L58 has no Hoare annotation [2022-02-20 16:21:51,215 WARN L170 areAnnotationChecker]: L112 has no Hoare annotation [2022-02-20 16:21:51,215 WARN L170 areAnnotationChecker]: L71 has no Hoare annotation [2022-02-20 16:21:51,215 WARN L170 areAnnotationChecker]: L71 has no Hoare annotation [2022-02-20 16:21:51,215 WARN L170 areAnnotationChecker]: L75 has no Hoare annotation [2022-02-20 16:21:51,216 WARN L170 areAnnotationChecker]: L75 has no Hoare annotation [2022-02-20 16:21:51,216 WARN L170 areAnnotationChecker]: L77 has no Hoare annotation [2022-02-20 16:21:51,216 WARN L170 areAnnotationChecker]: L77 has no Hoare annotation [2022-02-20 16:21:51,216 WARN L170 areAnnotationChecker]: L148 has no Hoare annotation [2022-02-20 16:21:51,216 WARN L170 areAnnotationChecker]: L143 has no Hoare annotation [2022-02-20 16:21:51,216 WARN L170 areAnnotationChecker]: L143 has no Hoare annotation [2022-02-20 16:21:51,216 WARN L170 areAnnotationChecker]: L85 has no Hoare annotation [2022-02-20 16:21:51,216 WARN L170 areAnnotationChecker]: L85 has no Hoare annotation [2022-02-20 16:21:51,216 WARN L170 areAnnotationChecker]: L131 has no Hoare annotation [2022-02-20 16:21:51,216 WARN L170 areAnnotationChecker]: L91 has no Hoare annotation [2022-02-20 16:21:51,216 WARN L170 areAnnotationChecker]: L91 has no Hoare annotation [2022-02-20 16:21:51,216 WARN L170 areAnnotationChecker]: L93 has no Hoare annotation [2022-02-20 16:21:51,216 WARN L170 areAnnotationChecker]: L93 has no Hoare annotation [2022-02-20 16:21:51,216 WARN L170 areAnnotationChecker]: L125 has no Hoare annotation [2022-02-20 16:21:51,216 WARN L170 areAnnotationChecker]: L120 has no Hoare annotation [2022-02-20 16:21:51,216 WARN L170 areAnnotationChecker]: L102 has no Hoare annotation [2022-02-20 16:21:51,216 WARN L170 areAnnotationChecker]: L102 has no Hoare annotation [2022-02-20 16:21:51,216 WARN L170 areAnnotationChecker]: L104 has no Hoare annotation [2022-02-20 16:21:51,216 WARN L170 areAnnotationChecker]: L104 has no Hoare annotation [2022-02-20 16:21:51,216 INFO L163 areAnnotationChecker]: CFG has 0 edges. 0 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-02-20 16:21:51,217 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.02 04:21:51 BoogieIcfgContainer [2022-02-20 16:21:51,217 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-02-20 16:21:51,221 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-02-20 16:21:51,221 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-02-20 16:21:51,221 INFO L275 PluginConnector]: Witness Printer initialized [2022-02-20 16:21:51,221 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 04:21:50" (3/4) ... [2022-02-20 16:21:51,223 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-02-20 16:21:51,223 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-02-20 16:21:51,224 INFO L158 Benchmark]: Toolchain (without parser) took 1280.77ms. Allocated memory is still 100.7MB. Free memory was 64.7MB in the beginning and 50.5MB in the end (delta: 14.2MB). Peak memory consumption was 12.4MB. Max. memory is 16.1GB. [2022-02-20 16:21:51,224 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 100.7MB. Free memory was 80.9MB in the beginning and 80.9MB in the end (delta: 83.9kB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 16:21:51,228 INFO L158 Benchmark]: CACSL2BoogieTranslator took 203.34ms. Allocated memory is still 100.7MB. Free memory was 64.6MB in the beginning and 75.2MB in the end (delta: -10.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-02-20 16:21:51,228 INFO L158 Benchmark]: Boogie Procedure Inliner took 24.71ms. Allocated memory is still 100.7MB. Free memory was 74.8MB in the beginning and 73.0MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-20 16:21:51,228 INFO L158 Benchmark]: Boogie Preprocessor took 14.01ms. Allocated memory is still 100.7MB. Free memory was 73.0MB in the beginning and 72.1MB in the end (delta: 911.3kB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-20 16:21:51,228 INFO L158 Benchmark]: RCFGBuilder took 302.46ms. Allocated memory is still 100.7MB. Free memory was 71.7MB in the beginning and 60.3MB in the end (delta: 11.4MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-02-20 16:21:51,229 INFO L158 Benchmark]: TraceAbstraction took 725.33ms. Allocated memory is still 100.7MB. Free memory was 60.0MB in the beginning and 51.0MB in the end (delta: 9.0MB). Peak memory consumption was 8.6MB. Max. memory is 16.1GB. [2022-02-20 16:21:51,229 INFO L158 Benchmark]: Witness Printer took 2.37ms. Allocated memory is still 100.7MB. Free memory was 51.0MB in the beginning and 50.5MB in the end (delta: 482.2kB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-20 16:21:51,231 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.13ms. Allocated memory is still 100.7MB. Free memory was 80.9MB in the beginning and 80.9MB in the end (delta: 83.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 203.34ms. Allocated memory is still 100.7MB. Free memory was 64.6MB in the beginning and 75.2MB in the end (delta: -10.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 24.71ms. Allocated memory is still 100.7MB. Free memory was 74.8MB in the beginning and 73.0MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 14.01ms. Allocated memory is still 100.7MB. Free memory was 73.0MB in the beginning and 72.1MB in the end (delta: 911.3kB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 302.46ms. Allocated memory is still 100.7MB. Free memory was 71.7MB in the beginning and 60.3MB in the end (delta: 11.4MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * TraceAbstraction took 725.33ms. Allocated memory is still 100.7MB. Free memory was 60.0MB in the beginning and 51.0MB in the end (delta: 9.0MB). Peak memory consumption was 8.6MB. Max. memory is 16.1GB. * Witness Printer took 2.37ms. Allocated memory is still 100.7MB. Free memory was 51.0MB in the beginning and 50.5MB in the end (delta: 482.2kB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 58]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 45, overapproximation of to_real at line 41. Possible FailurePath: [L1] int __return_main; [L13] int __tmp_129_0; [L14] int __tmp_129_1; [L15] int __tmp_129_2; [L16] int __return_134; VAL [__return_134=0, __return_main=0, __tmp_129_0=0, __tmp_129_1=0, __tmp_129_2=0] [L19] double main__E0; [L20] double main__E1; [L21] double main__S; [L22] int main__i; [L23] main__E1 = 0 [L24] main__S = 0 [L25] main__i = 0 VAL [__return_134=0, __return_main=0, __tmp_129_0=0, __tmp_129_1=0, __tmp_129_2=0, main__i=0] [L26] COND TRUE main__i <= 1000000 [L28] main__E0 = __VERIFIER_nondet_double() [L29] int main____CPAchecker_TMP_0; VAL [__return_134=0, __return_main=0, __tmp_129_0=0, __tmp_129_1=0, __tmp_129_2=0, main__E0=49, main__i=0] [L30] COND TRUE main__E0 >= -1.0 VAL [__return_134=0, __return_main=0, __tmp_129_0=0, __tmp_129_1=0, __tmp_129_2=0, main__E0=49, main__i=0] [L32] COND TRUE main__E0 <= 1.0 [L34] main____CPAchecker_TMP_0 = 1 VAL [__return_134=0, __return_main=0, __tmp_129_0=0, __tmp_129_1=0, __tmp_129_2=0, main____CPAchecker_TMP_0=1, main__E0=49, main__i=0] [L35] COND TRUE main____CPAchecker_TMP_0 != 0 [L37] int main____CPAchecker_TMP_1; [L38] main____CPAchecker_TMP_1 = __VERIFIER_nondet_int() [L39] COND TRUE !(main____CPAchecker_TMP_1 == 0) [L41] main__S = 0 VAL [__return_134=0, __return_main=0, __tmp_129_0=0, __tmp_129_1=0, __tmp_129_2=0, main____CPAchecker_TMP_0=1, main____CPAchecker_TMP_1=1, main__E0=49, main__i=0] [L43] main__E1 = main__E0 [L44] int main____CPAchecker_TMP_2; VAL [__return_134=0, __return_main=0, __tmp_129_0=0, __tmp_129_1=0, __tmp_129_2=0, main____CPAchecker_TMP_0=1, main____CPAchecker_TMP_1=1, main__E0=49, main__E1=49, main__i=0] [L45] COND FALSE !(main__S >= -10000.0) VAL [__return_134=0, __return_main=0, __tmp_129_0=0, __tmp_129_1=0, __tmp_129_2=0, main____CPAchecker_TMP_0=1, main____CPAchecker_TMP_1=1, main__E0=49, main__E1=49, main__i=0] [L162] main____CPAchecker_TMP_2 = 0 VAL [__return_134=0, __return_main=0, __tmp_129_0=0, __tmp_129_1=0, __tmp_129_2=0, main____CPAchecker_TMP_0=1, main____CPAchecker_TMP_1=1, main____CPAchecker_TMP_2=0, main__E0=49, main__E1=49, main__i=0] [L52] int __tmp_1; [L53] __tmp_1 = main____CPAchecker_TMP_2 [L54] int __VERIFIER_assert__cond; [L55] __VERIFIER_assert__cond = __tmp_1 VAL [__return_134=0, __return_main=0, __tmp_1=0, __tmp_129_0=0, __tmp_129_1=0, __tmp_129_2=0, __VERIFIER_assert__cond=0, main____CPAchecker_TMP_0=1, main____CPAchecker_TMP_1=1, main____CPAchecker_TMP_2=0, main__E0=49, main__E1=49, main__i=0] [L56] COND TRUE __VERIFIER_assert__cond == 0 VAL [__return_134=0, __return_main=0, __tmp_1=0, __tmp_129_0=0, __tmp_129_1=0, __tmp_129_2=0, __VERIFIER_assert__cond=0, main____CPAchecker_TMP_0=1, main____CPAchecker_TMP_1=1, main____CPAchecker_TMP_2=0, main__E0=49, main__E1=49, main__i=0] [L58] reach_error() VAL [__return_134=0, __return_main=0, __tmp_1=0, __tmp_129_0=0, __tmp_129_1=0, __tmp_129_2=0, __VERIFIER_assert__cond=0, main____CPAchecker_TMP_0=1, main____CPAchecker_TMP_1=1, main____CPAchecker_TMP_2=0, main__E0=49, main__E1=49, main__i=0] - UnprovableResult [Line: 104]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 33 locations, 2 error locations. Started 1 CEGAR loops. OverallTime: 0.6s, OverallIterations: 2, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 44 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 44 mSDsluCounter, 131 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 87 mSDsCounter, 2 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 17 IncrementalHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2 mSolverCounterUnsat, 44 mSDtfsCounter, 17 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=33occurred in iteration=0, InterpolantAutomatonStates: 7, 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, 2 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 26 NumberOfCodeBlocks, 26 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 12 ConstructedInterpolants, 0 QuantifiedInterpolants, 20 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 0/0 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 [2022-02-20 16:21:51,253 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -ea -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/float-benchs/filter1.c.v+lhb-reducer.c -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.graphml --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 27e2c506f8c4790ab21ed41c19bd1ea2839907b43d1ff7cacbbc276ad919ab4e --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 16:21:52,986 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 16:21:52,988 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 16:21:53,024 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 16:21:53,024 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 16:21:53,026 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 16:21:53,028 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 16:21:53,031 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 16:21:53,033 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 16:21:53,036 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 16:21:53,037 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 16:21:53,038 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 16:21:53,038 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 16:21:53,040 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 16:21:53,041 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 16:21:53,045 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 16:21:53,045 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 16:21:53,046 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 16:21:53,047 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 16:21:53,051 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 16:21:53,052 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 16:21:53,053 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 16:21:53,054 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 16:21:53,055 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 16:21:53,060 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 16:21:53,060 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 16:21:53,060 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 16:21:53,061 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 16:21:53,062 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 16:21:53,062 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 16:21:53,062 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 16:21:53,063 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 16:21:53,064 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 16:21:53,064 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 16:21:53,065 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 16:21:53,065 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 16:21:53,066 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 16:21:53,066 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 16:21:53,066 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 16:21:53,067 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 16:21:53,068 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 16:21:53,071 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2022-02-20 16:21:53,095 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 16:21:53,097 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 16:21:53,098 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 16:21:53,098 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 16:21:53,099 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 16:21:53,099 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 16:21:53,100 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 16:21:53,100 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 16:21:53,100 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 16:21:53,101 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 16:21:53,101 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 16:21:53,101 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 16:21:53,102 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 16:21:53,102 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 16:21:53,102 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 16:21:53,102 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 16:21:53,102 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-02-20 16:21:53,102 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-02-20 16:21:53,102 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-02-20 16:21:53,103 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 16:21:53,103 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 16:21:53,103 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 16:21:53,103 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 16:21:53,103 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 16:21:53,103 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 16:21:53,104 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 16:21:53,104 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 16:21:53,104 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 16:21:53,104 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 16:21:53,104 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 16:21:53,104 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-02-20 16:21:53,105 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-02-20 16:21:53,105 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 16:21:53,105 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 16:21:53,105 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 16:21:53,105 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-02-20 16:21:53,105 INFO L138 SettingsManager]: * Logic for external solver=AUFBV 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.graphml 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 -> 27e2c506f8c4790ab21ed41c19bd1ea2839907b43d1ff7cacbbc276ad919ab4e [2022-02-20 16:21:53,375 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 16:21:53,404 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 16:21:53,406 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 16:21:53,407 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 16:21:53,409 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 16:21:53,410 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/float-benchs/filter1.c.v+lhb-reducer.c [2022-02-20 16:21:53,466 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/356ed5f4a/9cff9ee123e545ecaf09f6f409520ab9/FLAG36229f18a [2022-02-20 16:21:53,817 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 16:21:53,818 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-benchs/filter1.c.v+lhb-reducer.c [2022-02-20 16:21:53,830 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/356ed5f4a/9cff9ee123e545ecaf09f6f409520ab9/FLAG36229f18a [2022-02-20 16:21:53,843 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/356ed5f4a/9cff9ee123e545ecaf09f6f409520ab9 [2022-02-20 16:21:53,845 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 16:21:53,847 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 16:21:53,849 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 16:21:53,849 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 16:21:53,851 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 16:21:53,852 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 04:21:53" (1/1) ... [2022-02-20 16:21:53,853 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3839015d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:21:53, skipping insertion in model container [2022-02-20 16:21:53,854 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 04:21:53" (1/1) ... [2022-02-20 16:21:53,861 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 16:21:53,878 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 16:21:54,033 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-benchs/filter1.c.v+lhb-reducer.c[1355,1368] [2022-02-20 16:21:54,079 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-benchs/filter1.c.v+lhb-reducer.c[2394,2407] [2022-02-20 16:21:54,094 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 16:21:54,123 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 16:21:54,156 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-benchs/filter1.c.v+lhb-reducer.c[1355,1368] [2022-02-20 16:21:54,166 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-benchs/filter1.c.v+lhb-reducer.c[2394,2407] [2022-02-20 16:21:54,173 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 16:21:54,211 INFO L208 MainTranslator]: Completed translation [2022-02-20 16:21:54,211 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:21:54 WrapperNode [2022-02-20 16:21:54,211 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 16:21:54,213 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 16:21:54,214 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 16:21:54,214 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 16:21:54,220 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:21:54" (1/1) ... [2022-02-20 16:21:54,253 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:21:54" (1/1) ... [2022-02-20 16:21:54,298 INFO L137 Inliner]: procedures = 16, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 121 [2022-02-20 16:21:54,299 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 16:21:54,300 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 16:21:54,300 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 16:21:54,301 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 16:21:54,306 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:21:54" (1/1) ... [2022-02-20 16:21:54,310 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:21:54" (1/1) ... [2022-02-20 16:21:54,316 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:21:54" (1/1) ... [2022-02-20 16:21:54,331 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:21:54" (1/1) ... [2022-02-20 16:21:54,346 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:21:54" (1/1) ... [2022-02-20 16:21:54,349 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:21:54" (1/1) ... [2022-02-20 16:21:54,351 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:21:54" (1/1) ... [2022-02-20 16:21:54,354 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 16:21:54,358 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 16:21:54,359 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 16:21:54,359 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 16:21:54,359 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:21:54" (1/1) ... [2022-02-20 16:21:54,379 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 16:21:54,390 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 16:21:54,400 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-02-20 16:21:54,415 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-02-20 16:21:54,423 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 16:21:54,423 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-02-20 16:21:54,424 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 16:21:54,424 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 16:21:54,465 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 16:21:54,466 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 16:21:56,992 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 16:21:56,996 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 16:21:56,996 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-02-20 16:21:56,997 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 04:21:56 BoogieIcfgContainer [2022-02-20 16:21:56,998 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 16:21:56,999 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 16:21:56,999 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 16:21:57,001 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 16:21:57,001 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 04:21:53" (1/3) ... [2022-02-20 16:21:57,002 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3e31ee78 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 04:21:57, skipping insertion in model container [2022-02-20 16:21:57,002 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:21:54" (2/3) ... [2022-02-20 16:21:57,002 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3e31ee78 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 04:21:57, skipping insertion in model container [2022-02-20 16:21:57,003 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 04:21:56" (3/3) ... [2022-02-20 16:21:57,003 INFO L111 eAbstractionObserver]: Analyzing ICFG filter1.c.v+lhb-reducer.c [2022-02-20 16:21:57,007 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 16:21:57,007 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-02-20 16:21:57,036 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 16:21:57,041 INFO L339 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, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, 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, mLoopAccelerationTechnique=FAST_UPR [2022-02-20 16:21:57,041 INFO L340 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2022-02-20 16:21:57,052 INFO L276 IsEmpty]: Start isEmpty. Operand has 33 states, 30 states have (on average 1.6) internal successors, (48), 32 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:21:57,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-02-20 16:21:57,055 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:21:57,055 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 16:21:57,056 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:21:57,059 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:21:57,060 INFO L85 PathProgramCache]: Analyzing trace with hash 775758574, now seen corresponding path program 1 times [2022-02-20 16:21:57,068 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 16:21:57,069 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [27290108] [2022-02-20 16:21:57,069 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:21:57,069 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 16:21:57,070 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 16:21:57,072 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-20 16:21:57,073 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2022-02-20 16:21:57,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:21:57,143 INFO L263 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 4 conjunts are in the unsatisfiable core [2022-02-20 16:21:57,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:21:57,155 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 16:21:57,281 INFO L290 TraceCheckUtils]: 0: Hoare triple {36#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;call #Ultimate.allocInit(2bv32, 1bv32);call write~init~intINTTYPE1(48bv8, 1bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 1bv32, 1bv32, 1bv32);call #Ultimate.allocInit(26bv32, 2bv32);call #Ultimate.allocInit(12bv32, 3bv32);~__return_main~0 := 0bv32;~__tmp_129_0~0 := 0bv32;~__tmp_129_1~0 := 0bv32;~__tmp_129_2~0 := 0bv32;~__return_134~0 := 0bv32; {36#true} is VALID [2022-02-20 16:21:57,282 INFO L290 TraceCheckUtils]: 1: Hoare triple {36#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_~__tmp_2~0#1, main_~__VERIFIER_assert__cond~1#1, main_~main____CPAchecker_TMP_2~1#1, main_~main____CPAchecker_TMP_1~1#1, main_~main____CPAchecker_TMP_0~1#1, main_~__tmp_1~0#1, main_~__VERIFIER_assert__cond~0#1, main_~main____CPAchecker_TMP_2~0#1, main_~main____CPAchecker_TMP_1~0#1, main_~main____CPAchecker_TMP_0~0#1, main_~main__E0~0#1, main_~main__E1~0#1, main_~main__S~0#1, main_~main__i~0#1;havoc main_~main__E0~0#1;havoc main_~main__E1~0#1;havoc main_~main__S~0#1;havoc main_~main__i~0#1;main_~main__E1~0#1 := ~convertINTToDOUBLE(currentRoundingMode, 0bv32);main_~main__S~0#1 := ~convertINTToDOUBLE(currentRoundingMode, 0bv32);main_~main__i~0#1 := 0bv32; {36#true} is VALID [2022-02-20 16:21:57,282 INFO L290 TraceCheckUtils]: 2: Hoare triple {36#true} assume ~bvsle32(main_~main__i~0#1, 1000000bv32);main_~main__E0~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~main____CPAchecker_TMP_0~0#1; {36#true} is VALID [2022-02-20 16:21:57,282 INFO L290 TraceCheckUtils]: 3: Hoare triple {36#true} assume ~fp.geq~DOUBLE(main_~main__E0~0#1, ~fp.neg~DOUBLE(~to_fp~DOUBLE(currentRoundingMode, 1.0))); {36#true} is VALID [2022-02-20 16:21:57,282 INFO L290 TraceCheckUtils]: 4: Hoare triple {36#true} assume ~fp.leq~DOUBLE(main_~main__E0~0#1, ~to_fp~DOUBLE(currentRoundingMode, 1.0));main_~main____CPAchecker_TMP_0~0#1 := 1bv32; {36#true} is VALID [2022-02-20 16:21:57,283 INFO L290 TraceCheckUtils]: 5: Hoare triple {36#true} assume 0bv32 != main_~main____CPAchecker_TMP_0~0#1;havoc main_~main____CPAchecker_TMP_1~0#1;main_~main____CPAchecker_TMP_1~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; {36#true} is VALID [2022-02-20 16:21:57,283 INFO L290 TraceCheckUtils]: 6: Hoare triple {36#true} assume !(0bv32 == main_~main____CPAchecker_TMP_1~0#1);main_~main__S~0#1 := ~convertINTToDOUBLE(currentRoundingMode, 0bv32); {36#true} is VALID [2022-02-20 16:21:57,283 INFO L290 TraceCheckUtils]: 7: Hoare triple {36#true} main_~main__E1~0#1 := main_~main__E0~0#1;havoc main_~main____CPAchecker_TMP_2~0#1; {36#true} is VALID [2022-02-20 16:21:57,283 INFO L290 TraceCheckUtils]: 8: Hoare triple {36#true} assume ~fp.geq~DOUBLE(main_~main__S~0#1, ~fp.neg~DOUBLE(~to_fp~DOUBLE(currentRoundingMode, 10000.0))); {36#true} is VALID [2022-02-20 16:21:57,284 INFO L290 TraceCheckUtils]: 9: Hoare triple {36#true} assume ~fp.leq~DOUBLE(main_~main__S~0#1, ~to_fp~DOUBLE(currentRoundingMode, 10000.0));main_~main____CPAchecker_TMP_2~0#1 := 1bv32; {68#(= |ULTIMATE.start_main_~main____CPAchecker_TMP_2~0#1| (_ bv1 32))} is VALID [2022-02-20 16:21:57,285 INFO L290 TraceCheckUtils]: 10: Hoare triple {68#(= |ULTIMATE.start_main_~main____CPAchecker_TMP_2~0#1| (_ bv1 32))} havoc main_~__tmp_1~0#1;main_~__tmp_1~0#1 := main_~main____CPAchecker_TMP_2~0#1;havoc main_~__VERIFIER_assert__cond~0#1;main_~__VERIFIER_assert__cond~0#1 := main_~__tmp_1~0#1; {72#(= |ULTIMATE.start_main_~__VERIFIER_assert__cond~0#1| (_ bv1 32))} is VALID [2022-02-20 16:21:57,285 INFO L290 TraceCheckUtils]: 11: Hoare triple {72#(= |ULTIMATE.start_main_~__VERIFIER_assert__cond~0#1| (_ bv1 32))} assume 0bv32 == main_~__VERIFIER_assert__cond~0#1; {37#false} is VALID [2022-02-20 16:21:57,285 INFO L290 TraceCheckUtils]: 12: Hoare triple {37#false} assume !false; {37#false} is VALID [2022-02-20 16:21:57,286 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 16:21:57,286 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 16:21:57,287 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 16:21:57,287 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [27290108] [2022-02-20 16:21:57,288 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [27290108] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 16:21:57,288 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 16:21:57,288 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 16:21:57,289 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1070098608] [2022-02-20 16:21:57,290 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 16:21:57,293 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2022-02-20 16:21:57,308 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 16:21:57,310 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:21:57,337 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 13 edges. 13 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:21:57,337 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 16:21:57,337 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 16:21:57,350 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 16:21:57,350 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-20 16:21:57,352 INFO L87 Difference]: Start difference. First operand has 33 states, 30 states have (on average 1.6) internal successors, (48), 32 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:22:10,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:22:10,201 INFO L93 Difference]: Finished difference Result 59 states and 81 transitions. [2022-02-20 16:22:10,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 16:22:10,201 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2022-02-20 16:22:10,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 16:22:10,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:22:10,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 81 transitions. [2022-02-20 16:22:10,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:22:10,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 81 transitions. [2022-02-20 16:22:10,209 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 81 transitions. [2022-02-20 16:22:10,701 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 81 edges. 81 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:22:10,708 INFO L225 Difference]: With dead ends: 59 [2022-02-20 16:22:10,708 INFO L226 Difference]: Without dead ends: 48 [2022-02-20 16:22:10,709 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-02-20 16:22:10,712 INFO L933 BasicCegarLoop]: 46 mSDtfsCounter, 28 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 129 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 16:22:10,712 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [28 Valid, 129 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 16:22:10,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2022-02-20 16:22:10,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 32. [2022-02-20 16:22:10,729 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 16:22:10,730 INFO L82 GeneralOperation]: Start isEquivalent. First operand 48 states. Second operand has 32 states, 30 states have (on average 1.3333333333333333) internal successors, (40), 31 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:22:10,730 INFO L74 IsIncluded]: Start isIncluded. First operand 48 states. Second operand has 32 states, 30 states have (on average 1.3333333333333333) internal successors, (40), 31 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:22:10,731 INFO L87 Difference]: Start difference. First operand 48 states. Second operand has 32 states, 30 states have (on average 1.3333333333333333) internal successors, (40), 31 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:22:10,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:22:10,734 INFO L93 Difference]: Finished difference Result 48 states and 61 transitions. [2022-02-20 16:22:10,734 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 61 transitions. [2022-02-20 16:22:10,734 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:22:10,735 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:22:10,735 INFO L74 IsIncluded]: Start isIncluded. First operand has 32 states, 30 states have (on average 1.3333333333333333) internal successors, (40), 31 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 48 states. [2022-02-20 16:22:10,735 INFO L87 Difference]: Start difference. First operand has 32 states, 30 states have (on average 1.3333333333333333) internal successors, (40), 31 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 48 states. [2022-02-20 16:22:10,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:22:10,738 INFO L93 Difference]: Finished difference Result 48 states and 61 transitions. [2022-02-20 16:22:10,738 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 61 transitions. [2022-02-20 16:22:10,738 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:22:10,739 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:22:10,739 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 16:22:10,739 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 16:22:10,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 30 states have (on average 1.3333333333333333) internal successors, (40), 31 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:22:10,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 40 transitions. [2022-02-20 16:22:10,741 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 40 transitions. Word has length 13 [2022-02-20 16:22:10,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 16:22:10,742 INFO L470 AbstractCegarLoop]: Abstraction has 32 states and 40 transitions. [2022-02-20 16:22:10,742 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:22:10,742 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 40 transitions. [2022-02-20 16:22:10,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-02-20 16:22:10,743 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:22:10,743 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 16:22:10,755 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Ended with exit code 0 [2022-02-20 16:22:10,950 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 16:22:10,951 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:22:10,952 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:22:10,952 INFO L85 PathProgramCache]: Analyzing trace with hash 843294771, now seen corresponding path program 1 times [2022-02-20 16:22:10,952 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 16:22:10,952 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [743513088] [2022-02-20 16:22:10,952 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:22:10,953 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 16:22:10,953 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 16:22:10,955 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-20 16:22:10,956 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2022-02-20 16:22:10,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:22:10,987 INFO L263 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 2 conjunts are in the unsatisfiable core [2022-02-20 16:22:10,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:22:10,996 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 16:22:11,080 INFO L290 TraceCheckUtils]: 0: Hoare triple {297#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;call #Ultimate.allocInit(2bv32, 1bv32);call write~init~intINTTYPE1(48bv8, 1bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 1bv32, 1bv32, 1bv32);call #Ultimate.allocInit(26bv32, 2bv32);call #Ultimate.allocInit(12bv32, 3bv32);~__return_main~0 := 0bv32;~__tmp_129_0~0 := 0bv32;~__tmp_129_1~0 := 0bv32;~__tmp_129_2~0 := 0bv32;~__return_134~0 := 0bv32; {297#true} is VALID [2022-02-20 16:22:11,081 INFO L290 TraceCheckUtils]: 1: Hoare triple {297#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_~__tmp_2~0#1, main_~__VERIFIER_assert__cond~1#1, main_~main____CPAchecker_TMP_2~1#1, main_~main____CPAchecker_TMP_1~1#1, main_~main____CPAchecker_TMP_0~1#1, main_~__tmp_1~0#1, main_~__VERIFIER_assert__cond~0#1, main_~main____CPAchecker_TMP_2~0#1, main_~main____CPAchecker_TMP_1~0#1, main_~main____CPAchecker_TMP_0~0#1, main_~main__E0~0#1, main_~main__E1~0#1, main_~main__S~0#1, main_~main__i~0#1;havoc main_~main__E0~0#1;havoc main_~main__E1~0#1;havoc main_~main__S~0#1;havoc main_~main__i~0#1;main_~main__E1~0#1 := ~convertINTToDOUBLE(currentRoundingMode, 0bv32);main_~main__S~0#1 := ~convertINTToDOUBLE(currentRoundingMode, 0bv32);main_~main__i~0#1 := 0bv32; {297#true} is VALID [2022-02-20 16:22:11,081 INFO L290 TraceCheckUtils]: 2: Hoare triple {297#true} assume ~bvsle32(main_~main__i~0#1, 1000000bv32);main_~main__E0~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~main____CPAchecker_TMP_0~0#1; {297#true} is VALID [2022-02-20 16:22:11,081 INFO L290 TraceCheckUtils]: 3: Hoare triple {297#true} assume ~fp.geq~DOUBLE(main_~main__E0~0#1, ~fp.neg~DOUBLE(~to_fp~DOUBLE(currentRoundingMode, 1.0))); {297#true} is VALID [2022-02-20 16:22:11,081 INFO L290 TraceCheckUtils]: 4: Hoare triple {297#true} assume ~fp.leq~DOUBLE(main_~main__E0~0#1, ~to_fp~DOUBLE(currentRoundingMode, 1.0));main_~main____CPAchecker_TMP_0~0#1 := 1bv32; {297#true} is VALID [2022-02-20 16:22:11,081 INFO L290 TraceCheckUtils]: 5: Hoare triple {297#true} assume 0bv32 != main_~main____CPAchecker_TMP_0~0#1;havoc main_~main____CPAchecker_TMP_1~0#1;main_~main____CPAchecker_TMP_1~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; {297#true} is VALID [2022-02-20 16:22:11,082 INFO L290 TraceCheckUtils]: 6: Hoare triple {297#true} assume !(0bv32 == main_~main____CPAchecker_TMP_1~0#1);main_~main__S~0#1 := ~convertINTToDOUBLE(currentRoundingMode, 0bv32); {320#(= |ULTIMATE.start_main_~main__S~0#1| ((_ to_fp 11 53) currentRoundingMode (_ bv0 32)))} is VALID [2022-02-20 16:22:11,083 INFO L290 TraceCheckUtils]: 7: Hoare triple {320#(= |ULTIMATE.start_main_~main__S~0#1| ((_ to_fp 11 53) currentRoundingMode (_ bv0 32)))} main_~main__E1~0#1 := main_~main__E0~0#1;havoc main_~main____CPAchecker_TMP_2~0#1; {320#(= |ULTIMATE.start_main_~main__S~0#1| ((_ to_fp 11 53) currentRoundingMode (_ bv0 32)))} is VALID [2022-02-20 16:22:11,085 INFO L290 TraceCheckUtils]: 8: Hoare triple {320#(= |ULTIMATE.start_main_~main__S~0#1| ((_ to_fp 11 53) currentRoundingMode (_ bv0 32)))} assume !~fp.geq~DOUBLE(main_~main__S~0#1, ~fp.neg~DOUBLE(~to_fp~DOUBLE(currentRoundingMode, 10000.0))); {298#false} is VALID [2022-02-20 16:22:11,085 INFO L290 TraceCheckUtils]: 9: Hoare triple {298#false} main_~main____CPAchecker_TMP_2~0#1 := 0bv32; {298#false} is VALID [2022-02-20 16:22:11,085 INFO L290 TraceCheckUtils]: 10: Hoare triple {298#false} havoc main_~__tmp_1~0#1;main_~__tmp_1~0#1 := main_~main____CPAchecker_TMP_2~0#1;havoc main_~__VERIFIER_assert__cond~0#1;main_~__VERIFIER_assert__cond~0#1 := main_~__tmp_1~0#1; {298#false} is VALID [2022-02-20 16:22:11,085 INFO L290 TraceCheckUtils]: 11: Hoare triple {298#false} assume 0bv32 == main_~__VERIFIER_assert__cond~0#1; {298#false} is VALID [2022-02-20 16:22:11,085 INFO L290 TraceCheckUtils]: 12: Hoare triple {298#false} assume !false; {298#false} is VALID [2022-02-20 16:22:11,085 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 16:22:11,085 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 16:22:11,086 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 16:22:11,086 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [743513088] [2022-02-20 16:22:11,086 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [743513088] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 16:22:11,086 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 16:22:11,086 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 16:22:11,086 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [85324668] [2022-02-20 16:22:11,086 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 16:22:11,087 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2022-02-20 16:22:11,087 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 16:22:11,087 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:22:11,108 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 13 edges. 13 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:22:11,108 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 16:22:11,109 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 16:22:11,109 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 16:22:11,109 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 16:22:11,109 INFO L87 Difference]: Start difference. First operand 32 states and 40 transitions. Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:22:16,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:22:16,788 INFO L93 Difference]: Finished difference Result 71 states and 91 transitions. [2022-02-20 16:22:16,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 16:22:16,789 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2022-02-20 16:22:16,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 16:22:16,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:22:16,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 89 transitions. [2022-02-20 16:22:16,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:22:16,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 89 transitions. [2022-02-20 16:22:16,793 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 89 transitions. [2022-02-20 16:22:17,682 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 89 edges. 89 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:22:17,684 INFO L225 Difference]: With dead ends: 71 [2022-02-20 16:22:17,684 INFO L226 Difference]: Without dead ends: 51 [2022-02-20 16:22:17,685 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 16:22:17,686 INFO L933 BasicCegarLoop]: 24 mSDtfsCounter, 23 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 40 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2022-02-20 16:22:17,687 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [23 Valid, 40 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2022-02-20 16:22:17,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2022-02-20 16:22:17,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 38. [2022-02-20 16:22:17,690 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 16:22:17,690 INFO L82 GeneralOperation]: Start isEquivalent. First operand 51 states. Second operand has 38 states, 36 states have (on average 1.2777777777777777) internal successors, (46), 37 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:22:17,691 INFO L74 IsIncluded]: Start isIncluded. First operand 51 states. Second operand has 38 states, 36 states have (on average 1.2777777777777777) internal successors, (46), 37 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:22:17,691 INFO L87 Difference]: Start difference. First operand 51 states. Second operand has 38 states, 36 states have (on average 1.2777777777777777) internal successors, (46), 37 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:22:17,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:22:17,692 INFO L93 Difference]: Finished difference Result 51 states and 62 transitions. [2022-02-20 16:22:17,692 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 62 transitions. [2022-02-20 16:22:17,693 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:22:17,693 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:22:17,693 INFO L74 IsIncluded]: Start isIncluded. First operand has 38 states, 36 states have (on average 1.2777777777777777) internal successors, (46), 37 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 51 states. [2022-02-20 16:22:17,693 INFO L87 Difference]: Start difference. First operand has 38 states, 36 states have (on average 1.2777777777777777) internal successors, (46), 37 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 51 states. [2022-02-20 16:22:17,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:22:17,694 INFO L93 Difference]: Finished difference Result 51 states and 62 transitions. [2022-02-20 16:22:17,695 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 62 transitions. [2022-02-20 16:22:17,695 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:22:17,696 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:22:17,696 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 16:22:17,696 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 16:22:17,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 36 states have (on average 1.2777777777777777) internal successors, (46), 37 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:22:17,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 46 transitions. [2022-02-20 16:22:17,704 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 46 transitions. Word has length 13 [2022-02-20 16:22:17,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 16:22:17,705 INFO L470 AbstractCegarLoop]: Abstraction has 38 states and 46 transitions. [2022-02-20 16:22:17,707 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:22:17,707 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 46 transitions. [2022-02-20 16:22:17,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-02-20 16:22:17,708 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:22:17,709 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 16:22:17,719 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2022-02-20 16:22:17,916 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 16:22:17,917 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:22:17,918 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:22:17,918 INFO L85 PathProgramCache]: Analyzing trace with hash 1349105153, now seen corresponding path program 1 times [2022-02-20 16:22:17,918 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 16:22:17,918 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1583528529] [2022-02-20 16:22:17,918 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:22:17,919 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 16:22:17,919 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 16:22:17,920 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-20 16:22:17,922 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2022-02-20 16:22:18,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:22:18,252 INFO L263 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 7 conjunts are in the unsatisfiable core [2022-02-20 16:22:18,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:22:18,269 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 16:22:18,869 INFO L290 TraceCheckUtils]: 0: Hoare triple {586#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;call #Ultimate.allocInit(2bv32, 1bv32);call write~init~intINTTYPE1(48bv8, 1bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 1bv32, 1bv32, 1bv32);call #Ultimate.allocInit(26bv32, 2bv32);call #Ultimate.allocInit(12bv32, 3bv32);~__return_main~0 := 0bv32;~__tmp_129_0~0 := 0bv32;~__tmp_129_1~0 := 0bv32;~__tmp_129_2~0 := 0bv32;~__return_134~0 := 0bv32; {591#(= currentRoundingMode roundNearestTiesToEven)} is VALID [2022-02-20 16:22:18,869 INFO L290 TraceCheckUtils]: 1: Hoare triple {591#(= currentRoundingMode roundNearestTiesToEven)} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_~__tmp_2~0#1, main_~__VERIFIER_assert__cond~1#1, main_~main____CPAchecker_TMP_2~1#1, main_~main____CPAchecker_TMP_1~1#1, main_~main____CPAchecker_TMP_0~1#1, main_~__tmp_1~0#1, main_~__VERIFIER_assert__cond~0#1, main_~main____CPAchecker_TMP_2~0#1, main_~main____CPAchecker_TMP_1~0#1, main_~main____CPAchecker_TMP_0~0#1, main_~main__E0~0#1, main_~main__E1~0#1, main_~main__S~0#1, main_~main__i~0#1;havoc main_~main__E0~0#1;havoc main_~main__E1~0#1;havoc main_~main__S~0#1;havoc main_~main__i~0#1;main_~main__E1~0#1 := ~convertINTToDOUBLE(currentRoundingMode, 0bv32);main_~main__S~0#1 := ~convertINTToDOUBLE(currentRoundingMode, 0bv32);main_~main__i~0#1 := 0bv32; {595#(and (= |ULTIMATE.start_main_~main__S~0#1| ((_ to_fp 11 53) currentRoundingMode (_ bv0 32))) (= ((_ to_fp 11 53) currentRoundingMode (_ bv0 32)) |ULTIMATE.start_main_~main__E1~0#1|) (= currentRoundingMode roundNearestTiesToEven))} is VALID [2022-02-20 16:22:18,870 INFO L290 TraceCheckUtils]: 2: Hoare triple {595#(and (= |ULTIMATE.start_main_~main__S~0#1| ((_ to_fp 11 53) currentRoundingMode (_ bv0 32))) (= ((_ to_fp 11 53) currentRoundingMode (_ bv0 32)) |ULTIMATE.start_main_~main__E1~0#1|) (= currentRoundingMode roundNearestTiesToEven))} assume ~bvsle32(main_~main__i~0#1, 1000000bv32);main_~main__E0~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~main____CPAchecker_TMP_0~0#1; {595#(and (= |ULTIMATE.start_main_~main__S~0#1| ((_ to_fp 11 53) currentRoundingMode (_ bv0 32))) (= ((_ to_fp 11 53) currentRoundingMode (_ bv0 32)) |ULTIMATE.start_main_~main__E1~0#1|) (= currentRoundingMode roundNearestTiesToEven))} is VALID [2022-02-20 16:22:18,870 INFO L290 TraceCheckUtils]: 3: Hoare triple {595#(and (= |ULTIMATE.start_main_~main__S~0#1| ((_ to_fp 11 53) currentRoundingMode (_ bv0 32))) (= ((_ to_fp 11 53) currentRoundingMode (_ bv0 32)) |ULTIMATE.start_main_~main__E1~0#1|) (= currentRoundingMode roundNearestTiesToEven))} assume ~fp.geq~DOUBLE(main_~main__E0~0#1, ~fp.neg~DOUBLE(~to_fp~DOUBLE(currentRoundingMode, 1.0))); {602#(and (fp.geq |ULTIMATE.start_main_~main__E0~0#1| (fp.neg ((_ to_fp 11 53) currentRoundingMode 1.0))) (= |ULTIMATE.start_main_~main__S~0#1| ((_ to_fp 11 53) currentRoundingMode (_ bv0 32))) (= ((_ to_fp 11 53) currentRoundingMode (_ bv0 32)) |ULTIMATE.start_main_~main__E1~0#1|) (= currentRoundingMode roundNearestTiesToEven))} is VALID [2022-02-20 16:22:18,871 INFO L290 TraceCheckUtils]: 4: Hoare triple {602#(and (fp.geq |ULTIMATE.start_main_~main__E0~0#1| (fp.neg ((_ to_fp 11 53) currentRoundingMode 1.0))) (= |ULTIMATE.start_main_~main__S~0#1| ((_ to_fp 11 53) currentRoundingMode (_ bv0 32))) (= ((_ to_fp 11 53) currentRoundingMode (_ bv0 32)) |ULTIMATE.start_main_~main__E1~0#1|) (= currentRoundingMode roundNearestTiesToEven))} assume ~fp.leq~DOUBLE(main_~main__E0~0#1, ~to_fp~DOUBLE(currentRoundingMode, 1.0));main_~main____CPAchecker_TMP_0~0#1 := 1bv32; {606#(and (fp.geq |ULTIMATE.start_main_~main__E0~0#1| (fp.neg ((_ to_fp 11 53) currentRoundingMode 1.0))) (= |ULTIMATE.start_main_~main__S~0#1| ((_ to_fp 11 53) currentRoundingMode (_ bv0 32))) (= ((_ to_fp 11 53) currentRoundingMode (_ bv0 32)) |ULTIMATE.start_main_~main__E1~0#1|) (fp.leq |ULTIMATE.start_main_~main__E0~0#1| ((_ to_fp 11 53) currentRoundingMode 1.0)) (= currentRoundingMode roundNearestTiesToEven))} is VALID [2022-02-20 16:22:18,871 INFO L290 TraceCheckUtils]: 5: Hoare triple {606#(and (fp.geq |ULTIMATE.start_main_~main__E0~0#1| (fp.neg ((_ to_fp 11 53) currentRoundingMode 1.0))) (= |ULTIMATE.start_main_~main__S~0#1| ((_ to_fp 11 53) currentRoundingMode (_ bv0 32))) (= ((_ to_fp 11 53) currentRoundingMode (_ bv0 32)) |ULTIMATE.start_main_~main__E1~0#1|) (fp.leq |ULTIMATE.start_main_~main__E0~0#1| ((_ to_fp 11 53) currentRoundingMode 1.0)) (= currentRoundingMode roundNearestTiesToEven))} assume 0bv32 != main_~main____CPAchecker_TMP_0~0#1;havoc main_~main____CPAchecker_TMP_1~0#1;main_~main____CPAchecker_TMP_1~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; {606#(and (fp.geq |ULTIMATE.start_main_~main__E0~0#1| (fp.neg ((_ to_fp 11 53) currentRoundingMode 1.0))) (= |ULTIMATE.start_main_~main__S~0#1| ((_ to_fp 11 53) currentRoundingMode (_ bv0 32))) (= ((_ to_fp 11 53) currentRoundingMode (_ bv0 32)) |ULTIMATE.start_main_~main__E1~0#1|) (fp.leq |ULTIMATE.start_main_~main__E0~0#1| ((_ to_fp 11 53) currentRoundingMode 1.0)) (= currentRoundingMode roundNearestTiesToEven))} is VALID [2022-02-20 16:22:18,874 INFO L290 TraceCheckUtils]: 6: Hoare triple {606#(and (fp.geq |ULTIMATE.start_main_~main__E0~0#1| (fp.neg ((_ to_fp 11 53) currentRoundingMode 1.0))) (= |ULTIMATE.start_main_~main__S~0#1| ((_ to_fp 11 53) currentRoundingMode (_ bv0 32))) (= ((_ to_fp 11 53) currentRoundingMode (_ bv0 32)) |ULTIMATE.start_main_~main__E1~0#1|) (fp.leq |ULTIMATE.start_main_~main__E0~0#1| ((_ to_fp 11 53) currentRoundingMode 1.0)) (= currentRoundingMode roundNearestTiesToEven))} assume !!(0bv32 == main_~main____CPAchecker_TMP_1~0#1);main_~main__S~0#1 := ~fp.sub~DOUBLE(currentRoundingMode, ~fp.add~DOUBLE(currentRoundingMode, ~fp.mul~DOUBLE(currentRoundingMode, ~to_fp~DOUBLE(currentRoundingMode, 0.999), main_~main__S~0#1), main_~main__E0~0#1), main_~main__E1~0#1); {613#(and (exists ((|ULTIMATE.start_main_~main__E0~0#1| (_ FloatingPoint 11 53))) (and (fp.geq |ULTIMATE.start_main_~main__E0~0#1| (fp.neg ((_ to_fp 11 53) currentRoundingMode 1.0))) (fp.leq |ULTIMATE.start_main_~main__E0~0#1| ((_ to_fp 11 53) currentRoundingMode 1.0)) (= (fp.sub currentRoundingMode (fp.add currentRoundingMode (fp.mul currentRoundingMode ((_ to_fp 11 53) currentRoundingMode (/ 999.0 1000.0)) ((_ to_fp 11 53) currentRoundingMode (_ bv0 32))) |ULTIMATE.start_main_~main__E0~0#1|) ((_ to_fp 11 53) currentRoundingMode (_ bv0 32))) |ULTIMATE.start_main_~main__S~0#1|))) (= currentRoundingMode roundNearestTiesToEven))} is VALID [2022-02-20 16:22:18,879 INFO L290 TraceCheckUtils]: 7: Hoare triple {613#(and (exists ((|ULTIMATE.start_main_~main__E0~0#1| (_ FloatingPoint 11 53))) (and (fp.geq |ULTIMATE.start_main_~main__E0~0#1| (fp.neg ((_ to_fp 11 53) currentRoundingMode 1.0))) (fp.leq |ULTIMATE.start_main_~main__E0~0#1| ((_ to_fp 11 53) currentRoundingMode 1.0)) (= (fp.sub currentRoundingMode (fp.add currentRoundingMode (fp.mul currentRoundingMode ((_ to_fp 11 53) currentRoundingMode (/ 999.0 1000.0)) ((_ to_fp 11 53) currentRoundingMode (_ bv0 32))) |ULTIMATE.start_main_~main__E0~0#1|) ((_ to_fp 11 53) currentRoundingMode (_ bv0 32))) |ULTIMATE.start_main_~main__S~0#1|))) (= currentRoundingMode roundNearestTiesToEven))} main_~main__E1~0#1 := main_~main__E0~0#1;havoc main_~main____CPAchecker_TMP_2~0#1; {613#(and (exists ((|ULTIMATE.start_main_~main__E0~0#1| (_ FloatingPoint 11 53))) (and (fp.geq |ULTIMATE.start_main_~main__E0~0#1| (fp.neg ((_ to_fp 11 53) currentRoundingMode 1.0))) (fp.leq |ULTIMATE.start_main_~main__E0~0#1| ((_ to_fp 11 53) currentRoundingMode 1.0)) (= (fp.sub currentRoundingMode (fp.add currentRoundingMode (fp.mul currentRoundingMode ((_ to_fp 11 53) currentRoundingMode (/ 999.0 1000.0)) ((_ to_fp 11 53) currentRoundingMode (_ bv0 32))) |ULTIMATE.start_main_~main__E0~0#1|) ((_ to_fp 11 53) currentRoundingMode (_ bv0 32))) |ULTIMATE.start_main_~main__S~0#1|))) (= currentRoundingMode roundNearestTiesToEven))} is VALID [2022-02-20 16:22:18,884 INFO L290 TraceCheckUtils]: 8: Hoare triple {613#(and (exists ((|ULTIMATE.start_main_~main__E0~0#1| (_ FloatingPoint 11 53))) (and (fp.geq |ULTIMATE.start_main_~main__E0~0#1| (fp.neg ((_ to_fp 11 53) currentRoundingMode 1.0))) (fp.leq |ULTIMATE.start_main_~main__E0~0#1| ((_ to_fp 11 53) currentRoundingMode 1.0)) (= (fp.sub currentRoundingMode (fp.add currentRoundingMode (fp.mul currentRoundingMode ((_ to_fp 11 53) currentRoundingMode (/ 999.0 1000.0)) ((_ to_fp 11 53) currentRoundingMode (_ bv0 32))) |ULTIMATE.start_main_~main__E0~0#1|) ((_ to_fp 11 53) currentRoundingMode (_ bv0 32))) |ULTIMATE.start_main_~main__S~0#1|))) (= currentRoundingMode roundNearestTiesToEven))} assume !~fp.geq~DOUBLE(main_~main__S~0#1, ~fp.neg~DOUBLE(~to_fp~DOUBLE(currentRoundingMode, 10000.0))); {587#false} is VALID [2022-02-20 16:22:18,884 INFO L290 TraceCheckUtils]: 9: Hoare triple {587#false} main_~main____CPAchecker_TMP_2~0#1 := 0bv32; {587#false} is VALID [2022-02-20 16:22:18,885 INFO L290 TraceCheckUtils]: 10: Hoare triple {587#false} havoc main_~__tmp_1~0#1;main_~__tmp_1~0#1 := main_~main____CPAchecker_TMP_2~0#1;havoc main_~__VERIFIER_assert__cond~0#1;main_~__VERIFIER_assert__cond~0#1 := main_~__tmp_1~0#1; {587#false} is VALID [2022-02-20 16:22:18,885 INFO L290 TraceCheckUtils]: 11: Hoare triple {587#false} assume 0bv32 == main_~__VERIFIER_assert__cond~0#1; {587#false} is VALID [2022-02-20 16:22:18,885 INFO L290 TraceCheckUtils]: 12: Hoare triple {587#false} assume !false; {587#false} is VALID [2022-02-20 16:22:18,885 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 16:22:18,885 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 16:22:18,885 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 16:22:18,885 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1583528529] [2022-02-20 16:22:18,886 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1583528529] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 16:22:18,886 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 16:22:18,886 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-20 16:22:18,886 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [982173173] [2022-02-20 16:22:18,886 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 16:22:18,886 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2022-02-20 16:22:18,886 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 16:22:18,886 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:22:19,411 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 13 edges. 13 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:22:19,412 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-02-20 16:22:19,412 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 16:22:19,412 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-02-20 16:22:19,412 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2022-02-20 16:22:19,413 INFO L87 Difference]: Start difference. First operand 38 states and 46 transitions. Second operand has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:22:25,672 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.10s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-02-20 16:22:25,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:22:25,911 INFO L93 Difference]: Finished difference Result 61 states and 74 transitions. [2022-02-20 16:22:25,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-02-20 16:22:25,911 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2022-02-20 16:22:25,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 16:22:25,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:22:25,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 64 transitions. [2022-02-20 16:22:25,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:22:25,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 64 transitions. [2022-02-20 16:22:25,913 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 64 transitions. [2022-02-20 16:22:26,779 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 64 edges. 64 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:22:26,780 INFO L225 Difference]: With dead ends: 61 [2022-02-20 16:22:26,780 INFO L226 Difference]: Without dead ends: 38 [2022-02-20 16:22:26,781 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2022-02-20 16:22:26,781 INFO L933 BasicCegarLoop]: 30 mSDtfsCounter, 8 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 3 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 14 IncrementalHoareTripleChecker+Unchecked, 3.7s IncrementalHoareTripleChecker+Time [2022-02-20 16:22:26,782 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [8 Valid, 73 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 30 Invalid, 1 Unknown, 14 Unchecked, 3.7s Time] [2022-02-20 16:22:26,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2022-02-20 16:22:26,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2022-02-20 16:22:26,784 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 16:22:26,784 INFO L82 GeneralOperation]: Start isEquivalent. First operand 38 states. Second operand has 38 states, 36 states have (on average 1.25) internal successors, (45), 37 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:22:26,785 INFO L74 IsIncluded]: Start isIncluded. First operand 38 states. Second operand has 38 states, 36 states have (on average 1.25) internal successors, (45), 37 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:22:26,785 INFO L87 Difference]: Start difference. First operand 38 states. Second operand has 38 states, 36 states have (on average 1.25) internal successors, (45), 37 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:22:26,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:22:26,786 INFO L93 Difference]: Finished difference Result 38 states and 45 transitions. [2022-02-20 16:22:26,786 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 45 transitions. [2022-02-20 16:22:26,786 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:22:26,786 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:22:26,786 INFO L74 IsIncluded]: Start isIncluded. First operand has 38 states, 36 states have (on average 1.25) internal successors, (45), 37 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 38 states. [2022-02-20 16:22:26,799 INFO L87 Difference]: Start difference. First operand has 38 states, 36 states have (on average 1.25) internal successors, (45), 37 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 38 states. [2022-02-20 16:22:26,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:22:26,801 INFO L93 Difference]: Finished difference Result 38 states and 45 transitions. [2022-02-20 16:22:26,801 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 45 transitions. [2022-02-20 16:22:26,801 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:22:26,802 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:22:26,802 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 16:22:26,802 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 16:22:26,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 36 states have (on average 1.25) internal successors, (45), 37 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:22:26,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 45 transitions. [2022-02-20 16:22:26,803 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 45 transitions. Word has length 13 [2022-02-20 16:22:26,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 16:22:26,804 INFO L470 AbstractCegarLoop]: Abstraction has 38 states and 45 transitions. [2022-02-20 16:22:26,804 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:22:26,804 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 45 transitions. [2022-02-20 16:22:26,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-02-20 16:22:26,805 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:22:26,805 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 16:22:26,827 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2022-02-20 16:22:27,022 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 16:22:27,023 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:22:27,023 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:22:27,024 INFO L85 PathProgramCache]: Analyzing trace with hash 1134941057, now seen corresponding path program 1 times [2022-02-20 16:22:27,024 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 16:22:27,024 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [662945788] [2022-02-20 16:22:27,024 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:22:27,024 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 16:22:27,025 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 16:22:27,026 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-20 16:22:27,028 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2022-02-20 16:22:27,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:22:27,324 INFO L263 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 8 conjunts are in the unsatisfiable core [2022-02-20 16:22:27,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:22:27,336 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 16:22:28,087 INFO L290 TraceCheckUtils]: 0: Hoare triple {839#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;call #Ultimate.allocInit(2bv32, 1bv32);call write~init~intINTTYPE1(48bv8, 1bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 1bv32, 1bv32, 1bv32);call #Ultimate.allocInit(26bv32, 2bv32);call #Ultimate.allocInit(12bv32, 3bv32);~__return_main~0 := 0bv32;~__tmp_129_0~0 := 0bv32;~__tmp_129_1~0 := 0bv32;~__tmp_129_2~0 := 0bv32;~__return_134~0 := 0bv32; {844#(= currentRoundingMode roundNearestTiesToEven)} is VALID [2022-02-20 16:22:28,087 INFO L290 TraceCheckUtils]: 1: Hoare triple {844#(= currentRoundingMode roundNearestTiesToEven)} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_~__tmp_2~0#1, main_~__VERIFIER_assert__cond~1#1, main_~main____CPAchecker_TMP_2~1#1, main_~main____CPAchecker_TMP_1~1#1, main_~main____CPAchecker_TMP_0~1#1, main_~__tmp_1~0#1, main_~__VERIFIER_assert__cond~0#1, main_~main____CPAchecker_TMP_2~0#1, main_~main____CPAchecker_TMP_1~0#1, main_~main____CPAchecker_TMP_0~0#1, main_~main__E0~0#1, main_~main__E1~0#1, main_~main__S~0#1, main_~main__i~0#1;havoc main_~main__E0~0#1;havoc main_~main__E1~0#1;havoc main_~main__S~0#1;havoc main_~main__i~0#1;main_~main__E1~0#1 := ~convertINTToDOUBLE(currentRoundingMode, 0bv32);main_~main__S~0#1 := ~convertINTToDOUBLE(currentRoundingMode, 0bv32);main_~main__i~0#1 := 0bv32; {848#(and (= |ULTIMATE.start_main_~main__S~0#1| ((_ to_fp 11 53) currentRoundingMode (_ bv0 32))) (= ((_ to_fp 11 53) currentRoundingMode (_ bv0 32)) |ULTIMATE.start_main_~main__E1~0#1|) (= currentRoundingMode roundNearestTiesToEven))} is VALID [2022-02-20 16:22:28,088 INFO L290 TraceCheckUtils]: 2: Hoare triple {848#(and (= |ULTIMATE.start_main_~main__S~0#1| ((_ to_fp 11 53) currentRoundingMode (_ bv0 32))) (= ((_ to_fp 11 53) currentRoundingMode (_ bv0 32)) |ULTIMATE.start_main_~main__E1~0#1|) (= currentRoundingMode roundNearestTiesToEven))} assume ~bvsle32(main_~main__i~0#1, 1000000bv32);main_~main__E0~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~main____CPAchecker_TMP_0~0#1; {848#(and (= |ULTIMATE.start_main_~main__S~0#1| ((_ to_fp 11 53) currentRoundingMode (_ bv0 32))) (= ((_ to_fp 11 53) currentRoundingMode (_ bv0 32)) |ULTIMATE.start_main_~main__E1~0#1|) (= currentRoundingMode roundNearestTiesToEven))} is VALID [2022-02-20 16:22:28,088 INFO L290 TraceCheckUtils]: 3: Hoare triple {848#(and (= |ULTIMATE.start_main_~main__S~0#1| ((_ to_fp 11 53) currentRoundingMode (_ bv0 32))) (= ((_ to_fp 11 53) currentRoundingMode (_ bv0 32)) |ULTIMATE.start_main_~main__E1~0#1|) (= currentRoundingMode roundNearestTiesToEven))} assume ~fp.geq~DOUBLE(main_~main__E0~0#1, ~fp.neg~DOUBLE(~to_fp~DOUBLE(currentRoundingMode, 1.0))); {855#(and (fp.geq |ULTIMATE.start_main_~main__E0~0#1| (fp.neg ((_ to_fp 11 53) currentRoundingMode 1.0))) (= |ULTIMATE.start_main_~main__S~0#1| ((_ to_fp 11 53) currentRoundingMode (_ bv0 32))) (= ((_ to_fp 11 53) currentRoundingMode (_ bv0 32)) |ULTIMATE.start_main_~main__E1~0#1|) (= currentRoundingMode roundNearestTiesToEven))} is VALID [2022-02-20 16:22:28,089 INFO L290 TraceCheckUtils]: 4: Hoare triple {855#(and (fp.geq |ULTIMATE.start_main_~main__E0~0#1| (fp.neg ((_ to_fp 11 53) currentRoundingMode 1.0))) (= |ULTIMATE.start_main_~main__S~0#1| ((_ to_fp 11 53) currentRoundingMode (_ bv0 32))) (= ((_ to_fp 11 53) currentRoundingMode (_ bv0 32)) |ULTIMATE.start_main_~main__E1~0#1|) (= currentRoundingMode roundNearestTiesToEven))} assume ~fp.leq~DOUBLE(main_~main__E0~0#1, ~to_fp~DOUBLE(currentRoundingMode, 1.0));main_~main____CPAchecker_TMP_0~0#1 := 1bv32; {859#(and (fp.geq |ULTIMATE.start_main_~main__E0~0#1| (fp.neg ((_ to_fp 11 53) currentRoundingMode 1.0))) (= |ULTIMATE.start_main_~main__S~0#1| ((_ to_fp 11 53) currentRoundingMode (_ bv0 32))) (= ((_ to_fp 11 53) currentRoundingMode (_ bv0 32)) |ULTIMATE.start_main_~main__E1~0#1|) (fp.leq |ULTIMATE.start_main_~main__E0~0#1| ((_ to_fp 11 53) currentRoundingMode 1.0)) (= currentRoundingMode roundNearestTiesToEven))} is VALID [2022-02-20 16:22:28,089 INFO L290 TraceCheckUtils]: 5: Hoare triple {859#(and (fp.geq |ULTIMATE.start_main_~main__E0~0#1| (fp.neg ((_ to_fp 11 53) currentRoundingMode 1.0))) (= |ULTIMATE.start_main_~main__S~0#1| ((_ to_fp 11 53) currentRoundingMode (_ bv0 32))) (= ((_ to_fp 11 53) currentRoundingMode (_ bv0 32)) |ULTIMATE.start_main_~main__E1~0#1|) (fp.leq |ULTIMATE.start_main_~main__E0~0#1| ((_ to_fp 11 53) currentRoundingMode 1.0)) (= currentRoundingMode roundNearestTiesToEven))} assume 0bv32 != main_~main____CPAchecker_TMP_0~0#1;havoc main_~main____CPAchecker_TMP_1~0#1;main_~main____CPAchecker_TMP_1~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; {859#(and (fp.geq |ULTIMATE.start_main_~main__E0~0#1| (fp.neg ((_ to_fp 11 53) currentRoundingMode 1.0))) (= |ULTIMATE.start_main_~main__S~0#1| ((_ to_fp 11 53) currentRoundingMode (_ bv0 32))) (= ((_ to_fp 11 53) currentRoundingMode (_ bv0 32)) |ULTIMATE.start_main_~main__E1~0#1|) (fp.leq |ULTIMATE.start_main_~main__E0~0#1| ((_ to_fp 11 53) currentRoundingMode 1.0)) (= currentRoundingMode roundNearestTiesToEven))} is VALID [2022-02-20 16:22:28,092 INFO L290 TraceCheckUtils]: 6: Hoare triple {859#(and (fp.geq |ULTIMATE.start_main_~main__E0~0#1| (fp.neg ((_ to_fp 11 53) currentRoundingMode 1.0))) (= |ULTIMATE.start_main_~main__S~0#1| ((_ to_fp 11 53) currentRoundingMode (_ bv0 32))) (= ((_ to_fp 11 53) currentRoundingMode (_ bv0 32)) |ULTIMATE.start_main_~main__E1~0#1|) (fp.leq |ULTIMATE.start_main_~main__E0~0#1| ((_ to_fp 11 53) currentRoundingMode 1.0)) (= currentRoundingMode roundNearestTiesToEven))} assume !!(0bv32 == main_~main____CPAchecker_TMP_1~0#1);main_~main__S~0#1 := ~fp.sub~DOUBLE(currentRoundingMode, ~fp.add~DOUBLE(currentRoundingMode, ~fp.mul~DOUBLE(currentRoundingMode, ~to_fp~DOUBLE(currentRoundingMode, 0.999), main_~main__S~0#1), main_~main__E0~0#1), main_~main__E1~0#1); {866#(and (exists ((|ULTIMATE.start_main_~main__E0~0#1| (_ FloatingPoint 11 53))) (and (fp.geq |ULTIMATE.start_main_~main__E0~0#1| (fp.neg ((_ to_fp 11 53) currentRoundingMode 1.0))) (fp.leq |ULTIMATE.start_main_~main__E0~0#1| ((_ to_fp 11 53) currentRoundingMode 1.0)) (= (fp.sub currentRoundingMode (fp.add currentRoundingMode (fp.mul currentRoundingMode ((_ to_fp 11 53) currentRoundingMode (/ 999.0 1000.0)) ((_ to_fp 11 53) currentRoundingMode (_ bv0 32))) |ULTIMATE.start_main_~main__E0~0#1|) ((_ to_fp 11 53) currentRoundingMode (_ bv0 32))) |ULTIMATE.start_main_~main__S~0#1|))) (= currentRoundingMode roundNearestTiesToEven))} is VALID [2022-02-20 16:22:28,094 INFO L290 TraceCheckUtils]: 7: Hoare triple {866#(and (exists ((|ULTIMATE.start_main_~main__E0~0#1| (_ FloatingPoint 11 53))) (and (fp.geq |ULTIMATE.start_main_~main__E0~0#1| (fp.neg ((_ to_fp 11 53) currentRoundingMode 1.0))) (fp.leq |ULTIMATE.start_main_~main__E0~0#1| ((_ to_fp 11 53) currentRoundingMode 1.0)) (= (fp.sub currentRoundingMode (fp.add currentRoundingMode (fp.mul currentRoundingMode ((_ to_fp 11 53) currentRoundingMode (/ 999.0 1000.0)) ((_ to_fp 11 53) currentRoundingMode (_ bv0 32))) |ULTIMATE.start_main_~main__E0~0#1|) ((_ to_fp 11 53) currentRoundingMode (_ bv0 32))) |ULTIMATE.start_main_~main__S~0#1|))) (= currentRoundingMode roundNearestTiesToEven))} main_~main__E1~0#1 := main_~main__E0~0#1;havoc main_~main____CPAchecker_TMP_2~0#1; {866#(and (exists ((|ULTIMATE.start_main_~main__E0~0#1| (_ FloatingPoint 11 53))) (and (fp.geq |ULTIMATE.start_main_~main__E0~0#1| (fp.neg ((_ to_fp 11 53) currentRoundingMode 1.0))) (fp.leq |ULTIMATE.start_main_~main__E0~0#1| ((_ to_fp 11 53) currentRoundingMode 1.0)) (= (fp.sub currentRoundingMode (fp.add currentRoundingMode (fp.mul currentRoundingMode ((_ to_fp 11 53) currentRoundingMode (/ 999.0 1000.0)) ((_ to_fp 11 53) currentRoundingMode (_ bv0 32))) |ULTIMATE.start_main_~main__E0~0#1|) ((_ to_fp 11 53) currentRoundingMode (_ bv0 32))) |ULTIMATE.start_main_~main__S~0#1|))) (= currentRoundingMode roundNearestTiesToEven))} is VALID [2022-02-20 16:22:28,097 INFO L290 TraceCheckUtils]: 8: Hoare triple {866#(and (exists ((|ULTIMATE.start_main_~main__E0~0#1| (_ FloatingPoint 11 53))) (and (fp.geq |ULTIMATE.start_main_~main__E0~0#1| (fp.neg ((_ to_fp 11 53) currentRoundingMode 1.0))) (fp.leq |ULTIMATE.start_main_~main__E0~0#1| ((_ to_fp 11 53) currentRoundingMode 1.0)) (= (fp.sub currentRoundingMode (fp.add currentRoundingMode (fp.mul currentRoundingMode ((_ to_fp 11 53) currentRoundingMode (/ 999.0 1000.0)) ((_ to_fp 11 53) currentRoundingMode (_ bv0 32))) |ULTIMATE.start_main_~main__E0~0#1|) ((_ to_fp 11 53) currentRoundingMode (_ bv0 32))) |ULTIMATE.start_main_~main__S~0#1|))) (= currentRoundingMode roundNearestTiesToEven))} assume ~fp.geq~DOUBLE(main_~main__S~0#1, ~fp.neg~DOUBLE(~to_fp~DOUBLE(currentRoundingMode, 10000.0))); {866#(and (exists ((|ULTIMATE.start_main_~main__E0~0#1| (_ FloatingPoint 11 53))) (and (fp.geq |ULTIMATE.start_main_~main__E0~0#1| (fp.neg ((_ to_fp 11 53) currentRoundingMode 1.0))) (fp.leq |ULTIMATE.start_main_~main__E0~0#1| ((_ to_fp 11 53) currentRoundingMode 1.0)) (= (fp.sub currentRoundingMode (fp.add currentRoundingMode (fp.mul currentRoundingMode ((_ to_fp 11 53) currentRoundingMode (/ 999.0 1000.0)) ((_ to_fp 11 53) currentRoundingMode (_ bv0 32))) |ULTIMATE.start_main_~main__E0~0#1|) ((_ to_fp 11 53) currentRoundingMode (_ bv0 32))) |ULTIMATE.start_main_~main__S~0#1|))) (= currentRoundingMode roundNearestTiesToEven))} is VALID [2022-02-20 16:22:28,101 INFO L290 TraceCheckUtils]: 9: Hoare triple {866#(and (exists ((|ULTIMATE.start_main_~main__E0~0#1| (_ FloatingPoint 11 53))) (and (fp.geq |ULTIMATE.start_main_~main__E0~0#1| (fp.neg ((_ to_fp 11 53) currentRoundingMode 1.0))) (fp.leq |ULTIMATE.start_main_~main__E0~0#1| ((_ to_fp 11 53) currentRoundingMode 1.0)) (= (fp.sub currentRoundingMode (fp.add currentRoundingMode (fp.mul currentRoundingMode ((_ to_fp 11 53) currentRoundingMode (/ 999.0 1000.0)) ((_ to_fp 11 53) currentRoundingMode (_ bv0 32))) |ULTIMATE.start_main_~main__E0~0#1|) ((_ to_fp 11 53) currentRoundingMode (_ bv0 32))) |ULTIMATE.start_main_~main__S~0#1|))) (= currentRoundingMode roundNearestTiesToEven))} assume !~fp.leq~DOUBLE(main_~main__S~0#1, ~to_fp~DOUBLE(currentRoundingMode, 10000.0)); {840#false} is VALID [2022-02-20 16:22:28,101 INFO L290 TraceCheckUtils]: 10: Hoare triple {840#false} main_~main____CPAchecker_TMP_2~0#1 := 0bv32; {840#false} is VALID [2022-02-20 16:22:28,101 INFO L290 TraceCheckUtils]: 11: Hoare triple {840#false} havoc main_~__tmp_1~0#1;main_~__tmp_1~0#1 := main_~main____CPAchecker_TMP_2~0#1;havoc main_~__VERIFIER_assert__cond~0#1;main_~__VERIFIER_assert__cond~0#1 := main_~__tmp_1~0#1; {840#false} is VALID [2022-02-20 16:22:28,101 INFO L290 TraceCheckUtils]: 12: Hoare triple {840#false} assume 0bv32 == main_~__VERIFIER_assert__cond~0#1; {840#false} is VALID [2022-02-20 16:22:28,102 INFO L290 TraceCheckUtils]: 13: Hoare triple {840#false} assume !false; {840#false} is VALID [2022-02-20 16:22:28,102 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 16:22:28,102 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 16:22:28,102 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 16:22:28,102 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [662945788] [2022-02-20 16:22:28,102 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [662945788] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 16:22:28,102 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 16:22:28,102 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-20 16:22:28,102 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [974760821] [2022-02-20 16:22:28,102 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 16:22:28,103 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.0) internal successors, (14), 6 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2022-02-20 16:22:28,103 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 16:22:28,103 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 2.0) internal successors, (14), 6 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:22:28,357 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 14 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:22:28,357 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-02-20 16:22:28,357 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 16:22:28,358 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-02-20 16:22:28,358 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2022-02-20 16:22:28,358 INFO L87 Difference]: Start difference. First operand 38 states and 45 transitions. Second operand has 7 states, 7 states have (on average 2.0) internal successors, (14), 6 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:22:34,681 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.09s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-02-20 16:22:36,688 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-02-20 16:22:36,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:22:36,940 INFO L93 Difference]: Finished difference Result 56 states and 68 transitions. [2022-02-20 16:22:36,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-02-20 16:22:36,940 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.0) internal successors, (14), 6 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2022-02-20 16:22:36,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 16:22:36,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 2.0) internal successors, (14), 6 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:22:36,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 60 transitions. [2022-02-20 16:22:36,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 2.0) internal successors, (14), 6 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:22:36,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 60 transitions. [2022-02-20 16:22:36,942 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 60 transitions. [2022-02-20 16:22:37,637 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 60 edges. 60 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:22:37,638 INFO L225 Difference]: With dead ends: 56 [2022-02-20 16:22:37,638 INFO L226 Difference]: Without dead ends: 33 [2022-02-20 16:22:37,638 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2022-02-20 16:22:37,639 INFO L933 BasicCegarLoop]: 25 mSDtfsCounter, 9 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 3 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 4 IncrementalHoareTripleChecker+Unchecked, 5.9s IncrementalHoareTripleChecker+Time [2022-02-20 16:22:37,639 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [9 Valid, 58 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 46 Invalid, 2 Unknown, 4 Unchecked, 5.9s Time] [2022-02-20 16:22:37,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2022-02-20 16:22:37,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 30. [2022-02-20 16:22:37,641 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 16:22:37,641 INFO L82 GeneralOperation]: Start isEquivalent. First operand 33 states. Second operand has 30 states, 29 states have (on average 1.2413793103448276) internal successors, (36), 29 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:22:37,642 INFO L74 IsIncluded]: Start isIncluded. First operand 33 states. Second operand has 30 states, 29 states have (on average 1.2413793103448276) internal successors, (36), 29 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:22:37,642 INFO L87 Difference]: Start difference. First operand 33 states. Second operand has 30 states, 29 states have (on average 1.2413793103448276) internal successors, (36), 29 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:22:37,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:22:37,642 INFO L93 Difference]: Finished difference Result 33 states and 39 transitions. [2022-02-20 16:22:37,647 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 39 transitions. [2022-02-20 16:22:37,648 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:22:37,648 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:22:37,648 INFO L74 IsIncluded]: Start isIncluded. First operand has 30 states, 29 states have (on average 1.2413793103448276) internal successors, (36), 29 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 33 states. [2022-02-20 16:22:37,648 INFO L87 Difference]: Start difference. First operand has 30 states, 29 states have (on average 1.2413793103448276) internal successors, (36), 29 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 33 states. [2022-02-20 16:22:37,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:22:37,649 INFO L93 Difference]: Finished difference Result 33 states and 39 transitions. [2022-02-20 16:22:37,649 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 39 transitions. [2022-02-20 16:22:37,649 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:22:37,649 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:22:37,650 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 16:22:37,650 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 16:22:37,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 29 states have (on average 1.2413793103448276) internal successors, (36), 29 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:22:37,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 36 transitions. [2022-02-20 16:22:37,651 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 36 transitions. Word has length 14 [2022-02-20 16:22:37,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 16:22:37,651 INFO L470 AbstractCegarLoop]: Abstraction has 30 states and 36 transitions. [2022-02-20 16:22:37,651 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.0) internal successors, (14), 6 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:22:37,651 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 36 transitions. [2022-02-20 16:22:37,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-02-20 16:22:37,653 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:22:37,653 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 16:22:37,675 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2022-02-20 16:22:37,866 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 16:22:37,866 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:22:37,866 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:22:37,867 INFO L85 PathProgramCache]: Analyzing trace with hash -151896705, now seen corresponding path program 1 times [2022-02-20 16:22:37,867 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 16:22:37,867 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1478993405] [2022-02-20 16:22:37,867 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:22:37,867 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 16:22:37,867 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 16:22:37,868 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-20 16:22:37,870 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2022-02-20 16:22:37,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:22:37,938 INFO L263 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 2 conjunts are in the unsatisfiable core [2022-02-20 16:22:37,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:22:37,945 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 16:22:38,029 INFO L290 TraceCheckUtils]: 0: Hoare triple {1067#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;call #Ultimate.allocInit(2bv32, 1bv32);call write~init~intINTTYPE1(48bv8, 1bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 1bv32, 1bv32, 1bv32);call #Ultimate.allocInit(26bv32, 2bv32);call #Ultimate.allocInit(12bv32, 3bv32);~__return_main~0 := 0bv32;~__tmp_129_0~0 := 0bv32;~__tmp_129_1~0 := 0bv32;~__tmp_129_2~0 := 0bv32;~__return_134~0 := 0bv32; {1067#true} is VALID [2022-02-20 16:22:38,029 INFO L290 TraceCheckUtils]: 1: Hoare triple {1067#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_~__tmp_2~0#1, main_~__VERIFIER_assert__cond~1#1, main_~main____CPAchecker_TMP_2~1#1, main_~main____CPAchecker_TMP_1~1#1, main_~main____CPAchecker_TMP_0~1#1, main_~__tmp_1~0#1, main_~__VERIFIER_assert__cond~0#1, main_~main____CPAchecker_TMP_2~0#1, main_~main____CPAchecker_TMP_1~0#1, main_~main____CPAchecker_TMP_0~0#1, main_~main__E0~0#1, main_~main__E1~0#1, main_~main__S~0#1, main_~main__i~0#1;havoc main_~main__E0~0#1;havoc main_~main__E1~0#1;havoc main_~main__S~0#1;havoc main_~main__i~0#1;main_~main__E1~0#1 := ~convertINTToDOUBLE(currentRoundingMode, 0bv32);main_~main__S~0#1 := ~convertINTToDOUBLE(currentRoundingMode, 0bv32);main_~main__i~0#1 := 0bv32; {1067#true} is VALID [2022-02-20 16:22:38,029 INFO L290 TraceCheckUtils]: 2: Hoare triple {1067#true} assume ~bvsle32(main_~main__i~0#1, 1000000bv32);main_~main__E0~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~main____CPAchecker_TMP_0~0#1; {1067#true} is VALID [2022-02-20 16:22:38,029 INFO L290 TraceCheckUtils]: 3: Hoare triple {1067#true} assume ~fp.geq~DOUBLE(main_~main__E0~0#1, ~fp.neg~DOUBLE(~to_fp~DOUBLE(currentRoundingMode, 1.0))); {1067#true} is VALID [2022-02-20 16:22:38,029 INFO L290 TraceCheckUtils]: 4: Hoare triple {1067#true} assume ~fp.leq~DOUBLE(main_~main__E0~0#1, ~to_fp~DOUBLE(currentRoundingMode, 1.0));main_~main____CPAchecker_TMP_0~0#1 := 1bv32; {1067#true} is VALID [2022-02-20 16:22:38,029 INFO L290 TraceCheckUtils]: 5: Hoare triple {1067#true} assume 0bv32 != main_~main____CPAchecker_TMP_0~0#1;havoc main_~main____CPAchecker_TMP_1~0#1;main_~main____CPAchecker_TMP_1~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; {1067#true} is VALID [2022-02-20 16:22:38,029 INFO L290 TraceCheckUtils]: 6: Hoare triple {1067#true} assume !(0bv32 == main_~main____CPAchecker_TMP_1~0#1);main_~main__S~0#1 := ~convertINTToDOUBLE(currentRoundingMode, 0bv32); {1067#true} is VALID [2022-02-20 16:22:38,029 INFO L290 TraceCheckUtils]: 7: Hoare triple {1067#true} main_~main__E1~0#1 := main_~main__E0~0#1;havoc main_~main____CPAchecker_TMP_2~0#1; {1067#true} is VALID [2022-02-20 16:22:38,030 INFO L290 TraceCheckUtils]: 8: Hoare triple {1067#true} assume ~fp.geq~DOUBLE(main_~main__S~0#1, ~fp.neg~DOUBLE(~to_fp~DOUBLE(currentRoundingMode, 10000.0))); {1067#true} is VALID [2022-02-20 16:22:38,030 INFO L290 TraceCheckUtils]: 9: Hoare triple {1067#true} assume ~fp.leq~DOUBLE(main_~main__S~0#1, ~to_fp~DOUBLE(currentRoundingMode, 10000.0));main_~main____CPAchecker_TMP_2~0#1 := 1bv32; {1067#true} is VALID [2022-02-20 16:22:38,030 INFO L290 TraceCheckUtils]: 10: Hoare triple {1067#true} havoc main_~__tmp_1~0#1;main_~__tmp_1~0#1 := main_~main____CPAchecker_TMP_2~0#1;havoc main_~__VERIFIER_assert__cond~0#1;main_~__VERIFIER_assert__cond~0#1 := main_~__tmp_1~0#1; {1067#true} is VALID [2022-02-20 16:22:38,030 INFO L290 TraceCheckUtils]: 11: Hoare triple {1067#true} assume !(0bv32 == main_~__VERIFIER_assert__cond~0#1);~__tmp_129_0~0 := main_~main____CPAchecker_TMP_2~0#1;~__tmp_129_1~0 := main_~main____CPAchecker_TMP_1~0#1;~__tmp_129_2~0 := main_~main____CPAchecker_TMP_0~0#1; {1067#true} is VALID [2022-02-20 16:22:38,030 INFO L290 TraceCheckUtils]: 12: Hoare triple {1067#true} main_~main____CPAchecker_TMP_2~0#1 := ~__tmp_129_0~0;main_~main____CPAchecker_TMP_1~0#1 := ~__tmp_129_1~0;main_~main____CPAchecker_TMP_0~0#1 := ~__tmp_129_2~0;main_~main__i~0#1 := ~bvadd32(1bv32, main_~main__i~0#1); {1067#true} is VALID [2022-02-20 16:22:38,030 INFO L290 TraceCheckUtils]: 13: Hoare triple {1067#true} assume ~bvsle32(main_~main__i~0#1, 1000000bv32);main_~main__E0~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~main____CPAchecker_TMP_0~1#1; {1067#true} is VALID [2022-02-20 16:22:38,030 INFO L290 TraceCheckUtils]: 14: Hoare triple {1067#true} assume !~fp.geq~DOUBLE(main_~main__E0~0#1, ~fp.neg~DOUBLE(~to_fp~DOUBLE(currentRoundingMode, 1.0))); {1067#true} is VALID [2022-02-20 16:22:38,034 INFO L290 TraceCheckUtils]: 15: Hoare triple {1067#true} main_~main____CPAchecker_TMP_0~1#1 := 0bv32; {1117#(= |ULTIMATE.start_main_~main____CPAchecker_TMP_0~1#1| (_ bv0 32))} is VALID [2022-02-20 16:22:38,035 INFO L290 TraceCheckUtils]: 16: Hoare triple {1117#(= |ULTIMATE.start_main_~main____CPAchecker_TMP_0~1#1| (_ bv0 32))} assume 0bv32 != main_~main____CPAchecker_TMP_0~1#1;havoc main_~main____CPAchecker_TMP_1~1#1;main_~main____CPAchecker_TMP_1~1#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1; {1068#false} is VALID [2022-02-20 16:22:38,035 INFO L290 TraceCheckUtils]: 17: Hoare triple {1068#false} assume !(0bv32 == main_~main____CPAchecker_TMP_1~1#1);main_~main__S~0#1 := ~convertINTToDOUBLE(currentRoundingMode, 0bv32); {1068#false} is VALID [2022-02-20 16:22:38,035 INFO L290 TraceCheckUtils]: 18: Hoare triple {1068#false} main_~main__E1~0#1 := main_~main__E0~0#1;havoc main_~main____CPAchecker_TMP_2~1#1; {1068#false} is VALID [2022-02-20 16:22:38,035 INFO L290 TraceCheckUtils]: 19: Hoare triple {1068#false} assume ~fp.geq~DOUBLE(main_~main__S~0#1, ~fp.neg~DOUBLE(~to_fp~DOUBLE(currentRoundingMode, 10000.0))); {1068#false} is VALID [2022-02-20 16:22:38,035 INFO L290 TraceCheckUtils]: 20: Hoare triple {1068#false} assume ~fp.leq~DOUBLE(main_~main__S~0#1, ~to_fp~DOUBLE(currentRoundingMode, 10000.0));main_~main____CPAchecker_TMP_2~1#1 := 1bv32; {1068#false} is VALID [2022-02-20 16:22:38,035 INFO L290 TraceCheckUtils]: 21: Hoare triple {1068#false} havoc main_~__tmp_2~0#1;main_~__tmp_2~0#1 := main_~main____CPAchecker_TMP_2~1#1;havoc main_~__VERIFIER_assert__cond~1#1;main_~__VERIFIER_assert__cond~1#1 := main_~__tmp_2~0#1; {1068#false} is VALID [2022-02-20 16:22:38,035 INFO L290 TraceCheckUtils]: 22: Hoare triple {1068#false} assume 0bv32 == main_~__VERIFIER_assert__cond~1#1; {1068#false} is VALID [2022-02-20 16:22:38,035 INFO L290 TraceCheckUtils]: 23: Hoare triple {1068#false} assume !false; {1068#false} is VALID [2022-02-20 16:22:38,036 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 16:22:38,036 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 16:22:38,036 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 16:22:38,036 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1478993405] [2022-02-20 16:22:38,036 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1478993405] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 16:22:38,036 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 16:22:38,036 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 16:22:38,036 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2088836400] [2022-02-20 16:22:38,036 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 16:22:38,037 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-02-20 16:22:38,037 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 16:22:38,037 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:22:38,060 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:22:38,060 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 16:22:38,061 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 16:22:38,062 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 16:22:38,062 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 16:22:38,063 INFO L87 Difference]: Start difference. First operand 30 states and 36 transitions. Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:22:44,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:22:44,892 INFO L93 Difference]: Finished difference Result 49 states and 60 transitions. [2022-02-20 16:22:44,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 16:22:44,892 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-02-20 16:22:44,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 16:22:44,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:22:44,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 54 transitions. [2022-02-20 16:22:44,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:22:44,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 54 transitions. [2022-02-20 16:22:44,893 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 54 transitions. [2022-02-20 16:22:45,386 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 54 edges. 54 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:22:45,387 INFO L225 Difference]: With dead ends: 49 [2022-02-20 16:22:45,387 INFO L226 Difference]: Without dead ends: 29 [2022-02-20 16:22:45,387 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 16:22:45,388 INFO L933 BasicCegarLoop]: 33 mSDtfsCounter, 0 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 60 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-02-20 16:22:45,388 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 60 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-02-20 16:22:45,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2022-02-20 16:22:45,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2022-02-20 16:22:45,390 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 16:22:45,390 INFO L82 GeneralOperation]: Start isEquivalent. First operand 29 states. Second operand has 29 states, 28 states have (on average 1.1785714285714286) internal successors, (33), 28 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:22:45,390 INFO L74 IsIncluded]: Start isIncluded. First operand 29 states. Second operand has 29 states, 28 states have (on average 1.1785714285714286) internal successors, (33), 28 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:22:45,391 INFO L87 Difference]: Start difference. First operand 29 states. Second operand has 29 states, 28 states have (on average 1.1785714285714286) internal successors, (33), 28 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:22:45,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:22:45,391 INFO L93 Difference]: Finished difference Result 29 states and 33 transitions. [2022-02-20 16:22:45,391 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 33 transitions. [2022-02-20 16:22:45,391 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:22:45,392 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:22:45,392 INFO L74 IsIncluded]: Start isIncluded. First operand has 29 states, 28 states have (on average 1.1785714285714286) internal successors, (33), 28 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 29 states. [2022-02-20 16:22:45,392 INFO L87 Difference]: Start difference. First operand has 29 states, 28 states have (on average 1.1785714285714286) internal successors, (33), 28 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 29 states. [2022-02-20 16:22:45,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:22:45,392 INFO L93 Difference]: Finished difference Result 29 states and 33 transitions. [2022-02-20 16:22:45,393 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 33 transitions. [2022-02-20 16:22:45,393 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:22:45,393 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:22:45,393 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 16:22:45,393 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 16:22:45,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 28 states have (on average 1.1785714285714286) internal successors, (33), 28 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:22:45,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 33 transitions. [2022-02-20 16:22:45,394 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 33 transitions. Word has length 24 [2022-02-20 16:22:45,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 16:22:45,394 INFO L470 AbstractCegarLoop]: Abstraction has 29 states and 33 transitions. [2022-02-20 16:22:45,395 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:22:45,395 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 33 transitions. [2022-02-20 16:22:45,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-02-20 16:22:45,395 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:22:45,395 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 16:22:45,405 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2022-02-20 16:22:45,600 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 16:22:45,601 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:22:45,601 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:22:45,601 INFO L85 PathProgramCache]: Analyzing trace with hash -327957724, now seen corresponding path program 1 times [2022-02-20 16:22:45,601 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 16:22:45,602 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [778160935] [2022-02-20 16:22:45,602 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:22:45,602 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 16:22:45,602 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 16:22:45,603 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-20 16:22:45,603 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2022-02-20 16:22:45,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:22:45,639 INFO L263 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 4 conjunts are in the unsatisfiable core [2022-02-20 16:22:45,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:22:45,646 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 16:22:45,736 INFO L290 TraceCheckUtils]: 0: Hoare triple {1302#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;call #Ultimate.allocInit(2bv32, 1bv32);call write~init~intINTTYPE1(48bv8, 1bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 1bv32, 1bv32, 1bv32);call #Ultimate.allocInit(26bv32, 2bv32);call #Ultimate.allocInit(12bv32, 3bv32);~__return_main~0 := 0bv32;~__tmp_129_0~0 := 0bv32;~__tmp_129_1~0 := 0bv32;~__tmp_129_2~0 := 0bv32;~__return_134~0 := 0bv32; {1302#true} is VALID [2022-02-20 16:22:45,736 INFO L290 TraceCheckUtils]: 1: Hoare triple {1302#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_~__tmp_2~0#1, main_~__VERIFIER_assert__cond~1#1, main_~main____CPAchecker_TMP_2~1#1, main_~main____CPAchecker_TMP_1~1#1, main_~main____CPAchecker_TMP_0~1#1, main_~__tmp_1~0#1, main_~__VERIFIER_assert__cond~0#1, main_~main____CPAchecker_TMP_2~0#1, main_~main____CPAchecker_TMP_1~0#1, main_~main____CPAchecker_TMP_0~0#1, main_~main__E0~0#1, main_~main__E1~0#1, main_~main__S~0#1, main_~main__i~0#1;havoc main_~main__E0~0#1;havoc main_~main__E1~0#1;havoc main_~main__S~0#1;havoc main_~main__i~0#1;main_~main__E1~0#1 := ~convertINTToDOUBLE(currentRoundingMode, 0bv32);main_~main__S~0#1 := ~convertINTToDOUBLE(currentRoundingMode, 0bv32);main_~main__i~0#1 := 0bv32; {1302#true} is VALID [2022-02-20 16:22:45,737 INFO L290 TraceCheckUtils]: 2: Hoare triple {1302#true} assume ~bvsle32(main_~main__i~0#1, 1000000bv32);main_~main__E0~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~main____CPAchecker_TMP_0~0#1; {1302#true} is VALID [2022-02-20 16:22:45,737 INFO L290 TraceCheckUtils]: 3: Hoare triple {1302#true} assume ~fp.geq~DOUBLE(main_~main__E0~0#1, ~fp.neg~DOUBLE(~to_fp~DOUBLE(currentRoundingMode, 1.0))); {1302#true} is VALID [2022-02-20 16:22:45,737 INFO L290 TraceCheckUtils]: 4: Hoare triple {1302#true} assume ~fp.leq~DOUBLE(main_~main__E0~0#1, ~to_fp~DOUBLE(currentRoundingMode, 1.0));main_~main____CPAchecker_TMP_0~0#1 := 1bv32; {1302#true} is VALID [2022-02-20 16:22:45,737 INFO L290 TraceCheckUtils]: 5: Hoare triple {1302#true} assume 0bv32 != main_~main____CPAchecker_TMP_0~0#1;havoc main_~main____CPAchecker_TMP_1~0#1;main_~main____CPAchecker_TMP_1~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; {1302#true} is VALID [2022-02-20 16:22:45,737 INFO L290 TraceCheckUtils]: 6: Hoare triple {1302#true} assume !(0bv32 == main_~main____CPAchecker_TMP_1~0#1);main_~main__S~0#1 := ~convertINTToDOUBLE(currentRoundingMode, 0bv32); {1302#true} is VALID [2022-02-20 16:22:45,737 INFO L290 TraceCheckUtils]: 7: Hoare triple {1302#true} main_~main__E1~0#1 := main_~main__E0~0#1;havoc main_~main____CPAchecker_TMP_2~0#1; {1302#true} is VALID [2022-02-20 16:22:45,738 INFO L290 TraceCheckUtils]: 8: Hoare triple {1302#true} assume ~fp.geq~DOUBLE(main_~main__S~0#1, ~fp.neg~DOUBLE(~to_fp~DOUBLE(currentRoundingMode, 10000.0))); {1302#true} is VALID [2022-02-20 16:22:45,738 INFO L290 TraceCheckUtils]: 9: Hoare triple {1302#true} assume ~fp.leq~DOUBLE(main_~main__S~0#1, ~to_fp~DOUBLE(currentRoundingMode, 10000.0));main_~main____CPAchecker_TMP_2~0#1 := 1bv32; {1302#true} is VALID [2022-02-20 16:22:45,738 INFO L290 TraceCheckUtils]: 10: Hoare triple {1302#true} havoc main_~__tmp_1~0#1;main_~__tmp_1~0#1 := main_~main____CPAchecker_TMP_2~0#1;havoc main_~__VERIFIER_assert__cond~0#1;main_~__VERIFIER_assert__cond~0#1 := main_~__tmp_1~0#1; {1302#true} is VALID [2022-02-20 16:22:45,738 INFO L290 TraceCheckUtils]: 11: Hoare triple {1302#true} assume !(0bv32 == main_~__VERIFIER_assert__cond~0#1);~__tmp_129_0~0 := main_~main____CPAchecker_TMP_2~0#1;~__tmp_129_1~0 := main_~main____CPAchecker_TMP_1~0#1;~__tmp_129_2~0 := main_~main____CPAchecker_TMP_0~0#1; {1302#true} is VALID [2022-02-20 16:22:45,738 INFO L290 TraceCheckUtils]: 12: Hoare triple {1302#true} main_~main____CPAchecker_TMP_2~0#1 := ~__tmp_129_0~0;main_~main____CPAchecker_TMP_1~0#1 := ~__tmp_129_1~0;main_~main____CPAchecker_TMP_0~0#1 := ~__tmp_129_2~0;main_~main__i~0#1 := ~bvadd32(1bv32, main_~main__i~0#1); {1302#true} is VALID [2022-02-20 16:22:45,742 INFO L290 TraceCheckUtils]: 13: Hoare triple {1302#true} assume ~bvsle32(main_~main__i~0#1, 1000000bv32);main_~main__E0~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~main____CPAchecker_TMP_0~1#1; {1302#true} is VALID [2022-02-20 16:22:45,743 INFO L290 TraceCheckUtils]: 14: Hoare triple {1302#true} assume ~fp.geq~DOUBLE(main_~main__E0~0#1, ~fp.neg~DOUBLE(~to_fp~DOUBLE(currentRoundingMode, 1.0))); {1302#true} is VALID [2022-02-20 16:22:45,743 INFO L290 TraceCheckUtils]: 15: Hoare triple {1302#true} assume ~fp.leq~DOUBLE(main_~main__E0~0#1, ~to_fp~DOUBLE(currentRoundingMode, 1.0));main_~main____CPAchecker_TMP_0~1#1 := 1bv32; {1302#true} is VALID [2022-02-20 16:22:45,743 INFO L290 TraceCheckUtils]: 16: Hoare triple {1302#true} assume 0bv32 != main_~main____CPAchecker_TMP_0~1#1;havoc main_~main____CPAchecker_TMP_1~1#1;main_~main____CPAchecker_TMP_1~1#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1; {1302#true} is VALID [2022-02-20 16:22:45,743 INFO L290 TraceCheckUtils]: 17: Hoare triple {1302#true} assume !(0bv32 == main_~main____CPAchecker_TMP_1~1#1);main_~main__S~0#1 := ~convertINTToDOUBLE(currentRoundingMode, 0bv32); {1302#true} is VALID [2022-02-20 16:22:45,743 INFO L290 TraceCheckUtils]: 18: Hoare triple {1302#true} main_~main__E1~0#1 := main_~main__E0~0#1;havoc main_~main____CPAchecker_TMP_2~1#1; {1302#true} is VALID [2022-02-20 16:22:45,743 INFO L290 TraceCheckUtils]: 19: Hoare triple {1302#true} assume ~fp.geq~DOUBLE(main_~main__S~0#1, ~fp.neg~DOUBLE(~to_fp~DOUBLE(currentRoundingMode, 10000.0))); {1302#true} is VALID [2022-02-20 16:22:45,752 INFO L290 TraceCheckUtils]: 20: Hoare triple {1302#true} assume ~fp.leq~DOUBLE(main_~main__S~0#1, ~to_fp~DOUBLE(currentRoundingMode, 10000.0));main_~main____CPAchecker_TMP_2~1#1 := 1bv32; {1367#(= |ULTIMATE.start_main_~main____CPAchecker_TMP_2~1#1| (_ bv1 32))} is VALID [2022-02-20 16:22:45,753 INFO L290 TraceCheckUtils]: 21: Hoare triple {1367#(= |ULTIMATE.start_main_~main____CPAchecker_TMP_2~1#1| (_ bv1 32))} havoc main_~__tmp_2~0#1;main_~__tmp_2~0#1 := main_~main____CPAchecker_TMP_2~1#1;havoc main_~__VERIFIER_assert__cond~1#1;main_~__VERIFIER_assert__cond~1#1 := main_~__tmp_2~0#1; {1371#(= |ULTIMATE.start_main_~__VERIFIER_assert__cond~1#1| (_ bv1 32))} is VALID [2022-02-20 16:22:45,753 INFO L290 TraceCheckUtils]: 22: Hoare triple {1371#(= |ULTIMATE.start_main_~__VERIFIER_assert__cond~1#1| (_ bv1 32))} assume 0bv32 == main_~__VERIFIER_assert__cond~1#1; {1303#false} is VALID [2022-02-20 16:22:45,753 INFO L290 TraceCheckUtils]: 23: Hoare triple {1303#false} assume !false; {1303#false} is VALID [2022-02-20 16:22:45,753 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 16:22:45,754 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 16:22:45,754 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 16:22:45,754 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [778160935] [2022-02-20 16:22:45,754 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [778160935] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 16:22:45,754 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 16:22:45,754 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 16:22:45,754 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1089561570] [2022-02-20 16:22:45,754 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 16:22:45,754 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-02-20 16:22:45,755 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 16:22:45,755 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:22:45,779 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:22:45,779 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 16:22:45,779 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 16:22:45,780 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 16:22:45,780 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-20 16:22:45,780 INFO L87 Difference]: Start difference. First operand 29 states and 33 transitions. Second operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:23:00,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:23:00,641 INFO L93 Difference]: Finished difference Result 48 states and 55 transitions. [2022-02-20 16:23:00,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 16:23:00,641 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-02-20 16:23:00,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 16:23:00,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:23:00,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 49 transitions. [2022-02-20 16:23:00,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:23:00,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 49 transitions. [2022-02-20 16:23:00,643 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 49 transitions. [2022-02-20 16:23:01,140 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 49 edges. 49 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:23:01,141 INFO L225 Difference]: With dead ends: 48 [2022-02-20 16:23:01,141 INFO L226 Difference]: Without dead ends: 46 [2022-02-20 16:23:01,141 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-02-20 16:23:01,141 INFO L933 BasicCegarLoop]: 41 mSDtfsCounter, 23 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 94 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 16:23:01,142 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [23 Valid, 94 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 16:23:01,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2022-02-20 16:23:01,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 31. [2022-02-20 16:23:01,144 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 16:23:01,144 INFO L82 GeneralOperation]: Start isEquivalent. First operand 46 states. Second operand has 31 states, 30 states have (on average 1.1666666666666667) internal successors, (35), 30 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:23:01,144 INFO L74 IsIncluded]: Start isIncluded. First operand 46 states. Second operand has 31 states, 30 states have (on average 1.1666666666666667) internal successors, (35), 30 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:23:01,144 INFO L87 Difference]: Start difference. First operand 46 states. Second operand has 31 states, 30 states have (on average 1.1666666666666667) internal successors, (35), 30 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:23:01,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:23:01,145 INFO L93 Difference]: Finished difference Result 46 states and 53 transitions. [2022-02-20 16:23:01,145 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 53 transitions. [2022-02-20 16:23:01,145 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:23:01,145 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:23:01,145 INFO L74 IsIncluded]: Start isIncluded. First operand has 31 states, 30 states have (on average 1.1666666666666667) internal successors, (35), 30 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 46 states. [2022-02-20 16:23:01,152 INFO L87 Difference]: Start difference. First operand has 31 states, 30 states have (on average 1.1666666666666667) internal successors, (35), 30 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 46 states. [2022-02-20 16:23:01,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:23:01,155 INFO L93 Difference]: Finished difference Result 46 states and 53 transitions. [2022-02-20 16:23:01,155 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 53 transitions. [2022-02-20 16:23:01,155 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:23:01,156 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:23:01,156 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 16:23:01,156 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 16:23:01,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 30 states have (on average 1.1666666666666667) internal successors, (35), 30 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:23:01,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 35 transitions. [2022-02-20 16:23:01,157 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 35 transitions. Word has length 24 [2022-02-20 16:23:01,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 16:23:01,157 INFO L470 AbstractCegarLoop]: Abstraction has 31 states and 35 transitions. [2022-02-20 16:23:01,157 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:23:01,157 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 35 transitions. [2022-02-20 16:23:01,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-02-20 16:23:01,158 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:23:01,158 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 16:23:01,169 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2022-02-20 16:23:01,359 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 16:23:01,359 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:23:01,360 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:23:01,360 INFO L85 PathProgramCache]: Analyzing trace with hash 401808482, now seen corresponding path program 1 times [2022-02-20 16:23:01,360 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 16:23:01,360 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [925855923] [2022-02-20 16:23:01,360 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:23:01,360 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 16:23:01,360 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 16:23:01,363 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-20 16:23:01,364 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2022-02-20 16:23:01,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:23:01,743 INFO L263 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 9 conjunts are in the unsatisfiable core [2022-02-20 16:23:03,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:23:03,283 INFO L286 TraceCheckSpWp]: Computing forward predicates...