./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/float-benchs/interpolation2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 6c24879c Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/float-benchs/interpolation2.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 5f3bcf3c30f63fe0ad0702712c01ba8d1145d6fb2558cd3e5ee3c870476dc3b1 --- Real Ultimate output --- This is Ultimate 0.2.2-?-6c24879 [2022-07-12 02:31:43,062 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-12 02:31:43,064 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-12 02:31:43,118 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-12 02:31:43,118 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-12 02:31:43,120 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-12 02:31:43,121 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-12 02:31:43,124 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-12 02:31:43,125 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-12 02:31:43,131 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-12 02:31:43,132 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-12 02:31:43,135 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-12 02:31:43,135 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-12 02:31:43,137 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-12 02:31:43,138 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-12 02:31:43,142 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-12 02:31:43,143 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-12 02:31:43,145 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-12 02:31:43,147 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-12 02:31:43,153 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-12 02:31:43,155 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-12 02:31:43,156 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-12 02:31:43,157 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-12 02:31:43,158 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-12 02:31:43,159 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-12 02:31:43,162 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-12 02:31:43,162 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-12 02:31:43,163 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-12 02:31:43,164 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-12 02:31:43,164 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-12 02:31:43,165 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-12 02:31:43,165 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-12 02:31:43,167 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-12 02:31:43,168 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-12 02:31:43,169 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-12 02:31:43,169 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-12 02:31:43,170 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-12 02:31:43,170 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-12 02:31:43,170 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-12 02:31:43,171 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-12 02:31:43,171 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-12 02:31:43,173 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-12 02:31:43,174 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-07-12 02:31:43,203 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-12 02:31:43,203 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-12 02:31:43,204 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-12 02:31:43,204 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-12 02:31:43,204 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-12 02:31:43,205 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-12 02:31:43,205 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-12 02:31:43,205 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-12 02:31:43,206 INFO L138 SettingsManager]: * Use SBE=true [2022-07-12 02:31:43,206 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-12 02:31:43,207 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-12 02:31:43,207 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-12 02:31:43,207 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-12 02:31:43,207 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-12 02:31:43,207 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-12 02:31:43,208 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-12 02:31:43,208 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-12 02:31:43,208 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-12 02:31:43,208 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-12 02:31:43,208 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-12 02:31:43,209 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-12 02:31:43,209 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-12 02:31:43,209 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-12 02:31:43,209 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-12 02:31:43,209 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-12 02:31:43,210 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-12 02:31:43,210 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-12 02:31:43,210 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-12 02:31:43,210 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-12 02:31:43,210 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-12 02:31:43,211 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-12 02:31:43,211 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-12 02:31:43,211 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-12 02:31:43,211 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 -> 5f3bcf3c30f63fe0ad0702712c01ba8d1145d6fb2558cd3e5ee3c870476dc3b1 [2022-07-12 02:31:43,463 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-12 02:31:43,487 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-12 02:31:43,489 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-12 02:31:43,490 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-12 02:31:43,491 INFO L275 PluginConnector]: CDTParser initialized [2022-07-12 02:31:43,492 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/float-benchs/interpolation2.c [2022-07-12 02:31:43,556 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/476501f54/3109279d2d17451f8d90e3ae1e00d032/FLAG1e9dc055d [2022-07-12 02:31:43,989 INFO L306 CDTParser]: Found 1 translation units. [2022-07-12 02:31:43,990 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-benchs/interpolation2.c [2022-07-12 02:31:43,997 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/476501f54/3109279d2d17451f8d90e3ae1e00d032/FLAG1e9dc055d [2022-07-12 02:31:44,020 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/476501f54/3109279d2d17451f8d90e3ae1e00d032 [2022-07-12 02:31:44,022 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-12 02:31:44,024 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-12 02:31:44,025 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-12 02:31:44,026 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-12 02:31:44,028 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-12 02:31:44,029 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.07 02:31:44" (1/1) ... [2022-07-12 02:31:44,030 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1d09e183 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 02:31:44, skipping insertion in model container [2022-07-12 02:31:44,030 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.07 02:31:44" (1/1) ... [2022-07-12 02:31:44,037 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-12 02:31:44,051 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-12 02:31:44,202 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/interpolation2.c[450,463] [2022-07-12 02:31:44,233 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-12 02:31:44,241 INFO L203 MainTranslator]: Completed pre-run [2022-07-12 02:31:44,255 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/interpolation2.c[450,463] [2022-07-12 02:31:44,281 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-12 02:31:44,299 INFO L208 MainTranslator]: Completed translation [2022-07-12 02:31:44,300 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 02:31:44 WrapperNode [2022-07-12 02:31:44,300 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-12 02:31:44,302 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-12 02:31:44,302 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-12 02:31:44,302 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-12 02:31:44,308 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 02:31:44" (1/1) ... [2022-07-12 02:31:44,325 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 02:31:44" (1/1) ... [2022-07-12 02:31:44,351 INFO L137 Inliner]: procedures = 18, calls = 49, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 100 [2022-07-12 02:31:44,351 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-12 02:31:44,352 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-12 02:31:44,352 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-12 02:31:44,352 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-12 02:31:44,359 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 02:31:44" (1/1) ... [2022-07-12 02:31:44,359 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 02:31:44" (1/1) ... [2022-07-12 02:31:44,363 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 02:31:44" (1/1) ... [2022-07-12 02:31:44,364 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 02:31:44" (1/1) ... [2022-07-12 02:31:44,381 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 02:31:44" (1/1) ... [2022-07-12 02:31:44,385 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 02:31:44" (1/1) ... [2022-07-12 02:31:44,389 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 02:31:44" (1/1) ... [2022-07-12 02:31:44,393 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-12 02:31:44,394 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-12 02:31:44,395 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-12 02:31:44,395 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-12 02:31:44,396 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 02:31:44" (1/1) ... [2022-07-12 02:31:44,402 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-12 02:31:44,410 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 02:31:44,424 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-07-12 02:31:44,455 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-07-12 02:31:44,470 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-12 02:31:44,470 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-12 02:31:44,470 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-12 02:31:44,470 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2022-07-12 02:31:44,471 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-12 02:31:44,471 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-12 02:31:44,471 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real [2022-07-12 02:31:44,471 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-12 02:31:44,551 INFO L234 CfgBuilder]: Building ICFG [2022-07-12 02:31:44,553 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-12 02:31:44,709 INFO L275 CfgBuilder]: Performing block encoding [2022-07-12 02:31:44,714 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-12 02:31:44,715 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-07-12 02:31:44,722 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 02:31:44 BoogieIcfgContainer [2022-07-12 02:31:44,723 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-12 02:31:44,724 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-12 02:31:44,724 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-12 02:31:44,745 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-12 02:31:44,746 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.07 02:31:44" (1/3) ... [2022-07-12 02:31:44,747 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@45f27341 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.07 02:31:44, skipping insertion in model container [2022-07-12 02:31:44,747 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 02:31:44" (2/3) ... [2022-07-12 02:31:44,747 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@45f27341 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.07 02:31:44, skipping insertion in model container [2022-07-12 02:31:44,747 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 02:31:44" (3/3) ... [2022-07-12 02:31:44,748 INFO L111 eAbstractionObserver]: Analyzing ICFG interpolation2.c [2022-07-12 02:31:44,760 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-12 02:31:44,779 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-12 02:31:44,834 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-12 02:31:44,846 INFO L357 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, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@457769c1, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@365e29d2 [2022-07-12 02:31:44,847 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-12 02:31:44,852 INFO L276 IsEmpty]: Start isEmpty. Operand has 17 states, 15 states have (on average 1.4666666666666666) internal successors, (22), 16 states have internal predecessors, (22), 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-07-12 02:31:44,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-07-12 02:31:44,858 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 02:31:44,859 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 02:31:44,860 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 02:31:44,870 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 02:31:44,870 INFO L85 PathProgramCache]: Analyzing trace with hash -1235833265, now seen corresponding path program 1 times [2022-07-12 02:31:44,896 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 02:31:44,897 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [777048378] [2022-07-12 02:31:44,897 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 02:31:44,898 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 02:31:45,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 02:31:45,090 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 02:31:45,091 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 02:31:45,092 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [777048378] [2022-07-12 02:31:45,092 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [777048378] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 02:31:45,092 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 02:31:45,093 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-12 02:31:45,094 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [915680684] [2022-07-12 02:31:45,095 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 02:31:45,098 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-07-12 02:31:45,100 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 02:31:45,127 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-07-12 02:31:45,128 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-12 02:31:45,130 INFO L87 Difference]: Start difference. First operand has 17 states, 15 states have (on average 1.4666666666666666) internal successors, (22), 16 states have internal predecessors, (22), 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 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 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-07-12 02:31:45,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 02:31:45,143 INFO L93 Difference]: Finished difference Result 29 states and 37 transitions. [2022-07-12 02:31:45,144 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-07-12 02:31:45,146 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 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 10 [2022-07-12 02:31:45,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 02:31:45,153 INFO L225 Difference]: With dead ends: 29 [2022-07-12 02:31:45,154 INFO L226 Difference]: Without dead ends: 13 [2022-07-12 02:31:45,156 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-12 02:31:45,159 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 19 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 02:31:45,160 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 02:31:45,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2022-07-12 02:31:45,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2022-07-12 02:31:45,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 12 states have (on average 1.25) internal successors, (15), 12 states have internal predecessors, (15), 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-07-12 02:31:45,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 15 transitions. [2022-07-12 02:31:45,186 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 15 transitions. Word has length 10 [2022-07-12 02:31:45,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 02:31:45,186 INFO L495 AbstractCegarLoop]: Abstraction has 13 states and 15 transitions. [2022-07-12 02:31:45,186 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 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-07-12 02:31:45,187 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 15 transitions. [2022-07-12 02:31:45,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-07-12 02:31:45,187 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 02:31:45,187 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 02:31:45,188 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-12 02:31:45,188 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 02:31:45,188 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 02:31:45,189 INFO L85 PathProgramCache]: Analyzing trace with hash -1178902664, now seen corresponding path program 1 times [2022-07-12 02:31:45,189 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 02:31:45,189 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [71353694] [2022-07-12 02:31:45,190 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 02:31:45,190 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 02:31:45,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 02:31:45,276 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 02:31:45,276 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 02:31:45,277 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [71353694] [2022-07-12 02:31:45,277 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [71353694] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 02:31:45,277 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 02:31:45,278 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-12 02:31:45,278 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1911280649] [2022-07-12 02:31:45,279 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 02:31:45,280 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-12 02:31:45,280 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 02:31:45,281 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-12 02:31:45,281 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 02:31:45,282 INFO L87 Difference]: Start difference. First operand 13 states and 15 transitions. Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 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-07-12 02:31:45,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 02:31:45,310 INFO L93 Difference]: Finished difference Result 24 states and 26 transitions. [2022-07-12 02:31:45,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-12 02:31:45,311 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 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 10 [2022-07-12 02:31:45,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 02:31:45,311 INFO L225 Difference]: With dead ends: 24 [2022-07-12 02:31:45,311 INFO L226 Difference]: Without dead ends: 20 [2022-07-12 02:31:45,312 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-07-12 02:31:45,313 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 6 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 23 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 02:31:45,314 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 23 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 02:31:45,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2022-07-12 02:31:45,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 14. [2022-07-12 02:31:45,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 13 states have internal predecessors, (16), 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-07-12 02:31:45,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 16 transitions. [2022-07-12 02:31:45,320 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 16 transitions. Word has length 10 [2022-07-12 02:31:45,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 02:31:45,320 INFO L495 AbstractCegarLoop]: Abstraction has 14 states and 16 transitions. [2022-07-12 02:31:45,320 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 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-07-12 02:31:45,321 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 16 transitions. [2022-07-12 02:31:45,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-07-12 02:31:45,322 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 02:31:45,322 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 02:31:45,323 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-12 02:31:45,323 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 02:31:45,324 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 02:31:45,324 INFO L85 PathProgramCache]: Analyzing trace with hash 2110328889, now seen corresponding path program 1 times [2022-07-12 02:31:45,329 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 02:31:45,329 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [129082014] [2022-07-12 02:31:45,329 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 02:31:45,330 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 02:31:45,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-12 02:31:45,380 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-12 02:31:45,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-12 02:31:45,423 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-12 02:31:45,423 INFO L271 BasicCegarLoop]: Counterexample is feasible [2022-07-12 02:31:45,424 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-07-12 02:31:45,426 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-12 02:31:45,428 INFO L356 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2022-07-12 02:31:45,431 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-07-12 02:31:45,453 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.07 02:31:45 BoogieIcfgContainer [2022-07-12 02:31:45,454 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-07-12 02:31:45,454 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-07-12 02:31:45,455 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-07-12 02:31:45,455 INFO L275 PluginConnector]: Witness Printer initialized [2022-07-12 02:31:45,455 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 02:31:44" (3/4) ... [2022-07-12 02:31:45,457 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-07-12 02:31:45,458 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-07-12 02:31:45,459 INFO L158 Benchmark]: Toolchain (without parser) took 1434.08ms. Allocated memory was 90.2MB in the beginning and 111.1MB in the end (delta: 21.0MB). Free memory was 57.4MB in the beginning and 63.3MB in the end (delta: -5.9MB). Peak memory consumption was 15.9MB. Max. memory is 16.1GB. [2022-07-12 02:31:45,459 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 90.2MB. Free memory was 44.5MB in the beginning and 44.5MB in the end (delta: 48.0kB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-12 02:31:45,460 INFO L158 Benchmark]: CACSL2BoogieTranslator took 275.65ms. Allocated memory is still 90.2MB. Free memory was 57.2MB in the beginning and 65.6MB in the end (delta: -8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-07-12 02:31:45,468 INFO L158 Benchmark]: Boogie Procedure Inliner took 49.27ms. Allocated memory is still 90.2MB. Free memory was 65.6MB in the beginning and 63.6MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-12 02:31:45,469 INFO L158 Benchmark]: Boogie Preprocessor took 41.69ms. Allocated memory is still 90.2MB. Free memory was 63.6MB in the beginning and 62.3MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-12 02:31:45,469 INFO L158 Benchmark]: RCFGBuilder took 328.25ms. Allocated memory is still 90.2MB. Free memory was 62.3MB in the beginning and 51.0MB in the end (delta: 11.3MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2022-07-12 02:31:45,470 INFO L158 Benchmark]: TraceAbstraction took 729.84ms. Allocated memory was 90.2MB in the beginning and 111.1MB in the end (delta: 21.0MB). Free memory was 50.5MB in the beginning and 63.3MB in the end (delta: -12.8MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-07-12 02:31:45,470 INFO L158 Benchmark]: Witness Printer took 3.43ms. Allocated memory is still 111.1MB. Free memory is still 63.3MB. There was no memory consumed. Max. memory is 16.1GB. [2022-07-12 02:31:45,473 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19ms. Allocated memory is still 90.2MB. Free memory was 44.5MB in the beginning and 44.5MB in the end (delta: 48.0kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 275.65ms. Allocated memory is still 90.2MB. Free memory was 57.2MB in the beginning and 65.6MB in the end (delta: -8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 49.27ms. Allocated memory is still 90.2MB. Free memory was 65.6MB in the beginning and 63.6MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 41.69ms. Allocated memory is still 90.2MB. Free memory was 63.6MB in the beginning and 62.3MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 328.25ms. Allocated memory is still 90.2MB. Free memory was 62.3MB in the beginning and 51.0MB in the end (delta: 11.3MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * TraceAbstraction took 729.84ms. Allocated memory was 90.2MB in the beginning and 111.1MB in the end (delta: 21.0MB). Free memory was 50.5MB in the beginning and 63.3MB in the end (delta: -12.8MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Witness Printer took 3.43ms. Allocated memory is still 111.1MB. Free memory is still 63.3MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 9]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 28, overapproximation of to_real at line 15, overapproximation of someBinaryArithmeticFLOAToperation at line 26. Possible FailurePath: [L13] int i; [L14] float z, t; [L15] float min[] = { 5, 10, 12, 30, 150 }; [L16] float max[] = { 10, 12, 30, 150, 300 }; [L17] float org[] = { 1, 5, -10, 30, 20 }; [L18] float slope[] = { 4, -15, 40, -10, 0 }; [L20] t = __VERIFIER_nondet_float() [L21] EXPR min[0] [L21] EXPR t >= min[0] && t <= max[sizeof(max) / sizeof(max[0]) - 1] [L21] EXPR max[sizeof(max) / sizeof(max[0]) - 1] [L21] EXPR t >= min[0] && t <= max[sizeof(max) / sizeof(max[0]) - 1] VAL [max={7:0}, max[sizeof(max) / sizeof(max[0]) - 1]=51, min={5:0}, min[0]=50, org={4:0}, slope={6:0}] [L21] CALL assume_abort_if_not(t >= min[0] && t <= max[sizeof(max) / sizeof(max[0]) - 1]) [L7] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L21] RET assume_abort_if_not(t >= min[0] && t <= max[sizeof(max) / sizeof(max[0]) - 1]) [L23] i = 0 VAL [i=0, max={7:0}, min={5:0}, org={4:0}, slope={6:0}] [L23] COND TRUE i < sizeof(min) / sizeof(min[0]) [L24] EXPR max[i] VAL [i=0, max={7:0}, max[i]=49, min={5:0}, org={4:0}, slope={6:0}] [L24] COND TRUE t <= max[i] [L26] EXPR org[i] [L26] EXPR slope[i] [L26] EXPR min[i] [L26] EXPR max[i] [L26] EXPR min[i] [L26] z = org[i] + slope[i] * (t - min[i]) / (max[i] - min[i]) [L28] CALL __VERIFIER_assert(z >= -10.f && z <= 30.f) [L9] COND TRUE !(cond) VAL [\old(cond)=0, cond=0] [L9] reach_error() VAL [\old(cond)=0, cond=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 17 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 0.6s, OverallIterations: 3, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 6 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 6 mSDsluCounter, 42 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 10 mSDsCounter, 0 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 6 IncrementalHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 0 mSolverCounterUnsat, 32 mSDtfsCounter, 6 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=17occurred in iteration=0, InterpolantAutomatonStates: 5, 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, 2 MinimizatonAttempts, 6 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 31 NumberOfCodeBlocks, 31 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 18 ConstructedInterpolants, 0 QuantifiedInterpolants, 20 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 2 InterpolantComputations, 2 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-07-12 02:31:45,507 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 -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/interpolation2.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 5f3bcf3c30f63fe0ad0702712c01ba8d1145d6fb2558cd3e5ee3c870476dc3b1 --- Real Ultimate output --- This is Ultimate 0.2.2-?-6c24879 [2022-07-12 02:31:47,552 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-12 02:31:47,554 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-12 02:31:47,579 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-12 02:31:47,579 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-12 02:31:47,581 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-12 02:31:47,587 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-12 02:31:47,591 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-12 02:31:47,593 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-12 02:31:47,598 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-12 02:31:47,600 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-12 02:31:47,602 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-12 02:31:47,602 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-12 02:31:47,604 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-12 02:31:47,606 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-12 02:31:47,611 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-12 02:31:47,612 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-12 02:31:47,612 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-12 02:31:47,614 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-12 02:31:47,618 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-12 02:31:47,623 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-12 02:31:47,624 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-12 02:31:47,624 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-12 02:31:47,626 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-12 02:31:47,627 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-12 02:31:47,630 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-12 02:31:47,631 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-12 02:31:47,632 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-12 02:31:47,633 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-12 02:31:47,633 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-12 02:31:47,634 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-12 02:31:47,634 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-12 02:31:47,636 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-12 02:31:47,636 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-12 02:31:47,638 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-12 02:31:47,639 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-12 02:31:47,639 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-12 02:31:47,640 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-12 02:31:47,640 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-12 02:31:47,640 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-12 02:31:47,641 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-12 02:31:47,643 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-12 02:31:47,646 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2022-07-12 02:31:47,678 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-12 02:31:47,679 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-12 02:31:47,679 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-12 02:31:47,680 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-12 02:31:47,680 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-12 02:31:47,681 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-12 02:31:47,681 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-12 02:31:47,681 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-12 02:31:47,682 INFO L138 SettingsManager]: * Use SBE=true [2022-07-12 02:31:47,682 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-12 02:31:47,683 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-12 02:31:47,691 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-12 02:31:47,691 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-12 02:31:47,691 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-12 02:31:47,691 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-12 02:31:47,692 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-12 02:31:47,692 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-07-12 02:31:47,692 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-07-12 02:31:47,692 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-07-12 02:31:47,692 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-12 02:31:47,693 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-12 02:31:47,693 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-12 02:31:47,693 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-12 02:31:47,693 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-12 02:31:47,693 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-12 02:31:47,694 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-12 02:31:47,694 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-12 02:31:47,694 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-12 02:31:47,694 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-12 02:31:47,694 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-12 02:31:47,695 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-07-12 02:31:47,695 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-07-12 02:31:47,695 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-12 02:31:47,695 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-12 02:31:47,696 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-12 02:31:47,696 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-07-12 02:31:47,696 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 -> 5f3bcf3c30f63fe0ad0702712c01ba8d1145d6fb2558cd3e5ee3c870476dc3b1 [2022-07-12 02:31:48,005 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-12 02:31:48,023 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-12 02:31:48,025 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-12 02:31:48,026 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-12 02:31:48,027 INFO L275 PluginConnector]: CDTParser initialized [2022-07-12 02:31:48,029 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/float-benchs/interpolation2.c [2022-07-12 02:31:48,093 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8ab29bf36/457191be8c1a42d990e60f4d78fd003f/FLAG14fc0c921 [2022-07-12 02:31:48,474 INFO L306 CDTParser]: Found 1 translation units. [2022-07-12 02:31:48,474 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-benchs/interpolation2.c [2022-07-12 02:31:48,479 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8ab29bf36/457191be8c1a42d990e60f4d78fd003f/FLAG14fc0c921 [2022-07-12 02:31:48,492 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8ab29bf36/457191be8c1a42d990e60f4d78fd003f [2022-07-12 02:31:48,494 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-12 02:31:48,496 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-12 02:31:48,497 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-12 02:31:48,497 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-12 02:31:48,499 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-12 02:31:48,499 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.07 02:31:48" (1/1) ... [2022-07-12 02:31:48,501 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4924ff01 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 02:31:48, skipping insertion in model container [2022-07-12 02:31:48,501 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.07 02:31:48" (1/1) ... [2022-07-12 02:31:48,507 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-12 02:31:48,520 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-12 02:31:48,614 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/interpolation2.c[450,463] [2022-07-12 02:31:48,634 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-12 02:31:48,642 INFO L203 MainTranslator]: Completed pre-run [2022-07-12 02:31:48,695 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/interpolation2.c[450,463] [2022-07-12 02:31:48,720 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-12 02:31:48,737 INFO L208 MainTranslator]: Completed translation [2022-07-12 02:31:48,738 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 02:31:48 WrapperNode [2022-07-12 02:31:48,738 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-12 02:31:48,739 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-12 02:31:48,739 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-12 02:31:48,739 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-12 02:31:48,745 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 02:31:48" (1/1) ... [2022-07-12 02:31:48,761 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 02:31:48" (1/1) ... [2022-07-12 02:31:48,787 INFO L137 Inliner]: procedures = 19, calls = 49, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 101 [2022-07-12 02:31:48,788 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-12 02:31:48,789 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-12 02:31:48,790 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-12 02:31:48,790 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-12 02:31:48,797 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 02:31:48" (1/1) ... [2022-07-12 02:31:48,797 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 02:31:48" (1/1) ... [2022-07-12 02:31:48,807 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 02:31:48" (1/1) ... [2022-07-12 02:31:48,807 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 02:31:48" (1/1) ... [2022-07-12 02:31:48,819 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 02:31:48" (1/1) ... [2022-07-12 02:31:48,822 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 02:31:48" (1/1) ... [2022-07-12 02:31:48,824 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 02:31:48" (1/1) ... [2022-07-12 02:31:48,826 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-12 02:31:48,827 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-12 02:31:48,827 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-12 02:31:48,827 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-12 02:31:48,828 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 02:31:48" (1/1) ... [2022-07-12 02:31:48,839 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-12 02:31:48,850 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 02:31:48,865 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-07-12 02:31:48,886 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-07-12 02:31:48,901 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-12 02:31:48,902 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4 [2022-07-12 02:31:48,902 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-07-12 02:31:48,902 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-12 02:31:48,902 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4 [2022-07-12 02:31:48,903 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-12 02:31:48,903 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-12 02:31:48,903 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-12 02:31:48,994 INFO L234 CfgBuilder]: Building ICFG [2022-07-12 02:31:48,996 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-12 02:31:51,415 INFO L275 CfgBuilder]: Performing block encoding [2022-07-12 02:31:51,420 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-12 02:31:51,420 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-07-12 02:31:51,422 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 02:31:51 BoogieIcfgContainer [2022-07-12 02:31:51,422 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-12 02:31:51,424 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-12 02:31:51,424 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-12 02:31:51,426 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-12 02:31:51,427 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.07 02:31:48" (1/3) ... [2022-07-12 02:31:51,427 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@51be1bec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.07 02:31:51, skipping insertion in model container [2022-07-12 02:31:51,427 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 02:31:48" (2/3) ... [2022-07-12 02:31:51,428 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@51be1bec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.07 02:31:51, skipping insertion in model container [2022-07-12 02:31:51,428 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 02:31:51" (3/3) ... [2022-07-12 02:31:51,429 INFO L111 eAbstractionObserver]: Analyzing ICFG interpolation2.c [2022-07-12 02:31:51,442 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-12 02:31:51,442 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-12 02:31:51,482 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-12 02:31:51,488 INFO L357 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, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@504d8ae0, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@64826327 [2022-07-12 02:31:51,489 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-12 02:31:51,493 INFO L276 IsEmpty]: Start isEmpty. Operand has 17 states, 15 states have (on average 1.4666666666666666) internal successors, (22), 16 states have internal predecessors, (22), 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-07-12 02:31:51,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-07-12 02:31:51,498 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 02:31:51,498 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 02:31:51,499 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 02:31:51,503 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 02:31:51,504 INFO L85 PathProgramCache]: Analyzing trace with hash -1235833265, now seen corresponding path program 1 times [2022-07-12 02:31:51,516 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 02:31:51,516 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [669365160] [2022-07-12 02:31:51,516 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 02:31:51,517 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 02:31:51,517 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 02:31:51,519 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-07-12 02:31:51,520 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2022-07-12 02:31:51,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 02:31:51,892 INFO L263 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 1 conjunts are in the unsatisfiable core [2022-07-12 02:31:51,897 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 02:31:51,916 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 02:31:51,916 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 02:31:51,917 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 02:31:51,918 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [669365160] [2022-07-12 02:31:51,918 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [669365160] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 02:31:51,919 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 02:31:51,919 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-12 02:31:51,921 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [381373132] [2022-07-12 02:31:51,922 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 02:31:51,925 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-07-12 02:31:51,926 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 02:31:51,951 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-07-12 02:31:51,952 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-12 02:31:51,954 INFO L87 Difference]: Start difference. First operand has 17 states, 15 states have (on average 1.4666666666666666) internal successors, (22), 16 states have internal predecessors, (22), 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 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 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-07-12 02:31:51,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 02:31:51,964 INFO L93 Difference]: Finished difference Result 29 states and 37 transitions. [2022-07-12 02:31:51,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-07-12 02:31:51,967 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 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 10 [2022-07-12 02:31:51,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 02:31:51,973 INFO L225 Difference]: With dead ends: 29 [2022-07-12 02:31:51,973 INFO L226 Difference]: Without dead ends: 13 [2022-07-12 02:31:51,977 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-12 02:31:51,981 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 19 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 02:31:51,982 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 02:31:52,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2022-07-12 02:31:52,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2022-07-12 02:31:52,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 12 states have (on average 1.25) internal successors, (15), 12 states have internal predecessors, (15), 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-07-12 02:31:52,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 15 transitions. [2022-07-12 02:31:52,021 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 15 transitions. Word has length 10 [2022-07-12 02:31:52,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 02:31:52,022 INFO L495 AbstractCegarLoop]: Abstraction has 13 states and 15 transitions. [2022-07-12 02:31:52,022 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 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-07-12 02:31:52,022 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 15 transitions. [2022-07-12 02:31:52,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-07-12 02:31:52,023 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 02:31:52,023 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 02:31:52,040 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Ended with exit code 0 [2022-07-12 02:31:52,227 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 02:31:52,228 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 02:31:52,228 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 02:31:52,228 INFO L85 PathProgramCache]: Analyzing trace with hash -1178902664, now seen corresponding path program 1 times [2022-07-12 02:31:52,229 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 02:31:52,229 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [704305345] [2022-07-12 02:31:52,229 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 02:31:52,229 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 02:31:52,230 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 02:31:52,231 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-07-12 02:31:52,234 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2022-07-12 02:31:52,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 02:31:52,589 INFO L263 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-12 02:31:52,591 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 02:31:52,635 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 02:31:52,635 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 02:31:52,636 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 02:31:52,636 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [704305345] [2022-07-12 02:31:52,636 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [704305345] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 02:31:52,636 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 02:31:52,636 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-12 02:31:52,637 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [80870844] [2022-07-12 02:31:52,637 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 02:31:52,638 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-12 02:31:52,638 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 02:31:52,638 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-12 02:31:52,639 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 02:31:52,639 INFO L87 Difference]: Start difference. First operand 13 states and 15 transitions. Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 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-07-12 02:31:54,881 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.21s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-12 02:31:54,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 02:31:54,991 INFO L93 Difference]: Finished difference Result 21 states and 24 transitions. [2022-07-12 02:31:54,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-12 02:31:54,993 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 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 10 [2022-07-12 02:31:54,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 02:31:54,993 INFO L225 Difference]: With dead ends: 21 [2022-07-12 02:31:54,993 INFO L226 Difference]: Without dead ends: 17 [2022-07-12 02:31:54,994 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 8 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-07-12 02:31:54,995 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 3 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 21 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-07-12 02:31:54,995 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 21 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 1 Unknown, 0 Unchecked, 2.3s Time] [2022-07-12 02:31:54,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2022-07-12 02:31:54,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 14. [2022-07-12 02:31:54,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 13 states have internal predecessors, (16), 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-07-12 02:31:54,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 16 transitions. [2022-07-12 02:31:54,999 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 16 transitions. Word has length 10 [2022-07-12 02:31:54,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 02:31:55,000 INFO L495 AbstractCegarLoop]: Abstraction has 14 states and 16 transitions. [2022-07-12 02:31:55,000 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 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-07-12 02:31:55,000 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 16 transitions. [2022-07-12 02:31:55,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-07-12 02:31:55,000 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 02:31:55,001 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 02:31:55,016 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2022-07-12 02:31:55,203 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 02:31:55,204 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 02:31:55,204 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 02:31:55,204 INFO L85 PathProgramCache]: Analyzing trace with hash 2110328889, now seen corresponding path program 1 times [2022-07-12 02:31:55,205 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 02:31:55,205 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [629693311] [2022-07-12 02:31:55,205 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 02:31:55,205 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 02:31:55,206 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 02:31:55,207 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-07-12 02:31:55,251 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2022-07-12 02:31:55,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 02:31:55,926 INFO L263 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 30 conjunts are in the unsatisfiable core [2022-07-12 02:31:55,931 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 02:32:02,993 INFO L356 Elim1Store]: treesize reduction 24, result has 51.0 percent of original size [2022-07-12 02:32:02,994 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 612 treesize of output 312 [2022-07-12 02:35:49,505 WARN L833 $PredicateComparison]: unable to prove that (or (and (or (exists ((v_arrayElimCell_2 (_ BitVec 32))) (and (exists ((v_arrayElimCell_4 (_ BitVec 32))) (and (= ((_ to_fp 8 24) roundNearestTiesToEven (_ bv10 32)) (fp ((_ extract 31 31) v_arrayElimCell_4) ((_ extract 30 23) v_arrayElimCell_4) ((_ extract 22 0) v_arrayElimCell_4))) (exists ((|ULTIMATE.start_main_~t~0#1| (_ FloatingPoint 8 24))) (and (exists ((v_arrayElimCell_5 (_ BitVec 32))) (and (exists ((v_arrayElimCell_1 (_ BitVec 32))) (let ((.cse0 (fp ((_ extract 31 31) v_arrayElimCell_1) ((_ extract 30 23) v_arrayElimCell_1) ((_ extract 22 0) v_arrayElimCell_1)))) (and (not (fp.geq (fp.add roundNearestTiesToEven (fp ((_ extract 31 31) v_arrayElimCell_5) ((_ extract 30 23) v_arrayElimCell_5) ((_ extract 22 0) v_arrayElimCell_5)) (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp ((_ extract 31 31) v_arrayElimCell_2) ((_ extract 30 23) v_arrayElimCell_2) ((_ extract 22 0) v_arrayElimCell_2)) (fp.sub roundNearestTiesToEven |ULTIMATE.start_main_~t~0#1| .cse0)) (fp.sub roundNearestTiesToEven (fp ((_ extract 31 31) v_arrayElimCell_4) ((_ extract 30 23) v_arrayElimCell_4) ((_ extract 22 0) v_arrayElimCell_4)) .cse0))) (fp.neg ((_ to_fp 8 24) roundNearestTiesToEven 10.0)))) (fp.geq |ULTIMATE.start_main_~t~0#1| .cse0) (= .cse0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv5 32)))))) (= (fp ((_ extract 31 31) v_arrayElimCell_5) ((_ extract 30 23) v_arrayElimCell_5) ((_ extract 22 0) v_arrayElimCell_5)) ((_ to_fp 8 24) roundNearestTiesToEven (_ bv1 32))))) (fp.leq |ULTIMATE.start_main_~t~0#1| (fp ((_ extract 31 31) v_arrayElimCell_4) ((_ extract 30 23) v_arrayElimCell_4) ((_ extract 22 0) v_arrayElimCell_4))))))) (= ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4 32)) (fp ((_ extract 31 31) v_arrayElimCell_2) ((_ extract 30 23) v_arrayElimCell_2) ((_ extract 22 0) v_arrayElimCell_2))))) (exists ((v_arrayElimCell_2 (_ BitVec 32))) (and (= ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4 32)) (fp ((_ extract 31 31) v_arrayElimCell_2) ((_ extract 30 23) v_arrayElimCell_2) ((_ extract 22 0) v_arrayElimCell_2))) (exists ((v_arrayElimCell_4 (_ BitVec 32))) (and (= ((_ to_fp 8 24) roundNearestTiesToEven (_ bv10 32)) (fp ((_ extract 31 31) v_arrayElimCell_4) ((_ extract 30 23) v_arrayElimCell_4) ((_ extract 22 0) v_arrayElimCell_4))) (exists ((|ULTIMATE.start_main_~t~0#1| (_ FloatingPoint 8 24))) (and (exists ((v_arrayElimCell_5 (_ BitVec 32))) (and (= (fp ((_ extract 31 31) v_arrayElimCell_5) ((_ extract 30 23) v_arrayElimCell_5) ((_ extract 22 0) v_arrayElimCell_5)) ((_ to_fp 8 24) roundNearestTiesToEven (_ bv1 32))) (exists ((v_arrayElimCell_1 (_ BitVec 32))) (let ((.cse1 (fp ((_ extract 31 31) v_arrayElimCell_1) ((_ extract 30 23) v_arrayElimCell_1) ((_ extract 22 0) v_arrayElimCell_1)))) (and (not (fp.leq (fp.add roundNearestTiesToEven (fp ((_ extract 31 31) v_arrayElimCell_5) ((_ extract 30 23) v_arrayElimCell_5) ((_ extract 22 0) v_arrayElimCell_5)) (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp ((_ extract 31 31) v_arrayElimCell_2) ((_ extract 30 23) v_arrayElimCell_2) ((_ extract 22 0) v_arrayElimCell_2)) (fp.sub roundNearestTiesToEven |ULTIMATE.start_main_~t~0#1| .cse1)) (fp.sub roundNearestTiesToEven (fp ((_ extract 31 31) v_arrayElimCell_4) ((_ extract 30 23) v_arrayElimCell_4) ((_ extract 22 0) v_arrayElimCell_4)) .cse1))) ((_ to_fp 8 24) roundNearestTiesToEven 30.0))) (fp.geq |ULTIMATE.start_main_~t~0#1| .cse1) (= .cse1 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv5 32)))))))) (fp.leq |ULTIMATE.start_main_~t~0#1| (fp ((_ extract 31 31) v_arrayElimCell_4) ((_ extract 30 23) v_arrayElimCell_4) ((_ extract 22 0) v_arrayElimCell_4)))))))))) (= |c_ULTIMATE.start___VERIFIER_assert_~cond#1| (_ bv0 32))) (and (= |c_ULTIMATE.start___VERIFIER_assert_~cond#1| (_ bv1 32)) (exists ((v_arrayElimCell_1 (_ BitVec 32)) (v_arrayElimCell_5 (_ BitVec 32)) (v_arrayElimCell_4 (_ BitVec 32)) (|ULTIMATE.start_main_~t~0#1| (_ FloatingPoint 8 24)) (v_arrayElimCell_2 (_ BitVec 32))) (let ((.cse3 (fp ((_ extract 31 31) v_arrayElimCell_5) ((_ extract 30 23) v_arrayElimCell_5) ((_ extract 22 0) v_arrayElimCell_5))) (.cse4 (fp ((_ extract 31 31) v_arrayElimCell_1) ((_ extract 30 23) v_arrayElimCell_1) ((_ extract 22 0) v_arrayElimCell_1))) (.cse2 (fp ((_ extract 31 31) v_arrayElimCell_4) ((_ extract 30 23) v_arrayElimCell_4) ((_ extract 22 0) v_arrayElimCell_4))) (.cse5 (fp ((_ extract 31 31) v_arrayElimCell_2) ((_ extract 30 23) v_arrayElimCell_2) ((_ extract 22 0) v_arrayElimCell_2)))) (and (fp.leq |ULTIMATE.start_main_~t~0#1| .cse2) (= .cse3 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv1 32))) (fp.geq |ULTIMATE.start_main_~t~0#1| .cse4) (= .cse4 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv5 32))) (fp.leq (fp.add roundNearestTiesToEven .cse3 (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse5 (fp.sub roundNearestTiesToEven |ULTIMATE.start_main_~t~0#1| .cse4)) (fp.sub roundNearestTiesToEven .cse2 .cse4))) ((_ to_fp 8 24) roundNearestTiesToEven 30.0)) (= ((_ to_fp 8 24) roundNearestTiesToEven (_ bv10 32)) .cse2) (= ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4 32)) .cse5)))))) is different from false [2022-07-12 02:36:18,876 WARN L833 $PredicateComparison]: unable to prove that (or (exists ((v_arrayElimCell_2 (_ BitVec 32))) (and (exists ((v_arrayElimCell_4 (_ BitVec 32))) (and (= ((_ to_fp 8 24) roundNearestTiesToEven (_ bv10 32)) (fp ((_ extract 31 31) v_arrayElimCell_4) ((_ extract 30 23) v_arrayElimCell_4) ((_ extract 22 0) v_arrayElimCell_4))) (exists ((|ULTIMATE.start_main_~t~0#1| (_ FloatingPoint 8 24))) (and (exists ((v_arrayElimCell_5 (_ BitVec 32))) (and (exists ((v_arrayElimCell_1 (_ BitVec 32))) (let ((.cse0 (fp ((_ extract 31 31) v_arrayElimCell_1) ((_ extract 30 23) v_arrayElimCell_1) ((_ extract 22 0) v_arrayElimCell_1)))) (and (not (fp.geq (fp.add roundNearestTiesToEven (fp ((_ extract 31 31) v_arrayElimCell_5) ((_ extract 30 23) v_arrayElimCell_5) ((_ extract 22 0) v_arrayElimCell_5)) (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp ((_ extract 31 31) v_arrayElimCell_2) ((_ extract 30 23) v_arrayElimCell_2) ((_ extract 22 0) v_arrayElimCell_2)) (fp.sub roundNearestTiesToEven |ULTIMATE.start_main_~t~0#1| .cse0)) (fp.sub roundNearestTiesToEven (fp ((_ extract 31 31) v_arrayElimCell_4) ((_ extract 30 23) v_arrayElimCell_4) ((_ extract 22 0) v_arrayElimCell_4)) .cse0))) (fp.neg ((_ to_fp 8 24) roundNearestTiesToEven 10.0)))) (fp.geq |ULTIMATE.start_main_~t~0#1| .cse0) (= .cse0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv5 32)))))) (= (fp ((_ extract 31 31) v_arrayElimCell_5) ((_ extract 30 23) v_arrayElimCell_5) ((_ extract 22 0) v_arrayElimCell_5)) ((_ to_fp 8 24) roundNearestTiesToEven (_ bv1 32))))) (fp.leq |ULTIMATE.start_main_~t~0#1| (fp ((_ extract 31 31) v_arrayElimCell_4) ((_ extract 30 23) v_arrayElimCell_4) ((_ extract 22 0) v_arrayElimCell_4))))))) (= ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4 32)) (fp ((_ extract 31 31) v_arrayElimCell_2) ((_ extract 30 23) v_arrayElimCell_2) ((_ extract 22 0) v_arrayElimCell_2))))) (exists ((v_arrayElimCell_2 (_ BitVec 32))) (and (= ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4 32)) (fp ((_ extract 31 31) v_arrayElimCell_2) ((_ extract 30 23) v_arrayElimCell_2) ((_ extract 22 0) v_arrayElimCell_2))) (exists ((v_arrayElimCell_4 (_ BitVec 32))) (and (= ((_ to_fp 8 24) roundNearestTiesToEven (_ bv10 32)) (fp ((_ extract 31 31) v_arrayElimCell_4) ((_ extract 30 23) v_arrayElimCell_4) ((_ extract 22 0) v_arrayElimCell_4))) (exists ((|ULTIMATE.start_main_~t~0#1| (_ FloatingPoint 8 24))) (and (exists ((v_arrayElimCell_5 (_ BitVec 32))) (and (= (fp ((_ extract 31 31) v_arrayElimCell_5) ((_ extract 30 23) v_arrayElimCell_5) ((_ extract 22 0) v_arrayElimCell_5)) ((_ to_fp 8 24) roundNearestTiesToEven (_ bv1 32))) (exists ((v_arrayElimCell_1 (_ BitVec 32))) (let ((.cse1 (fp ((_ extract 31 31) v_arrayElimCell_1) ((_ extract 30 23) v_arrayElimCell_1) ((_ extract 22 0) v_arrayElimCell_1)))) (and (not (fp.leq (fp.add roundNearestTiesToEven (fp ((_ extract 31 31) v_arrayElimCell_5) ((_ extract 30 23) v_arrayElimCell_5) ((_ extract 22 0) v_arrayElimCell_5)) (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp ((_ extract 31 31) v_arrayElimCell_2) ((_ extract 30 23) v_arrayElimCell_2) ((_ extract 22 0) v_arrayElimCell_2)) (fp.sub roundNearestTiesToEven |ULTIMATE.start_main_~t~0#1| .cse1)) (fp.sub roundNearestTiesToEven (fp ((_ extract 31 31) v_arrayElimCell_4) ((_ extract 30 23) v_arrayElimCell_4) ((_ extract 22 0) v_arrayElimCell_4)) .cse1))) ((_ to_fp 8 24) roundNearestTiesToEven 30.0))) (fp.geq |ULTIMATE.start_main_~t~0#1| .cse1) (= .cse1 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv5 32)))))))) (fp.leq |ULTIMATE.start_main_~t~0#1| (fp ((_ extract 31 31) v_arrayElimCell_4) ((_ extract 30 23) v_arrayElimCell_4) ((_ extract 22 0) v_arrayElimCell_4)))))))))) is different from false [2022-07-12 02:36:20,916 WARN L855 $PredicateComparison]: unable to prove that (or (exists ((v_arrayElimCell_2 (_ BitVec 32))) (and (exists ((v_arrayElimCell_4 (_ BitVec 32))) (and (= ((_ to_fp 8 24) roundNearestTiesToEven (_ bv10 32)) (fp ((_ extract 31 31) v_arrayElimCell_4) ((_ extract 30 23) v_arrayElimCell_4) ((_ extract 22 0) v_arrayElimCell_4))) (exists ((|ULTIMATE.start_main_~t~0#1| (_ FloatingPoint 8 24))) (and (exists ((v_arrayElimCell_5 (_ BitVec 32))) (and (exists ((v_arrayElimCell_1 (_ BitVec 32))) (let ((.cse0 (fp ((_ extract 31 31) v_arrayElimCell_1) ((_ extract 30 23) v_arrayElimCell_1) ((_ extract 22 0) v_arrayElimCell_1)))) (and (not (fp.geq (fp.add roundNearestTiesToEven (fp ((_ extract 31 31) v_arrayElimCell_5) ((_ extract 30 23) v_arrayElimCell_5) ((_ extract 22 0) v_arrayElimCell_5)) (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp ((_ extract 31 31) v_arrayElimCell_2) ((_ extract 30 23) v_arrayElimCell_2) ((_ extract 22 0) v_arrayElimCell_2)) (fp.sub roundNearestTiesToEven |ULTIMATE.start_main_~t~0#1| .cse0)) (fp.sub roundNearestTiesToEven (fp ((_ extract 31 31) v_arrayElimCell_4) ((_ extract 30 23) v_arrayElimCell_4) ((_ extract 22 0) v_arrayElimCell_4)) .cse0))) (fp.neg ((_ to_fp 8 24) roundNearestTiesToEven 10.0)))) (fp.geq |ULTIMATE.start_main_~t~0#1| .cse0) (= .cse0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv5 32)))))) (= (fp ((_ extract 31 31) v_arrayElimCell_5) ((_ extract 30 23) v_arrayElimCell_5) ((_ extract 22 0) v_arrayElimCell_5)) ((_ to_fp 8 24) roundNearestTiesToEven (_ bv1 32))))) (fp.leq |ULTIMATE.start_main_~t~0#1| (fp ((_ extract 31 31) v_arrayElimCell_4) ((_ extract 30 23) v_arrayElimCell_4) ((_ extract 22 0) v_arrayElimCell_4))))))) (= ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4 32)) (fp ((_ extract 31 31) v_arrayElimCell_2) ((_ extract 30 23) v_arrayElimCell_2) ((_ extract 22 0) v_arrayElimCell_2))))) (exists ((v_arrayElimCell_2 (_ BitVec 32))) (and (= ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4 32)) (fp ((_ extract 31 31) v_arrayElimCell_2) ((_ extract 30 23) v_arrayElimCell_2) ((_ extract 22 0) v_arrayElimCell_2))) (exists ((v_arrayElimCell_4 (_ BitVec 32))) (and (= ((_ to_fp 8 24) roundNearestTiesToEven (_ bv10 32)) (fp ((_ extract 31 31) v_arrayElimCell_4) ((_ extract 30 23) v_arrayElimCell_4) ((_ extract 22 0) v_arrayElimCell_4))) (exists ((|ULTIMATE.start_main_~t~0#1| (_ FloatingPoint 8 24))) (and (exists ((v_arrayElimCell_5 (_ BitVec 32))) (and (= (fp ((_ extract 31 31) v_arrayElimCell_5) ((_ extract 30 23) v_arrayElimCell_5) ((_ extract 22 0) v_arrayElimCell_5)) ((_ to_fp 8 24) roundNearestTiesToEven (_ bv1 32))) (exists ((v_arrayElimCell_1 (_ BitVec 32))) (let ((.cse1 (fp ((_ extract 31 31) v_arrayElimCell_1) ((_ extract 30 23) v_arrayElimCell_1) ((_ extract 22 0) v_arrayElimCell_1)))) (and (not (fp.leq (fp.add roundNearestTiesToEven (fp ((_ extract 31 31) v_arrayElimCell_5) ((_ extract 30 23) v_arrayElimCell_5) ((_ extract 22 0) v_arrayElimCell_5)) (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp ((_ extract 31 31) v_arrayElimCell_2) ((_ extract 30 23) v_arrayElimCell_2) ((_ extract 22 0) v_arrayElimCell_2)) (fp.sub roundNearestTiesToEven |ULTIMATE.start_main_~t~0#1| .cse1)) (fp.sub roundNearestTiesToEven (fp ((_ extract 31 31) v_arrayElimCell_4) ((_ extract 30 23) v_arrayElimCell_4) ((_ extract 22 0) v_arrayElimCell_4)) .cse1))) ((_ to_fp 8 24) roundNearestTiesToEven 30.0))) (fp.geq |ULTIMATE.start_main_~t~0#1| .cse1) (= .cse1 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv5 32)))))))) (fp.leq |ULTIMATE.start_main_~t~0#1| (fp ((_ extract 31 31) v_arrayElimCell_4) ((_ extract 30 23) v_arrayElimCell_4) ((_ extract 22 0) v_arrayElimCell_4)))))))))) is different from true [2022-07-12 02:36:20,917 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 02:36:20,917 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 02:36:20,918 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 02:36:20,918 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [629693311] [2022-07-12 02:36:20,918 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [629693311] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 02:36:20,918 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 02:36:20,918 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-07-12 02:36:20,918 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [890953750] [2022-07-12 02:36:20,918 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 02:36:20,919 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-07-12 02:36:20,919 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 02:36:20,919 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-07-12 02:36:20,920 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=62, Unknown=3, NotChecked=34, Total=132 [2022-07-12 02:36:20,920 INFO L87 Difference]: Start difference. First operand 14 states and 16 transitions. Second operand has 12 states, 11 states have (on average 1.0) internal successors, (11), 11 states have internal predecessors, (11), 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-07-12 02:36:27,525 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.20s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers []