./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/float-newlib/double_req_bl_1251b.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 7b2dab56 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-newlib/double_req_bl_1251b.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 0dca3295f12b1ef36cf31c463cf879069525072f ......................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis 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-newlib/double_req_bl_1251b.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 0dca3295f12b1ef36cf31c463cf879069525072f ......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.2.0-7b2dab5 [2020-12-03 01:08:58,165 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-12-03 01:08:58,168 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-12-03 01:08:58,205 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-12-03 01:08:58,205 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-12-03 01:08:58,207 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-12-03 01:08:58,209 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-12-03 01:08:58,211 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-12-03 01:08:58,213 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-12-03 01:08:58,215 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-12-03 01:08:58,216 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-12-03 01:08:58,217 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-12-03 01:08:58,218 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-12-03 01:08:58,219 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-12-03 01:08:58,220 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-12-03 01:08:58,222 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-12-03 01:08:58,223 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-12-03 01:08:58,224 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-12-03 01:08:58,226 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-12-03 01:08:58,229 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-12-03 01:08:58,231 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-12-03 01:08:58,233 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-12-03 01:08:58,240 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-12-03 01:08:58,241 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-12-03 01:08:58,248 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-12-03 01:08:58,248 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-12-03 01:08:58,249 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-12-03 01:08:58,252 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-12-03 01:08:58,253 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-12-03 01:08:58,254 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-12-03 01:08:58,255 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-12-03 01:08:58,256 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-12-03 01:08:58,257 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-12-03 01:08:58,258 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-12-03 01:08:58,259 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-12-03 01:08:58,259 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-12-03 01:08:58,260 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-12-03 01:08:58,260 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-12-03 01:08:58,261 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-12-03 01:08:58,266 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-12-03 01:08:58,267 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-12-03 01:08:58,271 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2020-12-03 01:08:58,300 INFO L113 SettingsManager]: Loading preferences was successful [2020-12-03 01:08:58,300 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-12-03 01:08:58,302 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-12-03 01:08:58,302 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-12-03 01:08:58,302 INFO L138 SettingsManager]: * Use SBE=true [2020-12-03 01:08:58,303 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-12-03 01:08:58,303 INFO L138 SettingsManager]: * sizeof long=4 [2020-12-03 01:08:58,303 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-12-03 01:08:58,303 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-12-03 01:08:58,303 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-12-03 01:08:58,303 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-12-03 01:08:58,304 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-12-03 01:08:58,304 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-12-03 01:08:58,304 INFO L138 SettingsManager]: * sizeof long double=12 [2020-12-03 01:08:58,304 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-12-03 01:08:58,304 INFO L138 SettingsManager]: * Use constant arrays=true [2020-12-03 01:08:58,305 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-12-03 01:08:58,305 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-12-03 01:08:58,305 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-12-03 01:08:58,305 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-12-03 01:08:58,305 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-12-03 01:08:58,306 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-12-03 01:08:58,306 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-12-03 01:08:58,306 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-12-03 01:08:58,306 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-12-03 01:08:58,306 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-12-03 01:08:58,306 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-12-03 01:08:58,307 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-12-03 01:08:58,307 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 -> 0dca3295f12b1ef36cf31c463cf879069525072f [2020-12-03 01:08:58,754 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-12-03 01:08:58,790 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-12-03 01:08:58,793 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-12-03 01:08:58,795 INFO L271 PluginConnector]: Initializing CDTParser... [2020-12-03 01:08:58,796 INFO L275 PluginConnector]: CDTParser initialized [2020-12-03 01:08:58,797 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/float-newlib/double_req_bl_1251b.c [2020-12-03 01:08:58,895 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5b1c78f77/528a1d0d82fa4e4592bbe8f21521910b/FLAG5d976ddb9 [2020-12-03 01:08:59,522 INFO L306 CDTParser]: Found 1 translation units. [2020-12-03 01:08:59,525 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/double_req_bl_1251b.c [2020-12-03 01:08:59,536 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5b1c78f77/528a1d0d82fa4e4592bbe8f21521910b/FLAG5d976ddb9 [2020-12-03 01:08:59,838 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5b1c78f77/528a1d0d82fa4e4592bbe8f21521910b [2020-12-03 01:08:59,841 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-12-03 01:08:59,846 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-12-03 01:08:59,848 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-12-03 01:08:59,852 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-12-03 01:08:59,857 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-12-03 01:08:59,859 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.12 01:08:59" (1/1) ... [2020-12-03 01:08:59,867 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5229a854 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 01:08:59, skipping insertion in model container [2020-12-03 01:08:59,867 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.12 01:08:59" (1/1) ... [2020-12-03 01:08:59,876 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-12-03 01:08:59,899 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-12-03 01:09:00,120 WARN L226 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-newlib/double_req_bl_1251b.c[2080,2093] [2020-12-03 01:09:00,124 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-12-03 01:09:00,134 INFO L203 MainTranslator]: Completed pre-run [2020-12-03 01:09:00,162 WARN L226 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-newlib/double_req_bl_1251b.c[2080,2093] [2020-12-03 01:09:00,163 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-12-03 01:09:00,181 INFO L208 MainTranslator]: Completed translation [2020-12-03 01:09:00,182 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 01:09:00 WrapperNode [2020-12-03 01:09:00,182 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-12-03 01:09:00,184 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-12-03 01:09:00,184 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-12-03 01:09:00,184 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-12-03 01:09:00,194 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 01:09:00" (1/1) ... [2020-12-03 01:09:00,203 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 01:09:00" (1/1) ... [2020-12-03 01:09:00,230 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-12-03 01:09:00,231 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-12-03 01:09:00,231 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-12-03 01:09:00,232 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-12-03 01:09:00,242 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 01:09:00" (1/1) ... [2020-12-03 01:09:00,243 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 01:09:00" (1/1) ... [2020-12-03 01:09:00,246 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 01:09:00" (1/1) ... [2020-12-03 01:09:00,246 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 01:09:00" (1/1) ... [2020-12-03 01:09:00,254 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 01:09:00" (1/1) ... [2020-12-03 01:09:00,260 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 01:09:00" (1/1) ... [2020-12-03 01:09:00,262 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 01:09:00" (1/1) ... [2020-12-03 01:09:00,265 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-12-03 01:09:00,267 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-12-03 01:09:00,267 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-12-03 01:09:00,267 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-12-03 01:09:00,268 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 01:09:00" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-12-03 01:09:00,390 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-12-03 01:09:00,390 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-12-03 01:09:00,391 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2020-12-03 01:09:00,391 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-12-03 01:09:00,392 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-12-03 01:09:00,392 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-12-03 01:09:00,392 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-12-03 01:09:00,995 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-12-03 01:09:00,995 INFO L299 CfgBuilder]: Removed 16 assume(true) statements. [2020-12-03 01:09:00,997 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 01:09:00 BoogieIcfgContainer [2020-12-03 01:09:00,997 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-12-03 01:09:00,999 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-12-03 01:09:01,000 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-12-03 01:09:01,003 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-12-03 01:09:01,003 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.12 01:08:59" (1/3) ... [2020-12-03 01:09:01,004 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@54601872 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.12 01:09:01, skipping insertion in model container [2020-12-03 01:09:01,005 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 01:09:00" (2/3) ... [2020-12-03 01:09:01,005 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@54601872 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.12 01:09:01, skipping insertion in model container [2020-12-03 01:09:01,005 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 01:09:00" (3/3) ... [2020-12-03 01:09:01,007 INFO L111 eAbstractionObserver]: Analyzing ICFG double_req_bl_1251b.c [2020-12-03 01:09:01,023 INFO L180 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-12-03 01:09:01,027 INFO L192 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-12-03 01:09:01,040 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-12-03 01:09:01,067 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-12-03 01:09:01,067 INFO L378 AbstractCegarLoop]: Hoare is true [2020-12-03 01:09:01,068 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-12-03 01:09:01,068 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-12-03 01:09:01,068 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-12-03 01:09:01,068 INFO L382 AbstractCegarLoop]: Difference is false [2020-12-03 01:09:01,069 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-12-03 01:09:01,069 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-12-03 01:09:01,083 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states. [2020-12-03 01:09:01,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-12-03 01:09:01,089 INFO L414 BasicCegarLoop]: Found error trace [2020-12-03 01:09:01,090 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-03 01:09:01,090 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-03 01:09:01,096 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-03 01:09:01,096 INFO L82 PathProgramCache]: Analyzing trace with hash -124750094, now seen corresponding path program 1 times [2020-12-03 01:09:01,107 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-03 01:09:01,107 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [287903094] [2020-12-03 01:09:01,107 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-03 01:09:01,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-03 01:09:01,290 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-03 01:09:01,291 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [287903094] [2020-12-03 01:09:01,292 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-03 01:09:01,292 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-12-03 01:09:01,293 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2118284960] [2020-12-03 01:09:01,298 INFO L461 AbstractCegarLoop]: Interpolant automaton has 2 states [2020-12-03 01:09:01,299 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-03 01:09:01,315 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2020-12-03 01:09:01,316 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-12-03 01:09:01,319 INFO L87 Difference]: Start difference. First operand 30 states. Second operand 2 states. [2020-12-03 01:09:01,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-03 01:09:01,341 INFO L93 Difference]: Finished difference Result 56 states and 87 transitions. [2020-12-03 01:09:01,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2020-12-03 01:09:01,343 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 11 [2020-12-03 01:09:01,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-03 01:09:01,355 INFO L225 Difference]: With dead ends: 56 [2020-12-03 01:09:01,355 INFO L226 Difference]: Without dead ends: 26 [2020-12-03 01:09:01,359 INFO L677 BasicCegarLoop]: 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 [2020-12-03 01:09:01,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2020-12-03 01:09:01,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2020-12-03 01:09:01,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2020-12-03 01:09:01,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 36 transitions. [2020-12-03 01:09:01,401 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 36 transitions. Word has length 11 [2020-12-03 01:09:01,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-03 01:09:01,402 INFO L481 AbstractCegarLoop]: Abstraction has 26 states and 36 transitions. [2020-12-03 01:09:01,402 INFO L482 AbstractCegarLoop]: Interpolant automaton has 2 states. [2020-12-03 01:09:01,402 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 36 transitions. [2020-12-03 01:09:01,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-12-03 01:09:01,403 INFO L414 BasicCegarLoop]: Found error trace [2020-12-03 01:09:01,403 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-03 01:09:01,404 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-12-03 01:09:01,404 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-03 01:09:01,405 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-03 01:09:01,405 INFO L82 PathProgramCache]: Analyzing trace with hash -1352831344, now seen corresponding path program 1 times [2020-12-03 01:09:01,405 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-03 01:09:01,405 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [477968654] [2020-12-03 01:09:01,406 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-03 01:09:01,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-03 01:09:01,514 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-03 01:09:01,515 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [477968654] [2020-12-03 01:09:01,515 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-03 01:09:01,515 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-03 01:09:01,515 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [318201707] [2020-12-03 01:09:01,517 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-03 01:09:01,517 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-03 01:09:01,518 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-03 01:09:01,518 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-03 01:09:01,519 INFO L87 Difference]: Start difference. First operand 26 states and 36 transitions. Second operand 4 states. [2020-12-03 01:09:01,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-03 01:09:01,616 INFO L93 Difference]: Finished difference Result 40 states and 51 transitions. [2020-12-03 01:09:01,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-03 01:09:01,618 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2020-12-03 01:09:01,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-03 01:09:01,619 INFO L225 Difference]: With dead ends: 40 [2020-12-03 01:09:01,619 INFO L226 Difference]: Without dead ends: 36 [2020-12-03 01:09:01,620 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-03 01:09:01,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2020-12-03 01:09:01,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 28. [2020-12-03 01:09:01,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2020-12-03 01:09:01,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 38 transitions. [2020-12-03 01:09:01,627 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 38 transitions. Word has length 12 [2020-12-03 01:09:01,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-03 01:09:01,627 INFO L481 AbstractCegarLoop]: Abstraction has 28 states and 38 transitions. [2020-12-03 01:09:01,627 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-03 01:09:01,628 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 38 transitions. [2020-12-03 01:09:01,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-12-03 01:09:01,628 INFO L414 BasicCegarLoop]: Found error trace [2020-12-03 01:09:01,628 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-03 01:09:01,629 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-12-03 01:09:01,629 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-03 01:09:01,630 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-03 01:09:01,630 INFO L82 PathProgramCache]: Analyzing trace with hash -1913129681, now seen corresponding path program 1 times [2020-12-03 01:09:01,630 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-03 01:09:01,630 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1553374423] [2020-12-03 01:09:01,630 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-03 01:09:01,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-03 01:09:01,711 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-03 01:09:01,712 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1553374423] [2020-12-03 01:09:01,712 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-03 01:09:01,714 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-03 01:09:01,715 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [624605421] [2020-12-03 01:09:01,715 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-03 01:09:01,715 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-03 01:09:01,719 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-03 01:09:01,719 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-03 01:09:01,719 INFO L87 Difference]: Start difference. First operand 28 states and 38 transitions. Second operand 4 states. [2020-12-03 01:09:01,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-03 01:09:01,830 INFO L93 Difference]: Finished difference Result 42 states and 53 transitions. [2020-12-03 01:09:01,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-03 01:09:01,832 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2020-12-03 01:09:01,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-03 01:09:01,836 INFO L225 Difference]: With dead ends: 42 [2020-12-03 01:09:01,837 INFO L226 Difference]: Without dead ends: 38 [2020-12-03 01:09:01,838 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-03 01:09:01,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2020-12-03 01:09:01,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 28. [2020-12-03 01:09:01,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2020-12-03 01:09:01,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 38 transitions. [2020-12-03 01:09:01,856 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 38 transitions. Word has length 13 [2020-12-03 01:09:01,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-03 01:09:01,856 INFO L481 AbstractCegarLoop]: Abstraction has 28 states and 38 transitions. [2020-12-03 01:09:01,856 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-03 01:09:01,856 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 38 transitions. [2020-12-03 01:09:01,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-12-03 01:09:01,858 INFO L414 BasicCegarLoop]: Found error trace [2020-12-03 01:09:01,858 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-03 01:09:01,858 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-12-03 01:09:01,858 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-03 01:09:01,859 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-03 01:09:01,859 INFO L82 PathProgramCache]: Analyzing trace with hash -1959363189, now seen corresponding path program 1 times [2020-12-03 01:09:01,859 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-03 01:09:01,861 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1427907391] [2020-12-03 01:09:01,861 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-03 01:09:01,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-03 01:09:01,972 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-03 01:09:01,973 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1427907391] [2020-12-03 01:09:01,973 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-03 01:09:01,973 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-03 01:09:01,973 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1692632394] [2020-12-03 01:09:01,974 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-03 01:09:01,974 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-03 01:09:01,975 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-03 01:09:01,975 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-03 01:09:01,975 INFO L87 Difference]: Start difference. First operand 28 states and 38 transitions. Second operand 4 states. [2020-12-03 01:09:02,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-03 01:09:02,053 INFO L93 Difference]: Finished difference Result 44 states and 55 transitions. [2020-12-03 01:09:02,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-03 01:09:02,054 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2020-12-03 01:09:02,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-03 01:09:02,055 INFO L225 Difference]: With dead ends: 44 [2020-12-03 01:09:02,055 INFO L226 Difference]: Without dead ends: 40 [2020-12-03 01:09:02,056 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-03 01:09:02,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2020-12-03 01:09:02,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 28. [2020-12-03 01:09:02,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2020-12-03 01:09:02,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 38 transitions. [2020-12-03 01:09:02,062 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 38 transitions. Word has length 14 [2020-12-03 01:09:02,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-03 01:09:02,062 INFO L481 AbstractCegarLoop]: Abstraction has 28 states and 38 transitions. [2020-12-03 01:09:02,062 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-03 01:09:02,062 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 38 transitions. [2020-12-03 01:09:02,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-12-03 01:09:02,063 INFO L414 BasicCegarLoop]: Found error trace [2020-12-03 01:09:02,063 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-03 01:09:02,063 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-12-03 01:09:02,064 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-03 01:09:02,064 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-03 01:09:02,064 INFO L82 PathProgramCache]: Analyzing trace with hash 1045511114, now seen corresponding path program 1 times [2020-12-03 01:09:02,064 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-03 01:09:02,065 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1614759234] [2020-12-03 01:09:02,065 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-03 01:09:02,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-03 01:09:02,122 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-03 01:09:02,123 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1614759234] [2020-12-03 01:09:02,123 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-03 01:09:02,123 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-03 01:09:02,123 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [817270960] [2020-12-03 01:09:02,124 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-03 01:09:02,124 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-03 01:09:02,126 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-03 01:09:02,126 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-03 01:09:02,126 INFO L87 Difference]: Start difference. First operand 28 states and 38 transitions. Second operand 4 states. [2020-12-03 01:09:02,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-03 01:09:02,213 INFO L93 Difference]: Finished difference Result 42 states and 53 transitions. [2020-12-03 01:09:02,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-03 01:09:02,214 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2020-12-03 01:09:02,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-03 01:09:02,215 INFO L225 Difference]: With dead ends: 42 [2020-12-03 01:09:02,215 INFO L226 Difference]: Without dead ends: 38 [2020-12-03 01:09:02,218 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-03 01:09:02,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2020-12-03 01:09:02,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 28. [2020-12-03 01:09:02,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2020-12-03 01:09:02,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 38 transitions. [2020-12-03 01:09:02,223 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 38 transitions. Word has length 15 [2020-12-03 01:09:02,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-03 01:09:02,223 INFO L481 AbstractCegarLoop]: Abstraction has 28 states and 38 transitions. [2020-12-03 01:09:02,223 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-03 01:09:02,224 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 38 transitions. [2020-12-03 01:09:02,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-12-03 01:09:02,224 INFO L414 BasicCegarLoop]: Found error trace [2020-12-03 01:09:02,224 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-03 01:09:02,225 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-12-03 01:09:02,225 INFO L429 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-03 01:09:02,225 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-03 01:09:02,225 INFO L82 PathProgramCache]: Analyzing trace with hash 1102769416, now seen corresponding path program 1 times [2020-12-03 01:09:02,226 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-03 01:09:02,226 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1488339733] [2020-12-03 01:09:02,226 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-03 01:09:02,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-12-03 01:09:02,254 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-12-03 01:09:02,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-12-03 01:09:02,277 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-12-03 01:09:02,304 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-12-03 01:09:02,304 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-12-03 01:09:02,304 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-12-03 01:09:02,340 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.12 01:09:02 BoogieIcfgContainer [2020-12-03 01:09:02,340 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-12-03 01:09:02,341 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-12-03 01:09:02,344 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-12-03 01:09:02,344 INFO L275 PluginConnector]: Witness Printer initialized [2020-12-03 01:09:02,345 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 01:09:00" (3/4) ... [2020-12-03 01:09:02,349 INFO L140 WitnessPrinter]: No result that supports witness generation found [2020-12-03 01:09:02,349 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-12-03 01:09:02,352 INFO L168 Benchmark]: Toolchain (without parser) took 2505.40 ms. Allocated memory was 48.2 MB in the beginning and 58.7 MB in the end (delta: 10.5 MB). Free memory was 24.7 MB in the beginning and 40.9 MB in the end (delta: -16.2 MB). Peak memory consumption was 18.8 MB. Max. memory is 16.1 GB. [2020-12-03 01:09:02,352 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 39.8 MB. Free memory was 17.8 MB in the beginning and 17.7 MB in the end (delta: 69.9 kB). There was no memory consumed. Max. memory is 16.1 GB. [2020-12-03 01:09:02,353 INFO L168 Benchmark]: CACSL2BoogieTranslator took 334.61 ms. Allocated memory is still 48.2 MB. Free memory was 24.5 MB in the beginning and 25.3 MB in the end (delta: -823.1 kB). Peak memory consumption was 7.5 MB. Max. memory is 16.1 GB. [2020-12-03 01:09:02,354 INFO L168 Benchmark]: Boogie Procedure Inliner took 46.77 ms. Allocated memory is still 48.2 MB. Free memory was 25.3 MB in the beginning and 23.5 MB in the end (delta: 1.8 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2020-12-03 01:09:02,355 INFO L168 Benchmark]: Boogie Preprocessor took 34.41 ms. Allocated memory is still 48.2 MB. Free memory was 23.5 MB in the beginning and 22.1 MB in the end (delta: 1.4 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2020-12-03 01:09:02,356 INFO L168 Benchmark]: RCFGBuilder took 730.96 ms. Allocated memory is still 48.2 MB. Free memory was 22.1 MB in the beginning and 26.4 MB in the end (delta: -4.3 MB). Peak memory consumption was 4.1 MB. Max. memory is 16.1 GB. [2020-12-03 01:09:02,357 INFO L168 Benchmark]: TraceAbstraction took 1340.74 ms. Allocated memory was 48.2 MB in the beginning and 58.7 MB in the end (delta: 10.5 MB). Free memory was 26.0 MB in the beginning and 20.1 MB in the end (delta: 5.9 MB). Peak memory consumption was 15.5 MB. Max. memory is 16.1 GB. [2020-12-03 01:09:02,357 INFO L168 Benchmark]: Witness Printer took 8.33 ms. Allocated memory is still 58.7 MB. Free memory was 20.1 MB in the beginning and 40.9 MB in the end (delta: -20.8 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2020-12-03 01:09:02,362 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.20 ms. Allocated memory is still 39.8 MB. Free memory was 17.8 MB in the beginning and 17.7 MB in the end (delta: 69.9 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 334.61 ms. Allocated memory is still 48.2 MB. Free memory was 24.5 MB in the beginning and 25.3 MB in the end (delta: -823.1 kB). Peak memory consumption was 7.5 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 46.77 ms. Allocated memory is still 48.2 MB. Free memory was 25.3 MB in the beginning and 23.5 MB in the end (delta: 1.8 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 34.41 ms. Allocated memory is still 48.2 MB. Free memory was 23.5 MB in the beginning and 22.1 MB in the end (delta: 1.4 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * RCFGBuilder took 730.96 ms. Allocated memory is still 48.2 MB. Free memory was 22.1 MB in the beginning and 26.4 MB in the end (delta: -4.3 MB). Peak memory consumption was 4.1 MB. Max. memory is 16.1 GB. * TraceAbstraction took 1340.74 ms. Allocated memory was 48.2 MB in the beginning and 58.7 MB in the end (delta: 10.5 MB). Free memory was 26.0 MB in the beginning and 20.1 MB in the end (delta: 5.9 MB). Peak memory consumption was 15.5 MB. Max. memory is 16.1 GB. * Witness Printer took 8.33 ms. Allocated memory is still 58.7 MB. Free memory was 20.1 MB in the beginning and 40.9 MB in the end (delta: -20.8 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 80]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 79, overapproximation of someBinaryArithmeticDOUBLEoperation at line 67. Possible FailurePath: [L66] double x = __VERIFIER_nondet_double(); [L67] double y = 0.0 / 0.0; [L18] return x != x; [L74] COND TRUE !isnan_double(x) [L29] __uint32_t msw, lsw; [L32] ieee_double_shape_type ew_u; [L33] ew_u.value = (x) [L34] EXPR ew_u.parts.msw [L34] (msw) = ew_u.parts.msw [L35] EXPR ew_u.parts.lsw [L35] (lsw) = ew_u.parts.lsw [L38-L39] COND FALSE !((msw == 0x00000000 && lsw == 0x00000000) || (msw == 0x80000000 && lsw == 0x00000000)) [L41-L42] COND FALSE !((msw >= 0x00100000 && msw <= 0x7fefffff) || (msw >= 0x80100000 && msw <= 0xffefffff)) [L44-L45] COND FALSE !(( msw <= 0x000fffff) || (msw >= 0x80000000 && msw <= 0x800fffff)) [L48-L49] COND FALSE !((msw == 0x7ff00000 && lsw == 0x00000000) || (msw == 0xfff00000 && lsw == 0x00000000)) [L52] return 0; [L57] COND TRUE __fpclassify_double(x) == 0 [L58] return y; [L76] double res = fmax_double(x, y); [L79] COND TRUE res != x [L80] reach_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 30 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 1.2s, OverallIterations: 6, TraceHistogramMax: 1, AutomataDifference: 0.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 209 SDtfs, 40 SDslu, 242 SDs, 0 SdLazy, 84 SolverSat, 6 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 22 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=30occurred in iteration=0, 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, 5 MinimizatonAttempts, 40 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.2s InterpolantComputationTime, 80 NumberOfCodeBlocks, 80 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 60 ConstructedInterpolants, 0 QuantifiedInterpolants, 930 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 5 InterpolantComputations, 5 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 Received shutdown request... ### Bit-precise run ### This is Ultimate 0.2.0-7b2dab5 [2020-12-03 01:09:04,995 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-12-03 01:09:04,999 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-12-03 01:09:05,051 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-12-03 01:09:05,052 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-12-03 01:09:05,054 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-12-03 01:09:05,055 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-12-03 01:09:05,058 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-12-03 01:09:05,060 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-12-03 01:09:05,061 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-12-03 01:09:05,062 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-12-03 01:09:05,064 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-12-03 01:09:05,065 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-12-03 01:09:05,066 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-12-03 01:09:05,067 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-12-03 01:09:05,069 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-12-03 01:09:05,073 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-12-03 01:09:05,074 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-12-03 01:09:05,076 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-12-03 01:09:05,079 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-12-03 01:09:05,080 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-12-03 01:09:05,082 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-12-03 01:09:05,083 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-12-03 01:09:05,084 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-12-03 01:09:05,088 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-12-03 01:09:05,088 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-12-03 01:09:05,088 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-12-03 01:09:05,090 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-12-03 01:09:05,090 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-12-03 01:09:05,091 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-12-03 01:09:05,092 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-12-03 01:09:05,093 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-12-03 01:09:05,094 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-12-03 01:09:05,095 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-12-03 01:09:05,096 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-12-03 01:09:05,097 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-12-03 01:09:05,097 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-12-03 01:09:05,098 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-12-03 01:09:05,098 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-12-03 01:09:05,099 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-12-03 01:09:05,100 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-12-03 01:09:05,101 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2020-12-03 01:09:05,137 INFO L113 SettingsManager]: Loading preferences was successful [2020-12-03 01:09:05,138 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-12-03 01:09:05,143 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-12-03 01:09:05,143 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-12-03 01:09:05,143 INFO L138 SettingsManager]: * Use SBE=true [2020-12-03 01:09:05,144 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-12-03 01:09:05,144 INFO L138 SettingsManager]: * sizeof long=4 [2020-12-03 01:09:05,144 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-12-03 01:09:05,145 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-12-03 01:09:05,145 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-12-03 01:09:05,146 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-12-03 01:09:05,147 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-12-03 01:09:05,147 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2020-12-03 01:09:05,147 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2020-12-03 01:09:05,148 INFO L138 SettingsManager]: * sizeof long double=12 [2020-12-03 01:09:05,148 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-12-03 01:09:05,148 INFO L138 SettingsManager]: * Use constant arrays=true [2020-12-03 01:09:05,149 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-12-03 01:09:05,149 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-12-03 01:09:05,149 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-12-03 01:09:05,150 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-12-03 01:09:05,150 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-12-03 01:09:05,150 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-12-03 01:09:05,151 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-12-03 01:09:05,151 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-12-03 01:09:05,151 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2020-12-03 01:09:05,151 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2020-12-03 01:09:05,152 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-12-03 01:09:05,152 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-12-03 01:09:05,152 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-12-03 01:09:05,152 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 -> 0dca3295f12b1ef36cf31c463cf879069525072f [2020-12-03 01:09:05,617 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-12-03 01:09:05,654 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-12-03 01:09:05,657 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-12-03 01:09:05,659 INFO L271 PluginConnector]: Initializing CDTParser... [2020-12-03 01:09:05,660 INFO L275 PluginConnector]: CDTParser initialized [2020-12-03 01:09:05,661 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/float-newlib/double_req_bl_1251b.c [2020-12-03 01:09:05,746 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6e9bcd1be/7f036d841c9a40e382efb64e217241af/FLAG97a7a7ca2 [2020-12-03 01:09:06,498 INFO L306 CDTParser]: Found 1 translation units. [2020-12-03 01:09:06,500 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/double_req_bl_1251b.c [2020-12-03 01:09:06,510 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6e9bcd1be/7f036d841c9a40e382efb64e217241af/FLAG97a7a7ca2 [2020-12-03 01:09:06,836 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6e9bcd1be/7f036d841c9a40e382efb64e217241af [2020-12-03 01:09:06,839 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-12-03 01:09:06,843 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-12-03 01:09:06,845 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-12-03 01:09:06,846 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-12-03 01:09:06,850 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-12-03 01:09:06,851 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.12 01:09:06" (1/1) ... [2020-12-03 01:09:06,855 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@54906cd5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 01:09:06, skipping insertion in model container [2020-12-03 01:09:06,855 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.12 01:09:06" (1/1) ... [2020-12-03 01:09:06,864 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-12-03 01:09:06,883 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-12-03 01:09:07,103 WARN L226 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-newlib/double_req_bl_1251b.c[2080,2093] [2020-12-03 01:09:07,107 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-12-03 01:09:07,121 INFO L203 MainTranslator]: Completed pre-run [2020-12-03 01:09:07,155 WARN L226 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-newlib/double_req_bl_1251b.c[2080,2093] [2020-12-03 01:09:07,156 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-12-03 01:09:07,191 INFO L208 MainTranslator]: Completed translation [2020-12-03 01:09:07,192 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 01:09:07 WrapperNode [2020-12-03 01:09:07,192 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-12-03 01:09:07,194 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-12-03 01:09:07,194 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-12-03 01:09:07,195 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-12-03 01:09:07,203 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 01:09:07" (1/1) ... [2020-12-03 01:09:07,214 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 01:09:07" (1/1) ... [2020-12-03 01:09:07,239 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-12-03 01:09:07,240 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-12-03 01:09:07,240 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-12-03 01:09:07,240 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-12-03 01:09:07,249 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 01:09:07" (1/1) ... [2020-12-03 01:09:07,250 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 01:09:07" (1/1) ... [2020-12-03 01:09:07,254 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 01:09:07" (1/1) ... [2020-12-03 01:09:07,255 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 01:09:07" (1/1) ... [2020-12-03 01:09:07,264 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 01:09:07" (1/1) ... [2020-12-03 01:09:07,269 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 01:09:07" (1/1) ... [2020-12-03 01:09:07,272 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 01:09:07" (1/1) ... [2020-12-03 01:09:07,277 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-12-03 01:09:07,278 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-12-03 01:09:07,278 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-12-03 01:09:07,278 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-12-03 01:09:07,279 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 01:09:07" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-12-03 01:09:07,394 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8 [2020-12-03 01:09:07,395 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2020-12-03 01:09:07,395 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-12-03 01:09:07,395 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2020-12-03 01:09:07,396 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-12-03 01:09:07,396 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-12-03 01:09:07,396 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-12-03 01:09:07,788 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-12-03 01:09:07,788 INFO L299 CfgBuilder]: Removed 16 assume(true) statements. [2020-12-03 01:09:07,791 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 01:09:07 BoogieIcfgContainer [2020-12-03 01:09:07,791 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-12-03 01:09:07,793 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-12-03 01:09:07,793 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-12-03 01:09:07,798 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-12-03 01:09:07,801 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.12 01:09:06" (1/3) ... [2020-12-03 01:09:07,802 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4a6f0610 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.12 01:09:07, skipping insertion in model container [2020-12-03 01:09:07,803 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 01:09:07" (2/3) ... [2020-12-03 01:09:07,803 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4a6f0610 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.12 01:09:07, skipping insertion in model container [2020-12-03 01:09:07,803 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 01:09:07" (3/3) ... [2020-12-03 01:09:07,805 INFO L111 eAbstractionObserver]: Analyzing ICFG double_req_bl_1251b.c [2020-12-03 01:09:07,844 INFO L180 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-12-03 01:09:07,854 INFO L192 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-12-03 01:09:07,886 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-12-03 01:09:07,953 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-12-03 01:09:07,953 INFO L378 AbstractCegarLoop]: Hoare is true [2020-12-03 01:09:07,954 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-12-03 01:09:07,954 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-12-03 01:09:07,954 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-12-03 01:09:07,954 INFO L382 AbstractCegarLoop]: Difference is false [2020-12-03 01:09:07,954 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-12-03 01:09:07,957 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-12-03 01:09:07,986 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states. [2020-12-03 01:09:07,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-12-03 01:09:07,996 INFO L414 BasicCegarLoop]: Found error trace [2020-12-03 01:09:07,997 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-03 01:09:07,998 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-03 01:09:08,005 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-03 01:09:08,006 INFO L82 PathProgramCache]: Analyzing trace with hash -124750094, now seen corresponding path program 1 times [2020-12-03 01:09:08,021 INFO L162 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-12-03 01:09:08,022 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [742865855] [2020-12-03 01:09:08,022 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 2 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with mathsat -unsat_core_generation=3 [2020-12-03 01:09:08,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-03 01:09:08,177 INFO L263 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 1 conjunts are in the unsatisfiable core [2020-12-03 01:09:08,185 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-03 01:09:08,235 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-03 01:09:08,235 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-12-03 01:09:08,237 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [742865855] [2020-12-03 01:09:08,238 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-03 01:09:08,238 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-12-03 01:09:08,239 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1507612161] [2020-12-03 01:09:08,249 INFO L461 AbstractCegarLoop]: Interpolant automaton has 2 states [2020-12-03 01:09:08,250 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-12-03 01:09:08,272 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2020-12-03 01:09:08,273 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-12-03 01:09:08,276 INFO L87 Difference]: Start difference. First operand 30 states. Second operand 2 states. [2020-12-03 01:09:08,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-03 01:09:08,319 INFO L93 Difference]: Finished difference Result 56 states and 87 transitions. [2020-12-03 01:09:08,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2020-12-03 01:09:08,322 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 11 [2020-12-03 01:09:08,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-03 01:09:08,333 INFO L225 Difference]: With dead ends: 56 [2020-12-03 01:09:08,334 INFO L226 Difference]: Without dead ends: 26 [2020-12-03 01:09:08,339 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-12-03 01:09:08,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2020-12-03 01:09:08,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2020-12-03 01:09:08,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2020-12-03 01:09:08,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 36 transitions. [2020-12-03 01:09:08,389 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 36 transitions. Word has length 11 [2020-12-03 01:09:08,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-03 01:09:08,390 INFO L481 AbstractCegarLoop]: Abstraction has 26 states and 36 transitions. [2020-12-03 01:09:08,391 INFO L482 AbstractCegarLoop]: Interpolant automaton has 2 states. [2020-12-03 01:09:08,391 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 36 transitions. [2020-12-03 01:09:08,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-12-03 01:09:08,392 INFO L414 BasicCegarLoop]: Found error trace [2020-12-03 01:09:08,392 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-03 01:09:08,607 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 mathsat -unsat_core_generation=3 [2020-12-03 01:09:08,607 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-03 01:09:08,612 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-03 01:09:08,613 INFO L82 PathProgramCache]: Analyzing trace with hash -1352831344, now seen corresponding path program 1 times [2020-12-03 01:09:08,617 INFO L162 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-12-03 01:09:08,617 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1452073240] [2020-12-03 01:09:08,618 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 3 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with mathsat -unsat_core_generation=3 [2020-12-03 01:09:08,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-03 01:09:08,714 INFO L263 TraceCheckSpWp]: Trace formula consists of 53 conjuncts, 3 conjunts are in the unsatisfiable core [2020-12-03 01:09:08,716 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-03 01:09:08,760 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-03 01:09:08,760 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-12-03 01:09:08,760 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1452073240] [2020-12-03 01:09:08,761 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-03 01:09:08,761 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-03 01:09:08,761 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1156337771] [2020-12-03 01:09:08,763 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-03 01:09:08,763 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-12-03 01:09:08,764 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-03 01:09:08,765 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-03 01:09:08,765 INFO L87 Difference]: Start difference. First operand 26 states and 36 transitions. Second operand 4 states. [2020-12-03 01:09:08,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-03 01:09:08,838 INFO L93 Difference]: Finished difference Result 40 states and 51 transitions. [2020-12-03 01:09:08,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-03 01:09:08,838 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2020-12-03 01:09:08,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-03 01:09:08,840 INFO L225 Difference]: With dead ends: 40 [2020-12-03 01:09:08,840 INFO L226 Difference]: Without dead ends: 36 [2020-12-03 01:09:08,841 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-03 01:09:08,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2020-12-03 01:09:08,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 28. [2020-12-03 01:09:08,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2020-12-03 01:09:08,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 38 transitions. [2020-12-03 01:09:08,849 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 38 transitions. Word has length 12 [2020-12-03 01:09:08,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-03 01:09:08,849 INFO L481 AbstractCegarLoop]: Abstraction has 28 states and 38 transitions. [2020-12-03 01:09:08,850 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-03 01:09:08,850 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 38 transitions. [2020-12-03 01:09:08,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-12-03 01:09:08,851 INFO L414 BasicCegarLoop]: Found error trace [2020-12-03 01:09:08,851 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-03 01:09:09,064 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 mathsat -unsat_core_generation=3 [2020-12-03 01:09:09,065 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-03 01:09:09,066 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-03 01:09:09,067 INFO L82 PathProgramCache]: Analyzing trace with hash -1913129681, now seen corresponding path program 1 times [2020-12-03 01:09:09,068 INFO L162 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-12-03 01:09:09,068 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [414234182] [2020-12-03 01:09:09,068 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 4 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with mathsat -unsat_core_generation=3 [2020-12-03 01:09:09,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-03 01:09:09,184 INFO L263 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 3 conjunts are in the unsatisfiable core [2020-12-03 01:09:09,186 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-03 01:09:09,209 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-03 01:09:09,209 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-12-03 01:09:09,210 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [414234182] [2020-12-03 01:09:09,210 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-03 01:09:09,210 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-03 01:09:09,210 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [61525316] [2020-12-03 01:09:09,211 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-03 01:09:09,211 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-12-03 01:09:09,212 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-03 01:09:09,212 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-03 01:09:09,213 INFO L87 Difference]: Start difference. First operand 28 states and 38 transitions. Second operand 4 states. [2020-12-03 01:09:09,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-03 01:09:09,362 INFO L93 Difference]: Finished difference Result 42 states and 53 transitions. [2020-12-03 01:09:09,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-03 01:09:09,362 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2020-12-03 01:09:09,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-03 01:09:09,363 INFO L225 Difference]: With dead ends: 42 [2020-12-03 01:09:09,364 INFO L226 Difference]: Without dead ends: 38 [2020-12-03 01:09:09,364 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-03 01:09:09,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2020-12-03 01:09:09,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 28. [2020-12-03 01:09:09,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2020-12-03 01:09:09,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 38 transitions. [2020-12-03 01:09:09,370 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 38 transitions. Word has length 13 [2020-12-03 01:09:09,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-03 01:09:09,370 INFO L481 AbstractCegarLoop]: Abstraction has 28 states and 38 transitions. [2020-12-03 01:09:09,370 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-03 01:09:09,370 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 38 transitions. [2020-12-03 01:09:09,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-12-03 01:09:09,371 INFO L414 BasicCegarLoop]: Found error trace [2020-12-03 01:09:09,371 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-03 01:09:09,587 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 mathsat -unsat_core_generation=3 [2020-12-03 01:09:09,589 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-03 01:09:09,590 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-03 01:09:09,590 INFO L82 PathProgramCache]: Analyzing trace with hash -1959363189, now seen corresponding path program 1 times [2020-12-03 01:09:09,591 INFO L162 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-12-03 01:09:09,591 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1337542394] [2020-12-03 01:09:09,592 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 5 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with mathsat -unsat_core_generation=3 [2020-12-03 01:09:09,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-03 01:09:09,690 INFO L263 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 3 conjunts are in the unsatisfiable core [2020-12-03 01:09:09,691 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-03 01:09:09,714 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-03 01:09:09,714 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-12-03 01:09:09,715 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1337542394] [2020-12-03 01:09:09,715 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-03 01:09:09,715 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-03 01:09:09,715 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1055490947] [2020-12-03 01:09:09,716 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-03 01:09:09,716 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-12-03 01:09:09,717 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-03 01:09:09,717 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-03 01:09:09,717 INFO L87 Difference]: Start difference. First operand 28 states and 38 transitions. Second operand 4 states. [2020-12-03 01:09:09,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-03 01:09:09,776 INFO L93 Difference]: Finished difference Result 42 states and 53 transitions. [2020-12-03 01:09:09,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-03 01:09:09,776 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2020-12-03 01:09:09,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-03 01:09:09,777 INFO L225 Difference]: With dead ends: 42 [2020-12-03 01:09:09,778 INFO L226 Difference]: Without dead ends: 38 [2020-12-03 01:09:09,778 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-03 01:09:09,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2020-12-03 01:09:09,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 28. [2020-12-03 01:09:09,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2020-12-03 01:09:09,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 38 transitions. [2020-12-03 01:09:09,794 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 38 transitions. Word has length 14 [2020-12-03 01:09:09,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-03 01:09:09,794 INFO L481 AbstractCegarLoop]: Abstraction has 28 states and 38 transitions. [2020-12-03 01:09:09,794 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-03 01:09:09,794 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 38 transitions. [2020-12-03 01:09:09,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-12-03 01:09:09,795 INFO L414 BasicCegarLoop]: Found error trace [2020-12-03 01:09:09,795 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-03 01:09:10,010 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 mathsat -unsat_core_generation=3 [2020-12-03 01:09:10,010 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-03 01:09:10,011 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-03 01:09:10,011 INFO L82 PathProgramCache]: Analyzing trace with hash 1045511114, now seen corresponding path program 1 times [2020-12-03 01:09:10,011 INFO L162 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-12-03 01:09:10,012 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1810061123] [2020-12-03 01:09:10,012 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 6 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with mathsat -unsat_core_generation=3 [2020-12-03 01:09:10,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-03 01:09:10,111 INFO L263 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 3 conjunts are in the unsatisfiable core [2020-12-03 01:09:10,113 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-03 01:09:10,135 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-03 01:09:10,136 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-12-03 01:09:10,136 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1810061123] [2020-12-03 01:09:10,136 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-03 01:09:10,136 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-03 01:09:10,137 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1545242300] [2020-12-03 01:09:10,137 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-03 01:09:10,137 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-12-03 01:09:10,138 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-03 01:09:10,139 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-03 01:09:10,139 INFO L87 Difference]: Start difference. First operand 28 states and 38 transitions. Second operand 4 states. [2020-12-03 01:09:10,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-03 01:09:10,569 INFO L93 Difference]: Finished difference Result 42 states and 53 transitions. [2020-12-03 01:09:10,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-03 01:09:10,570 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2020-12-03 01:09:10,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-03 01:09:10,571 INFO L225 Difference]: With dead ends: 42 [2020-12-03 01:09:10,571 INFO L226 Difference]: Without dead ends: 38 [2020-12-03 01:09:10,571 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-03 01:09:10,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2020-12-03 01:09:10,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 28. [2020-12-03 01:09:10,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2020-12-03 01:09:10,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 38 transitions. [2020-12-03 01:09:10,577 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 38 transitions. Word has length 15 [2020-12-03 01:09:10,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-03 01:09:10,578 INFO L481 AbstractCegarLoop]: Abstraction has 28 states and 38 transitions. [2020-12-03 01:09:10,578 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-03 01:09:10,578 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 38 transitions. [2020-12-03 01:09:10,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-12-03 01:09:10,579 INFO L414 BasicCegarLoop]: Found error trace [2020-12-03 01:09:10,579 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-03 01:09:10,779 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 mathsat -unsat_core_generation=3 [2020-12-03 01:09:10,780 INFO L429 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-03 01:09:10,781 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-03 01:09:10,782 INFO L82 PathProgramCache]: Analyzing trace with hash 1102769416, now seen corresponding path program 1 times [2020-12-03 01:09:10,783 INFO L162 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-12-03 01:09:10,783 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [204268856] [2020-12-03 01:09:10,784 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 7 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with mathsat -unsat_core_generation=3 [2020-12-03 01:09:10,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-03 01:09:10,881 INFO L263 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 19 conjunts are in the unsatisfiable core [2020-12-03 01:09:10,884 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-03 01:09:11,060 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 13 [2020-12-03 01:09:11,068 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-03 01:09:11,071 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-03 01:09:11,072 INFO L547 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-12-03 01:09:11,082 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-03 01:09:11,084 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-12-03 01:09:11,084 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:35, output treesize:24 [2020-12-03 01:09:13,116 WARN L860 $PredicateComparison]: unable to prove that (exists ((|v_skolemized_q#valueAsBitvector_5| (_ BitVec 64))) (and (let ((.cse0 (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_5|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_5|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_5|)))) (fp.eq .cse0 .cse0)) (= ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_5|) c_ULTIMATE.start___fpclassify_double_~msw~0) (= ((_ extract 31 0) |v_skolemized_q#valueAsBitvector_5|) c_ULTIMATE.start___fpclassify_double_~lsw~0))) is different from true [2020-12-03 01:09:21,386 WARN L197 SmtUtils]: Spent 8.18 s on a formula simplification. DAG size of input: 31 DAG size of output: 30 [2020-12-03 01:09:23,790 WARN L197 SmtUtils]: Spent 2.32 s on a formula simplification. DAG size of input: 66 DAG size of output: 38 [2020-12-03 01:09:23,814 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-03 01:09:23,814 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-12-03 01:09:23,815 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [204268856] [2020-12-03 01:09:23,815 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-03 01:09:23,815 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-12-03 01:09:23,816 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1930525174] [2020-12-03 01:09:23,816 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-12-03 01:09:23,816 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-12-03 01:09:23,817 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-12-03 01:09:23,817 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=31, Unknown=1, NotChecked=10, Total=56 [2020-12-03 01:09:23,818 INFO L87 Difference]: Start difference. First operand 28 states and 38 transitions. Second operand 8 states. [2020-12-03 01:09:28,113 WARN L197 SmtUtils]: Spent 2.05 s on a formula simplification that was a NOOP. DAG size: 28 [2020-12-03 01:09:32,267 WARN L197 SmtUtils]: Spent 4.12 s on a formula simplification that was a NOOP. DAG size: 44 [2020-12-03 01:09:37,748 WARN L197 SmtUtils]: Spent 4.10 s on a formula simplification that was a NOOP. DAG size: 42 [2020-12-03 01:09:39,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-03 01:09:39,946 INFO L93 Difference]: Finished difference Result 62 states and 79 transitions. [2020-12-03 01:09:39,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-12-03 01:09:39,947 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 15 [2020-12-03 01:09:39,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-03 01:09:39,948 INFO L225 Difference]: With dead ends: 62 [2020-12-03 01:09:39,948 INFO L226 Difference]: Without dead ends: 46 [2020-12-03 01:09:39,949 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 25.2s TimeCoverageRelationStatistics Valid=56, Invalid=128, Unknown=2, NotChecked=24, Total=210 [2020-12-03 01:09:39,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2020-12-03 01:09:39,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 26. [2020-12-03 01:09:39,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2020-12-03 01:09:39,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 34 transitions. [2020-12-03 01:09:39,956 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 34 transitions. Word has length 15 [2020-12-03 01:09:39,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-03 01:09:39,957 INFO L481 AbstractCegarLoop]: Abstraction has 26 states and 34 transitions. [2020-12-03 01:09:39,957 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-12-03 01:09:39,957 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 34 transitions. [2020-12-03 01:09:39,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-12-03 01:09:39,958 INFO L414 BasicCegarLoop]: Found error trace [2020-12-03 01:09:39,958 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-03 01:09:40,174 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 mathsat -unsat_core_generation=3 [2020-12-03 01:09:40,175 INFO L429 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-03 01:09:40,175 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-03 01:09:40,176 INFO L82 PathProgramCache]: Analyzing trace with hash 1042649172, now seen corresponding path program 1 times [2020-12-03 01:09:40,176 INFO L162 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-12-03 01:09:40,177 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1486468631] [2020-12-03 01:09:40,177 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 8 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with mathsat -unsat_core_generation=3 [2020-12-03 01:09:40,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-03 01:09:40,290 INFO L263 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 3 conjunts are in the unsatisfiable core [2020-12-03 01:09:40,291 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-03 01:09:40,320 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-03 01:09:40,320 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-12-03 01:09:40,321 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1486468631] [2020-12-03 01:09:40,322 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-03 01:09:40,322 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-03 01:09:40,322 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [911040951] [2020-12-03 01:09:40,322 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-03 01:09:40,325 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-12-03 01:09:40,326 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-03 01:09:40,327 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-03 01:09:40,327 INFO L87 Difference]: Start difference. First operand 26 states and 34 transitions. Second operand 4 states. [2020-12-03 01:09:40,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-03 01:09:40,425 INFO L93 Difference]: Finished difference Result 40 states and 48 transitions. [2020-12-03 01:09:40,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-03 01:09:40,426 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 17 [2020-12-03 01:09:40,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-03 01:09:40,427 INFO L225 Difference]: With dead ends: 40 [2020-12-03 01:09:40,427 INFO L226 Difference]: Without dead ends: 36 [2020-12-03 01:09:40,428 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-03 01:09:40,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2020-12-03 01:09:40,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 28. [2020-12-03 01:09:40,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2020-12-03 01:09:40,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 36 transitions. [2020-12-03 01:09:40,435 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 36 transitions. Word has length 17 [2020-12-03 01:09:40,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-03 01:09:40,436 INFO L481 AbstractCegarLoop]: Abstraction has 28 states and 36 transitions. [2020-12-03 01:09:40,436 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-03 01:09:40,436 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 36 transitions. [2020-12-03 01:09:40,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-12-03 01:09:40,437 INFO L414 BasicCegarLoop]: Found error trace [2020-12-03 01:09:40,437 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-03 01:09:40,650 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 mathsat -unsat_core_generation=3 [2020-12-03 01:09:40,651 INFO L429 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-03 01:09:40,652 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-03 01:09:40,652 INFO L82 PathProgramCache]: Analyzing trace with hash -666515868, now seen corresponding path program 1 times [2020-12-03 01:09:40,653 INFO L162 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-12-03 01:09:40,653 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [805159402] [2020-12-03 01:09:40,653 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 9 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with mathsat -unsat_core_generation=3 [2020-12-03 01:09:40,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-03 01:09:40,752 INFO L263 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 3 conjunts are in the unsatisfiable core [2020-12-03 01:09:40,753 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-03 01:09:40,783 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-03 01:09:40,783 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-12-03 01:09:40,784 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [805159402] [2020-12-03 01:09:40,784 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-03 01:09:40,784 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-03 01:09:40,785 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [635854739] [2020-12-03 01:09:40,785 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-03 01:09:40,785 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-12-03 01:09:40,786 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-03 01:09:40,786 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-03 01:09:40,786 INFO L87 Difference]: Start difference. First operand 28 states and 36 transitions. Second operand 4 states. [2020-12-03 01:09:41,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-03 01:09:41,004 INFO L93 Difference]: Finished difference Result 42 states and 50 transitions. [2020-12-03 01:09:41,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-03 01:09:41,006 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 18 [2020-12-03 01:09:41,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-03 01:09:41,007 INFO L225 Difference]: With dead ends: 42 [2020-12-03 01:09:41,007 INFO L226 Difference]: Without dead ends: 38 [2020-12-03 01:09:41,008 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-03 01:09:41,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2020-12-03 01:09:41,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 28. [2020-12-03 01:09:41,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2020-12-03 01:09:41,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 36 transitions. [2020-12-03 01:09:41,014 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 36 transitions. Word has length 18 [2020-12-03 01:09:41,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-03 01:09:41,015 INFO L481 AbstractCegarLoop]: Abstraction has 28 states and 36 transitions. [2020-12-03 01:09:41,015 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-03 01:09:41,015 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 36 transitions. [2020-12-03 01:09:41,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-12-03 01:09:41,016 INFO L414 BasicCegarLoop]: Found error trace [2020-12-03 01:09:41,016 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-03 01:09:41,228 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 mathsat -unsat_core_generation=3 [2020-12-03 01:09:41,229 INFO L429 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-03 01:09:41,230 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-03 01:09:41,230 INFO L82 PathProgramCache]: Analyzing trace with hash 1310041806, now seen corresponding path program 1 times [2020-12-03 01:09:41,231 INFO L162 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-12-03 01:09:41,231 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [534813862] [2020-12-03 01:09:41,231 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 10 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with mathsat -unsat_core_generation=3 [2020-12-03 01:09:41,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-03 01:09:41,353 INFO L263 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 4 conjunts are in the unsatisfiable core [2020-12-03 01:09:41,354 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-03 01:09:41,445 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-03 01:09:41,445 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-12-03 01:09:41,445 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [534813862] [2020-12-03 01:09:41,446 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-03 01:09:41,446 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-03 01:09:41,446 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1129417694] [2020-12-03 01:09:41,446 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-03 01:09:41,447 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-12-03 01:09:41,447 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-03 01:09:41,447 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-03 01:09:41,447 INFO L87 Difference]: Start difference. First operand 28 states and 36 transitions. Second operand 4 states. [2020-12-03 01:09:41,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-03 01:09:41,596 INFO L93 Difference]: Finished difference Result 33 states and 40 transitions. [2020-12-03 01:09:41,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-03 01:09:41,601 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 19 [2020-12-03 01:09:41,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-03 01:09:41,603 INFO L225 Difference]: With dead ends: 33 [2020-12-03 01:09:41,604 INFO L226 Difference]: Without dead ends: 28 [2020-12-03 01:09:41,604 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-03 01:09:41,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2020-12-03 01:09:41,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2020-12-03 01:09:41,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2020-12-03 01:09:41,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 35 transitions. [2020-12-03 01:09:41,613 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 35 transitions. Word has length 19 [2020-12-03 01:09:41,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-03 01:09:41,614 INFO L481 AbstractCegarLoop]: Abstraction has 28 states and 35 transitions. [2020-12-03 01:09:41,614 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-03 01:09:41,614 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 35 transitions. [2020-12-03 01:09:41,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-12-03 01:09:41,615 INFO L414 BasicCegarLoop]: Found error trace [2020-12-03 01:09:41,615 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-03 01:09:41,830 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 mathsat -unsat_core_generation=3 [2020-12-03 01:09:41,830 INFO L429 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-03 01:09:41,831 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-03 01:09:41,831 INFO L82 PathProgramCache]: Analyzing trace with hash 1311888848, now seen corresponding path program 1 times [2020-12-03 01:09:41,831 INFO L162 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-12-03 01:09:41,832 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [800603380] [2020-12-03 01:09:41,832 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 11 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with mathsat -unsat_core_generation=3 [2020-12-03 01:09:41,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-03 01:09:41,937 INFO L263 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 9 conjunts are in the unsatisfiable core [2020-12-03 01:09:41,938 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-03 01:09:42,128 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-03 01:09:42,129 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-12-03 01:09:42,129 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [800603380] [2020-12-03 01:09:42,129 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-03 01:09:42,129 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-12-03 01:09:42,129 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1159527043] [2020-12-03 01:09:42,130 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-12-03 01:09:42,130 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-12-03 01:09:42,130 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-12-03 01:09:42,131 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-12-03 01:09:42,131 INFO L87 Difference]: Start difference. First operand 28 states and 35 transitions. Second operand 6 states. [2020-12-03 01:09:44,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-03 01:09:44,746 INFO L93 Difference]: Finished difference Result 38 states and 45 transitions. [2020-12-03 01:09:44,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-12-03 01:09:44,747 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2020-12-03 01:09:44,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-03 01:09:44,748 INFO L225 Difference]: With dead ends: 38 [2020-12-03 01:09:44,748 INFO L226 Difference]: Without dead ends: 28 [2020-12-03 01:09:44,748 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2020-12-03 01:09:44,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2020-12-03 01:09:44,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 26. [2020-12-03 01:09:44,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2020-12-03 01:09:44,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 30 transitions. [2020-12-03 01:09:44,754 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 30 transitions. Word has length 19 [2020-12-03 01:09:44,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-03 01:09:44,754 INFO L481 AbstractCegarLoop]: Abstraction has 26 states and 30 transitions. [2020-12-03 01:09:44,754 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-12-03 01:09:44,754 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 30 transitions. [2020-12-03 01:09:44,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-12-03 01:09:44,755 INFO L414 BasicCegarLoop]: Found error trace [2020-12-03 01:09:44,755 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-03 01:09:44,964 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 mathsat -unsat_core_generation=3 [2020-12-03 01:09:44,965 INFO L429 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-03 01:09:44,965 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-03 01:09:44,966 INFO L82 PathProgramCache]: Analyzing trace with hash 782688991, now seen corresponding path program 1 times [2020-12-03 01:09:44,966 INFO L162 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-12-03 01:09:44,967 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [317809425] [2020-12-03 01:09:44,967 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 12 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with mathsat -unsat_core_generation=3 [2020-12-03 01:09:45,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-03 01:09:45,056 INFO L263 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 3 conjunts are in the unsatisfiable core [2020-12-03 01:09:45,057 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-03 01:09:45,089 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-03 01:09:45,089 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-12-03 01:09:45,089 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [317809425] [2020-12-03 01:09:45,090 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-03 01:09:45,090 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-03 01:09:45,090 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2140335181] [2020-12-03 01:09:45,091 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-03 01:09:45,091 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-12-03 01:09:45,092 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-03 01:09:45,092 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-03 01:09:45,092 INFO L87 Difference]: Start difference. First operand 26 states and 30 transitions. Second operand 4 states. [2020-12-03 01:09:45,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-03 01:09:45,147 INFO L93 Difference]: Finished difference Result 40 states and 43 transitions. [2020-12-03 01:09:45,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-03 01:09:45,148 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 20 [2020-12-03 01:09:45,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-03 01:09:45,149 INFO L225 Difference]: With dead ends: 40 [2020-12-03 01:09:45,149 INFO L226 Difference]: Without dead ends: 36 [2020-12-03 01:09:45,149 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-03 01:09:45,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2020-12-03 01:09:45,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 28. [2020-12-03 01:09:45,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2020-12-03 01:09:45,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 32 transitions. [2020-12-03 01:09:45,161 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 32 transitions. Word has length 20 [2020-12-03 01:09:45,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-03 01:09:45,161 INFO L481 AbstractCegarLoop]: Abstraction has 28 states and 32 transitions. [2020-12-03 01:09:45,161 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-03 01:09:45,161 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 32 transitions. [2020-12-03 01:09:45,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-12-03 01:09:45,162 INFO L414 BasicCegarLoop]: Found error trace [2020-12-03 01:09:45,162 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-03 01:09:45,378 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 mathsat -unsat_core_generation=3 [2020-12-03 01:09:45,379 INFO L429 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-03 01:09:45,380 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-03 01:09:45,380 INFO L82 PathProgramCache]: Analyzing trace with hash 839947293, now seen corresponding path program 1 times [2020-12-03 01:09:45,381 INFO L162 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-12-03 01:09:45,381 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1484727617] [2020-12-03 01:09:45,381 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 13 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with mathsat -unsat_core_generation=3 [2020-12-03 01:09:45,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-03 01:09:45,494 INFO L263 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 11 conjunts are in the unsatisfiable core [2020-12-03 01:09:45,496 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-03 01:09:45,599 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-03 01:09:46,223 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-03 01:09:46,223 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-12-03 01:09:46,224 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1484727617] [2020-12-03 01:09:46,224 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-03 01:09:46,224 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-12-03 01:09:46,224 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1262127240] [2020-12-03 01:09:46,224 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-12-03 01:09:46,224 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-12-03 01:09:46,225 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-12-03 01:09:46,225 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2020-12-03 01:09:46,225 INFO L87 Difference]: Start difference. First operand 28 states and 32 transitions. Second operand 7 states. [2020-12-03 01:09:47,421 WARN L197 SmtUtils]: Spent 1.05 s on a formula simplification. DAG size of input: 29 DAG size of output: 27 [2020-12-03 01:09:47,901 WARN L197 SmtUtils]: Spent 236.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 32 [2020-12-03 01:09:48,698 WARN L197 SmtUtils]: Spent 746.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 34 [2020-12-03 01:09:48,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-03 01:09:48,867 INFO L93 Difference]: Finished difference Result 50 states and 54 transitions. [2020-12-03 01:09:48,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-12-03 01:09:48,867 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 20 [2020-12-03 01:09:48,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-03 01:09:48,868 INFO L225 Difference]: With dead ends: 50 [2020-12-03 01:09:48,868 INFO L226 Difference]: Without dead ends: 46 [2020-12-03 01:09:48,868 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 5 SyntacticMatches, 9 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2020-12-03 01:09:48,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2020-12-03 01:09:48,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 36. [2020-12-03 01:09:48,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2020-12-03 01:09:48,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 41 transitions. [2020-12-03 01:09:48,876 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 41 transitions. Word has length 20 [2020-12-03 01:09:48,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-03 01:09:48,876 INFO L481 AbstractCegarLoop]: Abstraction has 36 states and 41 transitions. [2020-12-03 01:09:48,876 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-12-03 01:09:48,876 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 41 transitions. [2020-12-03 01:09:48,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-12-03 01:09:48,877 INFO L414 BasicCegarLoop]: Found error trace [2020-12-03 01:09:48,877 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-03 01:09:49,090 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 mathsat -unsat_core_generation=3 [2020-12-03 01:09:49,091 INFO L429 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-03 01:09:49,091 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-03 01:09:49,092 INFO L82 PathProgramCache]: Analyzing trace with hash -1085928516, now seen corresponding path program 1 times [2020-12-03 01:09:49,092 INFO L162 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-12-03 01:09:49,093 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1480836524] [2020-12-03 01:09:49,093 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 14 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with mathsat -unsat_core_generation=3 [2020-12-03 01:09:49,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-03 01:09:49,193 INFO L263 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 10 conjunts are in the unsatisfiable core [2020-12-03 01:09:49,194 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-03 01:09:49,404 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-03 01:09:49,405 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-12-03 01:09:49,405 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1480836524] [2020-12-03 01:09:49,405 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-03 01:09:49,405 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-12-03 01:09:49,406 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1703020120] [2020-12-03 01:09:49,406 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-12-03 01:09:49,406 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-12-03 01:09:49,407 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-12-03 01:09:49,407 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2020-12-03 01:09:49,407 INFO L87 Difference]: Start difference. First operand 36 states and 41 transitions. Second operand 7 states. [2020-12-03 01:09:49,619 WARN L197 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 14 DAG size of output: 8 [2020-12-03 01:09:49,772 WARN L197 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 16 DAG size of output: 10 [2020-12-03 01:09:49,903 WARN L197 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 18 DAG size of output: 12 [2020-12-03 01:09:49,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-03 01:09:49,914 INFO L93 Difference]: Finished difference Result 40 states and 44 transitions. [2020-12-03 01:09:49,914 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-12-03 01:09:49,914 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 21 [2020-12-03 01:09:49,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-03 01:09:49,915 INFO L225 Difference]: With dead ends: 40 [2020-12-03 01:09:49,915 INFO L226 Difference]: Without dead ends: 36 [2020-12-03 01:09:49,915 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2020-12-03 01:09:49,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2020-12-03 01:09:49,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 26. [2020-12-03 01:09:49,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2020-12-03 01:09:49,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 29 transitions. [2020-12-03 01:09:49,925 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 29 transitions. Word has length 21 [2020-12-03 01:09:49,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-03 01:09:49,925 INFO L481 AbstractCegarLoop]: Abstraction has 26 states and 29 transitions. [2020-12-03 01:09:49,925 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-12-03 01:09:49,925 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 29 transitions. [2020-12-03 01:09:49,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-12-03 01:09:49,932 INFO L414 BasicCegarLoop]: Found error trace [2020-12-03 01:09:49,932 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-03 01:09:50,147 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 mathsat -unsat_core_generation=3 [2020-12-03 01:09:50,148 INFO L429 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-03 01:09:50,148 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-03 01:09:50,149 INFO L82 PathProgramCache]: Analyzing trace with hash 598258075, now seen corresponding path program 1 times [2020-12-03 01:09:50,149 INFO L162 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-12-03 01:09:50,150 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [986801673] [2020-12-03 01:09:50,150 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 15 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with mathsat -unsat_core_generation=3 [2020-12-03 01:09:50,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-03 01:09:50,251 INFO L263 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 10 conjunts are in the unsatisfiable core [2020-12-03 01:09:50,253 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-03 01:09:50,363 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 13 [2020-12-03 01:09:50,375 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-03 01:09:50,378 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-03 01:09:50,378 INFO L547 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-12-03 01:09:50,408 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-03 01:09:50,410 INFO L547 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-12-03 01:09:50,410 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:32, output treesize:21 [2020-12-03 01:09:50,511 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-03 01:09:50,512 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-12-03 01:09:50,512 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [986801673] [2020-12-03 01:09:50,515 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-03 01:09:50,515 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-12-03 01:09:50,516 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [548313238] [2020-12-03 01:09:50,516 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-12-03 01:09:50,516 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-12-03 01:09:50,517 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-12-03 01:09:50,517 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-12-03 01:09:50,517 INFO L87 Difference]: Start difference. First operand 26 states and 29 transitions. Second operand 6 states. [2020-12-03 01:09:53,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-03 01:09:53,109 INFO L93 Difference]: Finished difference Result 34 states and 36 transitions. [2020-12-03 01:09:53,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-12-03 01:09:53,111 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2020-12-03 01:09:53,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-03 01:09:53,115 INFO L225 Difference]: With dead ends: 34 [2020-12-03 01:09:53,115 INFO L226 Difference]: Without dead ends: 26 [2020-12-03 01:09:53,115 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2020-12-03 01:09:53,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2020-12-03 01:09:53,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2020-12-03 01:09:53,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2020-12-03 01:09:53,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 28 transitions. [2020-12-03 01:09:53,121 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 28 transitions. Word has length 22 [2020-12-03 01:09:53,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-03 01:09:53,121 INFO L481 AbstractCegarLoop]: Abstraction has 26 states and 28 transitions. [2020-12-03 01:09:53,122 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-12-03 01:09:53,122 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 28 transitions. [2020-12-03 01:09:53,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-12-03 01:09:53,122 INFO L414 BasicCegarLoop]: Found error trace [2020-12-03 01:09:53,122 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-03 01:09:53,328 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 mathsat -unsat_core_generation=3 [2020-12-03 01:09:53,328 INFO L429 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-03 01:09:53,329 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-03 01:09:53,329 INFO L82 PathProgramCache]: Analyzing trace with hash -211088551, now seen corresponding path program 1 times [2020-12-03 01:09:53,330 INFO L162 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-12-03 01:09:53,330 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [180233295] [2020-12-03 01:09:53,331 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 16 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with mathsat -unsat_core_generation=3 [2020-12-03 01:09:53,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-03 01:09:53,448 INFO L263 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 3 conjunts are in the unsatisfiable core [2020-12-03 01:09:53,449 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-03 01:09:53,480 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-03 01:09:53,481 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-12-03 01:09:53,481 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [180233295] [2020-12-03 01:09:53,481 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-03 01:09:53,481 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-03 01:09:53,481 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1009971318] [2020-12-03 01:09:53,483 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-03 01:09:53,483 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-12-03 01:09:53,484 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-03 01:09:53,485 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-03 01:09:53,485 INFO L87 Difference]: Start difference. First operand 26 states and 28 transitions. Second operand 4 states. [2020-12-03 01:09:53,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-03 01:09:53,530 INFO L93 Difference]: Finished difference Result 26 states and 28 transitions. [2020-12-03 01:09:53,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-03 01:09:53,530 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 22 [2020-12-03 01:09:53,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-03 01:09:53,531 INFO L225 Difference]: With dead ends: 26 [2020-12-03 01:09:53,531 INFO L226 Difference]: Without dead ends: 0 [2020-12-03 01:09:53,531 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-03 01:09:53,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-12-03 01:09:53,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-12-03 01:09:53,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-12-03 01:09:53,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-12-03 01:09:53,532 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 22 [2020-12-03 01:09:53,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-03 01:09:53,533 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-12-03 01:09:53,533 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-03 01:09:53,533 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-12-03 01:09:53,533 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-12-03 01:09:53,747 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 mathsat -unsat_core_generation=3 [2020-12-03 01:09:53,751 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-12-03 01:09:53,982 WARN L197 SmtUtils]: Spent 196.00 ms on a formula simplification. DAG size of input: 139 DAG size of output: 136 [2020-12-03 01:09:59,187 WARN L197 SmtUtils]: Spent 5.12 s on a formula simplification. DAG size of input: 136 DAG size of output: 34 [2020-12-03 01:09:59,430 WARN L197 SmtUtils]: Spent 212.00 ms on a formula simplification. DAG size of input: 20 DAG size of output: 19 [2020-12-03 01:09:59,785 WARN L197 SmtUtils]: Spent 353.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 36 [2020-12-03 01:10:00,513 WARN L197 SmtUtils]: Spent 658.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 42 [2020-12-03 01:10:00,516 INFO L262 CegarLoopResult]: For program point L31-1(lines 31 36) no Hoare annotation was computed. [2020-12-03 01:10:00,516 INFO L258 CegarLoopResult]: At program point L31-2(lines 31 36) the Hoare annotation is: (and (exists ((currentRoundingMode RoundingMode)) (= (fp.div currentRoundingMode (_ +zero 11 53) (_ +zero 11 53)) ULTIMATE.start_fmax_double_~y)) (= ULTIMATE.start___fpclassify_double_~x ULTIMATE.start_fmax_double_~x) (= ULTIMATE.start_main_~x~0 ULTIMATE.start_fmax_double_~x) (exists ((currentRoundingMode RoundingMode)) (= (fp.div currentRoundingMode (_ +zero 11 53) (_ +zero 11 53)) ULTIMATE.start_main_~y~0)) (fp.eq ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~x~0) (= (_ bv0 32) |ULTIMATE.start_isnan_double_#res|)) [2020-12-03 01:10:00,517 INFO L262 CegarLoopResult]: For program point L31-3(lines 28 53) no Hoare annotation was computed. [2020-12-03 01:10:00,517 INFO L262 CegarLoopResult]: For program point L31-5(lines 31 36) no Hoare annotation was computed. [2020-12-03 01:10:00,517 INFO L258 CegarLoopResult]: At program point L31-6(lines 31 36) the Hoare annotation is: (and (exists ((currentRoundingMode RoundingMode)) (= (fp.div currentRoundingMode (_ +zero 11 53) (_ +zero 11 53)) ULTIMATE.start_fmax_double_~y)) (= ULTIMATE.start_main_~x~0 ULTIMATE.start_fmax_double_~x) (exists ((currentRoundingMode RoundingMode)) (= (fp.div currentRoundingMode (_ +zero 11 53) (_ +zero 11 53)) ULTIMATE.start_main_~y~0)) (fp.eq ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~x~0) (= (_ bv0 32) |ULTIMATE.start_isnan_double_#res|) (exists ((currentRoundingMode RoundingMode)) (= (fp.div currentRoundingMode (_ +zero 11 53) (_ +zero 11 53)) ULTIMATE.start___fpclassify_double_~x))) [2020-12-03 01:10:00,517 INFO L262 CegarLoopResult]: For program point L31-7(lines 28 53) no Hoare annotation was computed. [2020-12-03 01:10:00,517 INFO L265 CegarLoopResult]: At program point L85(lines 65 86) the Hoare annotation is: true [2020-12-03 01:10:00,518 INFO L258 CegarLoopResult]: At program point L52(lines 28 53) the Hoare annotation is: (and (exists ((currentRoundingMode RoundingMode)) (= (fp.div currentRoundingMode (_ +zero 11 53) (_ +zero 11 53)) ULTIMATE.start_fmax_double_~y)) (= ULTIMATE.start___fpclassify_double_~x ULTIMATE.start_fmax_double_~x) (= ULTIMATE.start_main_~x~0 ULTIMATE.start_fmax_double_~x) (exists ((currentRoundingMode RoundingMode)) (= (fp.div currentRoundingMode (_ +zero 11 53) (_ +zero 11 53)) ULTIMATE.start_main_~y~0)) (fp.eq ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~x~0) (or (= (_ bv3 32) |ULTIMATE.start___fpclassify_double_#res|) (= (_ bv1 32) |ULTIMATE.start___fpclassify_double_#res|) (= (_ bv2 32) |ULTIMATE.start___fpclassify_double_#res|) (= (_ bv4 32) |ULTIMATE.start___fpclassify_double_#res|)) (= (_ bv0 32) |ULTIMATE.start_isnan_double_#res|) (exists ((|v_skolemized_q#valueAsBitvector_7| (_ BitVec 64))) (and (= ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_7|) ULTIMATE.start___fpclassify_double_~msw~0) (= (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_7|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_7|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_7|)) ULTIMATE.start_fmax_double_~x)))) [2020-12-03 01:10:00,518 INFO L258 CegarLoopResult]: At program point L52-1(lines 28 53) the Hoare annotation is: (and (= (_ bv0 32) |ULTIMATE.start___fpclassify_double_#res|) (exists ((|v_skolemized_q#valueAsBitvector_8| (_ BitVec 64)) (currentRoundingMode RoundingMode)) (and (= ULTIMATE.start___fpclassify_double_~msw~0 ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_8|)) (= (fp.div currentRoundingMode (_ +zero 11 53) (_ +zero 11 53)) (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_8|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_8|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_8|))) (= ULTIMATE.start___fpclassify_double_~lsw~0 ((_ extract 31 0) |v_skolemized_q#valueAsBitvector_8|)))) (exists ((currentRoundingMode RoundingMode)) (= (fp.div currentRoundingMode (_ +zero 11 53) (_ +zero 11 53)) ULTIMATE.start_fmax_double_~y)) (= ULTIMATE.start_main_~x~0 ULTIMATE.start_fmax_double_~x) (exists ((currentRoundingMode RoundingMode)) (= (fp.div currentRoundingMode (_ +zero 11 53) (_ +zero 11 53)) ULTIMATE.start_main_~y~0)) (fp.eq ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~x~0) (= (_ bv0 32) |ULTIMATE.start_isnan_double_#res|) (exists ((currentRoundingMode RoundingMode)) (= (fp.div currentRoundingMode (_ +zero 11 53) (_ +zero 11 53)) ULTIMATE.start___fpclassify_double_~x))) [2020-12-03 01:10:00,518 INFO L262 CegarLoopResult]: For program point L48(lines 48 52) no Hoare annotation was computed. [2020-12-03 01:10:00,518 INFO L262 CegarLoopResult]: For program point L48-1(lines 48 52) no Hoare annotation was computed. [2020-12-03 01:10:00,518 INFO L262 CegarLoopResult]: For program point L44(lines 44 52) no Hoare annotation was computed. [2020-12-03 01:10:00,519 INFO L262 CegarLoopResult]: For program point L44-1(lines 44 52) no Hoare annotation was computed. [2020-12-03 01:10:00,519 INFO L262 CegarLoopResult]: For program point L-1(line -1) no Hoare annotation was computed. [2020-12-03 01:10:00,519 INFO L262 CegarLoopResult]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2020-12-03 01:10:00,519 INFO L262 CegarLoopResult]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2020-12-03 01:10:00,519 INFO L262 CegarLoopResult]: For program point L57(lines 57 58) no Hoare annotation was computed. [2020-12-03 01:10:00,519 INFO L262 CegarLoopResult]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 80) no Hoare annotation was computed. [2020-12-03 01:10:00,520 INFO L262 CegarLoopResult]: For program point L74(lines 74 83) no Hoare annotation was computed. [2020-12-03 01:10:00,520 INFO L262 CegarLoopResult]: For program point L41(lines 41 52) no Hoare annotation was computed. [2020-12-03 01:10:00,520 INFO L262 CegarLoopResult]: For program point L41-1(lines 41 52) no Hoare annotation was computed. [2020-12-03 01:10:00,520 INFO L262 CegarLoopResult]: For program point L74-2(lines 74 83) no Hoare annotation was computed. [2020-12-03 01:10:00,520 INFO L262 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2020-12-03 01:10:00,520 INFO L262 CegarLoopResult]: For program point L62(line 62) no Hoare annotation was computed. [2020-12-03 01:10:00,520 INFO L262 CegarLoopResult]: For program point L62-2(line 62) no Hoare annotation was computed. [2020-12-03 01:10:00,521 INFO L258 CegarLoopResult]: At program point L62-3(lines 55 63) the Hoare annotation is: (and (= ULTIMATE.start_main_~x~0 |ULTIMATE.start_fmax_double_#res|) (exists ((currentRoundingMode RoundingMode)) (= (fp.div currentRoundingMode (_ +zero 11 53) (_ +zero 11 53)) ULTIMATE.start_fmax_double_~y)) (= ULTIMATE.start_main_~x~0 ULTIMATE.start_fmax_double_~x) (exists ((|v_skolemized_q#valueAsBitvector_6| (_ BitVec 64)) (currentRoundingMode RoundingMode)) (and (= ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_6|) ULTIMATE.start___fpclassify_double_~msw~0) (= (fp.div currentRoundingMode (_ +zero 11 53) (_ +zero 11 53)) (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_6|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_6|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_6|))))) (exists ((currentRoundingMode RoundingMode)) (= (fp.div currentRoundingMode (_ +zero 11 53) (_ +zero 11 53)) ULTIMATE.start_main_~y~0)) (fp.eq ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~x~0) (= (_ bv0 32) |ULTIMATE.start_isnan_double_#res|) (exists ((currentRoundingMode RoundingMode)) (= (fp.div currentRoundingMode (_ +zero 11 53) (_ +zero 11 53)) ULTIMATE.start___fpclassify_double_~x))) [2020-12-03 01:10:00,521 INFO L262 CegarLoopResult]: For program point L79(lines 79 82) no Hoare annotation was computed. [2020-12-03 01:10:00,521 INFO L262 CegarLoopResult]: For program point L59(lines 59 60) no Hoare annotation was computed. [2020-12-03 01:10:00,521 INFO L258 CegarLoopResult]: At program point L18(line 18) the Hoare annotation is: (and (exists ((currentRoundingMode RoundingMode)) (= (fp.div currentRoundingMode (_ +zero 11 53) (_ +zero 11 53)) ULTIMATE.start_main_~y~0)) (let ((.cse0 (fp.eq ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~x~0))) (or (and .cse0 (= (_ bv0 32) |ULTIMATE.start_isnan_double_#res|)) (and (not .cse0) (= (_ bv1 32) |ULTIMATE.start_isnan_double_#res|))))) [2020-12-03 01:10:00,522 INFO L262 CegarLoopResult]: For program point L80(line 80) no Hoare annotation was computed. [2020-12-03 01:10:00,532 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2020-12-03 01:10:00,533 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_6,QUANTIFIED] [2020-12-03 01:10:00,533 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2020-12-03 01:10:00,534 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_6,QUANTIFIED] [2020-12-03 01:10:00,534 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_6,QUANTIFIED] [2020-12-03 01:10:00,534 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_6,QUANTIFIED] [2020-12-03 01:10:00,534 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2020-12-03 01:10:00,535 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2020-12-03 01:10:00,541 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2020-12-03 01:10:00,542 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_6,QUANTIFIED] [2020-12-03 01:10:00,542 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2020-12-03 01:10:00,542 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_6,QUANTIFIED] [2020-12-03 01:10:00,543 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_6,QUANTIFIED] [2020-12-03 01:10:00,543 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_6,QUANTIFIED] [2020-12-03 01:10:00,543 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2020-12-03 01:10:00,543 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2020-12-03 01:10:00,545 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2020-12-03 01:10:00,546 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2020-12-03 01:10:00,547 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2020-12-03 01:10:00,547 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2020-12-03 01:10:00,548 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2020-12-03 01:10:00,548 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2020-12-03 01:10:00,549 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_8,QUANTIFIED] [2020-12-03 01:10:00,549 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2020-12-03 01:10:00,550 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_8,QUANTIFIED] [2020-12-03 01:10:00,550 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_8,QUANTIFIED] [2020-12-03 01:10:00,550 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_8,QUANTIFIED] [2020-12-03 01:10:00,550 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_8,QUANTIFIED] [2020-12-03 01:10:00,551 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2020-12-03 01:10:00,551 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2020-12-03 01:10:00,551 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2020-12-03 01:10:00,552 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_8,QUANTIFIED] [2020-12-03 01:10:00,552 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2020-12-03 01:10:00,552 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_8,QUANTIFIED] [2020-12-03 01:10:00,553 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_8,QUANTIFIED] [2020-12-03 01:10:00,553 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_8,QUANTIFIED] [2020-12-03 01:10:00,553 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_8,QUANTIFIED] [2020-12-03 01:10:00,553 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2020-12-03 01:10:00,554 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2020-12-03 01:10:00,554 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2020-12-03 01:10:00,555 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2020-12-03 01:10:00,555 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2020-12-03 01:10:00,555 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2020-12-03 01:10:00,556 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2020-12-03 01:10:00,556 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2020-12-03 01:10:00,556 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2020-12-03 01:10:00,557 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2020-12-03 01:10:00,558 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2020-12-03 01:10:00,558 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2020-12-03 01:10:00,558 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2020-12-03 01:10:00,558 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2020-12-03 01:10:00,559 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2020-12-03 01:10:00,559 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2020-12-03 01:10:00,560 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2020-12-03 01:10:00,560 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2020-12-03 01:10:00,560 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2020-12-03 01:10:00,560 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2020-12-03 01:10:00,560 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2020-12-03 01:10:00,563 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.12 01:10:00 BoogieIcfgContainer [2020-12-03 01:10:00,563 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-12-03 01:10:00,564 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-12-03 01:10:00,564 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-12-03 01:10:00,564 INFO L275 PluginConnector]: Witness Printer initialized [2020-12-03 01:10:00,565 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 01:09:07" (3/4) ... [2020-12-03 01:10:00,569 INFO L137 WitnessPrinter]: Generating witness for correct program [2020-12-03 01:10:00,582 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 15 nodes and edges [2020-12-03 01:10:00,583 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2020-12-03 01:10:00,583 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2020-12-03 01:10:00,583 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2020-12-03 01:10:00,613 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (\exists currentRoundingMode : FloatRoundingMode :: ~fp.div~DOUBLE(currentRoundingMode, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE()) == y) && ((~fp.eq~DOUBLE(x, x) && 0bv32 == \result) || (!~fp.eq~DOUBLE(x, x) && 1bv32 == \result)) [2020-12-03 01:10:00,613 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((\exists currentRoundingMode : FloatRoundingMode :: ~fp.div~DOUBLE(currentRoundingMode, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE()) == y) && x == x) && x == x) && (\exists currentRoundingMode : FloatRoundingMode :: ~fp.div~DOUBLE(currentRoundingMode, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE()) == y)) && ~fp.eq~DOUBLE(x, x)) && 0bv32 == \result [2020-12-03 01:10:00,614 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((\exists currentRoundingMode : FloatRoundingMode :: ~fp.div~DOUBLE(currentRoundingMode, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE()) == y) && x == x) && x == x) && (\exists currentRoundingMode : FloatRoundingMode :: ~fp.div~DOUBLE(currentRoundingMode, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE()) == y)) && ~fp.eq~DOUBLE(x, x)) && (((3bv32 == \result || 1bv32 == \result) || 2bv32 == \result) || 4bv32 == \result)) && 0bv32 == \result) && (\exists v_skolemized_q#valueAsBitvector_7 : bv64 :: v_skolemized_q#valueAsBitvector_7[63:32] == msw && ~fp~LONGDOUBLE(v_skolemized_q#valueAsBitvector_7[63:63], v_skolemized_q#valueAsBitvector_7[62:52], v_skolemized_q#valueAsBitvector_7[51:0]) == x) [2020-12-03 01:10:00,614 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((x == \result && (\exists currentRoundingMode : FloatRoundingMode :: ~fp.div~DOUBLE(currentRoundingMode, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE()) == y)) && x == x) && (\exists v_skolemized_q#valueAsBitvector_6 : bv64, currentRoundingMode : FloatRoundingMode :: v_skolemized_q#valueAsBitvector_6[63:32] == msw && ~fp.div~DOUBLE(currentRoundingMode, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE()) == ~fp~LONGDOUBLE(v_skolemized_q#valueAsBitvector_6[63:63], v_skolemized_q#valueAsBitvector_6[62:52], v_skolemized_q#valueAsBitvector_6[51:0]))) && (\exists currentRoundingMode : FloatRoundingMode :: ~fp.div~DOUBLE(currentRoundingMode, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE()) == y)) && ~fp.eq~DOUBLE(x, x)) && 0bv32 == \result) && (\exists currentRoundingMode : FloatRoundingMode :: ~fp.div~DOUBLE(currentRoundingMode, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE()) == x) [2020-12-03 01:10:00,615 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((\exists currentRoundingMode : FloatRoundingMode :: ~fp.div~DOUBLE(currentRoundingMode, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE()) == y) && x == x) && (\exists currentRoundingMode : FloatRoundingMode :: ~fp.div~DOUBLE(currentRoundingMode, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE()) == y)) && ~fp.eq~DOUBLE(x, x)) && 0bv32 == \result) && (\exists currentRoundingMode : FloatRoundingMode :: ~fp.div~DOUBLE(currentRoundingMode, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE()) == x) [2020-12-03 01:10:00,615 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((0bv32 == \result && (\exists v_skolemized_q#valueAsBitvector_8 : bv64, currentRoundingMode : FloatRoundingMode :: (msw == v_skolemized_q#valueAsBitvector_8[63:32] && ~fp.div~DOUBLE(currentRoundingMode, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE()) == ~fp~LONGDOUBLE(v_skolemized_q#valueAsBitvector_8[63:63], v_skolemized_q#valueAsBitvector_8[62:52], v_skolemized_q#valueAsBitvector_8[51:0])) && lsw == v_skolemized_q#valueAsBitvector_8[31:0])) && (\exists currentRoundingMode : FloatRoundingMode :: ~fp.div~DOUBLE(currentRoundingMode, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE()) == y)) && x == x) && (\exists currentRoundingMode : FloatRoundingMode :: ~fp.div~DOUBLE(currentRoundingMode, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE()) == y)) && ~fp.eq~DOUBLE(x, x)) && 0bv32 == \result) && (\exists currentRoundingMode : FloatRoundingMode :: ~fp.div~DOUBLE(currentRoundingMode, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE()) == x) [2020-12-03 01:10:00,640 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2020-12-03 01:10:00,641 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-12-03 01:10:00,642 INFO L168 Benchmark]: Toolchain (without parser) took 53800.63 ms. Allocated memory was 44.0 MB in the beginning and 69.2 MB in the end (delta: 25.2 MB). Free memory was 20.9 MB in the beginning and 30.0 MB in the end (delta: -9.1 MB). Peak memory consumption was 19.1 MB. Max. memory is 16.1 GB. [2020-12-03 01:10:00,643 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 44.0 MB. Free memory is still 28.8 MB. There was no memory consumed. Max. memory is 16.1 GB. [2020-12-03 01:10:00,643 INFO L168 Benchmark]: CACSL2BoogieTranslator took 347.75 ms. Allocated memory is still 44.0 MB. Free memory was 20.8 MB in the beginning and 20.9 MB in the end (delta: -132.3 kB). Peak memory consumption was 7.5 MB. Max. memory is 16.1 GB. [2020-12-03 01:10:00,645 INFO L168 Benchmark]: Boogie Procedure Inliner took 45.27 ms. Allocated memory is still 44.0 MB. Free memory was 20.9 MB in the beginning and 19.1 MB in the end (delta: 1.8 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2020-12-03 01:10:00,646 INFO L168 Benchmark]: Boogie Preprocessor took 37.11 ms. Allocated memory is still 44.0 MB. Free memory was 19.1 MB in the beginning and 17.5 MB in the end (delta: 1.5 MB). There was no memory consumed. Max. memory is 16.1 GB. [2020-12-03 01:10:00,646 INFO L168 Benchmark]: RCFGBuilder took 513.04 ms. Allocated memory was 44.0 MB in the beginning and 56.6 MB in the end (delta: 12.6 MB). Free memory was 17.5 MB in the beginning and 38.0 MB in the end (delta: -20.5 MB). Peak memory consumption was 9.5 MB. Max. memory is 16.1 GB. [2020-12-03 01:10:00,646 INFO L168 Benchmark]: TraceAbstraction took 52770.75 ms. Allocated memory was 56.6 MB in the beginning and 69.2 MB in the end (delta: 12.6 MB). Free memory was 37.6 MB in the beginning and 33.5 MB in the end (delta: 4.1 MB). Peak memory consumption was 32.4 MB. Max. memory is 16.1 GB. [2020-12-03 01:10:00,647 INFO L168 Benchmark]: Witness Printer took 76.97 ms. Allocated memory is still 69.2 MB. Free memory was 33.5 MB in the beginning and 30.0 MB in the end (delta: 3.5 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. [2020-12-03 01:10:00,649 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.19 ms. Allocated memory is still 44.0 MB. Free memory is still 28.8 MB. There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 347.75 ms. Allocated memory is still 44.0 MB. Free memory was 20.8 MB in the beginning and 20.9 MB in the end (delta: -132.3 kB). Peak memory consumption was 7.5 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 45.27 ms. Allocated memory is still 44.0 MB. Free memory was 20.9 MB in the beginning and 19.1 MB in the end (delta: 1.8 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 37.11 ms. Allocated memory is still 44.0 MB. Free memory was 19.1 MB in the beginning and 17.5 MB in the end (delta: 1.5 MB). There was no memory consumed. Max. memory is 16.1 GB. * RCFGBuilder took 513.04 ms. Allocated memory was 44.0 MB in the beginning and 56.6 MB in the end (delta: 12.6 MB). Free memory was 17.5 MB in the beginning and 38.0 MB in the end (delta: -20.5 MB). Peak memory consumption was 9.5 MB. Max. memory is 16.1 GB. * TraceAbstraction took 52770.75 ms. Allocated memory was 56.6 MB in the beginning and 69.2 MB in the end (delta: 12.6 MB). Free memory was 37.6 MB in the beginning and 33.5 MB in the end (delta: 4.1 MB). Peak memory consumption was 32.4 MB. Max. memory is 16.1 GB. * Witness Printer took 76.97 ms. Allocated memory is still 69.2 MB. Free memory was 33.5 MB in the beginning and 30.0 MB in the end (delta: 3.5 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_8,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_8,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_8,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_8,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_8,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_8,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_8,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_8,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_8,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_8,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 80]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 65]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 55]: Loop Invariant [2020-12-03 01:10:00,657 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2020-12-03 01:10:00,657 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_6,QUANTIFIED] [2020-12-03 01:10:00,657 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2020-12-03 01:10:00,657 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_6,QUANTIFIED] [2020-12-03 01:10:00,658 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_6,QUANTIFIED] [2020-12-03 01:10:00,658 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_6,QUANTIFIED] [2020-12-03 01:10:00,658 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2020-12-03 01:10:00,658 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2020-12-03 01:10:00,659 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2020-12-03 01:10:00,659 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_6,QUANTIFIED] [2020-12-03 01:10:00,659 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2020-12-03 01:10:00,659 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_6,QUANTIFIED] [2020-12-03 01:10:00,659 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_6,QUANTIFIED] [2020-12-03 01:10:00,659 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_6,QUANTIFIED] [2020-12-03 01:10:00,659 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2020-12-03 01:10:00,660 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] Derived loop invariant: ((((((x == \result && (\exists currentRoundingMode : FloatRoundingMode :: ~fp.div~DOUBLE(currentRoundingMode, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE()) == y)) && x == x) && (\exists v_skolemized_q#valueAsBitvector_6 : bv64, currentRoundingMode : FloatRoundingMode :: v_skolemized_q#valueAsBitvector_6[63:32] == msw && ~fp.div~DOUBLE(currentRoundingMode, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE()) == ~fp~LONGDOUBLE(v_skolemized_q#valueAsBitvector_6[63:63], v_skolemized_q#valueAsBitvector_6[62:52], v_skolemized_q#valueAsBitvector_6[51:0]))) && (\exists currentRoundingMode : FloatRoundingMode :: ~fp.div~DOUBLE(currentRoundingMode, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE()) == y)) && ~fp.eq~DOUBLE(x, x)) && 0bv32 == \result) && (\exists currentRoundingMode : FloatRoundingMode :: ~fp.div~DOUBLE(currentRoundingMode, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE()) == x) - InvariantResult [Line: 18]: Loop Invariant [2020-12-03 01:10:00,660 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2020-12-03 01:10:00,661 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] Derived loop invariant: (\exists currentRoundingMode : FloatRoundingMode :: ~fp.div~DOUBLE(currentRoundingMode, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE()) == y) && ((~fp.eq~DOUBLE(x, x) && 0bv32 == \result) || (!~fp.eq~DOUBLE(x, x) && 1bv32 == \result)) - InvariantResult [Line: 31]: Loop Invariant [2020-12-03 01:10:00,661 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2020-12-03 01:10:00,661 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2020-12-03 01:10:00,661 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2020-12-03 01:10:00,662 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] Derived loop invariant: (((((\exists currentRoundingMode : FloatRoundingMode :: ~fp.div~DOUBLE(currentRoundingMode, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE()) == y) && x == x) && x == x) && (\exists currentRoundingMode : FloatRoundingMode :: ~fp.div~DOUBLE(currentRoundingMode, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE()) == y)) && ~fp.eq~DOUBLE(x, x)) && 0bv32 == \result - InvariantResult [Line: 28]: Loop Invariant [2020-12-03 01:10:00,662 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_8,QUANTIFIED] [2020-12-03 01:10:00,662 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2020-12-03 01:10:00,662 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_8,QUANTIFIED] [2020-12-03 01:10:00,662 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_8,QUANTIFIED] [2020-12-03 01:10:00,663 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_8,QUANTIFIED] [2020-12-03 01:10:00,663 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_8,QUANTIFIED] [2020-12-03 01:10:00,663 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2020-12-03 01:10:00,663 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2020-12-03 01:10:00,663 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2020-12-03 01:10:00,664 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_8,QUANTIFIED] [2020-12-03 01:10:00,664 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2020-12-03 01:10:00,664 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_8,QUANTIFIED] [2020-12-03 01:10:00,664 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_8,QUANTIFIED] [2020-12-03 01:10:00,664 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_8,QUANTIFIED] [2020-12-03 01:10:00,664 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_8,QUANTIFIED] [2020-12-03 01:10:00,665 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2020-12-03 01:10:00,665 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2020-12-03 01:10:00,665 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] Derived loop invariant: ((((((0bv32 == \result && (\exists v_skolemized_q#valueAsBitvector_8 : bv64, currentRoundingMode : FloatRoundingMode :: (msw == v_skolemized_q#valueAsBitvector_8[63:32] && ~fp.div~DOUBLE(currentRoundingMode, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE()) == ~fp~LONGDOUBLE(v_skolemized_q#valueAsBitvector_8[63:63], v_skolemized_q#valueAsBitvector_8[62:52], v_skolemized_q#valueAsBitvector_8[51:0])) && lsw == v_skolemized_q#valueAsBitvector_8[31:0])) && (\exists currentRoundingMode : FloatRoundingMode :: ~fp.div~DOUBLE(currentRoundingMode, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE()) == y)) && x == x) && (\exists currentRoundingMode : FloatRoundingMode :: ~fp.div~DOUBLE(currentRoundingMode, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE()) == y)) && ~fp.eq~DOUBLE(x, x)) && 0bv32 == \result) && (\exists currentRoundingMode : FloatRoundingMode :: ~fp.div~DOUBLE(currentRoundingMode, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE()) == x) - InvariantResult [Line: 31]: Loop Invariant [2020-12-03 01:10:00,666 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2020-12-03 01:10:00,666 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2020-12-03 01:10:00,666 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2020-12-03 01:10:00,666 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2020-12-03 01:10:00,666 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2020-12-03 01:10:00,667 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] Derived loop invariant: (((((\exists currentRoundingMode : FloatRoundingMode :: ~fp.div~DOUBLE(currentRoundingMode, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE()) == y) && x == x) && (\exists currentRoundingMode : FloatRoundingMode :: ~fp.div~DOUBLE(currentRoundingMode, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE()) == y)) && ~fp.eq~DOUBLE(x, x)) && 0bv32 == \result) && (\exists currentRoundingMode : FloatRoundingMode :: ~fp.div~DOUBLE(currentRoundingMode, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE()) == x) - InvariantResult [Line: 28]: Loop Invariant [2020-12-03 01:10:00,667 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2020-12-03 01:10:00,667 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2020-12-03 01:10:00,667 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2020-12-03 01:10:00,668 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2020-12-03 01:10:00,668 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2020-12-03 01:10:00,668 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2020-12-03 01:10:00,668 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2020-12-03 01:10:00,668 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2020-12-03 01:10:00,669 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2020-12-03 01:10:00,669 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2020-12-03 01:10:00,669 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2020-12-03 01:10:00,669 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] Derived loop invariant: (((((((\exists currentRoundingMode : FloatRoundingMode :: ~fp.div~DOUBLE(currentRoundingMode, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE()) == y) && x == x) && x == x) && (\exists currentRoundingMode : FloatRoundingMode :: ~fp.div~DOUBLE(currentRoundingMode, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE()) == y)) && ~fp.eq~DOUBLE(x, x)) && (((3bv32 == \result || 1bv32 == \result) || 2bv32 == \result) || 4bv32 == \result)) && 0bv32 == \result) && (\exists v_skolemized_q#valueAsBitvector_7 : bv64 :: v_skolemized_q#valueAsBitvector_7[63:32] == msw && ~fp~LONGDOUBLE(v_skolemized_q#valueAsBitvector_7[63:63], v_skolemized_q#valueAsBitvector_7[62:52], v_skolemized_q#valueAsBitvector_7[51:0]) == x) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 30 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 45.8s, OverallIterations: 15, TraceHistogramMax: 1, AutomataDifference: 25.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 6.7s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 486 SDtfs, 406 SDslu, 710 SDs, 0 SdLazy, 365 SolverSat, 18 SolverUnsat, 3 SolverUnknown, 0 SolverNotchecked, 9.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 274 GetRequests, 192 SyntacticMatches, 9 SemanticMatches, 73 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 29.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=36occurred in iteration=12, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 15 MinimizatonAttempts, 106 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 7 PreInvPairs, 14 NumberOfFragments, 246 HoareAnnotationTreeSize, 7 FomulaSimplifications, 9428 FormulaSimplificationTreeSizeReduction, 0.3s HoareSimplificationTime, 7 FomulaSimplificationsInter, 5901 FormulaSimplificationTreeSizeReductionInter, 6.4s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 1.0s SatisfiabilityAnalysisTime, 14.7s InterpolantComputationTime, 258 NumberOfCodeBlocks, 258 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 243 ConstructedInterpolants, 55 QuantifiedInterpolants, 26814 SizeOfPredicates, 60 NumberOfNonLiveVariables, 994 ConjunctsInSsa, 88 ConjunctsInUnsatCore, 15 InterpolantComputations, 15 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 proved your program to be correct! Received shutdown request...