./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/float-newlib/float_req_bl_1251.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version ee8e70e7 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/float-newlib/float_req_bl_1251.c -s /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-2/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 32adbfac5f3e3ea232180afd045da0027ca6d993 .............................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/float-newlib/float_req_bl_1251.c -s /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-2/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 32adbfac5f3e3ea232180afd045da0027ca6d993 .......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.2.0-ee8e70e [2020-10-24 15:11:37,291 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-24 15:11:37,295 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-24 15:11:37,353 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-24 15:11:37,354 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-24 15:11:37,360 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-24 15:11:37,365 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-24 15:11:37,369 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-24 15:11:37,373 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-24 15:11:37,379 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-24 15:11:37,381 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-24 15:11:37,386 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-24 15:11:37,386 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-24 15:11:37,390 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-24 15:11:37,392 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-24 15:11:37,394 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-24 15:11:37,395 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-24 15:11:37,399 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-24 15:11:37,402 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-24 15:11:37,410 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-24 15:11:37,411 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-24 15:11:37,413 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-24 15:11:37,416 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-24 15:11:37,416 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-24 15:11:37,422 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-24 15:11:37,422 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-24 15:11:37,423 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-24 15:11:37,425 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-24 15:11:37,425 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-24 15:11:37,426 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-24 15:11:37,427 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-24 15:11:37,428 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-24 15:11:37,429 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-24 15:11:37,430 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-24 15:11:37,433 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-24 15:11:37,434 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-24 15:11:37,435 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-24 15:11:37,435 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-24 15:11:37,435 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-24 15:11:37,437 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-24 15:11:37,438 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-24 15:11:37,439 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2020-10-24 15:11:37,490 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-24 15:11:37,500 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-24 15:11:37,502 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-24 15:11:37,503 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-24 15:11:37,503 INFO L138 SettingsManager]: * Use SBE=true [2020-10-24 15:11:37,503 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-24 15:11:37,504 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-24 15:11:37,504 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-24 15:11:37,505 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-24 15:11:37,505 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-24 15:11:37,506 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-10-24 15:11:37,506 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-10-24 15:11:37,507 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-10-24 15:11:37,507 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-24 15:11:37,507 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-24 15:11:37,507 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-24 15:11:37,508 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-10-24 15:11:37,508 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-24 15:11:37,508 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-24 15:11:37,509 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-10-24 15:11:37,509 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-10-24 15:11:37,509 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-24 15:11:37,510 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-24 15:11:37,510 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-10-24 15:11:37,510 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-10-24 15:11:37,511 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-24 15:11:37,511 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-10-24 15:11:37,511 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-10-24 15:11:37,511 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-10-24 15:11:37,512 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-2/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-2/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 -> 32adbfac5f3e3ea232180afd045da0027ca6d993 [2020-10-24 15:11:37,946 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-24 15:11:37,999 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-24 15:11:38,004 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-24 15:11:38,006 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-24 15:11:38,008 INFO L275 PluginConnector]: CDTParser initialized [2020-10-24 15:11:38,009 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/float-newlib/float_req_bl_1251.c [2020-10-24 15:11:38,095 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/a037ae52b/e3a799be8cbb4045bdbd714552dab841/FLAGf9ec76eca [2020-10-24 15:11:38,668 INFO L306 CDTParser]: Found 1 translation units. [2020-10-24 15:11:38,669 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-2/releaseScripts/default/sv-benchmarks/c/float-newlib/float_req_bl_1251.c [2020-10-24 15:11:38,685 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/a037ae52b/e3a799be8cbb4045bdbd714552dab841/FLAGf9ec76eca [2020-10-24 15:11:39,063 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/a037ae52b/e3a799be8cbb4045bdbd714552dab841 [2020-10-24 15:11:39,068 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-24 15:11:39,077 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-10-24 15:11:39,084 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-24 15:11:39,084 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-24 15:11:39,088 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-24 15:11:39,089 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 03:11:39" (1/1) ... [2020-10-24 15:11:39,092 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@345bc2fa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:11:39, skipping insertion in model container [2020-10-24 15:11:39,092 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 03:11:39" (1/1) ... [2020-10-24 15:11:39,101 INFO L146 MainTranslator]: Starting translation in SV-COMP mode [2020-10-24 15:11:39,123 INFO L179 MainTranslator]: Built tables and reachable declarations [2020-10-24 15:11:39,407 INFO L211 PostProcessor]: Analyzing one entry point: main [2020-10-24 15:11:39,416 INFO L212 MainTranslator]: Completed pre-run [2020-10-24 15:11:39,443 INFO L211 PostProcessor]: Analyzing one entry point: main [2020-10-24 15:11:39,463 INFO L217 MainTranslator]: Completed translation [2020-10-24 15:11:39,464 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:11:39 WrapperNode [2020-10-24 15:11:39,464 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-24 15:11:39,465 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-24 15:11:39,465 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-24 15:11:39,465 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-24 15:11:39,472 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:11:39" (1/1) ... [2020-10-24 15:11:39,481 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:11:39" (1/1) ... [2020-10-24 15:11:39,514 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-24 15:11:39,515 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-24 15:11:39,515 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-24 15:11:39,515 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-24 15:11:39,525 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:11:39" (1/1) ... [2020-10-24 15:11:39,525 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:11:39" (1/1) ... [2020-10-24 15:11:39,529 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:11:39" (1/1) ... [2020-10-24 15:11:39,529 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:11:39" (1/1) ... [2020-10-24 15:11:39,542 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:11:39" (1/1) ... [2020-10-24 15:11:39,547 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:11:39" (1/1) ... [2020-10-24 15:11:39,550 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:11:39" (1/1) ... [2020-10-24 15:11:39,553 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-24 15:11:39,554 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-24 15:11:39,555 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-24 15:11:39,555 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-24 15:11:39,556 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:11:39" (1/1) ... No working directory specified, using /storage/repos/ultimate-2/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-10-24 15:11:39,652 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-10-24 15:11:39,652 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-24 15:11:39,652 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2020-10-24 15:11:39,653 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-24 15:11:39,653 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-24 15:11:39,653 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-10-24 15:11:39,653 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-10-24 15:11:40,340 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-24 15:11:40,340 INFO L298 CfgBuilder]: Removed 34 assume(true) statements. [2020-10-24 15:11:40,343 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 03:11:40 BoogieIcfgContainer [2020-10-24 15:11:40,343 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-24 15:11:40,346 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-10-24 15:11:40,346 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-10-24 15:11:40,349 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-10-24 15:11:40,350 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 03:11:39" (1/3) ... [2020-10-24 15:11:40,351 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6f9d1622 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 03:11:40, skipping insertion in model container [2020-10-24 15:11:40,351 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:11:39" (2/3) ... [2020-10-24 15:11:40,352 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6f9d1622 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 03:11:40, skipping insertion in model container [2020-10-24 15:11:40,352 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 03:11:40" (3/3) ... [2020-10-24 15:11:40,354 INFO L111 eAbstractionObserver]: Analyzing ICFG float_req_bl_1251.c [2020-10-24 15:11:40,367 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-10-24 15:11:40,373 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2020-10-24 15:11:40,388 INFO L253 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2020-10-24 15:11:40,427 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-10-24 15:11:40,428 INFO L378 AbstractCegarLoop]: Hoare is true [2020-10-24 15:11:40,428 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-10-24 15:11:40,428 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-24 15:11:40,428 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-24 15:11:40,428 INFO L382 AbstractCegarLoop]: Difference is false [2020-10-24 15:11:40,428 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-24 15:11:40,429 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-24 15:11:40,442 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states. [2020-10-24 15:11:40,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-10-24 15:11:40,448 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 15:11:40,449 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-24 15:11:40,449 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 15:11:40,455 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 15:11:40,456 INFO L82 PathProgramCache]: Analyzing trace with hash 1204154757, now seen corresponding path program 1 times [2020-10-24 15:11:40,465 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-24 15:11:40,466 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1692484634] [2020-10-24 15:11:40,466 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 15:11:40,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 15:11:40,661 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-24 15:11:40,662 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1692484634] [2020-10-24 15:11:40,663 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-24 15:11:40,663 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-24 15:11:40,664 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1737527787] [2020-10-24 15:11:40,669 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-24 15:11:40,669 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-24 15:11:40,684 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-24 15:11:40,685 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-24 15:11:40,687 INFO L87 Difference]: Start difference. First operand 49 states. Second operand 4 states. [2020-10-24 15:11:40,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 15:11:40,762 INFO L93 Difference]: Finished difference Result 92 states and 136 transitions. [2020-10-24 15:11:40,762 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-24 15:11:40,764 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2020-10-24 15:11:40,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 15:11:40,774 INFO L225 Difference]: With dead ends: 92 [2020-10-24 15:11:40,775 INFO L226 Difference]: Without dead ends: 50 [2020-10-24 15:11:40,778 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-10-24 15:11:40,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2020-10-24 15:11:40,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 45. [2020-10-24 15:11:40,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2020-10-24 15:11:40,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 60 transitions. [2020-10-24 15:11:40,823 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 60 transitions. Word has length 16 [2020-10-24 15:11:40,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 15:11:40,824 INFO L481 AbstractCegarLoop]: Abstraction has 45 states and 60 transitions. [2020-10-24 15:11:40,824 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-24 15:11:40,824 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 60 transitions. [2020-10-24 15:11:40,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-10-24 15:11:40,825 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 15:11:40,825 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-24 15:11:40,826 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-10-24 15:11:40,826 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 15:11:40,827 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 15:11:40,827 INFO L82 PathProgramCache]: Analyzing trace with hash 44236684, now seen corresponding path program 1 times [2020-10-24 15:11:40,827 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-24 15:11:40,828 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1969618013] [2020-10-24 15:11:40,828 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 15:11:40,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 15:11:40,980 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-24 15:11:40,983 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1969618013] [2020-10-24 15:11:40,983 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-24 15:11:40,984 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-24 15:11:40,984 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1538086777] [2020-10-24 15:11:40,986 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-24 15:11:40,986 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-24 15:11:40,987 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-24 15:11:40,988 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-24 15:11:40,989 INFO L87 Difference]: Start difference. First operand 45 states and 60 transitions. Second operand 4 states. [2020-10-24 15:11:41,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 15:11:41,073 INFO L93 Difference]: Finished difference Result 77 states and 97 transitions. [2020-10-24 15:11:41,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-24 15:11:41,074 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 18 [2020-10-24 15:11:41,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 15:11:41,076 INFO L225 Difference]: With dead ends: 77 [2020-10-24 15:11:41,078 INFO L226 Difference]: Without dead ends: 64 [2020-10-24 15:11:41,079 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-10-24 15:11:41,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2020-10-24 15:11:41,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 47. [2020-10-24 15:11:41,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2020-10-24 15:11:41,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 62 transitions. [2020-10-24 15:11:41,094 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 62 transitions. Word has length 18 [2020-10-24 15:11:41,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 15:11:41,095 INFO L481 AbstractCegarLoop]: Abstraction has 47 states and 62 transitions. [2020-10-24 15:11:41,095 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-24 15:11:41,095 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 62 transitions. [2020-10-24 15:11:41,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-10-24 15:11:41,097 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 15:11:41,098 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-10-24 15:11:41,098 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-10-24 15:11:41,099 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 15:11:41,100 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 15:11:41,100 INFO L82 PathProgramCache]: Analyzing trace with hash -674173253, now seen corresponding path program 1 times [2020-10-24 15:11:41,101 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-24 15:11:41,101 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1780054018] [2020-10-24 15:11:41,102 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 15:11:41,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 15:11:41,221 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-24 15:11:41,221 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1780054018] [2020-10-24 15:11:41,222 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-24 15:11:41,222 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-24 15:11:41,223 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1840640470] [2020-10-24 15:11:41,223 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-24 15:11:41,224 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-24 15:11:41,225 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-24 15:11:41,226 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-24 15:11:41,226 INFO L87 Difference]: Start difference. First operand 47 states and 62 transitions. Second operand 4 states. [2020-10-24 15:11:41,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 15:11:41,320 INFO L93 Difference]: Finished difference Result 79 states and 99 transitions. [2020-10-24 15:11:41,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-24 15:11:41,321 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 19 [2020-10-24 15:11:41,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 15:11:41,322 INFO L225 Difference]: With dead ends: 79 [2020-10-24 15:11:41,322 INFO L226 Difference]: Without dead ends: 66 [2020-10-24 15:11:41,325 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-10-24 15:11:41,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2020-10-24 15:11:41,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 47. [2020-10-24 15:11:41,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2020-10-24 15:11:41,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 62 transitions. [2020-10-24 15:11:41,342 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 62 transitions. Word has length 19 [2020-10-24 15:11:41,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 15:11:41,343 INFO L481 AbstractCegarLoop]: Abstraction has 47 states and 62 transitions. [2020-10-24 15:11:41,343 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-24 15:11:41,343 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 62 transitions. [2020-10-24 15:11:41,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-10-24 15:11:41,346 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 15:11:41,346 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-10-24 15:11:41,346 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-10-24 15:11:41,347 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 15:11:41,347 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 15:11:41,348 INFO L82 PathProgramCache]: Analyzing trace with hash -1345927737, now seen corresponding path program 1 times [2020-10-24 15:11:41,349 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-24 15:11:41,349 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1116571738] [2020-10-24 15:11:41,349 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 15:11:41,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 15:11:41,434 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-24 15:11:41,434 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1116571738] [2020-10-24 15:11:41,434 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-24 15:11:41,435 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-24 15:11:41,435 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1180287895] [2020-10-24 15:11:41,435 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-24 15:11:41,436 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-24 15:11:41,437 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-24 15:11:41,437 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-24 15:11:41,437 INFO L87 Difference]: Start difference. First operand 47 states and 62 transitions. Second operand 4 states. [2020-10-24 15:11:41,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 15:11:41,488 INFO L93 Difference]: Finished difference Result 81 states and 101 transitions. [2020-10-24 15:11:41,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-24 15:11:41,488 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 20 [2020-10-24 15:11:41,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 15:11:41,490 INFO L225 Difference]: With dead ends: 81 [2020-10-24 15:11:41,490 INFO L226 Difference]: Without dead ends: 68 [2020-10-24 15:11:41,490 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-10-24 15:11:41,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2020-10-24 15:11:41,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 47. [2020-10-24 15:11:41,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2020-10-24 15:11:41,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 62 transitions. [2020-10-24 15:11:41,498 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 62 transitions. Word has length 20 [2020-10-24 15:11:41,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 15:11:41,498 INFO L481 AbstractCegarLoop]: Abstraction has 47 states and 62 transitions. [2020-10-24 15:11:41,499 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-24 15:11:41,499 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 62 transitions. [2020-10-24 15:11:41,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-10-24 15:11:41,500 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 15:11:41,500 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-10-24 15:11:41,500 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-10-24 15:11:41,501 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 15:11:41,501 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 15:11:41,501 INFO L82 PathProgramCache]: Analyzing trace with hash -1380709804, now seen corresponding path program 1 times [2020-10-24 15:11:41,502 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-24 15:11:41,502 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1496140743] [2020-10-24 15:11:41,502 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 15:11:41,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 15:11:41,541 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-24 15:11:41,542 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1496140743] [2020-10-24 15:11:41,542 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-24 15:11:41,542 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-24 15:11:41,542 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [897275788] [2020-10-24 15:11:41,543 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-24 15:11:41,543 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-24 15:11:41,544 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-24 15:11:41,544 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-24 15:11:41,544 INFO L87 Difference]: Start difference. First operand 47 states and 62 transitions. Second operand 3 states. [2020-10-24 15:11:41,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 15:11:41,561 INFO L93 Difference]: Finished difference Result 50 states and 65 transitions. [2020-10-24 15:11:41,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-24 15:11:41,562 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2020-10-24 15:11:41,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 15:11:41,563 INFO L225 Difference]: With dead ends: 50 [2020-10-24 15:11:41,563 INFO L226 Difference]: Without dead ends: 48 [2020-10-24 15:11:41,564 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-24 15:11:41,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2020-10-24 15:11:41,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2020-10-24 15:11:41,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2020-10-24 15:11:41,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 63 transitions. [2020-10-24 15:11:41,574 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 63 transitions. Word has length 21 [2020-10-24 15:11:41,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 15:11:41,575 INFO L481 AbstractCegarLoop]: Abstraction has 48 states and 63 transitions. [2020-10-24 15:11:41,575 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-24 15:11:41,575 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 63 transitions. [2020-10-24 15:11:41,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-10-24 15:11:41,578 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 15:11:41,578 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-10-24 15:11:41,579 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-10-24 15:11:41,579 INFO L429 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 15:11:41,579 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 15:11:41,579 INFO L82 PathProgramCache]: Analyzing trace with hash 147544209, now seen corresponding path program 1 times [2020-10-24 15:11:41,580 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-24 15:11:41,580 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [148735926] [2020-10-24 15:11:41,580 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 15:11:41,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-24 15:11:41,636 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-24 15:11:41,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-24 15:11:41,694 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-24 15:11:41,735 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-24 15:11:41,735 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-10-24 15:11:41,735 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-10-24 15:11:41,800 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.10 03:11:41 BoogieIcfgContainer [2020-10-24 15:11:41,801 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-10-24 15:11:41,802 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-10-24 15:11:41,802 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-10-24 15:11:41,802 INFO L275 PluginConnector]: Witness Printer initialized [2020-10-24 15:11:41,803 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 03:11:40" (3/4) ... [2020-10-24 15:11:41,806 INFO L140 WitnessPrinter]: No result that supports witness generation found [2020-10-24 15:11:41,806 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-10-24 15:11:41,810 INFO L168 Benchmark]: Toolchain (without parser) took 2735.77 ms. Allocated memory was 46.1 MB in the beginning and 71.3 MB in the end (delta: 25.2 MB). Free memory was 22.9 MB in the beginning and 44.4 MB in the end (delta: -21.5 MB). Peak memory consumption was 8.6 MB. Max. memory is 16.1 GB. [2020-10-24 15:11:41,813 INFO L168 Benchmark]: CDTParser took 0.25 ms. Allocated memory is still 46.1 MB. Free memory is still 33.0 MB. There was no memory consumed. Max. memory is 16.1 GB. [2020-10-24 15:11:41,814 INFO L168 Benchmark]: CACSL2BoogieTranslator took 380.81 ms. Allocated memory is still 46.1 MB. Free memory was 22.3 MB in the beginning and 23.2 MB in the end (delta: -875.3 kB). Peak memory consumption was 3.4 MB. Max. memory is 16.1 GB. [2020-10-24 15:11:41,816 INFO L168 Benchmark]: Boogie Procedure Inliner took 48.90 ms. Allocated memory is still 46.1 MB. Free memory was 23.2 MB in the beginning and 21.1 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2020-10-24 15:11:41,822 INFO L168 Benchmark]: Boogie Preprocessor took 38.71 ms. Allocated memory is still 46.1 MB. Free memory was 21.1 MB in the beginning and 19.5 MB in the end (delta: 1.6 MB). There was no memory consumed. Max. memory is 16.1 GB. [2020-10-24 15:11:41,823 INFO L168 Benchmark]: RCFGBuilder took 789.14 ms. Allocated memory was 46.1 MB in the beginning and 58.7 MB in the end (delta: 12.6 MB). Free memory was 19.5 MB in the beginning and 33.9 MB in the end (delta: -14.3 MB). Peak memory consumption was 8.2 MB. Max. memory is 16.1 GB. [2020-10-24 15:11:41,824 INFO L168 Benchmark]: TraceAbstraction took 1455.23 ms. Allocated memory was 58.7 MB in the beginning and 71.3 MB in the end (delta: 12.6 MB). Free memory was 33.3 MB in the beginning and 44.9 MB in the end (delta: -11.6 MB). Peak memory consumption was 1.3 MB. Max. memory is 16.1 GB. [2020-10-24 15:11:41,828 INFO L168 Benchmark]: Witness Printer took 4.34 ms. Allocated memory is still 71.3 MB. Free memory was 44.9 MB in the beginning and 44.4 MB in the end (delta: 518.0 kB). There was no memory consumed. Max. memory is 16.1 GB. [2020-10-24 15:11:41,837 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.25 ms. Allocated memory is still 46.1 MB. Free memory is still 33.0 MB. There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 380.81 ms. Allocated memory is still 46.1 MB. Free memory was 22.3 MB in the beginning and 23.2 MB in the end (delta: -875.3 kB). Peak memory consumption was 3.4 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 48.90 ms. Allocated memory is still 46.1 MB. Free memory was 23.2 MB in the beginning and 21.1 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 38.71 ms. Allocated memory is still 46.1 MB. Free memory was 21.1 MB in the beginning and 19.5 MB in the end (delta: 1.6 MB). There was no memory consumed. Max. memory is 16.1 GB. * RCFGBuilder took 789.14 ms. Allocated memory was 46.1 MB in the beginning and 58.7 MB in the end (delta: 12.6 MB). Free memory was 19.5 MB in the beginning and 33.9 MB in the end (delta: -14.3 MB). Peak memory consumption was 8.2 MB. Max. memory is 16.1 GB. * TraceAbstraction took 1455.23 ms. Allocated memory was 58.7 MB in the beginning and 71.3 MB in the end (delta: 12.6 MB). Free memory was 33.3 MB in the beginning and 44.9 MB in the end (delta: -11.6 MB). Peak memory consumption was 1.3 MB. Max. memory is 16.1 GB. * Witness Printer took 4.34 ms. Allocated memory is still 71.3 MB. Free memory was 44.9 MB in the beginning and 44.4 MB in the end (delta: 518.0 kB). There was no memory consumed. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 3]: Unable to prove that call of __VERIFIER_error() unreachable Unable to prove that call of __VERIFIER_error() unreachable Reason: overapproximation of someBinaryFLOAT_SMTComparisonOperation at line 75. Possible FailurePath: [L66] float x = __VERIFIER_nondet_float(); [L67] float y = __VERIFIER_nondet_float(); [L57] return x != x; [L69] EXPR isnan_float(x) && !isnan_float(y) [L57] return x != x; [L69] EXPR isnan_float(x) && !isnan_float(y) [L69-L70] (isnan_float(x) && !isnan_float(y)) || (!isnan_float(x) && isnan_float(y)) [L69-L70] COND TRUE (isnan_float(x) && !isnan_float(y)) || (!isnan_float(x) && isnan_float(y)) [L23] __uint32_t w; [L26] ieee_float_shape_type gf_u; [L27] gf_u.value = (x) [L28] EXPR gf_u.word [L28] (w) = gf_u.word [L31] COND FALSE !(w == 0x00000000 || w == 0x80000000) [L33-L34] COND FALSE !((w >= 0x00800000 && w <= 0x7f7fffff) || (w >= 0x80800000 && w <= 0xff7fffff)) [L36-L37] COND FALSE !((w >= 0x00000001 && w <= 0x007fffff) || (w >= 0x80000001 && w <= 0x807fffff)) [L39] COND FALSE !(w == 0x7f800000 || w == 0xff800000) [L42] return 0; [L46] COND TRUE __fpclassify_float(x) == 0 [L47] return y; [L72] float res = fmax_float(x, y); [L57] return x != x; [L75] EXPR isnan_float(x) && !isnan_float(y) [L57] return x != x; [L75] EXPR isnan_float(x) && !isnan_float(y) [L75] COND TRUE isnan_float(x) && !isnan_float(y) && res != y [L3] __assert_fail("0", "float_req_bl_1251.c", 3, "reach_error") - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 49 locations, 2 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 1.3s, OverallIterations: 6, TraceHistogramMax: 1, AutomataDifference: 0.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 343 SDtfs, 79 SDslu, 503 SDs, 0 SdLazy, 88 SolverSat, 6 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 23 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=49occurred 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, 62 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.2s InterpolantComputationTime, 116 NumberOfCodeBlocks, 116 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 89 ConstructedInterpolants, 0 QuantifiedInterpolants, 1865 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-ee8e70e [2020-10-24 15:11:44,411 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-24 15:11:44,415 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-24 15:11:44,467 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-24 15:11:44,468 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-24 15:11:44,469 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-24 15:11:44,471 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-24 15:11:44,473 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-24 15:11:44,480 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-24 15:11:44,488 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-24 15:11:44,490 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-24 15:11:44,492 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-24 15:11:44,497 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-24 15:11:44,500 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-24 15:11:44,502 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-24 15:11:44,503 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-24 15:11:44,504 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-24 15:11:44,509 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-24 15:11:44,513 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-24 15:11:44,518 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-24 15:11:44,520 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-24 15:11:44,523 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-24 15:11:44,525 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-24 15:11:44,529 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-24 15:11:44,535 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-24 15:11:44,537 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-24 15:11:44,537 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-24 15:11:44,538 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-24 15:11:44,540 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-24 15:11:44,541 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-24 15:11:44,541 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-24 15:11:44,542 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-24 15:11:44,544 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-24 15:11:44,545 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-24 15:11:44,547 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-24 15:11:44,547 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-24 15:11:44,559 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-24 15:11:44,560 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-24 15:11:44,560 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-24 15:11:44,562 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-24 15:11:44,563 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-24 15:11:44,564 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2020-10-24 15:11:44,605 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-24 15:11:44,605 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-24 15:11:44,606 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-24 15:11:44,607 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-24 15:11:44,607 INFO L138 SettingsManager]: * Use SBE=true [2020-10-24 15:11:44,607 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-24 15:11:44,607 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-24 15:11:44,608 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-24 15:11:44,608 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-24 15:11:44,608 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-10-24 15:11:44,608 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-10-24 15:11:44,608 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-10-24 15:11:44,609 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2020-10-24 15:11:44,609 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2020-10-24 15:11:44,609 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-24 15:11:44,609 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-24 15:11:44,609 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-24 15:11:44,610 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-10-24 15:11:44,610 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-24 15:11:44,610 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-24 15:11:44,610 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-10-24 15:11:44,610 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-10-24 15:11:44,611 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-24 15:11:44,611 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-24 15:11:44,611 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-10-24 15:11:44,611 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-10-24 15:11:44,611 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2020-10-24 15:11:44,612 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2020-10-24 15:11:44,612 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-10-24 15:11:44,612 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-10-24 15:11:44,612 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-10-24 15:11:44,612 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-2/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-2/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 -> 32adbfac5f3e3ea232180afd045da0027ca6d993 [2020-10-24 15:11:44,978 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-24 15:11:45,031 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-24 15:11:45,036 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-24 15:11:45,038 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-24 15:11:45,039 INFO L275 PluginConnector]: CDTParser initialized [2020-10-24 15:11:45,040 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/float-newlib/float_req_bl_1251.c [2020-10-24 15:11:45,126 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/6c43f1433/130f56c1cde34e2ca46710232aae1d42/FLAG556044572 [2020-10-24 15:11:45,824 INFO L306 CDTParser]: Found 1 translation units. [2020-10-24 15:11:45,824 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-2/releaseScripts/default/sv-benchmarks/c/float-newlib/float_req_bl_1251.c [2020-10-24 15:11:45,831 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/6c43f1433/130f56c1cde34e2ca46710232aae1d42/FLAG556044572 [2020-10-24 15:11:46,161 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/6c43f1433/130f56c1cde34e2ca46710232aae1d42 [2020-10-24 15:11:46,164 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-24 15:11:46,170 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-10-24 15:11:46,172 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-24 15:11:46,172 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-24 15:11:46,177 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-24 15:11:46,177 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 03:11:46" (1/1) ... [2020-10-24 15:11:46,181 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3f636af8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:11:46, skipping insertion in model container [2020-10-24 15:11:46,181 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 03:11:46" (1/1) ... [2020-10-24 15:11:46,189 INFO L146 MainTranslator]: Starting translation in SV-COMP mode [2020-10-24 15:11:46,207 INFO L179 MainTranslator]: Built tables and reachable declarations [2020-10-24 15:11:46,399 INFO L211 PostProcessor]: Analyzing one entry point: main [2020-10-24 15:11:46,417 INFO L212 MainTranslator]: Completed pre-run [2020-10-24 15:11:46,446 INFO L211 PostProcessor]: Analyzing one entry point: main [2020-10-24 15:11:46,470 INFO L217 MainTranslator]: Completed translation [2020-10-24 15:11:46,470 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:11:46 WrapperNode [2020-10-24 15:11:46,471 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-24 15:11:46,472 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-24 15:11:46,472 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-24 15:11:46,472 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-24 15:11:46,483 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:11:46" (1/1) ... [2020-10-24 15:11:46,495 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:11:46" (1/1) ... [2020-10-24 15:11:46,533 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-24 15:11:46,534 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-24 15:11:46,534 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-24 15:11:46,535 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-24 15:11:46,546 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:11:46" (1/1) ... [2020-10-24 15:11:46,546 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:11:46" (1/1) ... [2020-10-24 15:11:46,551 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:11:46" (1/1) ... [2020-10-24 15:11:46,552 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:11:46" (1/1) ... [2020-10-24 15:11:46,563 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:11:46" (1/1) ... [2020-10-24 15:11:46,568 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:11:46" (1/1) ... [2020-10-24 15:11:46,572 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:11:46" (1/1) ... [2020-10-24 15:11:46,577 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-24 15:11:46,578 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-24 15:11:46,579 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-24 15:11:46,579 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-24 15:11:46,580 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:11:46" (1/1) ... No working directory specified, using /storage/repos/ultimate-2/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-10-24 15:11:46,673 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2020-10-24 15:11:46,674 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-24 15:11:46,674 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2020-10-24 15:11:46,674 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-24 15:11:46,674 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-24 15:11:46,674 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4 [2020-10-24 15:11:46,674 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.float_to_bitvec_FLOAT [2020-10-24 15:11:46,675 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-10-24 15:11:47,182 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-24 15:11:47,182 INFO L298 CfgBuilder]: Removed 34 assume(true) statements. [2020-10-24 15:11:47,184 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 03:11:47 BoogieIcfgContainer [2020-10-24 15:11:47,184 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-24 15:11:47,186 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-10-24 15:11:47,186 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-10-24 15:11:47,190 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-10-24 15:11:47,190 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 03:11:46" (1/3) ... [2020-10-24 15:11:47,191 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@34993d29 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 03:11:47, skipping insertion in model container [2020-10-24 15:11:47,191 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:11:46" (2/3) ... [2020-10-24 15:11:47,192 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@34993d29 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 03:11:47, skipping insertion in model container [2020-10-24 15:11:47,192 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 03:11:47" (3/3) ... [2020-10-24 15:11:47,193 INFO L111 eAbstractionObserver]: Analyzing ICFG float_req_bl_1251.c [2020-10-24 15:11:47,205 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-10-24 15:11:47,211 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2020-10-24 15:11:47,225 INFO L253 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2020-10-24 15:11:47,255 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-10-24 15:11:47,255 INFO L378 AbstractCegarLoop]: Hoare is true [2020-10-24 15:11:47,255 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-10-24 15:11:47,256 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-24 15:11:47,256 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-24 15:11:47,256 INFO L382 AbstractCegarLoop]: Difference is false [2020-10-24 15:11:47,256 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-24 15:11:47,256 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-24 15:11:47,277 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states. [2020-10-24 15:11:47,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-10-24 15:11:47,284 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 15:11:47,285 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-24 15:11:47,285 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 15:11:47,304 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 15:11:47,304 INFO L82 PathProgramCache]: Analyzing trace with hash 1204154757, now seen corresponding path program 1 times [2020-10-24 15:11:47,319 INFO L162 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-10-24 15:11:47,319 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2026851589] [2020-10-24 15:11:47,319 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-2/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-10-24 15:11:47,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 15:11:47,482 INFO L263 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 1 conjunts are in the unsatisfiable core [2020-10-24 15:11:47,488 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-24 15:11:47,507 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-24 15:11:47,507 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-24 15:11:47,513 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-24 15:11:47,514 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2026851589] [2020-10-24 15:11:47,514 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-24 15:11:47,514 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2020-10-24 15:11:47,515 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [543623114] [2020-10-24 15:11:47,520 INFO L461 AbstractCegarLoop]: Interpolant automaton has 2 states [2020-10-24 15:11:47,520 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-10-24 15:11:47,534 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2020-10-24 15:11:47,535 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-10-24 15:11:47,537 INFO L87 Difference]: Start difference. First operand 49 states. Second operand 2 states. [2020-10-24 15:11:47,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 15:11:47,558 INFO L93 Difference]: Finished difference Result 84 states and 124 transitions. [2020-10-24 15:11:47,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2020-10-24 15:11:47,560 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 16 [2020-10-24 15:11:47,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 15:11:47,571 INFO L225 Difference]: With dead ends: 84 [2020-10-24 15:11:47,571 INFO L226 Difference]: Without dead ends: 43 [2020-10-24 15:11:47,574 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 30 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-10-24 15:11:47,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2020-10-24 15:11:47,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2020-10-24 15:11:47,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2020-10-24 15:11:47,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 58 transitions. [2020-10-24 15:11:47,613 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 58 transitions. Word has length 16 [2020-10-24 15:11:47,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 15:11:47,614 INFO L481 AbstractCegarLoop]: Abstraction has 43 states and 58 transitions. [2020-10-24 15:11:47,625 INFO L482 AbstractCegarLoop]: Interpolant automaton has 2 states. [2020-10-24 15:11:47,625 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 58 transitions. [2020-10-24 15:11:47,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-10-24 15:11:47,626 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 15:11:47,626 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-24 15:11:47,843 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 mathsat -unsat_core_generation=3 [2020-10-24 15:11:47,844 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 15:11:47,845 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 15:11:47,846 INFO L82 PathProgramCache]: Analyzing trace with hash 1262247077, now seen corresponding path program 1 times [2020-10-24 15:11:47,847 INFO L162 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-10-24 15:11:47,847 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1393498910] [2020-10-24 15:11:47,847 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-2/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-10-24 15:11:48,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 15:11:48,024 INFO L263 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-24 15:11:48,027 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-24 15:11:48,153 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-24 15:11:48,153 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-24 15:11:48,158 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-24 15:11:48,159 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1393498910] [2020-10-24 15:11:48,159 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-24 15:11:48,159 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 4 [2020-10-24 15:11:48,159 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1817599877] [2020-10-24 15:11:48,161 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-24 15:11:48,161 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-10-24 15:11:48,162 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-24 15:11:48,162 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-24 15:11:48,162 INFO L87 Difference]: Start difference. First operand 43 states and 58 transitions. Second operand 4 states. [2020-10-24 15:11:48,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 15:11:48,230 INFO L93 Difference]: Finished difference Result 82 states and 111 transitions. [2020-10-24 15:11:48,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-24 15:11:48,231 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 17 [2020-10-24 15:11:48,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 15:11:48,232 INFO L225 Difference]: With dead ends: 82 [2020-10-24 15:11:48,232 INFO L226 Difference]: Without dead ends: 50 [2020-10-24 15:11:48,233 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-24 15:11:48,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2020-10-24 15:11:48,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 45. [2020-10-24 15:11:48,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2020-10-24 15:11:48,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 60 transitions. [2020-10-24 15:11:48,241 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 60 transitions. Word has length 17 [2020-10-24 15:11:48,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 15:11:48,242 INFO L481 AbstractCegarLoop]: Abstraction has 45 states and 60 transitions. [2020-10-24 15:11:48,242 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-24 15:11:48,242 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 60 transitions. [2020-10-24 15:11:48,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-10-24 15:11:48,243 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 15:11:48,243 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-24 15:11:48,461 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 mathsat -unsat_core_generation=3 [2020-10-24 15:11:48,462 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 15:11:48,463 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 15:11:48,464 INFO L82 PathProgramCache]: Analyzing trace with hash 44236684, now seen corresponding path program 1 times [2020-10-24 15:11:48,465 INFO L162 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-10-24 15:11:48,465 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1864177031] [2020-10-24 15:11:48,466 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-2/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-10-24 15:11:48,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 15:11:48,626 INFO L263 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-24 15:11:48,628 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-24 15:11:48,658 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-24 15:11:48,659 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-24 15:11:48,688 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-24 15:11:48,688 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1864177031] [2020-10-24 15:11:48,689 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-24 15:11:48,689 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2020-10-24 15:11:48,690 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [759739745] [2020-10-24 15:11:48,690 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-24 15:11:48,690 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-10-24 15:11:48,691 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-24 15:11:48,692 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-10-24 15:11:48,692 INFO L87 Difference]: Start difference. First operand 45 states and 60 transitions. Second operand 6 states. [2020-10-24 15:11:48,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 15:11:48,843 INFO L93 Difference]: Finished difference Result 96 states and 120 transitions. [2020-10-24 15:11:48,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-24 15:11:48,844 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 18 [2020-10-24 15:11:48,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 15:11:48,846 INFO L225 Difference]: With dead ends: 96 [2020-10-24 15:11:48,846 INFO L226 Difference]: Without dead ends: 83 [2020-10-24 15:11:48,846 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2020-10-24 15:11:48,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2020-10-24 15:11:48,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 47. [2020-10-24 15:11:48,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2020-10-24 15:11:48,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 62 transitions. [2020-10-24 15:11:48,855 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 62 transitions. Word has length 18 [2020-10-24 15:11:48,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 15:11:48,856 INFO L481 AbstractCegarLoop]: Abstraction has 47 states and 62 transitions. [2020-10-24 15:11:48,856 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-24 15:11:48,856 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 62 transitions. [2020-10-24 15:11:48,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-10-24 15:11:48,857 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 15:11:48,857 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-10-24 15:11:49,075 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 mathsat -unsat_core_generation=3 [2020-10-24 15:11:49,077 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 15:11:49,078 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 15:11:49,078 INFO L82 PathProgramCache]: Analyzing trace with hash -1380709804, now seen corresponding path program 1 times [2020-10-24 15:11:49,078 INFO L162 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-10-24 15:11:49,079 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [795993270] [2020-10-24 15:11:49,079 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-2/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-10-24 15:11:49,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 15:11:49,219 INFO L263 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 2 conjunts are in the unsatisfiable core [2020-10-24 15:11:49,220 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-24 15:11:49,233 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-24 15:11:49,233 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-24 15:11:49,236 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-24 15:11:49,236 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [795993270] [2020-10-24 15:11:49,237 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-24 15:11:49,237 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-24 15:11:49,237 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [131581807] [2020-10-24 15:11:49,238 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-24 15:11:49,238 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-10-24 15:11:49,239 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-24 15:11:49,239 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-24 15:11:49,239 INFO L87 Difference]: Start difference. First operand 47 states and 62 transitions. Second operand 3 states. [2020-10-24 15:11:49,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 15:11:49,269 INFO L93 Difference]: Finished difference Result 50 states and 65 transitions. [2020-10-24 15:11:49,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-24 15:11:49,270 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2020-10-24 15:11:49,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 15:11:49,271 INFO L225 Difference]: With dead ends: 50 [2020-10-24 15:11:49,271 INFO L226 Difference]: Without dead ends: 48 [2020-10-24 15:11:49,272 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-24 15:11:49,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2020-10-24 15:11:49,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2020-10-24 15:11:49,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2020-10-24 15:11:49,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 63 transitions. [2020-10-24 15:11:49,279 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 63 transitions. Word has length 21 [2020-10-24 15:11:49,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 15:11:49,279 INFO L481 AbstractCegarLoop]: Abstraction has 48 states and 63 transitions. [2020-10-24 15:11:49,279 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-24 15:11:49,279 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 63 transitions. [2020-10-24 15:11:49,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-10-24 15:11:49,280 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 15:11:49,280 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-10-24 15:11:49,487 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 mathsat -unsat_core_generation=3 [2020-10-24 15:11:49,488 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 15:11:49,489 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 15:11:49,489 INFO L82 PathProgramCache]: Analyzing trace with hash 147544209, now seen corresponding path program 1 times [2020-10-24 15:11:49,490 INFO L162 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-10-24 15:11:49,490 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1001814367] [2020-10-24 15:11:49,490 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-2/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-10-24 15:11:49,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 15:11:49,637 INFO L263 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 12 conjunts are in the unsatisfiable core [2020-10-24 15:11:49,639 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-24 15:11:49,691 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-24 15:11:49,696 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-24 15:11:49,734 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-24 15:11:49,890 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-24 15:11:49,890 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-24 15:11:50,116 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-24 15:11:50,116 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1001814367] [2020-10-24 15:11:50,116 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-24 15:11:50,117 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9, 9] imperfect sequences [] total 15 [2020-10-24 15:11:50,117 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [377390226] [2020-10-24 15:11:50,117 INFO L461 AbstractCegarLoop]: Interpolant automaton has 15 states [2020-10-24 15:11:50,118 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-10-24 15:11:50,118 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2020-10-24 15:11:50,119 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=150, Unknown=0, NotChecked=0, Total=210 [2020-10-24 15:11:50,119 INFO L87 Difference]: Start difference. First operand 48 states and 63 transitions. Second operand 15 states. [2020-10-24 15:11:51,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 15:11:51,092 INFO L93 Difference]: Finished difference Result 136 states and 173 transitions. [2020-10-24 15:11:51,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2020-10-24 15:11:51,093 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 22 [2020-10-24 15:11:51,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 15:11:51,094 INFO L225 Difference]: With dead ends: 136 [2020-10-24 15:11:51,095 INFO L226 Difference]: Without dead ends: 134 [2020-10-24 15:11:51,096 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 128 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=185, Invalid=465, Unknown=0, NotChecked=0, Total=650 [2020-10-24 15:11:51,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2020-10-24 15:11:51,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 61. [2020-10-24 15:11:51,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2020-10-24 15:11:51,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 82 transitions. [2020-10-24 15:11:51,108 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 82 transitions. Word has length 22 [2020-10-24 15:11:51,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 15:11:51,108 INFO L481 AbstractCegarLoop]: Abstraction has 61 states and 82 transitions. [2020-10-24 15:11:51,108 INFO L482 AbstractCegarLoop]: Interpolant automaton has 15 states. [2020-10-24 15:11:51,108 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 82 transitions. [2020-10-24 15:11:51,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-10-24 15:11:51,110 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 15:11:51,110 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, 1, 1] [2020-10-24 15:11:51,331 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 mathsat -unsat_core_generation=3 [2020-10-24 15:11:51,332 INFO L429 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 15:11:51,333 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 15:11:51,333 INFO L82 PathProgramCache]: Analyzing trace with hash 156888005, now seen corresponding path program 1 times [2020-10-24 15:11:51,334 INFO L162 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-10-24 15:11:51,335 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [337216332] [2020-10-24 15:11:51,335 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-2/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-10-24 15:11:51,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 15:11:51,428 INFO L263 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-24 15:11:51,429 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-24 15:11:51,457 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-24 15:11:51,457 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-24 15:11:51,482 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-24 15:11:51,483 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [337216332] [2020-10-24 15:11:51,483 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-24 15:11:51,483 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2020-10-24 15:11:51,483 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [439374107] [2020-10-24 15:11:51,484 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-24 15:11:51,484 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-10-24 15:11:51,485 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-24 15:11:51,485 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-10-24 15:11:51,485 INFO L87 Difference]: Start difference. First operand 61 states and 82 transitions. Second operand 6 states. [2020-10-24 15:11:51,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 15:11:51,588 INFO L93 Difference]: Finished difference Result 113 states and 141 transitions. [2020-10-24 15:11:51,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-24 15:11:51,589 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 24 [2020-10-24 15:11:51,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 15:11:51,591 INFO L225 Difference]: With dead ends: 113 [2020-10-24 15:11:51,591 INFO L226 Difference]: Without dead ends: 99 [2020-10-24 15:11:51,592 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2020-10-24 15:11:51,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2020-10-24 15:11:51,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 63. [2020-10-24 15:11:51,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2020-10-24 15:11:51,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 84 transitions. [2020-10-24 15:11:51,616 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 84 transitions. Word has length 24 [2020-10-24 15:11:51,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 15:11:51,616 INFO L481 AbstractCegarLoop]: Abstraction has 63 states and 84 transitions. [2020-10-24 15:11:51,617 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-24 15:11:51,617 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 84 transitions. [2020-10-24 15:11:51,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-10-24 15:11:51,619 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 15:11:51,620 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, 1, 1] [2020-10-24 15:11:51,833 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 mathsat -unsat_core_generation=3 [2020-10-24 15:11:51,833 INFO L429 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 15:11:51,834 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 15:11:51,835 INFO L82 PathProgramCache]: Analyzing trace with hash 181919584, now seen corresponding path program 1 times [2020-10-24 15:11:51,835 INFO L162 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-10-24 15:11:51,836 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1902014537] [2020-10-24 15:11:51,836 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-2/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-10-24 15:11:51,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 15:11:51,926 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 2 conjunts are in the unsatisfiable core [2020-10-24 15:11:51,928 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-24 15:11:51,940 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-24 15:11:51,940 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-24 15:11:51,942 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-24 15:11:51,942 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1902014537] [2020-10-24 15:11:51,942 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-24 15:11:51,943 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-24 15:11:51,943 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [208221829] [2020-10-24 15:11:51,943 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-24 15:11:51,943 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-10-24 15:11:51,944 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-24 15:11:51,944 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-24 15:11:51,944 INFO L87 Difference]: Start difference. First operand 63 states and 84 transitions. Second operand 3 states. [2020-10-24 15:11:51,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 15:11:51,960 INFO L93 Difference]: Finished difference Result 66 states and 86 transitions. [2020-10-24 15:11:51,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-24 15:11:51,960 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2020-10-24 15:11:51,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 15:11:51,961 INFO L225 Difference]: With dead ends: 66 [2020-10-24 15:11:51,967 INFO L226 Difference]: Without dead ends: 63 [2020-10-24 15:11:51,967 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-24 15:11:51,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2020-10-24 15:11:51,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2020-10-24 15:11:51,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2020-10-24 15:11:51,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 83 transitions. [2020-10-24 15:11:51,977 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 83 transitions. Word has length 24 [2020-10-24 15:11:51,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 15:11:51,977 INFO L481 AbstractCegarLoop]: Abstraction has 63 states and 83 transitions. [2020-10-24 15:11:51,977 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-24 15:11:51,977 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 83 transitions. [2020-10-24 15:11:51,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-10-24 15:11:51,978 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 15:11:51,978 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, 1, 1] [2020-10-24 15:11:52,193 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 mathsat -unsat_core_generation=3 [2020-10-24 15:11:52,194 INFO L429 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 15:11:52,195 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 15:11:52,196 INFO L82 PathProgramCache]: Analyzing trace with hash -1382111440, now seen corresponding path program 1 times [2020-10-24 15:11:52,197 INFO L162 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-10-24 15:11:52,197 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1275090735] [2020-10-24 15:11:52,197 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-2/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-10-24 15:11:52,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 15:11:52,288 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-24 15:11:52,290 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-24 15:11:52,300 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-24 15:11:52,301 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-24 15:11:52,304 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-24 15:11:52,305 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1275090735] [2020-10-24 15:11:52,305 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-24 15:11:52,305 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 4 [2020-10-24 15:11:52,305 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2030605987] [2020-10-24 15:11:52,306 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-24 15:11:52,306 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-10-24 15:11:52,307 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-24 15:11:52,307 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-24 15:11:52,307 INFO L87 Difference]: Start difference. First operand 63 states and 83 transitions. Second operand 4 states. [2020-10-24 15:11:52,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 15:11:52,344 INFO L93 Difference]: Finished difference Result 101 states and 132 transitions. [2020-10-24 15:11:52,352 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-24 15:11:52,352 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 24 [2020-10-24 15:11:52,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 15:11:52,353 INFO L225 Difference]: With dead ends: 101 [2020-10-24 15:11:52,353 INFO L226 Difference]: Without dead ends: 63 [2020-10-24 15:11:52,354 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 44 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-10-24 15:11:52,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2020-10-24 15:11:52,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2020-10-24 15:11:52,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2020-10-24 15:11:52,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 82 transitions. [2020-10-24 15:11:52,371 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 82 transitions. Word has length 24 [2020-10-24 15:11:52,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 15:11:52,371 INFO L481 AbstractCegarLoop]: Abstraction has 63 states and 82 transitions. [2020-10-24 15:11:52,374 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-24 15:11:52,374 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 82 transitions. [2020-10-24 15:11:52,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-10-24 15:11:52,375 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 15:11:52,375 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, 1, 1, 1] [2020-10-24 15:11:52,588 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 mathsat -unsat_core_generation=3 [2020-10-24 15:11:52,589 INFO L429 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 15:11:52,590 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 15:11:52,590 INFO L82 PathProgramCache]: Analyzing trace with hash 1344415000, now seen corresponding path program 1 times [2020-10-24 15:11:52,592 INFO L162 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-10-24 15:11:52,592 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [930289533] [2020-10-24 15:11:52,592 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-2/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-10-24 15:11:52,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 15:11:52,683 INFO L263 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 13 conjunts are in the unsatisfiable core [2020-10-24 15:11:52,685 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-24 15:11:52,713 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-24 15:11:52,715 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-24 15:11:52,742 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-24 15:11:52,798 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-24 15:11:52,826 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-24 15:11:52,826 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-24 15:11:52,846 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 1] term [2020-10-24 15:11:52,850 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-24 15:11:52,923 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-24 15:11:52,923 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [930289533] [2020-10-24 15:11:52,923 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-24 15:11:52,924 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8, 8] imperfect sequences [] total 11 [2020-10-24 15:11:52,924 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1472418000] [2020-10-24 15:11:52,924 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-10-24 15:11:52,924 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-10-24 15:11:52,925 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-10-24 15:11:52,925 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2020-10-24 15:11:52,926 INFO L87 Difference]: Start difference. First operand 63 states and 82 transitions. Second operand 11 states. [2020-10-24 15:11:53,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 15:11:53,572 INFO L93 Difference]: Finished difference Result 97 states and 122 transitions. [2020-10-24 15:11:53,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-10-24 15:11:53,572 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 25 [2020-10-24 15:11:53,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 15:11:53,574 INFO L225 Difference]: With dead ends: 97 [2020-10-24 15:11:53,574 INFO L226 Difference]: Without dead ends: 85 [2020-10-24 15:11:53,575 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=111, Invalid=269, Unknown=0, NotChecked=0, Total=380 [2020-10-24 15:11:53,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2020-10-24 15:11:53,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 76. [2020-10-24 15:11:53,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2020-10-24 15:11:53,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 99 transitions. [2020-10-24 15:11:53,584 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 99 transitions. Word has length 25 [2020-10-24 15:11:53,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 15:11:53,584 INFO L481 AbstractCegarLoop]: Abstraction has 76 states and 99 transitions. [2020-10-24 15:11:53,584 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-10-24 15:11:53,584 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 99 transitions. [2020-10-24 15:11:53,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-10-24 15:11:53,585 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 15:11:53,586 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, 1, 1, 1] [2020-10-24 15:11:53,798 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 mathsat -unsat_core_generation=3 [2020-10-24 15:11:53,799 INFO L429 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 15:11:53,800 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 15:11:53,800 INFO L82 PathProgramCache]: Analyzing trace with hash 1281876129, now seen corresponding path program 1 times [2020-10-24 15:11:53,801 INFO L162 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-10-24 15:11:53,801 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1362636391] [2020-10-24 15:11:53,802 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-2/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-10-24 15:11:53,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 15:11:53,900 INFO L263 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 13 conjunts are in the unsatisfiable core [2020-10-24 15:11:53,903 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-24 15:11:53,924 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-24 15:11:53,929 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-24 15:11:53,951 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-24 15:11:53,994 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-24 15:11:54,034 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-24 15:11:54,034 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-24 15:11:54,153 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-24 15:11:54,154 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1362636391] [2020-10-24 15:11:54,154 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-24 15:11:54,154 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8, 8] imperfect sequences [] total 12 [2020-10-24 15:11:54,155 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1829443746] [2020-10-24 15:11:54,155 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-10-24 15:11:54,156 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-10-24 15:11:54,157 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-10-24 15:11:54,157 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2020-10-24 15:11:54,157 INFO L87 Difference]: Start difference. First operand 76 states and 99 transitions. Second operand 12 states. [2020-10-24 15:11:54,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 15:11:54,593 INFO L93 Difference]: Finished difference Result 78 states and 100 transitions. [2020-10-24 15:11:54,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-10-24 15:11:54,594 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 25 [2020-10-24 15:11:54,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 15:11:54,595 INFO L225 Difference]: With dead ends: 78 [2020-10-24 15:11:54,595 INFO L226 Difference]: Without dead ends: 76 [2020-10-24 15:11:54,596 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=81, Invalid=225, Unknown=0, NotChecked=0, Total=306 [2020-10-24 15:11:54,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2020-10-24 15:11:54,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 75. [2020-10-24 15:11:54,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2020-10-24 15:11:54,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 97 transitions. [2020-10-24 15:11:54,604 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 97 transitions. Word has length 25 [2020-10-24 15:11:54,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 15:11:54,605 INFO L481 AbstractCegarLoop]: Abstraction has 75 states and 97 transitions. [2020-10-24 15:11:54,605 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-10-24 15:11:54,605 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 97 transitions. [2020-10-24 15:11:54,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-10-24 15:11:54,606 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 15:11:54,606 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, 1, 1, 1, 1] [2020-10-24 15:11:54,820 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 mathsat -unsat_core_generation=3 [2020-10-24 15:11:54,822 INFO L429 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 15:11:54,822 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 15:11:54,823 INFO L82 PathProgramCache]: Analyzing trace with hash -144403189, now seen corresponding path program 1 times [2020-10-24 15:11:54,823 INFO L162 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-10-24 15:11:54,824 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1580684144] [2020-10-24 15:11:54,824 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-2/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-10-24 15:11:54,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 15:11:54,933 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 12 conjunts are in the unsatisfiable core [2020-10-24 15:11:54,935 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-24 15:11:54,963 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-24 15:11:55,026 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-24 15:11:55,026 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-24 15:11:55,139 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-24 15:11:55,140 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1580684144] [2020-10-24 15:11:55,140 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-24 15:11:55,140 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7, 7] imperfect sequences [] total 12 [2020-10-24 15:11:55,140 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [366832278] [2020-10-24 15:11:55,141 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-10-24 15:11:55,141 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-10-24 15:11:55,142 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-10-24 15:11:55,142 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2020-10-24 15:11:55,142 INFO L87 Difference]: Start difference. First operand 75 states and 97 transitions. Second operand 12 states. [2020-10-24 15:11:55,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 15:11:55,877 INFO L93 Difference]: Finished difference Result 216 states and 262 transitions. [2020-10-24 15:11:55,878 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2020-10-24 15:11:55,878 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 26 [2020-10-24 15:11:55,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 15:11:55,880 INFO L225 Difference]: With dead ends: 216 [2020-10-24 15:11:55,880 INFO L226 Difference]: Without dead ends: 170 [2020-10-24 15:11:55,881 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=110, Invalid=310, Unknown=0, NotChecked=0, Total=420 [2020-10-24 15:11:55,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2020-10-24 15:11:55,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 86. [2020-10-24 15:11:55,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2020-10-24 15:11:55,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 104 transitions. [2020-10-24 15:11:55,906 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 104 transitions. Word has length 26 [2020-10-24 15:11:55,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 15:11:55,907 INFO L481 AbstractCegarLoop]: Abstraction has 86 states and 104 transitions. [2020-10-24 15:11:55,907 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-10-24 15:11:55,907 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 104 transitions. [2020-10-24 15:11:55,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-10-24 15:11:55,912 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 15:11:55,913 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, 1, 1, 1, 1, 1, 1] [2020-10-24 15:11:56,113 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 mathsat -unsat_core_generation=3 [2020-10-24 15:11:56,114 INFO L429 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 15:11:56,115 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 15:11:56,116 INFO L82 PathProgramCache]: Analyzing trace with hash 1423958792, now seen corresponding path program 1 times [2020-10-24 15:11:56,117 INFO L162 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-10-24 15:11:56,117 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [523229865] [2020-10-24 15:11:56,117 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-2/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-10-24 15:11:56,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 15:11:56,216 INFO L263 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 19 conjunts are in the unsatisfiable core [2020-10-24 15:11:56,218 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-24 15:11:56,250 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-24 15:11:56,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-10-24 15:11:56,515 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-24 15:11:56,670 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-24 15:11:56,670 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [523229865] [2020-10-24 15:11:56,670 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-24 15:11:56,671 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10, 10] imperfect sequences [] total 12 [2020-10-24 15:11:56,671 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [12948319] [2020-10-24 15:11:56,671 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-10-24 15:11:56,671 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-10-24 15:11:56,672 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-10-24 15:11:56,672 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2020-10-24 15:11:56,672 INFO L87 Difference]: Start difference. First operand 86 states and 104 transitions. Second operand 12 states. [2020-10-24 15:11:58,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 15:11:58,229 INFO L93 Difference]: Finished difference Result 308 states and 347 transitions. [2020-10-24 15:11:58,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2020-10-24 15:11:58,230 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 28 [2020-10-24 15:11:58,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 15:11:58,232 INFO L225 Difference]: With dead ends: 308 [2020-10-24 15:11:58,232 INFO L226 Difference]: Without dead ends: 283 [2020-10-24 15:11:58,236 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 40 SyntacticMatches, 4 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 208 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=251, Invalid=805, Unknown=0, NotChecked=0, Total=1056 [2020-10-24 15:11:58,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 283 states. [2020-10-24 15:11:58,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 283 to 86. [2020-10-24 15:11:58,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2020-10-24 15:11:58,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 103 transitions. [2020-10-24 15:11:58,252 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 103 transitions. Word has length 28 [2020-10-24 15:11:58,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 15:11:58,252 INFO L481 AbstractCegarLoop]: Abstraction has 86 states and 103 transitions. [2020-10-24 15:11:58,252 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-10-24 15:11:58,253 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 103 transitions. [2020-10-24 15:11:58,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2020-10-24 15:11:58,255 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 15:11:58,256 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, 1, 1, 1, 1, 1, 1, 1] [2020-10-24 15:11:58,469 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 mathsat -unsat_core_generation=3 [2020-10-24 15:11:58,470 INFO L429 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 15:11:58,471 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 15:11:58,471 INFO L82 PathProgramCache]: Analyzing trace with hash -2092804141, now seen corresponding path program 1 times [2020-10-24 15:11:58,472 INFO L162 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-10-24 15:11:58,472 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [966150634] [2020-10-24 15:11:58,472 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-2/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-10-24 15:11:58,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 15:11:58,573 INFO L263 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-24 15:11:58,574 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-24 15:11:58,585 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-24 15:11:58,585 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-24 15:11:58,588 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-24 15:11:58,588 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [966150634] [2020-10-24 15:11:58,588 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-24 15:11:58,588 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 4 [2020-10-24 15:11:58,589 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [838941776] [2020-10-24 15:11:58,589 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-24 15:11:58,589 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-10-24 15:11:58,590 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-24 15:11:58,590 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-24 15:11:58,590 INFO L87 Difference]: Start difference. First operand 86 states and 103 transitions. Second operand 4 states. [2020-10-24 15:11:58,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 15:11:58,636 INFO L93 Difference]: Finished difference Result 122 states and 146 transitions. [2020-10-24 15:11:58,637 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-24 15:11:58,637 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 29 [2020-10-24 15:11:58,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 15:11:58,638 INFO L225 Difference]: With dead ends: 122 [2020-10-24 15:11:58,638 INFO L226 Difference]: Without dead ends: 71 [2020-10-24 15:11:58,641 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 54 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-10-24 15:11:58,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2020-10-24 15:11:58,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 58. [2020-10-24 15:11:58,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2020-10-24 15:11:58,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 68 transitions. [2020-10-24 15:11:58,650 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 68 transitions. Word has length 29 [2020-10-24 15:11:58,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 15:11:58,651 INFO L481 AbstractCegarLoop]: Abstraction has 58 states and 68 transitions. [2020-10-24 15:11:58,651 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-24 15:11:58,651 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 68 transitions. [2020-10-24 15:11:58,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2020-10-24 15:11:58,652 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 15:11:58,652 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, 1, 1, 1, 1, 1, 1, 1] [2020-10-24 15:11:58,865 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 mathsat -unsat_core_generation=3 [2020-10-24 15:11:58,865 INFO L429 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 15:11:58,866 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 15:11:58,867 INFO L82 PathProgramCache]: Analyzing trace with hash 2108438977, now seen corresponding path program 1 times [2020-10-24 15:11:58,868 INFO L162 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-10-24 15:11:58,868 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1971999257] [2020-10-24 15:11:58,868 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-2/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-10-24 15:11:58,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 15:11:58,983 INFO L263 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 12 conjunts are in the unsatisfiable core [2020-10-24 15:11:58,985 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-24 15:11:59,015 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-24 15:11:59,054 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-24 15:11:59,092 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-24 15:11:59,092 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-24 15:11:59,159 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-24 15:11:59,160 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1971999257] [2020-10-24 15:11:59,160 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-24 15:11:59,160 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7, 7] imperfect sequences [] total 10 [2020-10-24 15:11:59,161 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1494427555] [2020-10-24 15:11:59,161 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-10-24 15:11:59,161 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-10-24 15:11:59,162 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-10-24 15:11:59,162 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2020-10-24 15:11:59,162 INFO L87 Difference]: Start difference. First operand 58 states and 68 transitions. Second operand 10 states. [2020-10-24 15:11:59,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 15:11:59,434 INFO L93 Difference]: Finished difference Result 70 states and 80 transitions. [2020-10-24 15:11:59,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-10-24 15:11:59,434 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 29 [2020-10-24 15:11:59,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 15:11:59,435 INFO L225 Difference]: With dead ends: 70 [2020-10-24 15:11:59,435 INFO L226 Difference]: Without dead ends: 43 [2020-10-24 15:11:59,436 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2020-10-24 15:11:59,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2020-10-24 15:11:59,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 42. [2020-10-24 15:11:59,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2020-10-24 15:11:59,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 51 transitions. [2020-10-24 15:11:59,445 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 51 transitions. Word has length 29 [2020-10-24 15:11:59,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 15:11:59,445 INFO L481 AbstractCegarLoop]: Abstraction has 42 states and 51 transitions. [2020-10-24 15:11:59,445 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-10-24 15:11:59,445 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 51 transitions. [2020-10-24 15:11:59,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2020-10-24 15:11:59,447 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 15:11:59,448 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-24 15:11:59,664 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 mathsat -unsat_core_generation=3 [2020-10-24 15:11:59,664 INFO L429 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 15:11:59,665 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 15:11:59,665 INFO L82 PathProgramCache]: Analyzing trace with hash 489956430, now seen corresponding path program 1 times [2020-10-24 15:11:59,666 INFO L162 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-10-24 15:11:59,667 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [589091927] [2020-10-24 15:11:59,667 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-2/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-10-24 15:11:59,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 15:11:59,803 INFO L263 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 13 conjunts are in the unsatisfiable core [2020-10-24 15:11:59,808 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-24 15:11:59,827 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-24 15:11:59,828 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-24 15:11:59,849 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-24 15:11:59,927 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-24 15:11:59,927 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-24 15:12:00,081 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-24 15:12:00,081 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [589091927] [2020-10-24 15:12:00,081 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-24 15:12:00,081 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8, 8] imperfect sequences [] total 14 [2020-10-24 15:12:00,082 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [416528294] [2020-10-24 15:12:00,082 INFO L461 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-10-24 15:12:00,082 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-10-24 15:12:00,083 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-10-24 15:12:00,084 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2020-10-24 15:12:00,084 INFO L87 Difference]: Start difference. First operand 42 states and 51 transitions. Second operand 14 states. [2020-10-24 15:12:00,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 15:12:00,734 INFO L93 Difference]: Finished difference Result 58 states and 68 transitions. [2020-10-24 15:12:00,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-10-24 15:12:00,735 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 32 [2020-10-24 15:12:00,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 15:12:00,736 INFO L225 Difference]: With dead ends: 58 [2020-10-24 15:12:00,737 INFO L226 Difference]: Without dead ends: 43 [2020-10-24 15:12:00,738 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=113, Invalid=349, Unknown=0, NotChecked=0, Total=462 [2020-10-24 15:12:00,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2020-10-24 15:12:00,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 40. [2020-10-24 15:12:00,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2020-10-24 15:12:00,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 44 transitions. [2020-10-24 15:12:00,748 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 44 transitions. Word has length 32 [2020-10-24 15:12:00,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 15:12:00,748 INFO L481 AbstractCegarLoop]: Abstraction has 40 states and 44 transitions. [2020-10-24 15:12:00,749 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-10-24 15:12:00,749 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 44 transitions. [2020-10-24 15:12:00,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2020-10-24 15:12:00,750 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 15:12:00,751 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-24 15:12:00,968 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 mathsat -unsat_core_generation=3 [2020-10-24 15:12:00,969 INFO L429 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 15:12:00,970 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 15:12:00,970 INFO L82 PathProgramCache]: Analyzing trace with hash -1654102483, now seen corresponding path program 1 times [2020-10-24 15:12:00,971 INFO L162 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-10-24 15:12:00,971 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1260676522] [2020-10-24 15:12:00,971 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 17 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with mathsat -unsat_core_generation=3 [2020-10-24 15:12:01,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 15:12:01,093 INFO L263 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 9 conjunts are in the unsatisfiable core [2020-10-24 15:12:01,095 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-24 15:12:01,185 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-24 15:12:01,185 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-24 15:12:01,343 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-24 15:12:01,343 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1260676522] [2020-10-24 15:12:01,344 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-24 15:12:01,344 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7, 7] imperfect sequences [] total 12 [2020-10-24 15:12:01,344 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1024893320] [2020-10-24 15:12:01,344 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-10-24 15:12:01,345 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-10-24 15:12:01,345 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-10-24 15:12:01,346 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2020-10-24 15:12:01,346 INFO L87 Difference]: Start difference. First operand 40 states and 44 transitions. Second operand 12 states. [2020-10-24 15:12:01,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 15:12:01,746 INFO L93 Difference]: Finished difference Result 83 states and 89 transitions. [2020-10-24 15:12:01,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-10-24 15:12:01,746 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 33 [2020-10-24 15:12:01,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 15:12:01,748 INFO L225 Difference]: With dead ends: 83 [2020-10-24 15:12:01,748 INFO L226 Difference]: Without dead ends: 63 [2020-10-24 15:12:01,748 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=90, Invalid=252, Unknown=0, NotChecked=0, Total=342 [2020-10-24 15:12:01,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2020-10-24 15:12:01,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 40. [2020-10-24 15:12:01,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2020-10-24 15:12:01,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 43 transitions. [2020-10-24 15:12:01,759 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 43 transitions. Word has length 33 [2020-10-24 15:12:01,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 15:12:01,759 INFO L481 AbstractCegarLoop]: Abstraction has 40 states and 43 transitions. [2020-10-24 15:12:01,759 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-10-24 15:12:01,759 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 43 transitions. [2020-10-24 15:12:01,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2020-10-24 15:12:01,760 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 15:12:01,761 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-24 15:12:01,961 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 mathsat -unsat_core_generation=3 [2020-10-24 15:12:01,962 INFO L429 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 15:12:01,963 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 15:12:01,964 INFO L82 PathProgramCache]: Analyzing trace with hash 798574185, now seen corresponding path program 1 times [2020-10-24 15:12:01,964 INFO L162 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-10-24 15:12:01,965 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1751591353] [2020-10-24 15:12:01,965 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 18 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with mathsat -unsat_core_generation=3 [2020-10-24 15:12:02,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 15:12:02,073 INFO L263 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-24 15:12:02,074 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-24 15:12:02,086 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-24 15:12:02,086 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-24 15:12:02,092 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-24 15:12:02,093 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1751591353] [2020-10-24 15:12:02,094 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-24 15:12:02,094 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 4 [2020-10-24 15:12:02,095 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1188042212] [2020-10-24 15:12:02,095 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-24 15:12:02,095 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-10-24 15:12:02,096 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-24 15:12:02,096 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-24 15:12:02,098 INFO L87 Difference]: Start difference. First operand 40 states and 43 transitions. Second operand 4 states. [2020-10-24 15:12:02,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 15:12:02,121 INFO L93 Difference]: Finished difference Result 40 states and 43 transitions. [2020-10-24 15:12:02,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-24 15:12:02,122 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 35 [2020-10-24 15:12:02,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 15:12:02,122 INFO L225 Difference]: With dead ends: 40 [2020-10-24 15:12:02,122 INFO L226 Difference]: Without dead ends: 0 [2020-10-24 15:12:02,122 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 66 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-10-24 15:12:02,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-10-24 15:12:02,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-10-24 15:12:02,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-10-24 15:12:02,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-10-24 15:12:02,125 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 35 [2020-10-24 15:12:02,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 15:12:02,125 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-10-24 15:12:02,125 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-24 15:12:02,125 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-10-24 15:12:02,125 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-10-24 15:12:02,326 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 mathsat -unsat_core_generation=3 [2020-10-24 15:12:02,330 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-10-24 15:12:02,582 WARN L193 SmtUtils]: Spent 247.00 ms on a formula simplification. DAG size of input: 126 DAG size of output: 78 [2020-10-24 15:12:03,341 WARN L193 SmtUtils]: Spent 370.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 55 [2020-10-24 15:12:03,864 WARN L193 SmtUtils]: Spent 521.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 62 [2020-10-24 15:12:04,384 WARN L193 SmtUtils]: Spent 426.00 ms on a formula simplification. DAG size of input: 123 DAG size of output: 55 [2020-10-24 15:12:04,517 WARN L193 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 46 [2020-10-24 15:12:04,746 WARN L193 SmtUtils]: Spent 226.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 62 [2020-10-24 15:12:05,041 WARN L193 SmtUtils]: Spent 293.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 56 [2020-10-24 15:12:05,397 WARN L193 SmtUtils]: Spent 355.00 ms on a formula simplification. DAG size of input: 127 DAG size of output: 61 [2020-10-24 15:12:05,567 WARN L193 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 43 [2020-10-24 15:12:05,685 INFO L274 CegarLoopResult]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION(line 3) no Hoare annotation was computed. [2020-10-24 15:12:05,685 INFO L274 CegarLoopResult]: For program point L69(line 69) no Hoare annotation was computed. [2020-10-24 15:12:05,686 INFO L274 CegarLoopResult]: For program point L36(lines 36 42) no Hoare annotation was computed. [2020-10-24 15:12:05,686 INFO L274 CegarLoopResult]: For program point L69-2(line 69) no Hoare annotation was computed. [2020-10-24 15:12:05,686 INFO L274 CegarLoopResult]: For program point L36-1(lines 36 42) no Hoare annotation was computed. [2020-10-24 15:12:05,686 INFO L274 CegarLoopResult]: For program point L3(line 3) no Hoare annotation was computed. [2020-10-24 15:12:05,686 INFO L274 CegarLoopResult]: For program point L69-3(lines 69 70) no Hoare annotation was computed. [2020-10-24 15:12:05,686 INFO L274 CegarLoopResult]: For program point L3-1(line 3) no Hoare annotation was computed. [2020-10-24 15:12:05,686 INFO L274 CegarLoopResult]: For program point L3-2(line 3) no Hoare annotation was computed. [2020-10-24 15:12:05,686 INFO L274 CegarLoopResult]: For program point L69-5(lines 69 85) no Hoare annotation was computed. [2020-10-24 15:12:05,686 INFO L274 CegarLoopResult]: For program point L3-3(line 3) no Hoare annotation was computed. [2020-10-24 15:12:05,686 INFO L274 CegarLoopResult]: For program point L69-7(lines 69 85) no Hoare annotation was computed. [2020-10-24 15:12:05,687 INFO L274 CegarLoopResult]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2020-10-24 15:12:05,687 INFO L274 CegarLoopResult]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2020-10-24 15:12:05,687 INFO L274 CegarLoopResult]: For program point L53(line 53) no Hoare annotation was computed. [2020-10-24 15:12:05,687 INFO L274 CegarLoopResult]: For program point L53-2(line 53) no Hoare annotation was computed. [2020-10-24 15:12:05,687 INFO L270 CegarLoopResult]: At program point L53-3(lines 45 54) the Hoare annotation is: (let ((.cse3 (let ((.cse5 (fp ((_ extract 31 31) ULTIMATE.start_main_~y~0) ((_ extract 30 23) ULTIMATE.start_main_~y~0) ((_ extract 22 0) ULTIMATE.start_main_~y~0)))) (fp.eq .cse5 .cse5)))) (or (let ((.cse0 (fp ((_ extract 31 31) ULTIMATE.start_main_~x~0) ((_ extract 30 23) ULTIMATE.start_main_~x~0) ((_ extract 22 0) ULTIMATE.start_main_~x~0)))) (and (fp.eq (fp ((_ extract 31 31) ULTIMATE.start_fmax_float_~x) ((_ extract 30 23) ULTIMATE.start_fmax_float_~x) ((_ extract 22 0) ULTIMATE.start_fmax_float_~x)) .cse0) (not (let ((.cse1 (fp ((_ extract 31 31) ULTIMATE.start___fpclassify_float_~w~0) ((_ extract 30 23) ULTIMATE.start___fpclassify_float_~w~0) ((_ extract 22 0) ULTIMATE.start___fpclassify_float_~w~0)))) (fp.eq .cse1 .cse1))) (fp.eq (fp ((_ extract 31 31) |ULTIMATE.start_fmax_float_#res|) ((_ extract 30 23) |ULTIMATE.start_fmax_float_#res|) ((_ extract 22 0) |ULTIMATE.start_fmax_float_#res|)) .cse0) (not (let ((.cse2 (fp ((_ extract 31 31) ULTIMATE.start_fmax_float_~y) ((_ extract 30 23) ULTIMATE.start_fmax_float_~y) ((_ extract 22 0) ULTIMATE.start_fmax_float_~y)))) (fp.eq .cse2 .cse2))) (not .cse3) (= (_ bv1 32) |ULTIMATE.start_isnan_float_#res|) (not (let ((.cse4 (fp ((_ extract 31 31) ULTIMATE.start___fpclassify_float_~x) ((_ extract 30 23) ULTIMATE.start___fpclassify_float_~x) ((_ extract 22 0) ULTIMATE.start___fpclassify_float_~x)))) (fp.eq .cse4 .cse4))))) (and (= |ULTIMATE.start_fmax_float_#res| ULTIMATE.start_main_~y~0) (= (_ bv0 32) |ULTIMATE.start_isnan_float_#res|) .cse3 (= ULTIMATE.start_main_~y~0 ULTIMATE.start_fmax_float_~y)))) [2020-10-24 15:12:05,688 INFO L274 CegarLoopResult]: For program point L70(line 70) no Hoare annotation was computed. [2020-10-24 15:12:05,688 INFO L274 CegarLoopResult]: For program point L70-2(line 70) no Hoare annotation was computed. [2020-10-24 15:12:05,688 INFO L277 CegarLoopResult]: At program point L87(lines 59 88) the Hoare annotation is: true [2020-10-24 15:12:05,688 INFO L274 CegarLoopResult]: For program point L46(lines 46 48) no Hoare annotation was computed. [2020-10-24 15:12:05,688 INFO L274 CegarLoopResult]: For program point L39(lines 39 42) no Hoare annotation was computed. [2020-10-24 15:12:05,688 INFO L274 CegarLoopResult]: For program point L39-1(lines 39 42) no Hoare annotation was computed. [2020-10-24 15:12:05,689 INFO L274 CegarLoopResult]: For program point L81(line 81) no Hoare annotation was computed. [2020-10-24 15:12:05,689 INFO L274 CegarLoopResult]: For program point L81-2(lines 81 84) no Hoare annotation was computed. [2020-10-24 15:12:05,689 INFO L274 CegarLoopResult]: For program point L-1(line -1) no Hoare annotation was computed. [2020-10-24 15:12:05,689 INFO L270 CegarLoopResult]: At program point L57(line 57) the Hoare annotation is: (let ((.cse0 (let ((.cse1 (fp ((_ extract 31 31) ULTIMATE.start_main_~x~0) ((_ extract 30 23) ULTIMATE.start_main_~x~0) ((_ extract 22 0) ULTIMATE.start_main_~x~0)))) (fp.eq .cse1 .cse1)))) (or (and (not .cse0) (= (_ bv1 32) |ULTIMATE.start_isnan_float_#res|)) (and .cse0 (= (_ bv0 32) |ULTIMATE.start_isnan_float_#res|)))) [2020-10-24 15:12:05,690 INFO L270 CegarLoopResult]: At program point L57-1(line 57) the Hoare annotation is: (and (not (let ((.cse0 (fp ((_ extract 31 31) ULTIMATE.start_main_~x~0) ((_ extract 30 23) ULTIMATE.start_main_~x~0) ((_ extract 22 0) ULTIMATE.start_main_~x~0)))) (fp.eq .cse0 .cse0))) |ULTIMATE.start_main_#t~short17| (let ((.cse1 (let ((.cse2 (fp ((_ extract 31 31) ULTIMATE.start_main_~y~0) ((_ extract 30 23) ULTIMATE.start_main_~y~0) ((_ extract 22 0) ULTIMATE.start_main_~y~0)))) (fp.eq .cse2 .cse2)))) (or (and (not .cse1) (= (_ bv1 32) |ULTIMATE.start_isnan_float_#res|)) (and (= (_ bv0 32) |ULTIMATE.start_isnan_float_#res|) .cse1)))) [2020-10-24 15:12:05,690 INFO L274 CegarLoopResult]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 3) no Hoare annotation was computed. [2020-10-24 15:12:05,690 INFO L270 CegarLoopResult]: At program point L57-2(line 57) the Hoare annotation is: (let ((.cse2 (not |ULTIMATE.start_main_#t~short17|))) (let ((.cse1 (let ((.cse5 (fp ((_ extract 31 31) ULTIMATE.start_main_~x~0) ((_ extract 30 23) ULTIMATE.start_main_~x~0) ((_ extract 22 0) ULTIMATE.start_main_~x~0)))) (fp.eq .cse5 .cse5))) (.cse0 (let ((.cse3 (not |ULTIMATE.start_main_#t~short21|))) (or (and .cse3 .cse2) (and .cse3 (let ((.cse4 (fp ((_ extract 31 31) ULTIMATE.start_main_~y~0) ((_ extract 30 23) ULTIMATE.start_main_~y~0) ((_ extract 22 0) ULTIMATE.start_main_~y~0)))) (fp.eq .cse4 .cse4))))))) (or (and .cse0 .cse1 (= (_ bv0 32) |ULTIMATE.start_isnan_float_#res|) .cse2) (and (not .cse1) .cse0 (= (_ bv1 32) |ULTIMATE.start_isnan_float_#res|))))) [2020-10-24 15:12:05,690 INFO L270 CegarLoopResult]: At program point L57-3(line 57) the Hoare annotation is: (and (not |ULTIMATE.start_main_#t~short21|) (let ((.cse0 (fp ((_ extract 31 31) ULTIMATE.start_main_~x~0) ((_ extract 30 23) ULTIMATE.start_main_~x~0) ((_ extract 22 0) ULTIMATE.start_main_~x~0)))) (fp.eq .cse0 .cse0)) (not |ULTIMATE.start_main_#t~short17|) (let ((.cse1 (let ((.cse2 (fp ((_ extract 31 31) ULTIMATE.start_main_~y~0) ((_ extract 30 23) ULTIMATE.start_main_~y~0) ((_ extract 22 0) ULTIMATE.start_main_~y~0)))) (fp.eq .cse2 .cse2)))) (or (and (not .cse1) (= (_ bv1 32) |ULTIMATE.start_isnan_float_#res|)) (and (= (_ bv0 32) |ULTIMATE.start_isnan_float_#res|) .cse1)))) [2020-10-24 15:12:05,690 INFO L270 CegarLoopResult]: At program point L57-4(line 57) the Hoare annotation is: (let ((.cse3 (let ((.cse5 (fp ((_ extract 31 31) ULTIMATE.start_main_~y~0) ((_ extract 30 23) ULTIMATE.start_main_~y~0) ((_ extract 22 0) ULTIMATE.start_main_~y~0)))) (fp.eq .cse5 .cse5)))) (or (let ((.cse0 (fp ((_ extract 31 31) ULTIMATE.start_main_~x~0) ((_ extract 30 23) ULTIMATE.start_main_~x~0) ((_ extract 22 0) ULTIMATE.start_main_~x~0)))) (and (fp.eq (fp ((_ extract 31 31) ULTIMATE.start_fmax_float_~x) ((_ extract 30 23) ULTIMATE.start_fmax_float_~x) ((_ extract 22 0) ULTIMATE.start_fmax_float_~x)) .cse0) (not (let ((.cse1 (fp ((_ extract 31 31) ULTIMATE.start___fpclassify_float_~w~0) ((_ extract 30 23) ULTIMATE.start___fpclassify_float_~w~0) ((_ extract 22 0) ULTIMATE.start___fpclassify_float_~w~0)))) (fp.eq .cse1 .cse1))) (fp.eq (fp ((_ extract 31 31) ULTIMATE.start_main_~res~0) ((_ extract 30 23) ULTIMATE.start_main_~res~0) ((_ extract 22 0) ULTIMATE.start_main_~res~0)) .cse0) (fp.eq (fp ((_ extract 31 31) |ULTIMATE.start_fmax_float_#res|) ((_ extract 30 23) |ULTIMATE.start_fmax_float_#res|) ((_ extract 22 0) |ULTIMATE.start_fmax_float_#res|)) .cse0) (= (_ bv0 32) |ULTIMATE.start_isnan_float_#res|) (not (let ((.cse2 (fp ((_ extract 31 31) ULTIMATE.start_fmax_float_~y) ((_ extract 30 23) ULTIMATE.start_fmax_float_~y) ((_ extract 22 0) ULTIMATE.start_fmax_float_~y)))) (fp.eq .cse2 .cse2))) (not .cse3) (not (let ((.cse4 (fp ((_ extract 31 31) ULTIMATE.start___fpclassify_float_~x) ((_ extract 30 23) ULTIMATE.start___fpclassify_float_~x) ((_ extract 22 0) ULTIMATE.start___fpclassify_float_~x)))) (fp.eq .cse4 .cse4))))) (and (= |ULTIMATE.start_fmax_float_#res| ULTIMATE.start_main_~y~0) .cse3 (= ULTIMATE.start_main_~res~0 ULTIMATE.start_main_~y~0) (= ULTIMATE.start_main_~y~0 ULTIMATE.start_fmax_float_~y)))) [2020-10-24 15:12:05,691 INFO L270 CegarLoopResult]: At program point L57-5(line 57) the Hoare annotation is: (let ((.cse2 (let ((.cse5 (fp ((_ extract 31 31) ULTIMATE.start_main_~y~0) ((_ extract 30 23) ULTIMATE.start_main_~y~0) ((_ extract 22 0) ULTIMATE.start_main_~y~0)))) (fp.eq .cse5 .cse5)))) (or (let ((.cse0 (fp ((_ extract 31 31) ULTIMATE.start_main_~x~0) ((_ extract 30 23) ULTIMATE.start_main_~x~0) ((_ extract 22 0) ULTIMATE.start_main_~x~0)))) (and (fp.eq (fp ((_ extract 31 31) ULTIMATE.start_fmax_float_~x) ((_ extract 30 23) ULTIMATE.start_fmax_float_~x) ((_ extract 22 0) ULTIMATE.start_fmax_float_~x)) .cse0) (not (let ((.cse1 (fp ((_ extract 31 31) ULTIMATE.start___fpclassify_float_~w~0) ((_ extract 30 23) ULTIMATE.start___fpclassify_float_~w~0) ((_ extract 22 0) ULTIMATE.start___fpclassify_float_~w~0)))) (fp.eq .cse1 .cse1))) (fp.eq (fp ((_ extract 31 31) ULTIMATE.start_main_~res~0) ((_ extract 30 23) ULTIMATE.start_main_~res~0) ((_ extract 22 0) ULTIMATE.start_main_~res~0)) .cse0) (fp.eq (fp ((_ extract 31 31) |ULTIMATE.start_fmax_float_#res|) ((_ extract 30 23) |ULTIMATE.start_fmax_float_#res|) ((_ extract 22 0) |ULTIMATE.start_fmax_float_#res|)) .cse0) (not .cse2) (not (let ((.cse3 (fp ((_ extract 31 31) ULTIMATE.start_fmax_float_~y) ((_ extract 30 23) ULTIMATE.start_fmax_float_~y) ((_ extract 22 0) ULTIMATE.start_fmax_float_~y)))) (fp.eq .cse3 .cse3))) (= (_ bv1 32) |ULTIMATE.start_isnan_float_#res|) (not (let ((.cse4 (fp ((_ extract 31 31) ULTIMATE.start___fpclassify_float_~x) ((_ extract 30 23) ULTIMATE.start___fpclassify_float_~x) ((_ extract 22 0) ULTIMATE.start___fpclassify_float_~x)))) (fp.eq .cse4 .cse4))))) (and (= |ULTIMATE.start_fmax_float_#res| ULTIMATE.start_main_~y~0) (= (_ bv0 32) |ULTIMATE.start_isnan_float_#res|) .cse2 (= ULTIMATE.start_main_~res~0 ULTIMATE.start_main_~y~0) (= ULTIMATE.start_main_~y~0 ULTIMATE.start_fmax_float_~y)))) [2020-10-24 15:12:05,691 INFO L270 CegarLoopResult]: At program point L57-6(line 57) the Hoare annotation is: (or (let ((.cse0 (fp ((_ extract 31 31) ULTIMATE.start_main_~y~0) ((_ extract 30 23) ULTIMATE.start_main_~y~0) ((_ extract 22 0) ULTIMATE.start_main_~y~0)))) (fp.eq .cse0 .cse0)) (let ((.cse1 (fp ((_ extract 31 31) ULTIMATE.start_main_~x~0) ((_ extract 30 23) ULTIMATE.start_main_~x~0) ((_ extract 22 0) ULTIMATE.start_main_~x~0)))) (and (fp.eq (fp ((_ extract 31 31) ULTIMATE.start_fmax_float_~x) ((_ extract 30 23) ULTIMATE.start_fmax_float_~x) ((_ extract 22 0) ULTIMATE.start_fmax_float_~x)) .cse1) (not (let ((.cse2 (fp ((_ extract 31 31) ULTIMATE.start___fpclassify_float_~w~0) ((_ extract 30 23) ULTIMATE.start___fpclassify_float_~w~0) ((_ extract 22 0) ULTIMATE.start___fpclassify_float_~w~0)))) (fp.eq .cse2 .cse2))) (fp.eq (fp ((_ extract 31 31) ULTIMATE.start_main_~res~0) ((_ extract 30 23) ULTIMATE.start_main_~res~0) ((_ extract 22 0) ULTIMATE.start_main_~res~0)) .cse1) (fp.eq (fp ((_ extract 31 31) |ULTIMATE.start_fmax_float_#res|) ((_ extract 30 23) |ULTIMATE.start_fmax_float_#res|) ((_ extract 22 0) |ULTIMATE.start_fmax_float_#res|)) .cse1) (= (_ bv0 32) |ULTIMATE.start_isnan_float_#res|) (not (let ((.cse3 (fp ((_ extract 31 31) ULTIMATE.start_fmax_float_~y) ((_ extract 30 23) ULTIMATE.start_fmax_float_~y) ((_ extract 22 0) ULTIMATE.start_fmax_float_~y)))) (fp.eq .cse3 .cse3))) (not (let ((.cse4 (fp ((_ extract 31 31) ULTIMATE.start___fpclassify_float_~x) ((_ extract 30 23) ULTIMATE.start___fpclassify_float_~x) ((_ extract 22 0) ULTIMATE.start___fpclassify_float_~x)))) (fp.eq .cse4 .cse4)))))) [2020-10-24 15:12:05,691 INFO L270 CegarLoopResult]: At program point L57-7(line 57) the Hoare annotation is: (let ((.cse0 (let ((.cse6 (fp ((_ extract 31 31) ULTIMATE.start_main_~y~0) ((_ extract 30 23) ULTIMATE.start_main_~y~0) ((_ extract 22 0) ULTIMATE.start_main_~y~0)))) (fp.eq .cse6 .cse6)))) (let ((.cse1 (or (and (not .cse0) (= (_ bv1 32) |ULTIMATE.start_isnan_float_#res|)) (and (= (_ bv0 32) |ULTIMATE.start_isnan_float_#res|) .cse0)))) (or (and .cse0 .cse1) (let ((.cse2 (fp ((_ extract 31 31) ULTIMATE.start_main_~x~0) ((_ extract 30 23) ULTIMATE.start_main_~x~0) ((_ extract 22 0) ULTIMATE.start_main_~x~0)))) (and (fp.eq (fp ((_ extract 31 31) ULTIMATE.start_fmax_float_~x) ((_ extract 30 23) ULTIMATE.start_fmax_float_~x) ((_ extract 22 0) ULTIMATE.start_fmax_float_~x)) .cse2) (not (let ((.cse3 (fp ((_ extract 31 31) ULTIMATE.start___fpclassify_float_~w~0) ((_ extract 30 23) ULTIMATE.start___fpclassify_float_~w~0) ((_ extract 22 0) ULTIMATE.start___fpclassify_float_~w~0)))) (fp.eq .cse3 .cse3))) (fp.eq (fp ((_ extract 31 31) ULTIMATE.start_main_~res~0) ((_ extract 30 23) ULTIMATE.start_main_~res~0) ((_ extract 22 0) ULTIMATE.start_main_~res~0)) .cse2) (fp.eq (fp ((_ extract 31 31) |ULTIMATE.start_fmax_float_#res|) ((_ extract 30 23) |ULTIMATE.start_fmax_float_#res|) ((_ extract 22 0) |ULTIMATE.start_fmax_float_#res|)) .cse2) (not (let ((.cse4 (fp ((_ extract 31 31) ULTIMATE.start_fmax_float_~y) ((_ extract 30 23) ULTIMATE.start_fmax_float_~y) ((_ extract 22 0) ULTIMATE.start_fmax_float_~y)))) (fp.eq .cse4 .cse4))) (not (let ((.cse5 (fp ((_ extract 31 31) ULTIMATE.start___fpclassify_float_~x) ((_ extract 30 23) ULTIMATE.start___fpclassify_float_~x) ((_ extract 22 0) ULTIMATE.start___fpclassify_float_~x)))) (fp.eq .cse5 .cse5))) .cse1))))) [2020-10-24 15:12:05,691 INFO L274 CegarLoopResult]: For program point L33(lines 33 42) no Hoare annotation was computed. [2020-10-24 15:12:05,691 INFO L274 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2020-10-24 15:12:05,692 INFO L274 CegarLoopResult]: For program point L33-1(lines 33 42) no Hoare annotation was computed. [2020-10-24 15:12:05,692 INFO L274 CegarLoopResult]: For program point L25-1(lines 25 29) no Hoare annotation was computed. [2020-10-24 15:12:05,692 INFO L270 CegarLoopResult]: At program point L25-2(lines 25 29) the Hoare annotation is: (let ((.cse1 (let ((.cse7 (fp ((_ extract 31 31) ULTIMATE.start_main_~y~0) ((_ extract 30 23) ULTIMATE.start_main_~y~0) ((_ extract 22 0) ULTIMATE.start_main_~y~0)))) (fp.eq .cse7 .cse7)))) (let ((.cse4 (not .cse1))) (let ((.cse2 (let ((.cse6 (fp ((_ extract 31 31) ULTIMATE.start___fpclassify_float_~x) ((_ extract 30 23) ULTIMATE.start___fpclassify_float_~x) ((_ extract 22 0) ULTIMATE.start___fpclassify_float_~x)))) (fp.eq .cse6 .cse6))) (.cse3 (or (and .cse4 (= (_ bv1 32) |ULTIMATE.start_isnan_float_#res|)) (and (= (_ bv0 32) |ULTIMATE.start_isnan_float_#res|) .cse1)))) (or (and (not (let ((.cse0 (fp ((_ extract 31 31) ULTIMATE.start_main_~x~0) ((_ extract 30 23) ULTIMATE.start_main_~x~0) ((_ extract 22 0) ULTIMATE.start_main_~x~0)))) (fp.eq .cse0 .cse0))) .cse1 (= ULTIMATE.start_main_~y~0 ULTIMATE.start_fmax_float_~y) (not .cse2) .cse3) (and (= ULTIMATE.start___fpclassify_float_~x ULTIMATE.start_fmax_float_~x) .cse4 (not (let ((.cse5 (fp ((_ extract 31 31) ULTIMATE.start_fmax_float_~y) ((_ extract 30 23) ULTIMATE.start_fmax_float_~y) ((_ extract 22 0) ULTIMATE.start_fmax_float_~y)))) (fp.eq .cse5 .cse5))) (= ULTIMATE.start_main_~x~0 ULTIMATE.start_fmax_float_~x) .cse2 .cse3))))) [2020-10-24 15:12:05,692 INFO L274 CegarLoopResult]: For program point L25-3(lines 22 43) no Hoare annotation was computed. [2020-10-24 15:12:05,692 INFO L274 CegarLoopResult]: For program point L25-5(lines 25 29) no Hoare annotation was computed. [2020-10-24 15:12:05,693 INFO L270 CegarLoopResult]: At program point L25-6(lines 25 29) the Hoare annotation is: (and (fp.eq (fp ((_ extract 31 31) ULTIMATE.start_fmax_float_~x) ((_ extract 30 23) ULTIMATE.start_fmax_float_~x) ((_ extract 22 0) ULTIMATE.start_fmax_float_~x)) (fp ((_ extract 31 31) ULTIMATE.start_main_~x~0) ((_ extract 30 23) ULTIMATE.start_main_~x~0) ((_ extract 22 0) ULTIMATE.start_main_~x~0))) (not (let ((.cse0 (fp ((_ extract 31 31) ULTIMATE.start_main_~y~0) ((_ extract 30 23) ULTIMATE.start_main_~y~0) ((_ extract 22 0) ULTIMATE.start_main_~y~0)))) (fp.eq .cse0 .cse0))) (not (let ((.cse1 (fp ((_ extract 31 31) ULTIMATE.start_fmax_float_~y) ((_ extract 30 23) ULTIMATE.start_fmax_float_~y) ((_ extract 22 0) ULTIMATE.start_fmax_float_~y)))) (fp.eq .cse1 .cse1))) (= (_ bv1 32) |ULTIMATE.start_isnan_float_#res|) (not (let ((.cse2 (fp ((_ extract 31 31) ULTIMATE.start___fpclassify_float_~x) ((_ extract 30 23) ULTIMATE.start___fpclassify_float_~x) ((_ extract 22 0) ULTIMATE.start___fpclassify_float_~x)))) (fp.eq .cse2 .cse2)))) [2020-10-24 15:12:05,693 INFO L274 CegarLoopResult]: For program point L25-7(lines 22 43) no Hoare annotation was computed. [2020-10-24 15:12:05,693 INFO L274 CegarLoopResult]: For program point L50(lines 50 52) no Hoare annotation was computed. [2020-10-24 15:12:05,693 INFO L274 CegarLoopResult]: For program point L75(line 75) no Hoare annotation was computed. [2020-10-24 15:12:05,694 INFO L270 CegarLoopResult]: At program point L42(lines 22 43) the Hoare annotation is: (let ((.cse2 (let ((.cse9 (fp ((_ extract 31 31) ULTIMATE.start_main_~y~0) ((_ extract 30 23) ULTIMATE.start_main_~y~0) ((_ extract 22 0) ULTIMATE.start_main_~y~0)))) (fp.eq .cse9 .cse9)))) (let ((.cse7 (not .cse2))) (let ((.cse3 (= (_ bv0 32) |ULTIMATE.start___fpclassify_float_#res|)) (.cse4 (let ((.cse8 (fp ((_ extract 31 31) ULTIMATE.start___fpclassify_float_~x) ((_ extract 30 23) ULTIMATE.start___fpclassify_float_~x) ((_ extract 22 0) ULTIMATE.start___fpclassify_float_~x)))) (fp.eq .cse8 .cse8))) (.cse5 (or (and .cse7 (= (_ bv1 32) |ULTIMATE.start_isnan_float_#res|)) (and (= (_ bv0 32) |ULTIMATE.start_isnan_float_#res|) .cse2)))) (or (and (not (let ((.cse0 (fp ((_ extract 31 31) ULTIMATE.start_main_~x~0) ((_ extract 30 23) ULTIMATE.start_main_~x~0) ((_ extract 22 0) ULTIMATE.start_main_~x~0)))) (fp.eq .cse0 .cse0))) (not (let ((.cse1 (fp ((_ extract 31 31) ULTIMATE.start___fpclassify_float_~w~0) ((_ extract 30 23) ULTIMATE.start___fpclassify_float_~w~0) ((_ extract 22 0) ULTIMATE.start___fpclassify_float_~w~0)))) (fp.eq .cse1 .cse1))) .cse2 (= ULTIMATE.start_main_~y~0 ULTIMATE.start_fmax_float_~y) .cse3 (not .cse4) .cse5) (and (= ULTIMATE.start___fpclassify_float_~x ULTIMATE.start_fmax_float_~x) (not .cse3) (not (let ((.cse6 (fp ((_ extract 31 31) ULTIMATE.start_fmax_float_~y) ((_ extract 30 23) ULTIMATE.start_fmax_float_~y) ((_ extract 22 0) ULTIMATE.start_fmax_float_~y)))) (fp.eq .cse6 .cse6))) .cse7 (= ULTIMATE.start_main_~x~0 ULTIMATE.start_fmax_float_~x) (= ULTIMATE.start___fpclassify_float_~w~0 ULTIMATE.start_fmax_float_~x) .cse4 .cse5))))) [2020-10-24 15:12:05,694 INFO L270 CegarLoopResult]: At program point L42-1(lines 22 43) the Hoare annotation is: (and (fp.eq (fp ((_ extract 31 31) ULTIMATE.start_fmax_float_~x) ((_ extract 30 23) ULTIMATE.start_fmax_float_~x) ((_ extract 22 0) ULTIMATE.start_fmax_float_~x)) (fp ((_ extract 31 31) ULTIMATE.start_main_~x~0) ((_ extract 30 23) ULTIMATE.start_main_~x~0) ((_ extract 22 0) ULTIMATE.start_main_~x~0))) (not (let ((.cse0 (fp ((_ extract 31 31) ULTIMATE.start___fpclassify_float_~w~0) ((_ extract 30 23) ULTIMATE.start___fpclassify_float_~w~0) ((_ extract 22 0) ULTIMATE.start___fpclassify_float_~w~0)))) (fp.eq .cse0 .cse0))) (not (let ((.cse1 (fp ((_ extract 31 31) ULTIMATE.start_fmax_float_~y) ((_ extract 30 23) ULTIMATE.start_fmax_float_~y) ((_ extract 22 0) ULTIMATE.start_fmax_float_~y)))) (fp.eq .cse1 .cse1))) (not (let ((.cse2 (fp ((_ extract 31 31) ULTIMATE.start_main_~y~0) ((_ extract 30 23) ULTIMATE.start_main_~y~0) ((_ extract 22 0) ULTIMATE.start_main_~y~0)))) (fp.eq .cse2 .cse2))) (= (_ bv1 32) |ULTIMATE.start_isnan_float_#res|) (= (_ bv0 32) |ULTIMATE.start___fpclassify_float_#res|) (not (let ((.cse3 (fp ((_ extract 31 31) ULTIMATE.start___fpclassify_float_~x) ((_ extract 30 23) ULTIMATE.start___fpclassify_float_~x) ((_ extract 22 0) ULTIMATE.start___fpclassify_float_~x)))) (fp.eq .cse3 .cse3)))) [2020-10-24 15:12:05,694 INFO L274 CegarLoopResult]: For program point L75-2(lines 75 78) no Hoare annotation was computed. [2020-10-24 15:12:05,770 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.10 03:12:05 BoogieIcfgContainer [2020-10-24 15:12:05,770 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-10-24 15:12:05,771 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-10-24 15:12:05,771 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-10-24 15:12:05,772 INFO L275 PluginConnector]: Witness Printer initialized [2020-10-24 15:12:05,772 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 03:11:47" (3/4) ... [2020-10-24 15:12:05,775 INFO L137 WitnessPrinter]: Generating witness for correct program [2020-10-24 15:12:05,789 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 22 nodes and edges [2020-10-24 15:12:05,790 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2020-10-24 15:12:05,790 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2020-10-24 15:12:05,791 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2020-10-24 15:12:05,819 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (!~fp.eq~FLOAT(~fp~LONGDOUBLE(x[31:31], x[30:23], x[22:0]), ~fp~LONGDOUBLE(x[31:31], x[30:23], x[22:0])) && 1bv32 == \result) || (~fp.eq~FLOAT(~fp~LONGDOUBLE(x[31:31], x[30:23], x[22:0]), ~fp~LONGDOUBLE(x[31:31], x[30:23], x[22:0])) && 0bv32 == \result) [2020-10-24 15:12:05,819 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (!~fp.eq~FLOAT(~fp~LONGDOUBLE(x[31:31], x[30:23], x[22:0]), ~fp~LONGDOUBLE(x[31:31], x[30:23], x[22:0])) && aux-isnan_float(x) && !isnan_float(y)-aux) && ((!~fp.eq~FLOAT(~fp~LONGDOUBLE(y[31:31], y[30:23], y[22:0]), ~fp~LONGDOUBLE(y[31:31], y[30:23], y[22:0])) && 1bv32 == \result) || (0bv32 == \result && ~fp.eq~FLOAT(~fp~LONGDOUBLE(y[31:31], y[30:23], y[22:0]), ~fp~LONGDOUBLE(y[31:31], y[30:23], y[22:0])))) [2020-10-24 15:12:05,820 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((!aux-(isnan_float(x) && !isnan_float(y)) || (!isnan_float(x) && isnan_float(y))-aux && !aux-isnan_float(x) && !isnan_float(y)-aux) || (!aux-(isnan_float(x) && !isnan_float(y)) || (!isnan_float(x) && isnan_float(y))-aux && ~fp.eq~FLOAT(~fp~LONGDOUBLE(y[31:31], y[30:23], y[22:0]), ~fp~LONGDOUBLE(y[31:31], y[30:23], y[22:0])))) && ~fp.eq~FLOAT(~fp~LONGDOUBLE(x[31:31], x[30:23], x[22:0]), ~fp~LONGDOUBLE(x[31:31], x[30:23], x[22:0]))) && 0bv32 == \result) && !aux-isnan_float(x) && !isnan_float(y)-aux) || ((!~fp.eq~FLOAT(~fp~LONGDOUBLE(x[31:31], x[30:23], x[22:0]), ~fp~LONGDOUBLE(x[31:31], x[30:23], x[22:0])) && ((!aux-(isnan_float(x) && !isnan_float(y)) || (!isnan_float(x) && isnan_float(y))-aux && !aux-isnan_float(x) && !isnan_float(y)-aux) || (!aux-(isnan_float(x) && !isnan_float(y)) || (!isnan_float(x) && isnan_float(y))-aux && ~fp.eq~FLOAT(~fp~LONGDOUBLE(y[31:31], y[30:23], y[22:0]), ~fp~LONGDOUBLE(y[31:31], y[30:23], y[22:0]))))) && 1bv32 == \result) [2020-10-24 15:12:05,821 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((!aux-(isnan_float(x) && !isnan_float(y)) || (!isnan_float(x) && isnan_float(y))-aux && ~fp.eq~FLOAT(~fp~LONGDOUBLE(x[31:31], x[30:23], x[22:0]), ~fp~LONGDOUBLE(x[31:31], x[30:23], x[22:0]))) && !aux-isnan_float(x) && !isnan_float(y)-aux) && ((!~fp.eq~FLOAT(~fp~LONGDOUBLE(y[31:31], y[30:23], y[22:0]), ~fp~LONGDOUBLE(y[31:31], y[30:23], y[22:0])) && 1bv32 == \result) || (0bv32 == \result && ~fp.eq~FLOAT(~fp~LONGDOUBLE(y[31:31], y[30:23], y[22:0]), ~fp~LONGDOUBLE(y[31:31], y[30:23], y[22:0])))) [2020-10-24 15:12:05,821 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((!~fp.eq~FLOAT(~fp~LONGDOUBLE(x[31:31], x[30:23], x[22:0]), ~fp~LONGDOUBLE(x[31:31], x[30:23], x[22:0])) && ~fp.eq~FLOAT(~fp~LONGDOUBLE(y[31:31], y[30:23], y[22:0]), ~fp~LONGDOUBLE(y[31:31], y[30:23], y[22:0]))) && y == y) && !~fp.eq~FLOAT(~fp~LONGDOUBLE(x[31:31], x[30:23], x[22:0]), ~fp~LONGDOUBLE(x[31:31], x[30:23], x[22:0]))) && ((!~fp.eq~FLOAT(~fp~LONGDOUBLE(y[31:31], y[30:23], y[22:0]), ~fp~LONGDOUBLE(y[31:31], y[30:23], y[22:0])) && 1bv32 == \result) || (0bv32 == \result && ~fp.eq~FLOAT(~fp~LONGDOUBLE(y[31:31], y[30:23], y[22:0]), ~fp~LONGDOUBLE(y[31:31], y[30:23], y[22:0]))))) || (((((x == x && !~fp.eq~FLOAT(~fp~LONGDOUBLE(y[31:31], y[30:23], y[22:0]), ~fp~LONGDOUBLE(y[31:31], y[30:23], y[22:0]))) && !~fp.eq~FLOAT(~fp~LONGDOUBLE(y[31:31], y[30:23], y[22:0]), ~fp~LONGDOUBLE(y[31:31], y[30:23], y[22:0]))) && x == x) && ~fp.eq~FLOAT(~fp~LONGDOUBLE(x[31:31], x[30:23], x[22:0]), ~fp~LONGDOUBLE(x[31:31], x[30:23], x[22:0]))) && ((!~fp.eq~FLOAT(~fp~LONGDOUBLE(y[31:31], y[30:23], y[22:0]), ~fp~LONGDOUBLE(y[31:31], y[30:23], y[22:0])) && 1bv32 == \result) || (0bv32 == \result && ~fp.eq~FLOAT(~fp~LONGDOUBLE(y[31:31], y[30:23], y[22:0]), ~fp~LONGDOUBLE(y[31:31], y[30:23], y[22:0]))))) [2020-10-24 15:12:05,821 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((!~fp.eq~FLOAT(~fp~LONGDOUBLE(x[31:31], x[30:23], x[22:0]), ~fp~LONGDOUBLE(x[31:31], x[30:23], x[22:0])) && !~fp.eq~FLOAT(~fp~LONGDOUBLE(w[31:31], w[30:23], w[22:0]), ~fp~LONGDOUBLE(w[31:31], w[30:23], w[22:0]))) && ~fp.eq~FLOAT(~fp~LONGDOUBLE(y[31:31], y[30:23], y[22:0]), ~fp~LONGDOUBLE(y[31:31], y[30:23], y[22:0]))) && y == y) && 0bv32 == \result) && !~fp.eq~FLOAT(~fp~LONGDOUBLE(x[31:31], x[30:23], x[22:0]), ~fp~LONGDOUBLE(x[31:31], x[30:23], x[22:0]))) && ((!~fp.eq~FLOAT(~fp~LONGDOUBLE(y[31:31], y[30:23], y[22:0]), ~fp~LONGDOUBLE(y[31:31], y[30:23], y[22:0])) && 1bv32 == \result) || (0bv32 == \result && ~fp.eq~FLOAT(~fp~LONGDOUBLE(y[31:31], y[30:23], y[22:0]), ~fp~LONGDOUBLE(y[31:31], y[30:23], y[22:0]))))) || (((((((x == x && !(0bv32 == \result)) && !~fp.eq~FLOAT(~fp~LONGDOUBLE(y[31:31], y[30:23], y[22:0]), ~fp~LONGDOUBLE(y[31:31], y[30:23], y[22:0]))) && !~fp.eq~FLOAT(~fp~LONGDOUBLE(y[31:31], y[30:23], y[22:0]), ~fp~LONGDOUBLE(y[31:31], y[30:23], y[22:0]))) && x == x) && w == x) && ~fp.eq~FLOAT(~fp~LONGDOUBLE(x[31:31], x[30:23], x[22:0]), ~fp~LONGDOUBLE(x[31:31], x[30:23], x[22:0]))) && ((!~fp.eq~FLOAT(~fp~LONGDOUBLE(y[31:31], y[30:23], y[22:0]), ~fp~LONGDOUBLE(y[31:31], y[30:23], y[22:0])) && 1bv32 == \result) || (0bv32 == \result && ~fp.eq~FLOAT(~fp~LONGDOUBLE(y[31:31], y[30:23], y[22:0]), ~fp~LONGDOUBLE(y[31:31], y[30:23], y[22:0]))))) [2020-10-24 15:12:05,822 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((~fp.eq~FLOAT(~fp~LONGDOUBLE(x[31:31], x[30:23], x[22:0]), ~fp~LONGDOUBLE(x[31:31], x[30:23], x[22:0])) && !~fp.eq~FLOAT(~fp~LONGDOUBLE(w[31:31], w[30:23], w[22:0]), ~fp~LONGDOUBLE(w[31:31], w[30:23], w[22:0]))) && ~fp.eq~FLOAT(~fp~LONGDOUBLE(\result[31:31], \result[30:23], \result[22:0]), ~fp~LONGDOUBLE(x[31:31], x[30:23], x[22:0]))) && !~fp.eq~FLOAT(~fp~LONGDOUBLE(y[31:31], y[30:23], y[22:0]), ~fp~LONGDOUBLE(y[31:31], y[30:23], y[22:0]))) && !~fp.eq~FLOAT(~fp~LONGDOUBLE(y[31:31], y[30:23], y[22:0]), ~fp~LONGDOUBLE(y[31:31], y[30:23], y[22:0]))) && 1bv32 == \result) && !~fp.eq~FLOAT(~fp~LONGDOUBLE(x[31:31], x[30:23], x[22:0]), ~fp~LONGDOUBLE(x[31:31], x[30:23], x[22:0]))) || (((\result == y && 0bv32 == \result) && ~fp.eq~FLOAT(~fp~LONGDOUBLE(y[31:31], y[30:23], y[22:0]), ~fp~LONGDOUBLE(y[31:31], y[30:23], y[22:0]))) && y == y) [2020-10-24 15:12:05,822 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((~fp.eq~FLOAT(~fp~LONGDOUBLE(x[31:31], x[30:23], x[22:0]), ~fp~LONGDOUBLE(x[31:31], x[30:23], x[22:0])) && !~fp.eq~FLOAT(~fp~LONGDOUBLE(y[31:31], y[30:23], y[22:0]), ~fp~LONGDOUBLE(y[31:31], y[30:23], y[22:0]))) && !~fp.eq~FLOAT(~fp~LONGDOUBLE(y[31:31], y[30:23], y[22:0]), ~fp~LONGDOUBLE(y[31:31], y[30:23], y[22:0]))) && 1bv32 == \result) && !~fp.eq~FLOAT(~fp~LONGDOUBLE(x[31:31], x[30:23], x[22:0]), ~fp~LONGDOUBLE(x[31:31], x[30:23], x[22:0])) [2020-10-24 15:12:05,822 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((~fp.eq~FLOAT(~fp~LONGDOUBLE(x[31:31], x[30:23], x[22:0]), ~fp~LONGDOUBLE(x[31:31], x[30:23], x[22:0])) && !~fp.eq~FLOAT(~fp~LONGDOUBLE(w[31:31], w[30:23], w[22:0]), ~fp~LONGDOUBLE(w[31:31], w[30:23], w[22:0]))) && ~fp.eq~FLOAT(~fp~LONGDOUBLE(res[31:31], res[30:23], res[22:0]), ~fp~LONGDOUBLE(x[31:31], x[30:23], x[22:0]))) && ~fp.eq~FLOAT(~fp~LONGDOUBLE(\result[31:31], \result[30:23], \result[22:0]), ~fp~LONGDOUBLE(x[31:31], x[30:23], x[22:0]))) && 0bv32 == \result) && !~fp.eq~FLOAT(~fp~LONGDOUBLE(y[31:31], y[30:23], y[22:0]), ~fp~LONGDOUBLE(y[31:31], y[30:23], y[22:0]))) && !~fp.eq~FLOAT(~fp~LONGDOUBLE(y[31:31], y[30:23], y[22:0]), ~fp~LONGDOUBLE(y[31:31], y[30:23], y[22:0]))) && !~fp.eq~FLOAT(~fp~LONGDOUBLE(x[31:31], x[30:23], x[22:0]), ~fp~LONGDOUBLE(x[31:31], x[30:23], x[22:0]))) || (((\result == y && ~fp.eq~FLOAT(~fp~LONGDOUBLE(y[31:31], y[30:23], y[22:0]), ~fp~LONGDOUBLE(y[31:31], y[30:23], y[22:0]))) && res == y) && y == y) [2020-10-24 15:12:05,823 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((~fp.eq~FLOAT(~fp~LONGDOUBLE(x[31:31], x[30:23], x[22:0]), ~fp~LONGDOUBLE(x[31:31], x[30:23], x[22:0])) && !~fp.eq~FLOAT(~fp~LONGDOUBLE(w[31:31], w[30:23], w[22:0]), ~fp~LONGDOUBLE(w[31:31], w[30:23], w[22:0]))) && !~fp.eq~FLOAT(~fp~LONGDOUBLE(y[31:31], y[30:23], y[22:0]), ~fp~LONGDOUBLE(y[31:31], y[30:23], y[22:0]))) && !~fp.eq~FLOAT(~fp~LONGDOUBLE(y[31:31], y[30:23], y[22:0]), ~fp~LONGDOUBLE(y[31:31], y[30:23], y[22:0]))) && 1bv32 == \result) && 0bv32 == \result) && !~fp.eq~FLOAT(~fp~LONGDOUBLE(x[31:31], x[30:23], x[22:0]), ~fp~LONGDOUBLE(x[31:31], x[30:23], x[22:0])) [2020-10-24 15:12:05,823 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((~fp.eq~FLOAT(~fp~LONGDOUBLE(x[31:31], x[30:23], x[22:0]), ~fp~LONGDOUBLE(x[31:31], x[30:23], x[22:0])) && !~fp.eq~FLOAT(~fp~LONGDOUBLE(w[31:31], w[30:23], w[22:0]), ~fp~LONGDOUBLE(w[31:31], w[30:23], w[22:0]))) && ~fp.eq~FLOAT(~fp~LONGDOUBLE(res[31:31], res[30:23], res[22:0]), ~fp~LONGDOUBLE(x[31:31], x[30:23], x[22:0]))) && ~fp.eq~FLOAT(~fp~LONGDOUBLE(\result[31:31], \result[30:23], \result[22:0]), ~fp~LONGDOUBLE(x[31:31], x[30:23], x[22:0]))) && !~fp.eq~FLOAT(~fp~LONGDOUBLE(y[31:31], y[30:23], y[22:0]), ~fp~LONGDOUBLE(y[31:31], y[30:23], y[22:0]))) && !~fp.eq~FLOAT(~fp~LONGDOUBLE(y[31:31], y[30:23], y[22:0]), ~fp~LONGDOUBLE(y[31:31], y[30:23], y[22:0]))) && 1bv32 == \result) && !~fp.eq~FLOAT(~fp~LONGDOUBLE(x[31:31], x[30:23], x[22:0]), ~fp~LONGDOUBLE(x[31:31], x[30:23], x[22:0]))) || ((((\result == y && 0bv32 == \result) && ~fp.eq~FLOAT(~fp~LONGDOUBLE(y[31:31], y[30:23], y[22:0]), ~fp~LONGDOUBLE(y[31:31], y[30:23], y[22:0]))) && res == y) && y == y) [2020-10-24 15:12:05,824 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ~fp.eq~FLOAT(~fp~LONGDOUBLE(y[31:31], y[30:23], y[22:0]), ~fp~LONGDOUBLE(y[31:31], y[30:23], y[22:0])) || ((((((~fp.eq~FLOAT(~fp~LONGDOUBLE(x[31:31], x[30:23], x[22:0]), ~fp~LONGDOUBLE(x[31:31], x[30:23], x[22:0])) && !~fp.eq~FLOAT(~fp~LONGDOUBLE(w[31:31], w[30:23], w[22:0]), ~fp~LONGDOUBLE(w[31:31], w[30:23], w[22:0]))) && ~fp.eq~FLOAT(~fp~LONGDOUBLE(res[31:31], res[30:23], res[22:0]), ~fp~LONGDOUBLE(x[31:31], x[30:23], x[22:0]))) && ~fp.eq~FLOAT(~fp~LONGDOUBLE(\result[31:31], \result[30:23], \result[22:0]), ~fp~LONGDOUBLE(x[31:31], x[30:23], x[22:0]))) && 0bv32 == \result) && !~fp.eq~FLOAT(~fp~LONGDOUBLE(y[31:31], y[30:23], y[22:0]), ~fp~LONGDOUBLE(y[31:31], y[30:23], y[22:0]))) && !~fp.eq~FLOAT(~fp~LONGDOUBLE(x[31:31], x[30:23], x[22:0]), ~fp~LONGDOUBLE(x[31:31], x[30:23], x[22:0]))) [2020-10-24 15:12:05,824 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (~fp.eq~FLOAT(~fp~LONGDOUBLE(y[31:31], y[30:23], y[22:0]), ~fp~LONGDOUBLE(y[31:31], y[30:23], y[22:0])) && ((!~fp.eq~FLOAT(~fp~LONGDOUBLE(y[31:31], y[30:23], y[22:0]), ~fp~LONGDOUBLE(y[31:31], y[30:23], y[22:0])) && 1bv32 == \result) || (0bv32 == \result && ~fp.eq~FLOAT(~fp~LONGDOUBLE(y[31:31], y[30:23], y[22:0]), ~fp~LONGDOUBLE(y[31:31], y[30:23], y[22:0]))))) || ((((((~fp.eq~FLOAT(~fp~LONGDOUBLE(x[31:31], x[30:23], x[22:0]), ~fp~LONGDOUBLE(x[31:31], x[30:23], x[22:0])) && !~fp.eq~FLOAT(~fp~LONGDOUBLE(w[31:31], w[30:23], w[22:0]), ~fp~LONGDOUBLE(w[31:31], w[30:23], w[22:0]))) && ~fp.eq~FLOAT(~fp~LONGDOUBLE(res[31:31], res[30:23], res[22:0]), ~fp~LONGDOUBLE(x[31:31], x[30:23], x[22:0]))) && ~fp.eq~FLOAT(~fp~LONGDOUBLE(\result[31:31], \result[30:23], \result[22:0]), ~fp~LONGDOUBLE(x[31:31], x[30:23], x[22:0]))) && !~fp.eq~FLOAT(~fp~LONGDOUBLE(y[31:31], y[30:23], y[22:0]), ~fp~LONGDOUBLE(y[31:31], y[30:23], y[22:0]))) && !~fp.eq~FLOAT(~fp~LONGDOUBLE(x[31:31], x[30:23], x[22:0]), ~fp~LONGDOUBLE(x[31:31], x[30:23], x[22:0]))) && ((!~fp.eq~FLOAT(~fp~LONGDOUBLE(y[31:31], y[30:23], y[22:0]), ~fp~LONGDOUBLE(y[31:31], y[30:23], y[22:0])) && 1bv32 == \result) || (0bv32 == \result && ~fp.eq~FLOAT(~fp~LONGDOUBLE(y[31:31], y[30:23], y[22:0]), ~fp~LONGDOUBLE(y[31:31], y[30:23], y[22:0]))))) [2020-10-24 15:12:05,866 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/witness.graphml [2020-10-24 15:12:05,866 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-10-24 15:12:05,868 INFO L168 Benchmark]: Toolchain (without parser) took 19702.10 ms. Allocated memory was 44.0 MB in the beginning and 119.5 MB in the end (delta: 75.5 MB). Free memory was 21.5 MB in the beginning and 56.9 MB in the end (delta: -35.4 MB). Peak memory consumption was 43.0 MB. Max. memory is 16.1 GB. [2020-10-24 15:12:05,870 INFO L168 Benchmark]: CDTParser took 0.24 ms. Allocated memory is still 44.0 MB. Free memory was 24.5 MB in the beginning and 24.5 MB in the end (delta: 32.8 kB). There was no memory consumed. Max. memory is 16.1 GB. [2020-10-24 15:12:05,871 INFO L168 Benchmark]: CACSL2BoogieTranslator took 298.97 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: -109.7 kB). Peak memory consumption was 5.4 MB. Max. memory is 16.1 GB. [2020-10-24 15:12:05,873 INFO L168 Benchmark]: Boogie Procedure Inliner took 61.71 ms. Allocated memory was 44.0 MB in the beginning and 54.5 MB in the end (delta: 10.5 MB). Free memory was 20.9 MB in the beginning and 38.8 MB in the end (delta: -17.9 MB). Peak memory consumption was 2.9 MB. Max. memory is 16.1 GB. [2020-10-24 15:12:05,874 INFO L168 Benchmark]: Boogie Preprocessor took 43.06 ms. Allocated memory is still 54.5 MB. Free memory was 38.8 MB in the beginning and 37.2 MB in the end (delta: 1.7 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2020-10-24 15:12:05,874 INFO L168 Benchmark]: RCFGBuilder took 605.79 ms. Allocated memory is still 54.5 MB. Free memory was 37.0 MB in the beginning and 27.0 MB in the end (delta: 10.0 MB). Peak memory consumption was 14.0 MB. Max. memory is 16.1 GB. [2020-10-24 15:12:05,874 INFO L168 Benchmark]: TraceAbstraction took 18584.34 ms. Allocated memory was 54.5 MB in the beginning and 119.5 MB in the end (delta: 65.0 MB). Free memory was 26.5 MB in the beginning and 62.2 MB in the end (delta: -35.7 MB). Peak memory consumption was 60.6 MB. Max. memory is 16.1 GB. [2020-10-24 15:12:05,875 INFO L168 Benchmark]: Witness Printer took 95.81 ms. Allocated memory is still 119.5 MB. Free memory was 62.2 MB in the beginning and 56.9 MB in the end (delta: 5.2 MB). Peak memory consumption was 6.3 MB. Max. memory is 16.1 GB. [2020-10-24 15:12:05,877 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.24 ms. Allocated memory is still 44.0 MB. Free memory was 24.5 MB in the beginning and 24.5 MB in the end (delta: 32.8 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 298.97 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: -109.7 kB). Peak memory consumption was 5.4 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 61.71 ms. Allocated memory was 44.0 MB in the beginning and 54.5 MB in the end (delta: 10.5 MB). Free memory was 20.9 MB in the beginning and 38.8 MB in the end (delta: -17.9 MB). Peak memory consumption was 2.9 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 43.06 ms. Allocated memory is still 54.5 MB. Free memory was 38.8 MB in the beginning and 37.2 MB in the end (delta: 1.7 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * RCFGBuilder took 605.79 ms. Allocated memory is still 54.5 MB. Free memory was 37.0 MB in the beginning and 27.0 MB in the end (delta: 10.0 MB). Peak memory consumption was 14.0 MB. Max. memory is 16.1 GB. * TraceAbstraction took 18584.34 ms. Allocated memory was 54.5 MB in the beginning and 119.5 MB in the end (delta: 65.0 MB). Free memory was 26.5 MB in the beginning and 62.2 MB in the end (delta: -35.7 MB). Peak memory consumption was 60.6 MB. Max. memory is 16.1 GB. * Witness Printer took 95.81 ms. Allocated memory is still 119.5 MB. Free memory was 62.2 MB in the beginning and 56.9 MB in the end (delta: 5.2 MB). Peak memory consumption was 6.3 MB. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 3]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 3]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 2 specifications checked. All of them hold - InvariantResult [Line: 45]: Loop Invariant Derived loop invariant: ((((((~fp.eq~FLOAT(~fp~LONGDOUBLE(x[31:31], x[30:23], x[22:0]), ~fp~LONGDOUBLE(x[31:31], x[30:23], x[22:0])) && !~fp.eq~FLOAT(~fp~LONGDOUBLE(w[31:31], w[30:23], w[22:0]), ~fp~LONGDOUBLE(w[31:31], w[30:23], w[22:0]))) && ~fp.eq~FLOAT(~fp~LONGDOUBLE(\result[31:31], \result[30:23], \result[22:0]), ~fp~LONGDOUBLE(x[31:31], x[30:23], x[22:0]))) && !~fp.eq~FLOAT(~fp~LONGDOUBLE(y[31:31], y[30:23], y[22:0]), ~fp~LONGDOUBLE(y[31:31], y[30:23], y[22:0]))) && !~fp.eq~FLOAT(~fp~LONGDOUBLE(y[31:31], y[30:23], y[22:0]), ~fp~LONGDOUBLE(y[31:31], y[30:23], y[22:0]))) && 1bv32 == \result) && !~fp.eq~FLOAT(~fp~LONGDOUBLE(x[31:31], x[30:23], x[22:0]), ~fp~LONGDOUBLE(x[31:31], x[30:23], x[22:0]))) || (((\result == y && 0bv32 == \result) && ~fp.eq~FLOAT(~fp~LONGDOUBLE(y[31:31], y[30:23], y[22:0]), ~fp~LONGDOUBLE(y[31:31], y[30:23], y[22:0]))) && y == y) - InvariantResult [Line: 57]: Loop Invariant Derived loop invariant: (~fp.eq~FLOAT(~fp~LONGDOUBLE(y[31:31], y[30:23], y[22:0]), ~fp~LONGDOUBLE(y[31:31], y[30:23], y[22:0])) && ((!~fp.eq~FLOAT(~fp~LONGDOUBLE(y[31:31], y[30:23], y[22:0]), ~fp~LONGDOUBLE(y[31:31], y[30:23], y[22:0])) && 1bv32 == \result) || (0bv32 == \result && ~fp.eq~FLOAT(~fp~LONGDOUBLE(y[31:31], y[30:23], y[22:0]), ~fp~LONGDOUBLE(y[31:31], y[30:23], y[22:0]))))) || ((((((~fp.eq~FLOAT(~fp~LONGDOUBLE(x[31:31], x[30:23], x[22:0]), ~fp~LONGDOUBLE(x[31:31], x[30:23], x[22:0])) && !~fp.eq~FLOAT(~fp~LONGDOUBLE(w[31:31], w[30:23], w[22:0]), ~fp~LONGDOUBLE(w[31:31], w[30:23], w[22:0]))) && ~fp.eq~FLOAT(~fp~LONGDOUBLE(res[31:31], res[30:23], res[22:0]), ~fp~LONGDOUBLE(x[31:31], x[30:23], x[22:0]))) && ~fp.eq~FLOAT(~fp~LONGDOUBLE(\result[31:31], \result[30:23], \result[22:0]), ~fp~LONGDOUBLE(x[31:31], x[30:23], x[22:0]))) && !~fp.eq~FLOAT(~fp~LONGDOUBLE(y[31:31], y[30:23], y[22:0]), ~fp~LONGDOUBLE(y[31:31], y[30:23], y[22:0]))) && !~fp.eq~FLOAT(~fp~LONGDOUBLE(x[31:31], x[30:23], x[22:0]), ~fp~LONGDOUBLE(x[31:31], x[30:23], x[22:0]))) && ((!~fp.eq~FLOAT(~fp~LONGDOUBLE(y[31:31], y[30:23], y[22:0]), ~fp~LONGDOUBLE(y[31:31], y[30:23], y[22:0])) && 1bv32 == \result) || (0bv32 == \result && ~fp.eq~FLOAT(~fp~LONGDOUBLE(y[31:31], y[30:23], y[22:0]), ~fp~LONGDOUBLE(y[31:31], y[30:23], y[22:0]))))) - InvariantResult [Line: 57]: Loop Invariant Derived loop invariant: ~fp.eq~FLOAT(~fp~LONGDOUBLE(y[31:31], y[30:23], y[22:0]), ~fp~LONGDOUBLE(y[31:31], y[30:23], y[22:0])) || ((((((~fp.eq~FLOAT(~fp~LONGDOUBLE(x[31:31], x[30:23], x[22:0]), ~fp~LONGDOUBLE(x[31:31], x[30:23], x[22:0])) && !~fp.eq~FLOAT(~fp~LONGDOUBLE(w[31:31], w[30:23], w[22:0]), ~fp~LONGDOUBLE(w[31:31], w[30:23], w[22:0]))) && ~fp.eq~FLOAT(~fp~LONGDOUBLE(res[31:31], res[30:23], res[22:0]), ~fp~LONGDOUBLE(x[31:31], x[30:23], x[22:0]))) && ~fp.eq~FLOAT(~fp~LONGDOUBLE(\result[31:31], \result[30:23], \result[22:0]), ~fp~LONGDOUBLE(x[31:31], x[30:23], x[22:0]))) && 0bv32 == \result) && !~fp.eq~FLOAT(~fp~LONGDOUBLE(y[31:31], y[30:23], y[22:0]), ~fp~LONGDOUBLE(y[31:31], y[30:23], y[22:0]))) && !~fp.eq~FLOAT(~fp~LONGDOUBLE(x[31:31], x[30:23], x[22:0]), ~fp~LONGDOUBLE(x[31:31], x[30:23], x[22:0]))) - InvariantResult [Line: 25]: Loop Invariant Derived loop invariant: (((~fp.eq~FLOAT(~fp~LONGDOUBLE(x[31:31], x[30:23], x[22:0]), ~fp~LONGDOUBLE(x[31:31], x[30:23], x[22:0])) && !~fp.eq~FLOAT(~fp~LONGDOUBLE(y[31:31], y[30:23], y[22:0]), ~fp~LONGDOUBLE(y[31:31], y[30:23], y[22:0]))) && !~fp.eq~FLOAT(~fp~LONGDOUBLE(y[31:31], y[30:23], y[22:0]), ~fp~LONGDOUBLE(y[31:31], y[30:23], y[22:0]))) && 1bv32 == \result) && !~fp.eq~FLOAT(~fp~LONGDOUBLE(x[31:31], x[30:23], x[22:0]), ~fp~LONGDOUBLE(x[31:31], x[30:23], x[22:0])) - InvariantResult [Line: 22]: Loop Invariant Derived loop invariant: (((((~fp.eq~FLOAT(~fp~LONGDOUBLE(x[31:31], x[30:23], x[22:0]), ~fp~LONGDOUBLE(x[31:31], x[30:23], x[22:0])) && !~fp.eq~FLOAT(~fp~LONGDOUBLE(w[31:31], w[30:23], w[22:0]), ~fp~LONGDOUBLE(w[31:31], w[30:23], w[22:0]))) && !~fp.eq~FLOAT(~fp~LONGDOUBLE(y[31:31], y[30:23], y[22:0]), ~fp~LONGDOUBLE(y[31:31], y[30:23], y[22:0]))) && !~fp.eq~FLOAT(~fp~LONGDOUBLE(y[31:31], y[30:23], y[22:0]), ~fp~LONGDOUBLE(y[31:31], y[30:23], y[22:0]))) && 1bv32 == \result) && 0bv32 == \result) && !~fp.eq~FLOAT(~fp~LONGDOUBLE(x[31:31], x[30:23], x[22:0]), ~fp~LONGDOUBLE(x[31:31], x[30:23], x[22:0])) - InvariantResult [Line: 57]: Loop Invariant Derived loop invariant: (((((((~fp.eq~FLOAT(~fp~LONGDOUBLE(x[31:31], x[30:23], x[22:0]), ~fp~LONGDOUBLE(x[31:31], x[30:23], x[22:0])) && !~fp.eq~FLOAT(~fp~LONGDOUBLE(w[31:31], w[30:23], w[22:0]), ~fp~LONGDOUBLE(w[31:31], w[30:23], w[22:0]))) && ~fp.eq~FLOAT(~fp~LONGDOUBLE(res[31:31], res[30:23], res[22:0]), ~fp~LONGDOUBLE(x[31:31], x[30:23], x[22:0]))) && ~fp.eq~FLOAT(~fp~LONGDOUBLE(\result[31:31], \result[30:23], \result[22:0]), ~fp~LONGDOUBLE(x[31:31], x[30:23], x[22:0]))) && !~fp.eq~FLOAT(~fp~LONGDOUBLE(y[31:31], y[30:23], y[22:0]), ~fp~LONGDOUBLE(y[31:31], y[30:23], y[22:0]))) && !~fp.eq~FLOAT(~fp~LONGDOUBLE(y[31:31], y[30:23], y[22:0]), ~fp~LONGDOUBLE(y[31:31], y[30:23], y[22:0]))) && 1bv32 == \result) && !~fp.eq~FLOAT(~fp~LONGDOUBLE(x[31:31], x[30:23], x[22:0]), ~fp~LONGDOUBLE(x[31:31], x[30:23], x[22:0]))) || ((((\result == y && 0bv32 == \result) && ~fp.eq~FLOAT(~fp~LONGDOUBLE(y[31:31], y[30:23], y[22:0]), ~fp~LONGDOUBLE(y[31:31], y[30:23], y[22:0]))) && res == y) && y == y) - InvariantResult [Line: 22]: Loop Invariant Derived loop invariant: ((((((!~fp.eq~FLOAT(~fp~LONGDOUBLE(x[31:31], x[30:23], x[22:0]), ~fp~LONGDOUBLE(x[31:31], x[30:23], x[22:0])) && !~fp.eq~FLOAT(~fp~LONGDOUBLE(w[31:31], w[30:23], w[22:0]), ~fp~LONGDOUBLE(w[31:31], w[30:23], w[22:0]))) && ~fp.eq~FLOAT(~fp~LONGDOUBLE(y[31:31], y[30:23], y[22:0]), ~fp~LONGDOUBLE(y[31:31], y[30:23], y[22:0]))) && y == y) && 0bv32 == \result) && !~fp.eq~FLOAT(~fp~LONGDOUBLE(x[31:31], x[30:23], x[22:0]), ~fp~LONGDOUBLE(x[31:31], x[30:23], x[22:0]))) && ((!~fp.eq~FLOAT(~fp~LONGDOUBLE(y[31:31], y[30:23], y[22:0]), ~fp~LONGDOUBLE(y[31:31], y[30:23], y[22:0])) && 1bv32 == \result) || (0bv32 == \result && ~fp.eq~FLOAT(~fp~LONGDOUBLE(y[31:31], y[30:23], y[22:0]), ~fp~LONGDOUBLE(y[31:31], y[30:23], y[22:0]))))) || (((((((x == x && !(0bv32 == \result)) && !~fp.eq~FLOAT(~fp~LONGDOUBLE(y[31:31], y[30:23], y[22:0]), ~fp~LONGDOUBLE(y[31:31], y[30:23], y[22:0]))) && !~fp.eq~FLOAT(~fp~LONGDOUBLE(y[31:31], y[30:23], y[22:0]), ~fp~LONGDOUBLE(y[31:31], y[30:23], y[22:0]))) && x == x) && w == x) && ~fp.eq~FLOAT(~fp~LONGDOUBLE(x[31:31], x[30:23], x[22:0]), ~fp~LONGDOUBLE(x[31:31], x[30:23], x[22:0]))) && ((!~fp.eq~FLOAT(~fp~LONGDOUBLE(y[31:31], y[30:23], y[22:0]), ~fp~LONGDOUBLE(y[31:31], y[30:23], y[22:0])) && 1bv32 == \result) || (0bv32 == \result && ~fp.eq~FLOAT(~fp~LONGDOUBLE(y[31:31], y[30:23], y[22:0]), ~fp~LONGDOUBLE(y[31:31], y[30:23], y[22:0]))))) - InvariantResult [Line: 57]: Loop Invariant Derived loop invariant: (((((((~fp.eq~FLOAT(~fp~LONGDOUBLE(x[31:31], x[30:23], x[22:0]), ~fp~LONGDOUBLE(x[31:31], x[30:23], x[22:0])) && !~fp.eq~FLOAT(~fp~LONGDOUBLE(w[31:31], w[30:23], w[22:0]), ~fp~LONGDOUBLE(w[31:31], w[30:23], w[22:0]))) && ~fp.eq~FLOAT(~fp~LONGDOUBLE(res[31:31], res[30:23], res[22:0]), ~fp~LONGDOUBLE(x[31:31], x[30:23], x[22:0]))) && ~fp.eq~FLOAT(~fp~LONGDOUBLE(\result[31:31], \result[30:23], \result[22:0]), ~fp~LONGDOUBLE(x[31:31], x[30:23], x[22:0]))) && 0bv32 == \result) && !~fp.eq~FLOAT(~fp~LONGDOUBLE(y[31:31], y[30:23], y[22:0]), ~fp~LONGDOUBLE(y[31:31], y[30:23], y[22:0]))) && !~fp.eq~FLOAT(~fp~LONGDOUBLE(y[31:31], y[30:23], y[22:0]), ~fp~LONGDOUBLE(y[31:31], y[30:23], y[22:0]))) && !~fp.eq~FLOAT(~fp~LONGDOUBLE(x[31:31], x[30:23], x[22:0]), ~fp~LONGDOUBLE(x[31:31], x[30:23], x[22:0]))) || (((\result == y && ~fp.eq~FLOAT(~fp~LONGDOUBLE(y[31:31], y[30:23], y[22:0]), ~fp~LONGDOUBLE(y[31:31], y[30:23], y[22:0]))) && res == y) && y == y) - InvariantResult [Line: 57]: Loop Invariant Derived loop invariant: ((!aux-(isnan_float(x) && !isnan_float(y)) || (!isnan_float(x) && isnan_float(y))-aux && ~fp.eq~FLOAT(~fp~LONGDOUBLE(x[31:31], x[30:23], x[22:0]), ~fp~LONGDOUBLE(x[31:31], x[30:23], x[22:0]))) && !aux-isnan_float(x) && !isnan_float(y)-aux) && ((!~fp.eq~FLOAT(~fp~LONGDOUBLE(y[31:31], y[30:23], y[22:0]), ~fp~LONGDOUBLE(y[31:31], y[30:23], y[22:0])) && 1bv32 == \result) || (0bv32 == \result && ~fp.eq~FLOAT(~fp~LONGDOUBLE(y[31:31], y[30:23], y[22:0]), ~fp~LONGDOUBLE(y[31:31], y[30:23], y[22:0])))) - InvariantResult [Line: 57]: Loop Invariant Derived loop invariant: (((((!aux-(isnan_float(x) && !isnan_float(y)) || (!isnan_float(x) && isnan_float(y))-aux && !aux-isnan_float(x) && !isnan_float(y)-aux) || (!aux-(isnan_float(x) && !isnan_float(y)) || (!isnan_float(x) && isnan_float(y))-aux && ~fp.eq~FLOAT(~fp~LONGDOUBLE(y[31:31], y[30:23], y[22:0]), ~fp~LONGDOUBLE(y[31:31], y[30:23], y[22:0])))) && ~fp.eq~FLOAT(~fp~LONGDOUBLE(x[31:31], x[30:23], x[22:0]), ~fp~LONGDOUBLE(x[31:31], x[30:23], x[22:0]))) && 0bv32 == \result) && !aux-isnan_float(x) && !isnan_float(y)-aux) || ((!~fp.eq~FLOAT(~fp~LONGDOUBLE(x[31:31], x[30:23], x[22:0]), ~fp~LONGDOUBLE(x[31:31], x[30:23], x[22:0])) && ((!aux-(isnan_float(x) && !isnan_float(y)) || (!isnan_float(x) && isnan_float(y))-aux && !aux-isnan_float(x) && !isnan_float(y)-aux) || (!aux-(isnan_float(x) && !isnan_float(y)) || (!isnan_float(x) && isnan_float(y))-aux && ~fp.eq~FLOAT(~fp~LONGDOUBLE(y[31:31], y[30:23], y[22:0]), ~fp~LONGDOUBLE(y[31:31], y[30:23], y[22:0]))))) && 1bv32 == \result) - InvariantResult [Line: 59]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 25]: Loop Invariant Derived loop invariant: ((((!~fp.eq~FLOAT(~fp~LONGDOUBLE(x[31:31], x[30:23], x[22:0]), ~fp~LONGDOUBLE(x[31:31], x[30:23], x[22:0])) && ~fp.eq~FLOAT(~fp~LONGDOUBLE(y[31:31], y[30:23], y[22:0]), ~fp~LONGDOUBLE(y[31:31], y[30:23], y[22:0]))) && y == y) && !~fp.eq~FLOAT(~fp~LONGDOUBLE(x[31:31], x[30:23], x[22:0]), ~fp~LONGDOUBLE(x[31:31], x[30:23], x[22:0]))) && ((!~fp.eq~FLOAT(~fp~LONGDOUBLE(y[31:31], y[30:23], y[22:0]), ~fp~LONGDOUBLE(y[31:31], y[30:23], y[22:0])) && 1bv32 == \result) || (0bv32 == \result && ~fp.eq~FLOAT(~fp~LONGDOUBLE(y[31:31], y[30:23], y[22:0]), ~fp~LONGDOUBLE(y[31:31], y[30:23], y[22:0]))))) || (((((x == x && !~fp.eq~FLOAT(~fp~LONGDOUBLE(y[31:31], y[30:23], y[22:0]), ~fp~LONGDOUBLE(y[31:31], y[30:23], y[22:0]))) && !~fp.eq~FLOAT(~fp~LONGDOUBLE(y[31:31], y[30:23], y[22:0]), ~fp~LONGDOUBLE(y[31:31], y[30:23], y[22:0]))) && x == x) && ~fp.eq~FLOAT(~fp~LONGDOUBLE(x[31:31], x[30:23], x[22:0]), ~fp~LONGDOUBLE(x[31:31], x[30:23], x[22:0]))) && ((!~fp.eq~FLOAT(~fp~LONGDOUBLE(y[31:31], y[30:23], y[22:0]), ~fp~LONGDOUBLE(y[31:31], y[30:23], y[22:0])) && 1bv32 == \result) || (0bv32 == \result && ~fp.eq~FLOAT(~fp~LONGDOUBLE(y[31:31], y[30:23], y[22:0]), ~fp~LONGDOUBLE(y[31:31], y[30:23], y[22:0]))))) - InvariantResult [Line: 57]: Loop Invariant Derived loop invariant: (!~fp.eq~FLOAT(~fp~LONGDOUBLE(x[31:31], x[30:23], x[22:0]), ~fp~LONGDOUBLE(x[31:31], x[30:23], x[22:0])) && aux-isnan_float(x) && !isnan_float(y)-aux) && ((!~fp.eq~FLOAT(~fp~LONGDOUBLE(y[31:31], y[30:23], y[22:0]), ~fp~LONGDOUBLE(y[31:31], y[30:23], y[22:0])) && 1bv32 == \result) || (0bv32 == \result && ~fp.eq~FLOAT(~fp~LONGDOUBLE(y[31:31], y[30:23], y[22:0]), ~fp~LONGDOUBLE(y[31:31], y[30:23], y[22:0])))) - InvariantResult [Line: 57]: Loop Invariant Derived loop invariant: (!~fp.eq~FLOAT(~fp~LONGDOUBLE(x[31:31], x[30:23], x[22:0]), ~fp~LONGDOUBLE(x[31:31], x[30:23], x[22:0])) && 1bv32 == \result) || (~fp.eq~FLOAT(~fp~LONGDOUBLE(x[31:31], x[30:23], x[22:0]), ~fp~LONGDOUBLE(x[31:31], x[30:23], x[22:0])) && 0bv32 == \result) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 49 locations, 2 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 15.0s, OverallIterations: 17, TraceHistogramMax: 1, AutomataDifference: 6.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 3.3s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 966 SDtfs, 1711 SDslu, 3183 SDs, 0 SdLazy, 1527 SolverSat, 176 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 905 GetRequests, 718 SyntacticMatches, 4 SemanticMatches, 183 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 488 ImplicationChecksByTransitivity, 5.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=86occurred in iteration=11, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 17 MinimizatonAttempts, 481 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 14 LocationsWithAnnotation, 14 PreInvPairs, 38 NumberOfFragments, 1509 HoareAnnotationTreeSize, 14 FomulaSimplifications, 175385 FormulaSimplificationTreeSizeReduction, 0.6s HoareSimplificationTime, 14 FomulaSimplificationsInter, 11915 FormulaSimplificationTreeSizeReductionInter, 2.7s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 1.0s SatisfiabilityAnalysisTime, 2.8s InterpolantComputationTime, 428 NumberOfCodeBlocks, 428 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 822 ConstructedInterpolants, 0 QuantifiedInterpolants, 118482 SizeOfPredicates, 94 NumberOfNonLiveVariables, 1449 ConjunctsInSsa, 126 ConjunctsInUnsatCore, 34 InterpolantComputations, 34 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...