./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/float-newlib/double_req_bl_1252a.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 20ed64ec Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/float-newlib/double_req_bl_1252a.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 23f3104f6bf674f4cf2d86feffb86c85d21d7d18 ......................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/float-newlib/double_req_bl_1252a.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 23f3104f6bf674f4cf2d86feffb86c85d21d7d18 .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.2.1-dev-20ed64e [2021-08-26 01:42:23,579 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-08-26 01:42:23,581 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-08-26 01:42:23,611 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-08-26 01:42:23,612 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-08-26 01:42:23,615 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-08-26 01:42:23,618 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-08-26 01:42:23,619 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-08-26 01:42:23,621 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-08-26 01:42:23,622 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-08-26 01:42:23,623 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-08-26 01:42:23,624 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-08-26 01:42:23,624 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-08-26 01:42:23,625 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-08-26 01:42:23,626 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-08-26 01:42:23,627 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-08-26 01:42:23,628 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-08-26 01:42:23,629 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-08-26 01:42:23,630 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-08-26 01:42:23,632 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-08-26 01:42:23,633 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-08-26 01:42:23,641 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-08-26 01:42:23,642 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-08-26 01:42:23,643 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-08-26 01:42:23,650 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-08-26 01:42:23,650 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-08-26 01:42:23,651 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-08-26 01:42:23,652 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-08-26 01:42:23,652 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-08-26 01:42:23,653 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-08-26 01:42:23,653 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-08-26 01:42:23,654 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-08-26 01:42:23,654 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-08-26 01:42:23,655 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-08-26 01:42:23,656 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-08-26 01:42:23,656 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-08-26 01:42:23,657 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-08-26 01:42:23,657 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-08-26 01:42:23,658 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-08-26 01:42:23,658 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-08-26 01:42:23,659 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-08-26 01:42:23,660 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2021-08-26 01:42:23,694 INFO L113 SettingsManager]: Loading preferences was successful [2021-08-26 01:42:23,697 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-08-26 01:42:23,698 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-08-26 01:42:23,699 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-08-26 01:42:23,700 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-08-26 01:42:23,701 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-08-26 01:42:23,701 INFO L138 SettingsManager]: * Use SBE=true [2021-08-26 01:42:23,701 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-08-26 01:42:23,701 INFO L138 SettingsManager]: * sizeof long=4 [2021-08-26 01:42:23,701 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-08-26 01:42:23,702 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-08-26 01:42:23,703 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-08-26 01:42:23,703 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-08-26 01:42:23,703 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-08-26 01:42:23,703 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-08-26 01:42:23,703 INFO L138 SettingsManager]: * sizeof long double=12 [2021-08-26 01:42:23,703 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-08-26 01:42:23,704 INFO L138 SettingsManager]: * Use constant arrays=true [2021-08-26 01:42:23,704 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-08-26 01:42:23,704 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-08-26 01:42:23,704 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-08-26 01:42:23,704 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-08-26 01:42:23,705 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-08-26 01:42:23,705 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-08-26 01:42:23,705 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-08-26 01:42:23,705 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-08-26 01:42:23,705 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-08-26 01:42:23,705 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-08-26 01:42:23,706 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-08-26 01:42:23,706 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-08-26 01:42:23,706 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 23f3104f6bf674f4cf2d86feffb86c85d21d7d18 [2021-08-26 01:42:24,016 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-08-26 01:42:24,036 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-08-26 01:42:24,038 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-08-26 01:42:24,039 INFO L271 PluginConnector]: Initializing CDTParser... [2021-08-26 01:42:24,040 INFO L275 PluginConnector]: CDTParser initialized [2021-08-26 01:42:24,041 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/float-newlib/double_req_bl_1252a.c [2021-08-26 01:42:24,103 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e1b4d3cd7/ad3deda9970f4921a0c38db9ce8b8c6d/FLAG20a72ed32 [2021-08-26 01:42:24,463 INFO L306 CDTParser]: Found 1 translation units. [2021-08-26 01:42:24,464 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/double_req_bl_1252a.c [2021-08-26 01:42:24,469 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e1b4d3cd7/ad3deda9970f4921a0c38db9ce8b8c6d/FLAG20a72ed32 [2021-08-26 01:42:24,857 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e1b4d3cd7/ad3deda9970f4921a0c38db9ce8b8c6d [2021-08-26 01:42:24,865 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-08-26 01:42:24,867 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-08-26 01:42:24,868 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-08-26 01:42:24,868 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-08-26 01:42:24,872 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-08-26 01:42:24,873 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.08 01:42:24" (1/1) ... [2021-08-26 01:42:24,875 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2ab66 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 01:42:24, skipping insertion in model container [2021-08-26 01:42:24,875 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.08 01:42:24" (1/1) ... [2021-08-26 01:42:24,881 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-08-26 01:42:24,896 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-08-26 01:42:25,025 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/double_req_bl_1252a.c[2154,2167] [2021-08-26 01:42:25,028 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-26 01:42:25,064 INFO L203 MainTranslator]: Completed pre-run [2021-08-26 01:42:25,091 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/double_req_bl_1252a.c[2154,2167] [2021-08-26 01:42:25,092 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-26 01:42:25,103 INFO L208 MainTranslator]: Completed translation [2021-08-26 01:42:25,104 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 01:42:25 WrapperNode [2021-08-26 01:42:25,104 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-08-26 01:42:25,105 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-08-26 01:42:25,105 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-08-26 01:42:25,105 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-08-26 01:42:25,111 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 01:42:25" (1/1) ... [2021-08-26 01:42:25,117 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 01:42:25" (1/1) ... [2021-08-26 01:42:25,135 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-08-26 01:42:25,136 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-08-26 01:42:25,136 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-08-26 01:42:25,136 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-08-26 01:42:25,142 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 01:42:25" (1/1) ... [2021-08-26 01:42:25,142 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 01:42:25" (1/1) ... [2021-08-26 01:42:25,145 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 01:42:25" (1/1) ... [2021-08-26 01:42:25,145 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 01:42:25" (1/1) ... [2021-08-26 01:42:25,150 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 01:42:25" (1/1) ... [2021-08-26 01:42:25,154 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 01:42:25" (1/1) ... [2021-08-26 01:42:25,155 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 01:42:25" (1/1) ... [2021-08-26 01:42:25,157 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-08-26 01:42:25,158 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-08-26 01:42:25,158 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-08-26 01:42:25,158 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-08-26 01:42:25,159 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 01:42:25" (1/1) ... [2021-08-26 01:42:25,165 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-08-26 01:42:25,170 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-26 01:42:25,189 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-08-26 01:42:25,214 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-08-26 01:42:25,230 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-08-26 01:42:25,231 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-08-26 01:42:25,232 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2021-08-26 01:42:25,233 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-08-26 01:42:25,233 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-08-26 01:42:25,233 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-08-26 01:42:25,233 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-08-26 01:42:25,624 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-08-26 01:42:25,625 INFO L299 CfgBuilder]: Removed 18 assume(true) statements. [2021-08-26 01:42:25,626 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.08 01:42:25 BoogieIcfgContainer [2021-08-26 01:42:25,627 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-08-26 01:42:25,628 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-08-26 01:42:25,628 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-08-26 01:42:25,630 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-08-26 01:42:25,631 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.08 01:42:24" (1/3) ... [2021-08-26 01:42:25,631 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7707d5f4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.08 01:42:25, skipping insertion in model container [2021-08-26 01:42:25,632 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 01:42:25" (2/3) ... [2021-08-26 01:42:25,632 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7707d5f4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.08 01:42:25, skipping insertion in model container [2021-08-26 01:42:25,632 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.08 01:42:25" (3/3) ... [2021-08-26 01:42:25,633 INFO L111 eAbstractionObserver]: Analyzing ICFG double_req_bl_1252a.c [2021-08-26 01:42:25,637 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-08-26 01:42:25,638 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-08-26 01:42:25,695 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-08-26 01:42:25,704 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2021-08-26 01:42:25,704 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-08-26 01:42:25,716 INFO L276 IsEmpty]: Start isEmpty. Operand has 32 states, 30 states have (on average 1.6666666666666667) internal successors, (50), 31 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 01:42:25,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2021-08-26 01:42:25,721 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 01:42:25,721 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-26 01:42:25,722 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-26 01:42:25,735 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 01:42:25,735 INFO L82 PathProgramCache]: Analyzing trace with hash -958075201, now seen corresponding path program 1 times [2021-08-26 01:42:25,744 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 01:42:25,744 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1701060250] [2021-08-26 01:42:25,745 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 01:42:25,745 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 01:42:25,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 01:42:25,889 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-26 01:42:25,891 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 01:42:25,891 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1701060250] [2021-08-26 01:42:25,892 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1701060250] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-26 01:42:25,892 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-26 01:42:25,892 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-08-26 01:42:25,894 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1724124197] [2021-08-26 01:42:25,899 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2021-08-26 01:42:25,899 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 01:42:25,911 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-08-26 01:42:25,913 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-08-26 01:42:25,921 INFO L87 Difference]: Start difference. First operand has 32 states, 30 states have (on average 1.6666666666666667) internal successors, (50), 31 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 01:42:25,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 01:42:25,942 INFO L93 Difference]: Finished difference Result 62 states and 98 transitions. [2021-08-26 01:42:25,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-08-26 01:42:25,944 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2021-08-26 01:42:25,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 01:42:25,955 INFO L225 Difference]: With dead ends: 62 [2021-08-26 01:42:25,956 INFO L226 Difference]: Without dead ends: 29 [2021-08-26 01:42:25,959 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0ms TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-08-26 01:42:25,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2021-08-26 01:42:25,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2021-08-26 01:42:25,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 28 states have (on average 1.4285714285714286) internal successors, (40), 28 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 01:42:25,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 40 transitions. [2021-08-26 01:42:25,996 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 40 transitions. Word has length 10 [2021-08-26 01:42:25,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 01:42:25,997 INFO L470 AbstractCegarLoop]: Abstraction has 29 states and 40 transitions. [2021-08-26 01:42:25,997 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 01:42:25,998 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 40 transitions. [2021-08-26 01:42:25,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2021-08-26 01:42:25,998 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 01:42:25,999 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-26 01:42:25,999 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-08-26 01:42:25,999 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-26 01:42:26,003 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 01:42:26,003 INFO L82 PathProgramCache]: Analyzing trace with hash 1001584898, now seen corresponding path program 1 times [2021-08-26 01:42:26,003 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 01:42:26,003 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2053811885] [2021-08-26 01:42:26,004 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 01:42:26,004 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 01:42:26,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 01:42:26,153 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-26 01:42:26,154 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 01:42:26,154 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2053811885] [2021-08-26 01:42:26,155 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2053811885] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-26 01:42:26,155 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-26 01:42:26,155 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-26 01:42:26,155 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [123524479] [2021-08-26 01:42:26,162 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-26 01:42:26,164 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 01:42:26,165 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-26 01:42:26,166 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-26 01:42:26,167 INFO L87 Difference]: Start difference. First operand 29 states and 40 transitions. Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 01:42:26,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 01:42:26,248 INFO L93 Difference]: Finished difference Result 53 states and 67 transitions. [2021-08-26 01:42:26,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-26 01:42:26,249 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2021-08-26 01:42:26,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 01:42:26,252 INFO L225 Difference]: With dead ends: 53 [2021-08-26 01:42:26,252 INFO L226 Difference]: Without dead ends: 44 [2021-08-26 01:42:26,253 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 44.8ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-26 01:42:26,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2021-08-26 01:42:26,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 31. [2021-08-26 01:42:26,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 30 states have (on average 1.4) internal successors, (42), 30 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 01:42:26,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 42 transitions. [2021-08-26 01:42:26,265 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 42 transitions. Word has length 11 [2021-08-26 01:42:26,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 01:42:26,265 INFO L470 AbstractCegarLoop]: Abstraction has 31 states and 42 transitions. [2021-08-26 01:42:26,266 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 01:42:26,266 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 42 transitions. [2021-08-26 01:42:26,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2021-08-26 01:42:26,267 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 01:42:26,267 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-26 01:42:26,268 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-08-26 01:42:26,269 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-26 01:42:26,277 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 01:42:26,277 INFO L82 PathProgramCache]: Analyzing trace with hash 502201410, now seen corresponding path program 1 times [2021-08-26 01:42:26,277 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 01:42:26,277 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2139452593] [2021-08-26 01:42:26,278 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 01:42:26,278 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 01:42:26,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 01:42:26,374 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-26 01:42:26,375 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 01:42:26,377 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2139452593] [2021-08-26 01:42:26,377 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2139452593] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-26 01:42:26,378 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-26 01:42:26,378 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-26 01:42:26,378 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [293619964] [2021-08-26 01:42:26,379 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-26 01:42:26,379 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 01:42:26,380 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-26 01:42:26,381 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-26 01:42:26,387 INFO L87 Difference]: Start difference. First operand 31 states and 42 transitions. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 01:42:26,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 01:42:26,487 INFO L93 Difference]: Finished difference Result 55 states and 69 transitions. [2021-08-26 01:42:26,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-26 01:42:26,488 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2021-08-26 01:42:26,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 01:42:26,489 INFO L225 Difference]: With dead ends: 55 [2021-08-26 01:42:26,489 INFO L226 Difference]: Without dead ends: 46 [2021-08-26 01:42:26,489 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 50.2ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-26 01:42:26,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2021-08-26 01:42:26,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 31. [2021-08-26 01:42:26,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 30 states have (on average 1.4) internal successors, (42), 30 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 01:42:26,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 42 transitions. [2021-08-26 01:42:26,493 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 42 transitions. Word has length 12 [2021-08-26 01:42:26,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 01:42:26,494 INFO L470 AbstractCegarLoop]: Abstraction has 31 states and 42 transitions. [2021-08-26 01:42:26,494 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 01:42:26,494 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 42 transitions. [2021-08-26 01:42:26,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2021-08-26 01:42:26,495 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 01:42:26,495 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-26 01:42:26,495 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-08-26 01:42:26,495 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-26 01:42:26,496 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 01:42:26,496 INFO L82 PathProgramCache]: Analyzing trace with hash -1951233721, now seen corresponding path program 1 times [2021-08-26 01:42:26,496 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 01:42:26,496 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1266781204] [2021-08-26 01:42:26,497 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 01:42:26,497 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 01:42:26,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 01:42:26,567 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-26 01:42:26,568 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 01:42:26,568 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1266781204] [2021-08-26 01:42:26,571 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1266781204] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-26 01:42:26,572 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-26 01:42:26,572 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-26 01:42:26,572 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1260541068] [2021-08-26 01:42:26,572 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-26 01:42:26,572 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 01:42:26,573 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-26 01:42:26,573 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-26 01:42:26,573 INFO L87 Difference]: Start difference. First operand 31 states and 42 transitions. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 01:42:26,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 01:42:26,650 INFO L93 Difference]: Finished difference Result 57 states and 71 transitions. [2021-08-26 01:42:26,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-26 01:42:26,651 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2021-08-26 01:42:26,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 01:42:26,655 INFO L225 Difference]: With dead ends: 57 [2021-08-26 01:42:26,655 INFO L226 Difference]: Without dead ends: 48 [2021-08-26 01:42:26,656 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 24.6ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-26 01:42:26,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2021-08-26 01:42:26,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 31. [2021-08-26 01:42:26,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 30 states have (on average 1.4) internal successors, (42), 30 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 01:42:26,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 42 transitions. [2021-08-26 01:42:26,666 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 42 transitions. Word has length 13 [2021-08-26 01:42:26,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 01:42:26,666 INFO L470 AbstractCegarLoop]: Abstraction has 31 states and 42 transitions. [2021-08-26 01:42:26,666 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 01:42:26,666 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 42 transitions. [2021-08-26 01:42:26,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2021-08-26 01:42:26,669 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 01:42:26,669 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-26 01:42:26,670 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-08-26 01:42:26,670 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-26 01:42:26,670 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 01:42:26,671 INFO L82 PathProgramCache]: Analyzing trace with hash -555760345, now seen corresponding path program 1 times [2021-08-26 01:42:26,671 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 01:42:26,671 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1343940431] [2021-08-26 01:42:26,671 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 01:42:26,671 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 01:42:26,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 01:42:26,740 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-26 01:42:26,741 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 01:42:26,741 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1343940431] [2021-08-26 01:42:26,741 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1343940431] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-26 01:42:26,741 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-26 01:42:26,741 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-26 01:42:26,742 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1911150671] [2021-08-26 01:42:26,742 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-26 01:42:26,742 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 01:42:26,743 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-26 01:42:26,743 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-26 01:42:26,743 INFO L87 Difference]: Start difference. First operand 31 states and 42 transitions. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 01:42:26,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 01:42:26,816 INFO L93 Difference]: Finished difference Result 55 states and 69 transitions. [2021-08-26 01:42:26,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-26 01:42:26,817 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2021-08-26 01:42:26,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 01:42:26,819 INFO L225 Difference]: With dead ends: 55 [2021-08-26 01:42:26,819 INFO L226 Difference]: Without dead ends: 46 [2021-08-26 01:42:26,820 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 19.9ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-26 01:42:26,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2021-08-26 01:42:26,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 31. [2021-08-26 01:42:26,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 30 states have (on average 1.4) internal successors, (42), 30 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 01:42:26,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 42 transitions. [2021-08-26 01:42:26,830 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 42 transitions. Word has length 14 [2021-08-26 01:42:26,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 01:42:26,830 INFO L470 AbstractCegarLoop]: Abstraction has 31 states and 42 transitions. [2021-08-26 01:42:26,830 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 01:42:26,831 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 42 transitions. [2021-08-26 01:42:26,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2021-08-26 01:42:26,831 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 01:42:26,831 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-26 01:42:26,831 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-08-26 01:42:26,831 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-26 01:42:26,832 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 01:42:26,832 INFO L82 PathProgramCache]: Analyzing trace with hash 1219247017, now seen corresponding path program 1 times [2021-08-26 01:42:26,832 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 01:42:26,832 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1802982481] [2021-08-26 01:42:26,832 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 01:42:26,832 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 01:42:26,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-26 01:42:26,864 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-26 01:42:26,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-26 01:42:26,912 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-26 01:42:26,912 INFO L626 BasicCegarLoop]: Counterexample is feasible [2021-08-26 01:42:26,913 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION [2021-08-26 01:42:26,914 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-08-26 01:42:26,919 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-08-26 01:42:26,943 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.08 01:42:26 BoogieIcfgContainer [2021-08-26 01:42:26,944 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-08-26 01:42:26,944 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-08-26 01:42:26,944 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-08-26 01:42:26,945 INFO L275 PluginConnector]: Witness Printer initialized [2021-08-26 01:42:26,945 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.08 01:42:25" (3/4) ... [2021-08-26 01:42:26,948 INFO L140 WitnessPrinter]: No result that supports witness generation found [2021-08-26 01:42:26,948 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-08-26 01:42:26,951 INFO L168 Benchmark]: Toolchain (without parser) took 2082.69 ms. Allocated memory was 62.9 MB in the beginning and 79.7 MB in the end (delta: 16.8 MB). Free memory was 43.7 MB in the beginning and 31.2 MB in the end (delta: 12.5 MB). Peak memory consumption was 28.4 MB. Max. memory is 16.1 GB. [2021-08-26 01:42:26,953 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 62.9 MB. Free memory was 44.0 MB in the beginning and 44.0 MB in the end (delta: 40.6 kB). There was no memory consumed. Max. memory is 16.1 GB. [2021-08-26 01:42:26,956 INFO L168 Benchmark]: CACSL2BoogieTranslator took 236.05 ms. Allocated memory is still 62.9 MB. Free memory was 43.5 MB in the beginning and 45.2 MB in the end (delta: -1.7 MB). Peak memory consumption was 11.3 MB. Max. memory is 16.1 GB. [2021-08-26 01:42:26,956 INFO L168 Benchmark]: Boogie Procedure Inliner took 30.48 ms. Allocated memory is still 62.9 MB. Free memory was 45.0 MB in the beginning and 43.3 MB in the end (delta: 1.7 MB). There was no memory consumed. Max. memory is 16.1 GB. [2021-08-26 01:42:26,956 INFO L168 Benchmark]: Boogie Preprocessor took 21.33 ms. Allocated memory is still 62.9 MB. Free memory was 43.3 MB in the beginning and 41.7 MB in the end (delta: 1.5 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-08-26 01:42:26,956 INFO L168 Benchmark]: RCFGBuilder took 468.72 ms. Allocated memory is still 62.9 MB. Free memory was 41.7 MB in the beginning and 38.9 MB in the end (delta: 2.8 MB). Peak memory consumption was 16.2 MB. Max. memory is 16.1 GB. [2021-08-26 01:42:26,957 INFO L168 Benchmark]: TraceAbstraction took 1315.63 ms. Allocated memory was 62.9 MB in the beginning and 79.7 MB in the end (delta: 16.8 MB). Free memory was 38.6 MB in the beginning and 31.7 MB in the end (delta: 6.9 MB). Peak memory consumption was 23.9 MB. Max. memory is 16.1 GB. [2021-08-26 01:42:26,958 INFO L168 Benchmark]: Witness Printer took 4.70 ms. Allocated memory is still 79.7 MB. Free memory was 31.7 MB in the beginning and 31.2 MB in the end (delta: 568.2 kB). There was no memory consumed. Max. memory is 16.1 GB. [2021-08-26 01:42:26,961 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.18 ms. Allocated memory is still 62.9 MB. Free memory was 44.0 MB in the beginning and 44.0 MB in the end (delta: 40.6 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 236.05 ms. Allocated memory is still 62.9 MB. Free memory was 43.5 MB in the beginning and 45.2 MB in the end (delta: -1.7 MB). Peak memory consumption was 11.3 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 30.48 ms. Allocated memory is still 62.9 MB. Free memory was 45.0 MB in the beginning and 43.3 MB in the end (delta: 1.7 MB). There was no memory consumed. Max. memory is 16.1 GB. * Boogie Preprocessor took 21.33 ms. Allocated memory is still 62.9 MB. Free memory was 43.3 MB in the beginning and 41.7 MB in the end (delta: 1.5 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * RCFGBuilder took 468.72 ms. Allocated memory is still 62.9 MB. Free memory was 41.7 MB in the beginning and 38.9 MB in the end (delta: 2.8 MB). Peak memory consumption was 16.2 MB. Max. memory is 16.1 GB. * TraceAbstraction took 1315.63 ms. Allocated memory was 62.9 MB in the beginning and 79.7 MB in the end (delta: 16.8 MB). Free memory was 38.6 MB in the beginning and 31.7 MB in the end (delta: 6.9 MB). Peak memory consumption was 23.9 MB. Max. memory is 16.1 GB. * Witness Printer took 4.70 ms. Allocated memory is still 79.7 MB. Free memory was 31.7 MB in the beginning and 31.2 MB in the end (delta: 568.2 kB). There was no memory consumed. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0ms ErrorAutomatonConstructionTimeTotal, 0.0ms FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0ms ErrorAutomatonConstructionTimeAvg, 0.0ms ErrorAutomatonDifferenceTimeAvg, 0.0ms ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 87]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 86, overapproximation of someUnaryDOUBLEoperation at line 81. Possible FailurePath: [L81] double x = -0.0; [L82] double y = 0.0; [L26] __uint32_t msw, lsw; [L29] ieee_double_shape_type ew_u; [L30] ew_u.value = (x) [L31] EXPR ew_u.parts.msw [L31] (msw) = ew_u.parts.msw [L32] EXPR ew_u.parts.lsw [L32] (lsw) = ew_u.parts.lsw [L35-L36] COND FALSE !((msw == 0x00000000 && lsw == 0x00000000) || (msw == 0x80000000 && lsw == 0x00000000)) [L38-L39] COND FALSE !((msw >= 0x00100000 && msw <= 0x7fefffff) || (msw >= 0x80100000 && msw <= 0xffefffff)) [L41-L42] COND FALSE !(( msw <= 0x000fffff) || (msw >= 0x80000000 && msw <= 0x800fffff)) [L45-L46] COND FALSE !((msw == 0x7ff00000 && lsw == 0x00000000) || (msw == 0xfff00000 && lsw == 0x00000000)) [L49] return 0; [L54] COND TRUE __fpclassify_double(x) == 0 [L55] return y; [L83] double res = fmax_double(x, y); [L86] EXPR res == 0.0 && __signbit_double(res) == 0 [L86] COND TRUE !(res == 0.0 && __signbit_double(res) == 0) [L87] reach_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 32 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 1225.0ms, OverallIterations: 6, TraceHistogramMax: 1, EmptinessCheckTime: 12.4ms, AutomataDifference: 416.9ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 8.8ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 251 SDtfs, 64 SDslu, 298 SDs, 0 SdLazy, 84 SolverSat, 6 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 158.1ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 22 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 139.6ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=32occurred in iteration=0, InterpolantAutomatonStates: 18, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: 60.2ms AutomataMinimizationTime, 5 MinimizatonAttempts, 60 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 33.1ms SsaConstructionTime, 146.2ms SatisfiabilityAnalysisTime, 306.8ms InterpolantComputationTime, 74 NumberOfCodeBlocks, 74 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 55 ConstructedInterpolants, 0 QuantifiedInterpolants, 71 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 [2021-08-26 01:42:26,996 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request... ### Bit-precise run ### This is Ultimate 0.2.1-dev-20ed64e [2021-08-26 01:42:28,910 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-08-26 01:42:28,912 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-08-26 01:42:28,955 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-08-26 01:42:28,956 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-08-26 01:42:28,959 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-08-26 01:42:28,961 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-08-26 01:42:28,966 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-08-26 01:42:28,969 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-08-26 01:42:28,973 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-08-26 01:42:28,974 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-08-26 01:42:28,979 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-08-26 01:42:28,979 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-08-26 01:42:28,982 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-08-26 01:42:28,983 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-08-26 01:42:28,987 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-08-26 01:42:28,988 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-08-26 01:42:28,988 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-08-26 01:42:28,990 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-08-26 01:42:28,996 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-08-26 01:42:28,997 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-08-26 01:42:28,998 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-08-26 01:42:29,000 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-08-26 01:42:29,001 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-08-26 01:42:29,007 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-08-26 01:42:29,008 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-08-26 01:42:29,008 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-08-26 01:42:29,010 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-08-26 01:42:29,010 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-08-26 01:42:29,011 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-08-26 01:42:29,011 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-08-26 01:42:29,012 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-08-26 01:42:29,014 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-08-26 01:42:29,014 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-08-26 01:42:29,016 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-08-26 01:42:29,016 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-08-26 01:42:29,017 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-08-26 01:42:29,017 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-08-26 01:42:29,017 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-08-26 01:42:29,019 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-08-26 01:42:29,019 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-08-26 01:42:29,024 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2021-08-26 01:42:29,060 INFO L113 SettingsManager]: Loading preferences was successful [2021-08-26 01:42:29,061 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-08-26 01:42:29,062 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-08-26 01:42:29,062 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-08-26 01:42:29,064 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-08-26 01:42:29,064 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-08-26 01:42:29,064 INFO L138 SettingsManager]: * Use SBE=true [2021-08-26 01:42:29,064 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-08-26 01:42:29,065 INFO L138 SettingsManager]: * sizeof long=4 [2021-08-26 01:42:29,065 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-08-26 01:42:29,066 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-08-26 01:42:29,066 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-08-26 01:42:29,066 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-08-26 01:42:29,066 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-08-26 01:42:29,066 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2021-08-26 01:42:29,067 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2021-08-26 01:42:29,067 INFO L138 SettingsManager]: * sizeof long double=12 [2021-08-26 01:42:29,067 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-08-26 01:42:29,067 INFO L138 SettingsManager]: * Use constant arrays=true [2021-08-26 01:42:29,067 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-08-26 01:42:29,068 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-08-26 01:42:29,068 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-08-26 01:42:29,068 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-08-26 01:42:29,072 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-08-26 01:42:29,073 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-08-26 01:42:29,082 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-08-26 01:42:29,083 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-08-26 01:42:29,083 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2021-08-26 01:42:29,083 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2021-08-26 01:42:29,083 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-08-26 01:42:29,083 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-08-26 01:42:29,084 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-08-26 01:42:29,084 INFO L138 SettingsManager]: * Logic for external solver=AUFBV WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 23f3104f6bf674f4cf2d86feffb86c85d21d7d18 [2021-08-26 01:42:29,405 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-08-26 01:42:29,437 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-08-26 01:42:29,439 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-08-26 01:42:29,441 INFO L271 PluginConnector]: Initializing CDTParser... [2021-08-26 01:42:29,441 INFO L275 PluginConnector]: CDTParser initialized [2021-08-26 01:42:29,443 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/float-newlib/double_req_bl_1252a.c [2021-08-26 01:42:29,504 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0e5d0e412/8a6acdd198854eb7ad3865f5c379950a/FLAG4cabf9b68 [2021-08-26 01:42:29,967 INFO L306 CDTParser]: Found 1 translation units. [2021-08-26 01:42:29,970 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/double_req_bl_1252a.c [2021-08-26 01:42:29,977 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0e5d0e412/8a6acdd198854eb7ad3865f5c379950a/FLAG4cabf9b68 [2021-08-26 01:42:30,358 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0e5d0e412/8a6acdd198854eb7ad3865f5c379950a [2021-08-26 01:42:30,361 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-08-26 01:42:30,363 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-08-26 01:42:30,364 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-08-26 01:42:30,365 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-08-26 01:42:30,381 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-08-26 01:42:30,381 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.08 01:42:30" (1/1) ... [2021-08-26 01:42:30,383 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6e654fe5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 01:42:30, skipping insertion in model container [2021-08-26 01:42:30,383 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.08 01:42:30" (1/1) ... [2021-08-26 01:42:30,390 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-08-26 01:42:30,405 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-08-26 01:42:30,525 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/double_req_bl_1252a.c[2154,2167] [2021-08-26 01:42:30,531 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-26 01:42:30,554 INFO L203 MainTranslator]: Completed pre-run [2021-08-26 01:42:30,625 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/double_req_bl_1252a.c[2154,2167] [2021-08-26 01:42:30,625 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-26 01:42:30,644 INFO L208 MainTranslator]: Completed translation [2021-08-26 01:42:30,644 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 01:42:30 WrapperNode [2021-08-26 01:42:30,645 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-08-26 01:42:30,646 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-08-26 01:42:30,646 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-08-26 01:42:30,646 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-08-26 01:42:30,652 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 01:42:30" (1/1) ... [2021-08-26 01:42:30,661 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 01:42:30" (1/1) ... [2021-08-26 01:42:30,681 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-08-26 01:42:30,682 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-08-26 01:42:30,682 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-08-26 01:42:30,683 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-08-26 01:42:30,689 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 01:42:30" (1/1) ... [2021-08-26 01:42:30,689 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 01:42:30" (1/1) ... [2021-08-26 01:42:30,692 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 01:42:30" (1/1) ... [2021-08-26 01:42:30,693 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 01:42:30" (1/1) ... [2021-08-26 01:42:30,700 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 01:42:30" (1/1) ... [2021-08-26 01:42:30,704 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 01:42:30" (1/1) ... [2021-08-26 01:42:30,707 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 01:42:30" (1/1) ... [2021-08-26 01:42:30,710 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-08-26 01:42:30,711 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-08-26 01:42:30,711 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-08-26 01:42:30,711 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-08-26 01:42:30,712 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 01:42:30" (1/1) ... [2021-08-26 01:42:30,718 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-08-26 01:42:30,724 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-26 01:42:30,736 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-08-26 01:42:30,745 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-08-26 01:42:30,781 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8 [2021-08-26 01:42:30,782 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2021-08-26 01:42:30,782 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-08-26 01:42:30,782 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2021-08-26 01:42:30,782 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-08-26 01:42:30,783 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-08-26 01:42:30,783 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-08-26 01:42:31,281 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-08-26 01:42:31,282 INFO L299 CfgBuilder]: Removed 18 assume(true) statements. [2021-08-26 01:42:31,284 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.08 01:42:31 BoogieIcfgContainer [2021-08-26 01:42:31,284 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-08-26 01:42:31,286 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-08-26 01:42:31,287 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-08-26 01:42:31,290 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-08-26 01:42:31,291 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.08 01:42:30" (1/3) ... [2021-08-26 01:42:31,292 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@136ba373 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.08 01:42:31, skipping insertion in model container [2021-08-26 01:42:31,292 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 01:42:30" (2/3) ... [2021-08-26 01:42:31,292 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@136ba373 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.08 01:42:31, skipping insertion in model container [2021-08-26 01:42:31,292 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.08 01:42:31" (3/3) ... [2021-08-26 01:42:31,294 INFO L111 eAbstractionObserver]: Analyzing ICFG double_req_bl_1252a.c [2021-08-26 01:42:31,300 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-08-26 01:42:31,300 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-08-26 01:42:31,349 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-08-26 01:42:31,356 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2021-08-26 01:42:31,357 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-08-26 01:42:31,373 INFO L276 IsEmpty]: Start isEmpty. Operand has 32 states, 30 states have (on average 1.6666666666666667) internal successors, (50), 31 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 01:42:31,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2021-08-26 01:42:31,389 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 01:42:31,390 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-26 01:42:31,391 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-26 01:42:31,396 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 01:42:31,397 INFO L82 PathProgramCache]: Analyzing trace with hash -958075201, now seen corresponding path program 1 times [2021-08-26 01:42:31,407 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-26 01:42:31,407 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [621653465] [2021-08-26 01:42:31,408 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 01:42:31,408 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-26 01:42:31,409 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-26 01:42:31,411 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-08-26 01:42:31,445 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2021-08-26 01:42:31,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 01:42:31,568 INFO L263 TraceCheckSpWp]: Trace formula consists of 41 conjuncts, 1 conjunts are in the unsatisfiable core [2021-08-26 01:42:31,572 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-26 01:42:31,668 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-26 01:42:31,668 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-26 01:42:31,732 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-26 01:42:31,733 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-26 01:42:31,733 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [621653465] [2021-08-26 01:42:31,734 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [621653465] provided 2 perfect and 0 imperfect interpolant sequences [2021-08-26 01:42:31,734 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-08-26 01:42:31,734 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2021-08-26 01:42:31,735 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2115539556] [2021-08-26 01:42:31,753 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2021-08-26 01:42:31,762 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-26 01:42:31,772 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-08-26 01:42:31,778 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-08-26 01:42:31,780 INFO L87 Difference]: Start difference. First operand has 32 states, 30 states have (on average 1.6666666666666667) internal successors, (50), 31 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 01:42:31,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 01:42:31,808 INFO L93 Difference]: Finished difference Result 62 states and 98 transitions. [2021-08-26 01:42:31,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-08-26 01:42:31,810 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2021-08-26 01:42:31,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 01:42:31,824 INFO L225 Difference]: With dead ends: 62 [2021-08-26 01:42:31,832 INFO L226 Difference]: Without dead ends: 29 [2021-08-26 01:42:31,837 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1ms TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-08-26 01:42:31,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2021-08-26 01:42:31,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2021-08-26 01:42:31,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 28 states have (on average 1.4285714285714286) internal successors, (40), 28 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 01:42:31,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 40 transitions. [2021-08-26 01:42:31,869 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 40 transitions. Word has length 10 [2021-08-26 01:42:31,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 01:42:31,869 INFO L470 AbstractCegarLoop]: Abstraction has 29 states and 40 transitions. [2021-08-26 01:42:31,869 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 01:42:31,870 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 40 transitions. [2021-08-26 01:42:31,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2021-08-26 01:42:31,870 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 01:42:31,870 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-26 01:42:31,878 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Ended with exit code 0 [2021-08-26 01:42:32,071 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-08-26 01:42:32,072 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-26 01:42:32,072 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 01:42:32,073 INFO L82 PathProgramCache]: Analyzing trace with hash 1001584898, now seen corresponding path program 1 times [2021-08-26 01:42:32,073 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-26 01:42:32,073 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1211509067] [2021-08-26 01:42:32,074 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 01:42:32,074 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-26 01:42:32,074 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-26 01:42:32,075 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-08-26 01:42:32,081 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2021-08-26 01:42:32,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 01:42:32,174 INFO L263 TraceCheckSpWp]: Trace formula consists of 50 conjuncts, 3 conjunts are in the unsatisfiable core [2021-08-26 01:42:32,176 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-26 01:42:32,264 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-26 01:42:32,264 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-26 01:42:32,355 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-26 01:42:32,355 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-26 01:42:32,356 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1211509067] [2021-08-26 01:42:32,356 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1211509067] provided 2 perfect and 0 imperfect interpolant sequences [2021-08-26 01:42:32,356 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-08-26 01:42:32,356 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2021-08-26 01:42:32,356 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1349545110] [2021-08-26 01:42:32,358 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-08-26 01:42:32,358 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-26 01:42:32,359 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-08-26 01:42:32,359 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-08-26 01:42:32,359 INFO L87 Difference]: Start difference. First operand 29 states and 40 transitions. Second operand has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 01:42:32,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 01:42:32,463 INFO L93 Difference]: Finished difference Result 68 states and 85 transitions. [2021-08-26 01:42:32,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-08-26 01:42:32,469 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2021-08-26 01:42:32,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 01:42:32,471 INFO L225 Difference]: With dead ends: 68 [2021-08-26 01:42:32,471 INFO L226 Difference]: Without dead ends: 59 [2021-08-26 01:42:32,472 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 54.5ms TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-08-26 01:42:32,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2021-08-26 01:42:32,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 31. [2021-08-26 01:42:32,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 30 states have (on average 1.4) internal successors, (42), 30 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 01:42:32,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 42 transitions. [2021-08-26 01:42:32,482 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 42 transitions. Word has length 11 [2021-08-26 01:42:32,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 01:42:32,482 INFO L470 AbstractCegarLoop]: Abstraction has 31 states and 42 transitions. [2021-08-26 01:42:32,483 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 01:42:32,483 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 42 transitions. [2021-08-26 01:42:32,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2021-08-26 01:42:32,483 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 01:42:32,484 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-26 01:42:32,496 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2021-08-26 01:42:32,685 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-08-26 01:42:32,685 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-26 01:42:32,686 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 01:42:32,686 INFO L82 PathProgramCache]: Analyzing trace with hash 1219247017, now seen corresponding path program 1 times [2021-08-26 01:42:32,686 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-26 01:42:32,687 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [983969296] [2021-08-26 01:42:32,687 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 01:42:32,687 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-26 01:42:32,687 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-26 01:42:32,692 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-08-26 01:42:32,693 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2021-08-26 01:42:32,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 01:42:32,817 INFO L263 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 9 conjunts are in the unsatisfiable core [2021-08-26 01:42:32,819 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-26 01:42:33,048 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-26 01:42:33,048 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-26 01:42:33,263 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-26 01:42:33,264 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-26 01:42:33,264 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [983969296] [2021-08-26 01:42:33,265 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [983969296] provided 2 perfect and 0 imperfect interpolant sequences [2021-08-26 01:42:33,265 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-08-26 01:42:33,265 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2021-08-26 01:42:33,265 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1599080817] [2021-08-26 01:42:33,266 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-08-26 01:42:33,266 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-26 01:42:33,266 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-08-26 01:42:33,267 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-08-26 01:42:33,267 INFO L87 Difference]: Start difference. First operand 31 states and 42 transitions. Second operand has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 01:42:33,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 01:42:33,358 INFO L93 Difference]: Finished difference Result 52 states and 69 transitions. [2021-08-26 01:42:33,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-26 01:42:33,360 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2021-08-26 01:42:33,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 01:42:33,361 INFO L225 Difference]: With dead ends: 52 [2021-08-26 01:42:33,361 INFO L226 Difference]: Without dead ends: 28 [2021-08-26 01:42:33,361 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 65.9ms TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-08-26 01:42:33,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2021-08-26 01:42:33,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2021-08-26 01:42:33,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 27 states have (on average 1.2962962962962963) internal successors, (35), 27 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 01:42:33,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 35 transitions. [2021-08-26 01:42:33,365 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 35 transitions. Word has length 14 [2021-08-26 01:42:33,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 01:42:33,366 INFO L470 AbstractCegarLoop]: Abstraction has 28 states and 35 transitions. [2021-08-26 01:42:33,366 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 01:42:33,366 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 35 transitions. [2021-08-26 01:42:33,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-08-26 01:42:33,367 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 01:42:33,367 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-26 01:42:33,378 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2021-08-26 01:42:33,578 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-08-26 01:42:33,578 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-26 01:42:33,579 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 01:42:33,579 INFO L82 PathProgramCache]: Analyzing trace with hash 1012446717, now seen corresponding path program 1 times [2021-08-26 01:42:33,579 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-26 01:42:33,579 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [336379596] [2021-08-26 01:42:33,580 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 01:42:33,580 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-26 01:42:33,580 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-26 01:42:33,581 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-08-26 01:42:33,583 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2021-08-26 01:42:33,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 01:42:33,680 INFO L263 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 3 conjunts are in the unsatisfiable core [2021-08-26 01:42:33,681 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-26 01:42:33,762 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-26 01:42:33,763 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-26 01:42:33,823 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-26 01:42:33,824 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-26 01:42:33,825 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [336379596] [2021-08-26 01:42:33,825 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [336379596] provided 2 perfect and 0 imperfect interpolant sequences [2021-08-26 01:42:33,825 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-08-26 01:42:33,825 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2021-08-26 01:42:33,825 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [654553680] [2021-08-26 01:42:33,826 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-08-26 01:42:33,826 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-26 01:42:33,827 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-08-26 01:42:33,827 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-08-26 01:42:33,827 INFO L87 Difference]: Start difference. First operand 28 states and 35 transitions. Second operand has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 01:42:33,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 01:42:33,900 INFO L93 Difference]: Finished difference Result 65 states and 76 transitions. [2021-08-26 01:42:33,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-08-26 01:42:33,901 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2021-08-26 01:42:33,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 01:42:33,904 INFO L225 Difference]: With dead ends: 65 [2021-08-26 01:42:33,904 INFO L226 Difference]: Without dead ends: 56 [2021-08-26 01:42:33,905 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 31.8ms TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-08-26 01:42:33,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2021-08-26 01:42:33,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 30. [2021-08-26 01:42:33,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 29 states have (on average 1.2758620689655173) internal successors, (37), 29 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 01:42:33,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 37 transitions. [2021-08-26 01:42:33,916 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 37 transitions. Word has length 16 [2021-08-26 01:42:33,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 01:42:33,917 INFO L470 AbstractCegarLoop]: Abstraction has 30 states and 37 transitions. [2021-08-26 01:42:33,917 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 01:42:33,917 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 37 transitions. [2021-08-26 01:42:33,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-08-26 01:42:33,919 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 01:42:33,919 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-26 01:42:33,932 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2021-08-26 01:42:34,129 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-08-26 01:42:34,129 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-26 01:42:34,130 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 01:42:34,130 INFO L82 PathProgramCache]: Analyzing trace with hash -414082333, now seen corresponding path program 1 times [2021-08-26 01:42:34,130 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-26 01:42:34,130 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [187117291] [2021-08-26 01:42:34,131 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 01:42:34,131 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-26 01:42:34,131 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-26 01:42:34,132 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-08-26 01:42:34,133 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2021-08-26 01:42:34,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 01:42:34,262 INFO L263 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 7 conjunts are in the unsatisfiable core [2021-08-26 01:42:34,263 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-26 01:42:34,412 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-26 01:42:34,413 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-26 01:42:34,577 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-26 01:42:34,577 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-26 01:42:34,577 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [187117291] [2021-08-26 01:42:34,577 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [187117291] provided 2 perfect and 0 imperfect interpolant sequences [2021-08-26 01:42:34,578 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-08-26 01:42:34,578 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2021-08-26 01:42:34,578 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1926689893] [2021-08-26 01:42:34,578 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-26 01:42:34,578 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-26 01:42:34,579 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-26 01:42:34,579 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-08-26 01:42:34,579 INFO L87 Difference]: Start difference. First operand 30 states and 37 transitions. Second operand has 4 states, 4 states have (on average 7.5) internal successors, (30), 4 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 01:42:34,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 01:42:34,595 INFO L93 Difference]: Finished difference Result 40 states and 47 transitions. [2021-08-26 01:42:34,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-26 01:42:34,597 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 4 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-08-26 01:42:34,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 01:42:34,597 INFO L225 Difference]: With dead ends: 40 [2021-08-26 01:42:34,597 INFO L226 Difference]: Without dead ends: 30 [2021-08-26 01:42:34,598 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 32.0ms TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-08-26 01:42:34,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2021-08-26 01:42:34,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2021-08-26 01:42:34,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 29 states have (on average 1.2413793103448276) internal successors, (36), 29 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 01:42:34,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 36 transitions. [2021-08-26 01:42:34,602 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 36 transitions. Word has length 18 [2021-08-26 01:42:34,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 01:42:34,602 INFO L470 AbstractCegarLoop]: Abstraction has 30 states and 36 transitions. [2021-08-26 01:42:34,602 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 4 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 01:42:34,602 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 36 transitions. [2021-08-26 01:42:34,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-08-26 01:42:34,603 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 01:42:34,603 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-26 01:42:34,620 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2021-08-26 01:42:34,816 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-08-26 01:42:34,817 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-26 01:42:34,817 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 01:42:34,817 INFO L82 PathProgramCache]: Analyzing trace with hash -356824031, now seen corresponding path program 1 times [2021-08-26 01:42:34,817 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-26 01:42:34,817 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1435170224] [2021-08-26 01:42:34,817 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 01:42:34,817 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-26 01:42:34,818 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-26 01:42:34,819 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-08-26 01:42:34,821 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2021-08-26 01:42:34,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 01:42:34,941 INFO L263 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 8 conjunts are in the unsatisfiable core [2021-08-26 01:42:34,943 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-26 01:42:35,052 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-26 01:42:35,053 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-26 01:42:35,157 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-26 01:42:35,157 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-26 01:42:35,158 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1435170224] [2021-08-26 01:42:35,158 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1435170224] provided 2 perfect and 0 imperfect interpolant sequences [2021-08-26 01:42:35,158 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-08-26 01:42:35,158 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [] total 9 [2021-08-26 01:42:35,158 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1920516562] [2021-08-26 01:42:35,159 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-08-26 01:42:35,159 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-26 01:42:35,159 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-08-26 01:42:35,160 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2021-08-26 01:42:35,160 INFO L87 Difference]: Start difference. First operand 30 states and 36 transitions. Second operand has 9 states, 9 states have (on average 3.5555555555555554) internal successors, (32), 9 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 01:42:35,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 01:42:35,264 INFO L93 Difference]: Finished difference Result 42 states and 47 transitions. [2021-08-26 01:42:35,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-08-26 01:42:35,265 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.5555555555555554) internal successors, (32), 9 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-08-26 01:42:35,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 01:42:35,265 INFO L225 Difference]: With dead ends: 42 [2021-08-26 01:42:35,265 INFO L226 Difference]: Without dead ends: 39 [2021-08-26 01:42:35,266 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 94.6ms TimeCoverageRelationStatistics Valid=44, Invalid=112, Unknown=0, NotChecked=0, Total=156 [2021-08-26 01:42:35,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2021-08-26 01:42:35,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 32. [2021-08-26 01:42:35,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 31 states have (on average 1.2258064516129032) internal successors, (38), 31 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 01:42:35,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 38 transitions. [2021-08-26 01:42:35,269 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 38 transitions. Word has length 18 [2021-08-26 01:42:35,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 01:42:35,269 INFO L470 AbstractCegarLoop]: Abstraction has 32 states and 38 transitions. [2021-08-26 01:42:35,270 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.5555555555555554) internal successors, (32), 9 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 01:42:35,270 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 38 transitions. [2021-08-26 01:42:35,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-08-26 01:42:35,270 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 01:42:35,270 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-26 01:42:35,284 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2021-08-26 01:42:35,479 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-08-26 01:42:35,479 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-26 01:42:35,479 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 01:42:35,480 INFO L82 PathProgramCache]: Analyzing trace with hash -208358251, now seen corresponding path program 1 times [2021-08-26 01:42:35,480 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-26 01:42:35,480 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1455545181] [2021-08-26 01:42:35,480 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 01:42:35,480 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-26 01:42:35,480 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-26 01:42:35,481 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-08-26 01:42:35,483 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2021-08-26 01:42:35,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 01:42:35,605 INFO L263 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 9 conjunts are in the unsatisfiable core [2021-08-26 01:42:35,611 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-26 01:42:35,739 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-26 01:42:35,739 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-26 01:42:35,905 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-26 01:42:35,906 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-26 01:42:35,906 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1455545181] [2021-08-26 01:42:35,906 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1455545181] provided 2 perfect and 0 imperfect interpolant sequences [2021-08-26 01:42:35,906 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-08-26 01:42:35,906 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 8 [2021-08-26 01:42:35,906 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1158445308] [2021-08-26 01:42:35,907 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-08-26 01:42:35,907 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-26 01:42:35,908 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-08-26 01:42:35,908 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-08-26 01:42:35,909 INFO L87 Difference]: Start difference. First operand 32 states and 38 transitions. Second operand has 8 states, 8 states have (on average 3.75) internal successors, (30), 8 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 01:42:35,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 01:42:35,980 INFO L93 Difference]: Finished difference Result 45 states and 50 transitions. [2021-08-26 01:42:35,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-08-26 01:42:35,981 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.75) internal successors, (30), 8 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2021-08-26 01:42:35,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 01:42:35,983 INFO L225 Difference]: With dead ends: 45 [2021-08-26 01:42:35,983 INFO L226 Difference]: Without dead ends: 27 [2021-08-26 01:42:35,984 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 97.1ms TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2021-08-26 01:42:35,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2021-08-26 01:42:35,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2021-08-26 01:42:35,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 26 states have (on average 1.0769230769230769) internal successors, (28), 26 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 01:42:35,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 28 transitions. [2021-08-26 01:42:35,993 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 28 transitions. Word has length 19 [2021-08-26 01:42:35,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 01:42:35,993 INFO L470 AbstractCegarLoop]: Abstraction has 27 states and 28 transitions. [2021-08-26 01:42:35,993 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.75) internal successors, (30), 8 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 01:42:35,993 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 28 transitions. [2021-08-26 01:42:35,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-08-26 01:42:35,994 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 01:42:35,994 INFO L512 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] [2021-08-26 01:42:36,005 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2021-08-26 01:42:36,204 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-08-26 01:42:36,205 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-26 01:42:36,205 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 01:42:36,205 INFO L82 PathProgramCache]: Analyzing trace with hash -1524231306, now seen corresponding path program 1 times [2021-08-26 01:42:36,205 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-26 01:42:36,206 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [523508338] [2021-08-26 01:42:36,206 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 01:42:36,206 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-26 01:42:36,206 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-26 01:42:36,207 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-08-26 01:42:36,208 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2021-08-26 01:42:36,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 01:42:36,374 INFO L263 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 15 conjunts are in the unsatisfiable core [2021-08-26 01:42:36,375 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-26 01:42:36,582 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-26 01:42:36,583 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-26 01:42:36,982 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-26 01:42:36,982 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-26 01:42:36,983 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [523508338] [2021-08-26 01:42:36,983 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [523508338] provided 2 perfect and 0 imperfect interpolant sequences [2021-08-26 01:42:36,983 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-08-26 01:42:36,983 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10, 10] imperfect sequences [] total 16 [2021-08-26 01:42:36,983 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1696525102] [2021-08-26 01:42:36,984 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2021-08-26 01:42:36,984 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-26 01:42:36,984 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-08-26 01:42:36,985 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=205, Unknown=0, NotChecked=0, Total=240 [2021-08-26 01:42:36,985 INFO L87 Difference]: Start difference. First operand 27 states and 28 transitions. Second operand has 16 states, 16 states have (on average 2.5) internal successors, (40), 16 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 01:42:37,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 01:42:37,173 INFO L93 Difference]: Finished difference Result 27 states and 28 transitions. [2021-08-26 01:42:37,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-08-26 01:42:37,174 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.5) internal successors, (40), 16 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2021-08-26 01:42:37,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 01:42:37,174 INFO L225 Difference]: With dead ends: 27 [2021-08-26 01:42:37,174 INFO L226 Difference]: Without dead ends: 0 [2021-08-26 01:42:37,175 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 335.0ms TimeCoverageRelationStatistics Valid=104, Invalid=358, Unknown=0, NotChecked=0, Total=462 [2021-08-26 01:42:37,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2021-08-26 01:42:37,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2021-08-26 01:42:37,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 01:42:37,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2021-08-26 01:42:37,176 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 22 [2021-08-26 01:42:37,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 01:42:37,176 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-08-26 01:42:37,176 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.5) internal successors, (40), 16 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 01:42:37,176 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2021-08-26 01:42:37,176 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-08-26 01:42:37,178 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION [2021-08-26 01:42:37,187 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2021-08-26 01:42:37,382 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-08-26 01:42:37,385 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2021-08-26 01:42:37,387 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-26 01:42:37,415 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-26 01:42:37,428 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-26 01:42:37,450 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-26 01:42:37,462 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-26 01:42:37,465 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-26 01:42:37,466 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-26 01:42:37,467 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-26 01:42:37,692 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2021-08-26 01:42:37,692 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2021-08-26 01:42:37,692 INFO L857 garLoopResultBuilder]: For program point L28-1(lines 28 33) no Hoare annotation was computed. [2021-08-26 01:42:37,693 INFO L853 garLoopResultBuilder]: At program point L28-2(lines 28 33) the Hoare annotation is: (let ((.cse0 (fp.neg (_ +zero 11 53)))) (and (= ULTIMATE.start___fpclassify_double_~x .cse0) (= .cse0 ULTIMATE.start_fmax_double_~x) (= (_ +zero 11 53) ULTIMATE.start_fmax_double_~y))) [2021-08-26 01:42:37,693 INFO L857 garLoopResultBuilder]: For program point L28-3(lines 25 50) no Hoare annotation was computed. [2021-08-26 01:42:37,693 INFO L857 garLoopResultBuilder]: For program point L28-5(lines 28 33) no Hoare annotation was computed. [2021-08-26 01:42:37,693 INFO L853 garLoopResultBuilder]: At program point L28-6(lines 28 33) the Hoare annotation is: (and (= (_ +zero 11 53) ULTIMATE.start___fpclassify_double_~x) (= (fp.neg (_ +zero 11 53)) ULTIMATE.start_fmax_double_~x) (= (_ +zero 11 53) ULTIMATE.start_fmax_double_~y)) [2021-08-26 01:42:37,693 INFO L857 garLoopResultBuilder]: For program point L86(line 86) no Hoare annotation was computed. [2021-08-26 01:42:37,694 INFO L857 garLoopResultBuilder]: For program point L28-7(lines 25 50) no Hoare annotation was computed. [2021-08-26 01:42:37,694 INFO L857 garLoopResultBuilder]: For program point L86-2(lines 86 89) no Hoare annotation was computed. [2021-08-26 01:42:37,694 INFO L857 garLoopResultBuilder]: For program point L45(lines 45 49) no Hoare annotation was computed. [2021-08-26 01:42:37,694 INFO L857 garLoopResultBuilder]: For program point L45-1(lines 45 49) no Hoare annotation was computed. [2021-08-26 01:42:37,694 INFO L857 garLoopResultBuilder]: For program point L87(line 87) no Hoare annotation was computed. [2021-08-26 01:42:37,694 INFO L857 garLoopResultBuilder]: For program point L54(lines 54 55) no Hoare annotation was computed. [2021-08-26 01:42:37,694 INFO L853 garLoopResultBuilder]: At program point L71(lines 62 72) the Hoare annotation is: (and (= |ULTIMATE.start___signbit_double_#res| (_ bv0 32)) (= (_ +zero 11 53) |ULTIMATE.start_fmax_double_#res|) |ULTIMATE.start_main_#t~short15| (exists ((|v_skolemized_q#valueAsBitvector_8| (_ BitVec 64))) (and (= ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_8|) ULTIMATE.start___fpclassify_double_~msw~0) (= (_ +zero 11 53) (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_8|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_8|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_8|))))) (= (_ +zero 11 53) ULTIMATE.start___fpclassify_double_~x) (exists ((|v_skolemized_q#valueAsBitvector_9| (_ BitVec 64))) (and (= ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_9|) ULTIMATE.start___signbit_double_~msw~1) (= (_ +zero 11 53) (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_9|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_9|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_9|))))) (= (_ +zero 11 53) ULTIMATE.start___signbit_double_~x) (= (fp.neg (_ +zero 11 53)) ULTIMATE.start_fmax_double_~x) (= (_ +zero 11 53) ULTIMATE.start_main_~res~0) (= (_ +zero 11 53) ULTIMATE.start_fmax_double_~y)) [2021-08-26 01:42:37,695 INFO L857 garLoopResultBuilder]: For program point L38(lines 38 49) no Hoare annotation was computed. [2021-08-26 01:42:37,695 INFO L857 garLoopResultBuilder]: For program point L38-1(lines 38 49) no Hoare annotation was computed. [2021-08-26 01:42:37,695 INFO L857 garLoopResultBuilder]: For program point L56(lines 56 57) no Hoare annotation was computed. [2021-08-26 01:42:37,695 INFO L857 garLoopResultBuilder]: For program point L65-1(lines 65 69) no Hoare annotation was computed. [2021-08-26 01:42:37,695 INFO L857 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2021-08-26 01:42:37,695 INFO L853 garLoopResultBuilder]: At program point L65-2(lines 65 69) the Hoare annotation is: (and (= (_ +zero 11 53) |ULTIMATE.start_fmax_double_#res|) |ULTIMATE.start_main_#t~short15| (exists ((|v_skolemized_q#valueAsBitvector_8| (_ BitVec 64))) (and (= ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_8|) ULTIMATE.start___fpclassify_double_~msw~0) (= (_ +zero 11 53) (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_8|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_8|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_8|))))) (= (_ +zero 11 53) ULTIMATE.start___fpclassify_double_~x) (= (_ +zero 11 53) ULTIMATE.start___signbit_double_~x) (= (fp.neg (_ +zero 11 53)) ULTIMATE.start_fmax_double_~x) (= (_ +zero 11 53) ULTIMATE.start_main_~res~0) (= (_ +zero 11 53) ULTIMATE.start_fmax_double_~y)) [2021-08-26 01:42:37,695 INFO L857 garLoopResultBuilder]: For program point L65-3(lines 65 69) no Hoare annotation was computed. [2021-08-26 01:42:37,696 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 87) no Hoare annotation was computed. [2021-08-26 01:42:37,696 INFO L853 garLoopResultBuilder]: At program point L49(lines 25 50) the Hoare annotation is: (let ((.cse0 (fp.neg (_ +zero 11 53)))) (and (exists ((|v_skolemized_q#valueAsBitvector_7| (_ BitVec 64))) (and (= (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_7|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_7|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_7|)) (fp.neg (_ +zero 11 53))) (= ULTIMATE.start___fpclassify_double_~msw~0 ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_7|)))) (= ULTIMATE.start___fpclassify_double_~x .cse0) (= .cse0 ULTIMATE.start_fmax_double_~x) (not (= |ULTIMATE.start___fpclassify_double_#res| (_ bv0 32))) (= (_ +zero 11 53) ULTIMATE.start_fmax_double_~y))) [2021-08-26 01:42:37,696 INFO L853 garLoopResultBuilder]: At program point L49-1(lines 25 50) the Hoare annotation is: (and (exists ((|v_skolemized_q#valueAsBitvector_8| (_ BitVec 64))) (and (= ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_8|) ULTIMATE.start___fpclassify_double_~msw~0) (= (_ +zero 11 53) (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_8|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_8|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_8|))))) (= (_ +zero 11 53) ULTIMATE.start___fpclassify_double_~x) (= (fp.neg (_ +zero 11 53)) ULTIMATE.start_fmax_double_~x) (not (= |ULTIMATE.start___fpclassify_double_#res| (_ bv0 32))) (= (_ +zero 11 53) ULTIMATE.start_fmax_double_~y)) [2021-08-26 01:42:37,696 INFO L857 garLoopResultBuilder]: For program point L41(lines 41 49) no Hoare annotation was computed. [2021-08-26 01:42:37,696 INFO L857 garLoopResultBuilder]: For program point L41-1(lines 41 49) no Hoare annotation was computed. [2021-08-26 01:42:37,696 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2021-08-26 01:42:37,697 INFO L860 garLoopResultBuilder]: At program point L91(lines 74 92) the Hoare annotation is: true [2021-08-26 01:42:37,697 INFO L857 garLoopResultBuilder]: For program point L59(line 59) no Hoare annotation was computed. [2021-08-26 01:42:37,697 INFO L857 garLoopResultBuilder]: For program point L59-2(line 59) no Hoare annotation was computed. [2021-08-26 01:42:37,697 INFO L853 garLoopResultBuilder]: At program point L59-3(lines 52 60) the Hoare annotation is: (and (= (_ +zero 11 53) |ULTIMATE.start_fmax_double_#res|) (exists ((|v_skolemized_q#valueAsBitvector_8| (_ BitVec 64))) (and (= ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_8|) ULTIMATE.start___fpclassify_double_~msw~0) (= (_ +zero 11 53) (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_8|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_8|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_8|))))) (= (_ +zero 11 53) ULTIMATE.start___fpclassify_double_~x) (= (fp.neg (_ +zero 11 53)) ULTIMATE.start_fmax_double_~x) (= (_ +zero 11 53) ULTIMATE.start_fmax_double_~y)) [2021-08-26 01:42:37,701 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-08-26 01:42:37,706 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_8,QUANTIFIED] [2021-08-26 01:42:37,706 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_8,QUANTIFIED] [2021-08-26 01:42:37,707 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_8,QUANTIFIED] [2021-08-26 01:42:37,707 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_8,QUANTIFIED] [2021-08-26 01:42:37,712 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_8,QUANTIFIED] [2021-08-26 01:42:37,712 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_8,QUANTIFIED] [2021-08-26 01:42:37,713 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_8,QUANTIFIED] [2021-08-26 01:42:37,713 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_8,QUANTIFIED] [2021-08-26 01:42:37,714 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2021-08-26 01:42:37,714 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2021-08-26 01:42:37,714 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2021-08-26 01:42:37,714 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2021-08-26 01:42:37,715 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2021-08-26 01:42:37,715 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2021-08-26 01:42:37,715 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2021-08-26 01:42:37,715 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2021-08-26 01:42:37,716 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_8,QUANTIFIED] [2021-08-26 01:42:37,716 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_8,QUANTIFIED] [2021-08-26 01:42:37,716 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_8,QUANTIFIED] [2021-08-26 01:42:37,716 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_8,QUANTIFIED] [2021-08-26 01:42:37,716 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_9,QUANTIFIED] [2021-08-26 01:42:37,717 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_9,QUANTIFIED] [2021-08-26 01:42:37,717 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_9,QUANTIFIED] [2021-08-26 01:42:37,717 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_9,QUANTIFIED] [2021-08-26 01:42:37,718 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_8,QUANTIFIED] [2021-08-26 01:42:37,718 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_8,QUANTIFIED] [2021-08-26 01:42:37,718 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_8,QUANTIFIED] [2021-08-26 01:42:37,718 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_8,QUANTIFIED] [2021-08-26 01:42:37,718 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_9,QUANTIFIED] [2021-08-26 01:42:37,718 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_9,QUANTIFIED] [2021-08-26 01:42:37,719 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_9,QUANTIFIED] [2021-08-26 01:42:37,719 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_9,QUANTIFIED] [2021-08-26 01:42:37,719 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_8,QUANTIFIED] [2021-08-26 01:42:37,719 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_8,QUANTIFIED] [2021-08-26 01:42:37,720 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_8,QUANTIFIED] [2021-08-26 01:42:37,720 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_8,QUANTIFIED] [2021-08-26 01:42:37,720 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_8,QUANTIFIED] [2021-08-26 01:42:37,720 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_8,QUANTIFIED] [2021-08-26 01:42:37,721 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_8,QUANTIFIED] [2021-08-26 01:42:37,721 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_8,QUANTIFIED] [2021-08-26 01:42:37,722 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_8,QUANTIFIED] [2021-08-26 01:42:37,722 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_8,QUANTIFIED] [2021-08-26 01:42:37,722 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_8,QUANTIFIED] [2021-08-26 01:42:37,722 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_8,QUANTIFIED] [2021-08-26 01:42:37,723 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_8,QUANTIFIED] [2021-08-26 01:42:37,723 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_8,QUANTIFIED] [2021-08-26 01:42:37,723 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_8,QUANTIFIED] [2021-08-26 01:42:37,723 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_8,QUANTIFIED] [2021-08-26 01:42:37,724 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.08 01:42:37 BoogieIcfgContainer [2021-08-26 01:42:37,724 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-08-26 01:42:37,724 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-08-26 01:42:37,724 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-08-26 01:42:37,725 INFO L275 PluginConnector]: Witness Printer initialized [2021-08-26 01:42:37,725 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.08 01:42:31" (3/4) ... [2021-08-26 01:42:37,728 INFO L137 WitnessPrinter]: Generating witness for correct program [2021-08-26 01:42:37,736 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 17 nodes and edges [2021-08-26 01:42:37,737 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 8 nodes and edges [2021-08-26 01:42:37,737 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2021-08-26 01:42:37,737 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2021-08-26 01:42:37,755 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((\exists v_skolemized_q#valueAsBitvector_7 : bv64 :: ~fp~LONGDOUBLE(v_skolemized_q#valueAsBitvector_7[63:63], v_skolemized_q#valueAsBitvector_7[62:52], v_skolemized_q#valueAsBitvector_7[51:0]) == ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE()) && msw == v_skolemized_q#valueAsBitvector_7[63:32]) && x == ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE())) && ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE()) == x) && !(\result == 0bv32)) && ~Pluszero~LONGDOUBLE() == y [2021-08-26 01:42:37,756 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((~Pluszero~LONGDOUBLE() == \result && (\exists v_skolemized_q#valueAsBitvector_8 : bv64 :: v_skolemized_q#valueAsBitvector_8[63:32] == msw && ~Pluszero~LONGDOUBLE() == ~fp~LONGDOUBLE(v_skolemized_q#valueAsBitvector_8[63:63], v_skolemized_q#valueAsBitvector_8[62:52], v_skolemized_q#valueAsBitvector_8[51:0]))) && ~Pluszero~LONGDOUBLE() == x) && ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE()) == x) && ~Pluszero~LONGDOUBLE() == y [2021-08-26 01:42:37,756 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((~Pluszero~LONGDOUBLE() == \result && aux-res == 0.0 && __signbit_double(res) == 0-aux) && (\exists v_skolemized_q#valueAsBitvector_8 : bv64 :: v_skolemized_q#valueAsBitvector_8[63:32] == msw && ~Pluszero~LONGDOUBLE() == ~fp~LONGDOUBLE(v_skolemized_q#valueAsBitvector_8[63:63], v_skolemized_q#valueAsBitvector_8[62:52], v_skolemized_q#valueAsBitvector_8[51:0]))) && ~Pluszero~LONGDOUBLE() == x) && ~Pluszero~LONGDOUBLE() == x) && ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE()) == x) && ~Pluszero~LONGDOUBLE() == res) && ~Pluszero~LONGDOUBLE() == y [2021-08-26 01:42:37,757 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((\exists v_skolemized_q#valueAsBitvector_8 : bv64 :: v_skolemized_q#valueAsBitvector_8[63:32] == msw && ~Pluszero~LONGDOUBLE() == ~fp~LONGDOUBLE(v_skolemized_q#valueAsBitvector_8[63:63], v_skolemized_q#valueAsBitvector_8[62:52], v_skolemized_q#valueAsBitvector_8[51:0])) && ~Pluszero~LONGDOUBLE() == x) && ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE()) == x) && !(\result == 0bv32)) && ~Pluszero~LONGDOUBLE() == y [2021-08-26 01:42:37,757 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((\result == 0bv32 && ~Pluszero~LONGDOUBLE() == \result) && aux-res == 0.0 && __signbit_double(res) == 0-aux) && (\exists v_skolemized_q#valueAsBitvector_8 : bv64 :: v_skolemized_q#valueAsBitvector_8[63:32] == msw && ~Pluszero~LONGDOUBLE() == ~fp~LONGDOUBLE(v_skolemized_q#valueAsBitvector_8[63:63], v_skolemized_q#valueAsBitvector_8[62:52], v_skolemized_q#valueAsBitvector_8[51:0]))) && ~Pluszero~LONGDOUBLE() == x) && (\exists v_skolemized_q#valueAsBitvector_9 : bv64 :: v_skolemized_q#valueAsBitvector_9[63:32] == msw && ~Pluszero~LONGDOUBLE() == ~fp~LONGDOUBLE(v_skolemized_q#valueAsBitvector_9[63:63], v_skolemized_q#valueAsBitvector_9[62:52], v_skolemized_q#valueAsBitvector_9[51:0]))) && ~Pluszero~LONGDOUBLE() == x) && ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE()) == x) && ~Pluszero~LONGDOUBLE() == res) && ~Pluszero~LONGDOUBLE() == y [2021-08-26 01:42:37,768 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2021-08-26 01:42:37,768 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-08-26 01:42:37,769 INFO L168 Benchmark]: Toolchain (without parser) took 7406.18 ms. Allocated memory was 58.7 MB in the beginning and 86.0 MB in the end (delta: 27.3 MB). Free memory was 37.7 MB in the beginning and 42.2 MB in the end (delta: -4.5 MB). Peak memory consumption was 21.2 MB. Max. memory is 16.1 GB. [2021-08-26 01:42:37,770 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 58.7 MB. Free memory was 40.9 MB in the beginning and 40.8 MB in the end (delta: 39.1 kB). There was no memory consumed. Max. memory is 16.1 GB. [2021-08-26 01:42:37,770 INFO L168 Benchmark]: CACSL2BoogieTranslator took 280.67 ms. Allocated memory is still 58.7 MB. Free memory was 37.5 MB in the beginning and 41.2 MB in the end (delta: -3.7 MB). Peak memory consumption was 12.6 MB. Max. memory is 16.1 GB. [2021-08-26 01:42:37,770 INFO L168 Benchmark]: Boogie Procedure Inliner took 35.69 ms. Allocated memory is still 58.7 MB. Free memory was 41.2 MB in the beginning and 39.4 MB in the end (delta: 1.7 MB). There was no memory consumed. Max. memory is 16.1 GB. [2021-08-26 01:42:37,771 INFO L168 Benchmark]: Boogie Preprocessor took 27.86 ms. Allocated memory is still 58.7 MB. Free memory was 39.4 MB in the beginning and 37.8 MB in the end (delta: 1.6 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-08-26 01:42:37,771 INFO L168 Benchmark]: RCFGBuilder took 573.92 ms. Allocated memory was 58.7 MB in the beginning and 71.3 MB in the end (delta: 12.6 MB). Free memory was 37.6 MB in the beginning and 44.7 MB in the end (delta: -7.0 MB). Peak memory consumption was 16.4 MB. Max. memory is 16.1 GB. [2021-08-26 01:42:37,771 INFO L168 Benchmark]: TraceAbstraction took 6437.48 ms. Allocated memory was 71.3 MB in the beginning and 86.0 MB in the end (delta: 14.7 MB). Free memory was 44.1 MB in the beginning and 46.4 MB in the end (delta: -2.3 MB). Peak memory consumption was 37.3 MB. Max. memory is 16.1 GB. [2021-08-26 01:42:37,771 INFO L168 Benchmark]: Witness Printer took 43.84 ms. Allocated memory is still 86.0 MB. Free memory was 46.4 MB in the beginning and 42.2 MB in the end (delta: 4.2 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. [2021-08-26 01:42:37,773 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.18 ms. Allocated memory is still 58.7 MB. Free memory was 40.9 MB in the beginning and 40.8 MB in the end (delta: 39.1 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 280.67 ms. Allocated memory is still 58.7 MB. Free memory was 37.5 MB in the beginning and 41.2 MB in the end (delta: -3.7 MB). Peak memory consumption was 12.6 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 35.69 ms. Allocated memory is still 58.7 MB. Free memory was 41.2 MB in the beginning and 39.4 MB in the end (delta: 1.7 MB). There was no memory consumed. Max. memory is 16.1 GB. * Boogie Preprocessor took 27.86 ms. Allocated memory is still 58.7 MB. Free memory was 39.4 MB in the beginning and 37.8 MB in the end (delta: 1.6 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * RCFGBuilder took 573.92 ms. Allocated memory was 58.7 MB in the beginning and 71.3 MB in the end (delta: 12.6 MB). Free memory was 37.6 MB in the beginning and 44.7 MB in the end (delta: -7.0 MB). Peak memory consumption was 16.4 MB. Max. memory is 16.1 GB. * TraceAbstraction took 6437.48 ms. Allocated memory was 71.3 MB in the beginning and 86.0 MB in the end (delta: 14.7 MB). Free memory was 44.1 MB in the beginning and 46.4 MB in the end (delta: -2.3 MB). Peak memory consumption was 37.3 MB. Max. memory is 16.1 GB. * Witness Printer took 43.84 ms. Allocated memory is still 86.0 MB. Free memory was 46.4 MB in the beginning and 42.2 MB in the end (delta: 4.2 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_8,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_8,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_8,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_8,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_8,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_8,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_8,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_8,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_8,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_8,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_8,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_8,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_8,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_8,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_8,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_8,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_8,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_8,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_8,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_8,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_8,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_8,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_8,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_8,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_8,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_8,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_8,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_8,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_8,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_8,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_8,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_8,QUANTIFIED] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0ms ErrorAutomatonConstructionTimeTotal, 0.0ms FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0ms ErrorAutomatonConstructionTimeAvg, 0.0ms ErrorAutomatonDifferenceTimeAvg, 0.0ms ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 87]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 32 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 6353.5ms, OverallIterations: 8, TraceHistogramMax: 1, EmptinessCheckTime: 25.8ms, AutomataDifference: 754.6ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 308.2ms, InitialAbstractionConstructionTime: 11.2ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 252 SDtfs, 303 SDslu, 522 SDs, 0 SdLazy, 178 SolverSat, 34 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 286.1ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 257 GetRequests, 199 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 711.3ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=32occurred in iteration=0, InterpolantAutomatonStates: 42, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: 61.4ms AutomataMinimizationTime, 8 MinimizatonAttempts, 61 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: 0.0ms HoareAnnotationTime, 8 LocationsWithAnnotation, 8 PreInvPairs, 16 NumberOfFragments, 205 HoareAnnotationTreeSize, 8 FomulaSimplifications, 52 FormulaSimplificationTreeSizeReduction, 82.1ms HoareSimplificationTime, 8 FomulaSimplificationsInter, 30 FormulaSimplificationTreeSizeReductionInter, 215.0ms HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 114.6ms SsaConstructionTime, 291.8ms SatisfiabilityAnalysisTime, 2403.1ms InterpolantComputationTime, 128 NumberOfCodeBlocks, 128 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 240 ConstructedInterpolants, 32 QuantifiedInterpolants, 1020 SizeOfPredicates, 38 NumberOfNonLiveVariables, 505 ConjunctsInSsa, 55 ConjunctsInUnsatCore, 16 InterpolantComputations, 16 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 - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 25]: Loop Invariant [2021-08-26 01:42:37,783 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_8,QUANTIFIED] [2021-08-26 01:42:37,783 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_8,QUANTIFIED] [2021-08-26 01:42:37,783 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_8,QUANTIFIED] [2021-08-26 01:42:37,784 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_8,QUANTIFIED] [2021-08-26 01:42:37,784 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_8,QUANTIFIED] [2021-08-26 01:42:37,784 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_8,QUANTIFIED] [2021-08-26 01:42:37,784 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_8,QUANTIFIED] [2021-08-26 01:42:37,784 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_8,QUANTIFIED] Derived loop invariant: ((((\exists v_skolemized_q#valueAsBitvector_8 : bv64 :: v_skolemized_q#valueAsBitvector_8[63:32] == msw && ~Pluszero~LONGDOUBLE() == ~fp~LONGDOUBLE(v_skolemized_q#valueAsBitvector_8[63:63], v_skolemized_q#valueAsBitvector_8[62:52], v_skolemized_q#valueAsBitvector_8[51:0])) && ~Pluszero~LONGDOUBLE() == x) && ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE()) == x) && !(\result == 0bv32)) && ~Pluszero~LONGDOUBLE() == y - InvariantResult [Line: 25]: Loop Invariant [2021-08-26 01:42:37,785 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2021-08-26 01:42:37,785 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2021-08-26 01:42:37,785 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2021-08-26 01:42:37,785 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2021-08-26 01:42:37,786 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2021-08-26 01:42:37,786 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2021-08-26 01:42:37,786 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2021-08-26 01:42:37,786 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] Derived loop invariant: ((((\exists v_skolemized_q#valueAsBitvector_7 : bv64 :: ~fp~LONGDOUBLE(v_skolemized_q#valueAsBitvector_7[63:63], v_skolemized_q#valueAsBitvector_7[62:52], v_skolemized_q#valueAsBitvector_7[51:0]) == ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE()) && msw == v_skolemized_q#valueAsBitvector_7[63:32]) && x == ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE())) && ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE()) == x) && !(\result == 0bv32)) && ~Pluszero~LONGDOUBLE() == y - InvariantResult [Line: 62]: Loop Invariant [2021-08-26 01:42:37,786 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_8,QUANTIFIED] [2021-08-26 01:42:37,787 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_8,QUANTIFIED] [2021-08-26 01:42:37,787 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_8,QUANTIFIED] [2021-08-26 01:42:37,787 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_8,QUANTIFIED] [2021-08-26 01:42:37,787 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_9,QUANTIFIED] [2021-08-26 01:42:37,787 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_9,QUANTIFIED] [2021-08-26 01:42:37,787 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_9,QUANTIFIED] [2021-08-26 01:42:37,787 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_9,QUANTIFIED] [2021-08-26 01:42:37,788 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_8,QUANTIFIED] [2021-08-26 01:42:37,788 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_8,QUANTIFIED] [2021-08-26 01:42:37,788 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_8,QUANTIFIED] [2021-08-26 01:42:37,788 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_8,QUANTIFIED] [2021-08-26 01:42:37,788 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_9,QUANTIFIED] [2021-08-26 01:42:37,789 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_9,QUANTIFIED] [2021-08-26 01:42:37,789 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_9,QUANTIFIED] [2021-08-26 01:42:37,789 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_9,QUANTIFIED] Derived loop invariant: ((((((((\result == 0bv32 && ~Pluszero~LONGDOUBLE() == \result) && aux-res == 0.0 && __signbit_double(res) == 0-aux) && (\exists v_skolemized_q#valueAsBitvector_8 : bv64 :: v_skolemized_q#valueAsBitvector_8[63:32] == msw && ~Pluszero~LONGDOUBLE() == ~fp~LONGDOUBLE(v_skolemized_q#valueAsBitvector_8[63:63], v_skolemized_q#valueAsBitvector_8[62:52], v_skolemized_q#valueAsBitvector_8[51:0]))) && ~Pluszero~LONGDOUBLE() == x) && (\exists v_skolemized_q#valueAsBitvector_9 : bv64 :: v_skolemized_q#valueAsBitvector_9[63:32] == msw && ~Pluszero~LONGDOUBLE() == ~fp~LONGDOUBLE(v_skolemized_q#valueAsBitvector_9[63:63], v_skolemized_q#valueAsBitvector_9[62:52], v_skolemized_q#valueAsBitvector_9[51:0]))) && ~Pluszero~LONGDOUBLE() == x) && ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE()) == x) && ~Pluszero~LONGDOUBLE() == res) && ~Pluszero~LONGDOUBLE() == y - InvariantResult [Line: 65]: Loop Invariant [2021-08-26 01:42:37,790 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_8,QUANTIFIED] [2021-08-26 01:42:37,790 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_8,QUANTIFIED] [2021-08-26 01:42:37,790 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_8,QUANTIFIED] [2021-08-26 01:42:37,790 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_8,QUANTIFIED] [2021-08-26 01:42:37,790 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_8,QUANTIFIED] [2021-08-26 01:42:37,790 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_8,QUANTIFIED] [2021-08-26 01:42:37,791 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_8,QUANTIFIED] [2021-08-26 01:42:37,791 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_8,QUANTIFIED] Derived loop invariant: ((((((~Pluszero~LONGDOUBLE() == \result && aux-res == 0.0 && __signbit_double(res) == 0-aux) && (\exists v_skolemized_q#valueAsBitvector_8 : bv64 :: v_skolemized_q#valueAsBitvector_8[63:32] == msw && ~Pluszero~LONGDOUBLE() == ~fp~LONGDOUBLE(v_skolemized_q#valueAsBitvector_8[63:63], v_skolemized_q#valueAsBitvector_8[62:52], v_skolemized_q#valueAsBitvector_8[51:0]))) && ~Pluszero~LONGDOUBLE() == x) && ~Pluszero~LONGDOUBLE() == x) && ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE()) == x) && ~Pluszero~LONGDOUBLE() == res) && ~Pluszero~LONGDOUBLE() == y - InvariantResult [Line: 28]: Loop Invariant Derived loop invariant: (x == ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE()) && ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE()) == x) && ~Pluszero~LONGDOUBLE() == y - InvariantResult [Line: 28]: Loop Invariant Derived loop invariant: (~Pluszero~LONGDOUBLE() == x && ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE()) == x) && ~Pluszero~LONGDOUBLE() == y - InvariantResult [Line: 74]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 52]: Loop Invariant [2021-08-26 01:42:37,792 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_8,QUANTIFIED] [2021-08-26 01:42:37,792 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_8,QUANTIFIED] [2021-08-26 01:42:37,792 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_8,QUANTIFIED] [2021-08-26 01:42:37,792 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_8,QUANTIFIED] [2021-08-26 01:42:37,793 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_8,QUANTIFIED] [2021-08-26 01:42:37,793 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_8,QUANTIFIED] [2021-08-26 01:42:37,793 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_8,QUANTIFIED] [2021-08-26 01:42:37,793 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_8,QUANTIFIED] Derived loop invariant: (((~Pluszero~LONGDOUBLE() == \result && (\exists v_skolemized_q#valueAsBitvector_8 : bv64 :: v_skolemized_q#valueAsBitvector_8[63:32] == msw && ~Pluszero~LONGDOUBLE() == ~fp~LONGDOUBLE(v_skolemized_q#valueAsBitvector_8[63:63], v_skolemized_q#valueAsBitvector_8[62:52], v_skolemized_q#valueAsBitvector_8[51:0]))) && ~Pluszero~LONGDOUBLE() == x) && ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE()) == x) && ~Pluszero~LONGDOUBLE() == y RESULT: Ultimate proved your program to be correct! [2021-08-26 01:42:37,827 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...