./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/float-newlib/float_req_bl_1251.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 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/float_req_bl_1251.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 32adbfac5f3e3ea232180afd045da0027ca6d993 ...................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/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/float_req_bl_1251.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 32adbfac5f3e3ea232180afd045da0027ca6d993 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ 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:54:08,850 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-08-26 01:54:08,852 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-08-26 01:54:08,885 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-08-26 01:54:08,885 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-08-26 01:54:08,889 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-08-26 01:54:08,891 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-08-26 01:54:08,896 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-08-26 01:54:08,898 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-08-26 01:54:08,902 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-08-26 01:54:08,903 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-08-26 01:54:08,907 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-08-26 01:54:08,907 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-08-26 01:54:08,909 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-08-26 01:54:08,911 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-08-26 01:54:08,913 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-08-26 01:54:08,913 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-08-26 01:54:08,914 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-08-26 01:54:08,918 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-08-26 01:54:08,922 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-08-26 01:54:08,923 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-08-26 01:54:08,924 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-08-26 01:54:08,925 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-08-26 01:54:08,927 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-08-26 01:54:08,933 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-08-26 01:54:08,934 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-08-26 01:54:08,934 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-08-26 01:54:08,936 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-08-26 01:54:08,936 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-08-26 01:54:08,937 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-08-26 01:54:08,938 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-08-26 01:54:08,938 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-08-26 01:54:08,940 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-08-26 01:54:08,940 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-08-26 01:54:08,942 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-08-26 01:54:08,942 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-08-26 01:54:08,942 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-08-26 01:54:08,943 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-08-26 01:54:08,943 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-08-26 01:54:08,944 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-08-26 01:54:08,945 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-08-26 01:54:08,949 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:54:08,980 INFO L113 SettingsManager]: Loading preferences was successful [2021-08-26 01:54:08,980 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-08-26 01:54:08,981 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-08-26 01:54:08,981 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-08-26 01:54:08,983 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-08-26 01:54:08,984 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-08-26 01:54:08,984 INFO L138 SettingsManager]: * Use SBE=true [2021-08-26 01:54:08,984 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-08-26 01:54:08,984 INFO L138 SettingsManager]: * sizeof long=4 [2021-08-26 01:54:08,985 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-08-26 01:54:08,985 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-08-26 01:54:08,986 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-08-26 01:54:08,986 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-08-26 01:54:08,986 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-08-26 01:54:08,986 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-08-26 01:54:08,986 INFO L138 SettingsManager]: * sizeof long double=12 [2021-08-26 01:54:08,987 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-08-26 01:54:08,987 INFO L138 SettingsManager]: * Use constant arrays=true [2021-08-26 01:54:08,987 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-08-26 01:54:08,987 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-08-26 01:54:08,988 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-08-26 01:54:08,988 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-08-26 01:54:08,988 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-08-26 01:54:08,988 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-08-26 01:54:08,989 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-08-26 01:54:08,989 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-08-26 01:54:08,989 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-08-26 01:54:08,989 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-08-26 01:54:08,989 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-08-26 01:54:08,989 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-08-26 01:54:08,990 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 -> 32adbfac5f3e3ea232180afd045da0027ca6d993 [2021-08-26 01:54:09,285 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-08-26 01:54:09,310 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-08-26 01:54:09,314 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-08-26 01:54:09,315 INFO L271 PluginConnector]: Initializing CDTParser... [2021-08-26 01:54:09,316 INFO L275 PluginConnector]: CDTParser initialized [2021-08-26 01:54:09,317 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/float-newlib/float_req_bl_1251.c [2021-08-26 01:54:09,380 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bbe18d753/54826d6c106f45a9ba7d66a0eca14f46/FLAGc5d13a493 [2021-08-26 01:54:09,852 INFO L306 CDTParser]: Found 1 translation units. [2021-08-26 01:54:09,853 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/float_req_bl_1251.c [2021-08-26 01:54:09,858 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bbe18d753/54826d6c106f45a9ba7d66a0eca14f46/FLAGc5d13a493 [2021-08-26 01:54:10,245 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bbe18d753/54826d6c106f45a9ba7d66a0eca14f46 [2021-08-26 01:54:10,249 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-08-26 01:54:10,250 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-08-26 01:54:10,252 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-08-26 01:54:10,252 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-08-26 01:54:10,255 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-08-26 01:54:10,255 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.08 01:54:10" (1/1) ... [2021-08-26 01:54:10,257 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@831cc9f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 01:54:10, skipping insertion in model container [2021-08-26 01:54:10,257 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.08 01:54:10" (1/1) ... [2021-08-26 01:54:10,264 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-08-26 01:54:10,279 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-08-26 01:54:10,398 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/float_req_bl_1251.c[1980,1993] [2021-08-26 01:54:10,401 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/float_req_bl_1251.c[2139,2152] [2021-08-26 01:54:10,402 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-26 01:54:10,408 INFO L203 MainTranslator]: Completed pre-run [2021-08-26 01:54:10,425 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/float_req_bl_1251.c[1980,1993] [2021-08-26 01:54:10,426 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/float_req_bl_1251.c[2139,2152] [2021-08-26 01:54:10,427 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-26 01:54:10,438 INFO L208 MainTranslator]: Completed translation [2021-08-26 01:54:10,438 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 01:54:10 WrapperNode [2021-08-26 01:54:10,438 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-08-26 01:54:10,439 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-08-26 01:54:10,439 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-08-26 01:54:10,439 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-08-26 01:54:10,445 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:54:10" (1/1) ... [2021-08-26 01:54:10,452 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:54:10" (1/1) ... [2021-08-26 01:54:10,474 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-08-26 01:54:10,475 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-08-26 01:54:10,475 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-08-26 01:54:10,475 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-08-26 01:54:10,482 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 01:54:10" (1/1) ... [2021-08-26 01:54:10,482 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 01:54:10" (1/1) ... [2021-08-26 01:54:10,485 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 01:54:10" (1/1) ... [2021-08-26 01:54:10,485 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 01:54:10" (1/1) ... [2021-08-26 01:54:10,492 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 01:54:10" (1/1) ... [2021-08-26 01:54:10,495 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 01:54:10" (1/1) ... [2021-08-26 01:54:10,497 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 01:54:10" (1/1) ... [2021-08-26 01:54:10,499 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-08-26 01:54:10,500 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-08-26 01:54:10,500 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-08-26 01:54:10,501 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-08-26 01:54:10,501 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 01:54:10" (1/1) ... [2021-08-26 01:54:10,507 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-08-26 01:54:10,513 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-26 01:54:10,530 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:54:10,536 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:54:10,567 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-08-26 01:54:10,568 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-08-26 01:54:10,568 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2021-08-26 01:54:10,568 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-08-26 01:54:10,568 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-08-26 01:54:10,568 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-08-26 01:54:10,569 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-08-26 01:54:11,056 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-08-26 01:54:11,056 INFO L299 CfgBuilder]: Removed 30 assume(true) statements. [2021-08-26 01:54:11,057 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.08 01:54:11 BoogieIcfgContainer [2021-08-26 01:54:11,058 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-08-26 01:54:11,059 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-08-26 01:54:11,059 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-08-26 01:54:11,061 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-08-26 01:54:11,068 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.08 01:54:10" (1/3) ... [2021-08-26 01:54:11,069 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@455c8678 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.08 01:54:11, skipping insertion in model container [2021-08-26 01:54:11,069 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 01:54:10" (2/3) ... [2021-08-26 01:54:11,069 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@455c8678 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.08 01:54:11, skipping insertion in model container [2021-08-26 01:54:11,070 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.08 01:54:11" (3/3) ... [2021-08-26 01:54:11,071 INFO L111 eAbstractionObserver]: Analyzing ICFG float_req_bl_1251.c [2021-08-26 01:54:11,075 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-08-26 01:54:11,075 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2021-08-26 01:54:11,135 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-08-26 01:54:11,143 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:54:11,144 INFO L340 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2021-08-26 01:54:11,158 INFO L276 IsEmpty]: Start isEmpty. Operand has 47 states, 44 states have (on average 1.5681818181818181) internal successors, (69), 46 states have internal predecessors, (69), 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:54:11,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-08-26 01:54:11,165 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 01:54:11,166 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:54:11,166 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-26 01:54:11,180 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 01:54:11,181 INFO L82 PathProgramCache]: Analyzing trace with hash 1204154757, now seen corresponding path program 1 times [2021-08-26 01:54:11,188 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 01:54:11,189 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1877053863] [2021-08-26 01:54:11,189 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 01:54:11,190 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 01:54:11,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 01:54:11,342 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:54:11,343 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 01:54:11,343 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1877053863] [2021-08-26 01:54:11,344 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1877053863] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-26 01:54:11,344 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-26 01:54:11,344 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-26 01:54:11,346 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [616805520] [2021-08-26 01:54:11,349 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-26 01:54:11,350 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 01:54:11,359 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-26 01:54:11,360 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-26 01:54:11,362 INFO L87 Difference]: Start difference. First operand has 47 states, 44 states have (on average 1.5681818181818181) internal successors, (69), 46 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 01:54:11,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 01:54:11,423 INFO L93 Difference]: Finished difference Result 90 states and 134 transitions. [2021-08-26 01:54:11,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-08-26 01:54:11,425 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2021-08-26 01:54:11,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 01:54:11,432 INFO L225 Difference]: With dead ends: 90 [2021-08-26 01:54:11,432 INFO L226 Difference]: Without dead ends: 50 [2021-08-26 01:54:11,434 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 19.4ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-26 01:54:11,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2021-08-26 01:54:11,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 45. [2021-08-26 01:54:11,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 43 states have (on average 1.3953488372093024) internal successors, (60), 44 states have internal predecessors, (60), 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:54:11,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 60 transitions. [2021-08-26 01:54:11,462 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 60 transitions. Word has length 16 [2021-08-26 01:54:11,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 01:54:11,463 INFO L470 AbstractCegarLoop]: Abstraction has 45 states and 60 transitions. [2021-08-26 01:54:11,463 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 01:54:11,463 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 60 transitions. [2021-08-26 01:54:11,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-08-26 01:54:11,464 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 01:54:11,464 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:54:11,465 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-08-26 01:54:11,465 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-26 01:54:11,465 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 01:54:11,466 INFO L82 PathProgramCache]: Analyzing trace with hash 44236684, now seen corresponding path program 1 times [2021-08-26 01:54:11,466 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 01:54:11,466 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [907378584] [2021-08-26 01:54:11,466 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 01:54:11,467 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 01:54:11,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 01:54:11,568 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:54:11,569 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 01:54:11,569 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [907378584] [2021-08-26 01:54:11,570 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [907378584] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-26 01:54:11,570 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-26 01:54:11,570 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-26 01:54:11,571 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [101452677] [2021-08-26 01:54:11,572 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-26 01:54:11,572 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 01:54:11,572 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-26 01:54:11,573 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-26 01:54:11,573 INFO L87 Difference]: Start difference. First operand 45 states and 60 transitions. Second operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 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:54:11,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 01:54:11,640 INFO L93 Difference]: Finished difference Result 77 states and 97 transitions. [2021-08-26 01:54:11,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-26 01:54:11,641 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 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:54:11,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 01:54:11,642 INFO L225 Difference]: With dead ends: 77 [2021-08-26 01:54:11,643 INFO L226 Difference]: Without dead ends: 64 [2021-08-26 01:54:11,645 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 13.8ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-26 01:54:11,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2021-08-26 01:54:11,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 47. [2021-08-26 01:54:11,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 45 states have (on average 1.3777777777777778) internal successors, (62), 46 states have internal predecessors, (62), 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:54:11,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 62 transitions. [2021-08-26 01:54:11,658 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 62 transitions. Word has length 18 [2021-08-26 01:54:11,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 01:54:11,659 INFO L470 AbstractCegarLoop]: Abstraction has 47 states and 62 transitions. [2021-08-26 01:54:11,659 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 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:54:11,659 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 62 transitions. [2021-08-26 01:54:11,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-08-26 01:54:11,661 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 01:54:11,662 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:54:11,662 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-08-26 01:54:11,662 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-26 01:54:11,663 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 01:54:11,667 INFO L82 PathProgramCache]: Analyzing trace with hash -674173253, now seen corresponding path program 1 times [2021-08-26 01:54:11,667 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 01:54:11,667 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1902726873] [2021-08-26 01:54:11,668 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 01:54:11,668 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 01:54:11,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 01:54:11,736 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:54:11,736 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 01:54:11,736 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1902726873] [2021-08-26 01:54:11,737 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1902726873] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-26 01:54:11,737 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-26 01:54:11,737 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-26 01:54:11,737 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [573730071] [2021-08-26 01:54:11,738 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-26 01:54:11,738 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 01:54:11,738 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-26 01:54:11,738 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-26 01:54:11,739 INFO L87 Difference]: Start difference. First operand 47 states and 62 transitions. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 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:54:11,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 01:54:11,771 INFO L93 Difference]: Finished difference Result 79 states and 99 transitions. [2021-08-26 01:54:11,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-26 01:54:11,772 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 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 19 [2021-08-26 01:54:11,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 01:54:11,773 INFO L225 Difference]: With dead ends: 79 [2021-08-26 01:54:11,773 INFO L226 Difference]: Without dead ends: 66 [2021-08-26 01:54:11,773 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 9.4ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-26 01:54:11,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2021-08-26 01:54:11,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 47. [2021-08-26 01:54:11,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 45 states have (on average 1.3777777777777778) internal successors, (62), 46 states have internal predecessors, (62), 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:54:11,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 62 transitions. [2021-08-26 01:54:11,778 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 62 transitions. Word has length 19 [2021-08-26 01:54:11,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 01:54:11,779 INFO L470 AbstractCegarLoop]: Abstraction has 47 states and 62 transitions. [2021-08-26 01:54:11,779 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 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:54:11,779 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 62 transitions. [2021-08-26 01:54:11,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-08-26 01:54:11,780 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 01:54:11,780 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] [2021-08-26 01:54:11,780 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-08-26 01:54:11,781 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-26 01:54:11,781 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 01:54:11,781 INFO L82 PathProgramCache]: Analyzing trace with hash -1345927737, now seen corresponding path program 1 times [2021-08-26 01:54:11,781 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 01:54:11,782 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [463042921] [2021-08-26 01:54:11,782 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 01:54:11,782 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 01:54:11,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 01:54:11,822 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:54:11,822 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 01:54:11,822 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [463042921] [2021-08-26 01:54:11,823 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [463042921] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-26 01:54:11,823 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-26 01:54:11,823 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-26 01:54:11,823 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1016632782] [2021-08-26 01:54:11,824 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-26 01:54:11,824 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 01:54:11,824 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-26 01:54:11,825 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-26 01:54:11,825 INFO L87 Difference]: Start difference. First operand 47 states and 62 transitions. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 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:54:11,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 01:54:11,864 INFO L93 Difference]: Finished difference Result 81 states and 101 transitions. [2021-08-26 01:54:11,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-26 01:54:11,864 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 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 20 [2021-08-26 01:54:11,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 01:54:11,865 INFO L225 Difference]: With dead ends: 81 [2021-08-26 01:54:11,865 INFO L226 Difference]: Without dead ends: 68 [2021-08-26 01:54:11,866 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 17.3ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-26 01:54:11,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2021-08-26 01:54:11,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 47. [2021-08-26 01:54:11,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 45 states have (on average 1.3777777777777778) internal successors, (62), 46 states have internal predecessors, (62), 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:54:11,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 62 transitions. [2021-08-26 01:54:11,870 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 62 transitions. Word has length 20 [2021-08-26 01:54:11,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 01:54:11,871 INFO L470 AbstractCegarLoop]: Abstraction has 47 states and 62 transitions. [2021-08-26 01:54:11,871 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 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:54:11,871 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 62 transitions. [2021-08-26 01:54:11,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-08-26 01:54:11,872 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 01:54:11,872 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] [2021-08-26 01:54:11,872 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-08-26 01:54:11,873 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-26 01:54:11,873 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 01:54:11,873 INFO L82 PathProgramCache]: Analyzing trace with hash -1380709804, now seen corresponding path program 1 times [2021-08-26 01:54:11,873 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 01:54:11,874 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1727671454] [2021-08-26 01:54:11,874 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 01:54:11,874 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 01:54:11,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 01:54:11,906 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:54:11,907 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 01:54:11,907 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1727671454] [2021-08-26 01:54:11,907 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1727671454] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-26 01:54:11,907 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-26 01:54:11,907 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-26 01:54:11,908 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [607705846] [2021-08-26 01:54:11,908 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-26 01:54:11,908 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 01:54:11,909 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-26 01:54:11,909 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-26 01:54:11,909 INFO L87 Difference]: Start difference. First operand 47 states and 62 transitions. Second operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 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:54:11,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 01:54:11,924 INFO L93 Difference]: Finished difference Result 50 states and 65 transitions. [2021-08-26 01:54:11,924 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-26 01:54:11,925 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 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 21 [2021-08-26 01:54:11,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 01:54:11,925 INFO L225 Difference]: With dead ends: 50 [2021-08-26 01:54:11,925 INFO L226 Difference]: Without dead ends: 48 [2021-08-26 01:54:11,926 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.8ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-26 01:54:11,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2021-08-26 01:54:11,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2021-08-26 01:54:11,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 46 states have (on average 1.3695652173913044) internal successors, (63), 47 states have internal predecessors, (63), 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:54:11,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 63 transitions. [2021-08-26 01:54:11,933 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 63 transitions. Word has length 21 [2021-08-26 01:54:11,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 01:54:11,934 INFO L470 AbstractCegarLoop]: Abstraction has 48 states and 63 transitions. [2021-08-26 01:54:11,934 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 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:54:11,934 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 63 transitions. [2021-08-26 01:54:11,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-08-26 01:54:11,935 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 01:54:11,935 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:54:11,935 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-08-26 01:54:11,936 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-26 01:54:11,936 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 01:54:11,936 INFO L82 PathProgramCache]: Analyzing trace with hash 147544209, now seen corresponding path program 1 times [2021-08-26 01:54:11,937 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 01:54:11,937 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [86196501] [2021-08-26 01:54:11,937 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 01:54:11,937 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 01:54:11,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-26 01:54:12,003 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-26 01:54:12,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-26 01:54:12,068 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-26 01:54:12,069 INFO L626 BasicCegarLoop]: Counterexample is feasible [2021-08-26 01:54:12,070 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION [2021-08-26 01:54:12,074 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION [2021-08-26 01:54:12,074 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-08-26 01:54:12,079 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-08-26 01:54:12,116 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.08 01:54:12 BoogieIcfgContainer [2021-08-26 01:54:12,116 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-08-26 01:54:12,117 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-08-26 01:54:12,117 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-08-26 01:54:12,117 INFO L275 PluginConnector]: Witness Printer initialized [2021-08-26 01:54:12,117 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.08 01:54:11" (3/4) ... [2021-08-26 01:54:12,120 INFO L140 WitnessPrinter]: No result that supports witness generation found [2021-08-26 01:54:12,120 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-08-26 01:54:12,122 INFO L168 Benchmark]: Toolchain (without parser) took 1870.95 ms. Allocated memory was 65.0 MB in the beginning and 83.9 MB in the end (delta: 18.9 MB). Free memory was 45.8 MB in the beginning and 42.4 MB in the end (delta: 3.4 MB). Peak memory consumption was 24.6 MB. Max. memory is 16.1 GB. [2021-08-26 01:54:12,122 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 65.0 MB. Free memory was 47.4 MB in the beginning and 47.3 MB in the end (delta: 84.0 kB). There was no memory consumed. Max. memory is 16.1 GB. [2021-08-26 01:54:12,122 INFO L168 Benchmark]: CACSL2BoogieTranslator took 187.08 ms. Allocated memory is still 65.0 MB. Free memory was 45.6 MB in the beginning and 35.3 MB in the end (delta: 10.3 MB). Peak memory consumption was 10.5 MB. Max. memory is 16.1 GB. [2021-08-26 01:54:12,123 INFO L168 Benchmark]: Boogie Procedure Inliner took 34.80 ms. Allocated memory is still 65.0 MB. Free memory was 35.1 MB in the beginning and 33.2 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-08-26 01:54:12,123 INFO L168 Benchmark]: Boogie Preprocessor took 24.96 ms. Allocated memory is still 65.0 MB. Free memory was 33.2 MB in the beginning and 31.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:54:12,124 INFO L168 Benchmark]: RCFGBuilder took 557.29 ms. Allocated memory is still 65.0 MB. Free memory was 31.7 MB in the beginning and 28.1 MB in the end (delta: 3.6 MB). Peak memory consumption was 8.5 MB. Max. memory is 16.1 GB. [2021-08-26 01:54:12,125 INFO L168 Benchmark]: TraceAbstraction took 1057.37 ms. Allocated memory was 65.0 MB in the beginning and 83.9 MB in the end (delta: 18.9 MB). Free memory was 27.6 MB in the beginning and 43.0 MB in the end (delta: -15.4 MB). Peak memory consumption was 3.5 MB. Max. memory is 16.1 GB. [2021-08-26 01:54:12,125 INFO L168 Benchmark]: Witness Printer took 3.46 ms. Allocated memory is still 83.9 MB. Free memory was 43.0 MB in the beginning and 42.4 MB in the end (delta: 553.9 kB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-08-26 01:54:12,128 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19 ms. Allocated memory is still 65.0 MB. Free memory was 47.4 MB in the beginning and 47.3 MB in the end (delta: 84.0 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 187.08 ms. Allocated memory is still 65.0 MB. Free memory was 45.6 MB in the beginning and 35.3 MB in the end (delta: 10.3 MB). Peak memory consumption was 10.5 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 34.80 ms. Allocated memory is still 65.0 MB. Free memory was 35.1 MB in the beginning and 33.2 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 24.96 ms. Allocated memory is still 65.0 MB. Free memory was 33.2 MB in the beginning and 31.7 MB in the end (delta: 1.5 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * RCFGBuilder took 557.29 ms. Allocated memory is still 65.0 MB. Free memory was 31.7 MB in the beginning and 28.1 MB in the end (delta: 3.6 MB). Peak memory consumption was 8.5 MB. Max. memory is 16.1 GB. * TraceAbstraction took 1057.37 ms. Allocated memory was 65.0 MB in the beginning and 83.9 MB in the end (delta: 18.9 MB). Free memory was 27.6 MB in the beginning and 43.0 MB in the end (delta: -15.4 MB). Peak memory consumption was 3.5 MB. Max. memory is 16.1 GB. * Witness Printer took 3.46 ms. Allocated memory is still 83.9 MB. Free memory was 43.0 MB in the beginning and 42.4 MB in the end (delta: 553.9 kB). Peak memory consumption was 2.1 MB. 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: 76]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 75. Possible FailurePath: [L66] float x = __VERIFIER_nondet_float(); [L67] float y = __VERIFIER_nondet_float(); [L57] return x != x; [L69] EXPR isnan_float(x) && !isnan_float(y) [L57] return x != x; [L69] EXPR isnan_float(x) && !isnan_float(y) [L69-L70] (isnan_float(x) && !isnan_float(y)) || (!isnan_float(x) && isnan_float(y)) [L69-L70] COND TRUE (isnan_float(x) && !isnan_float(y)) || (!isnan_float(x) && isnan_float(y)) [L23] __uint32_t w; [L26] ieee_float_shape_type gf_u; [L27] gf_u.value = (x) [L28] EXPR gf_u.word [L28] (w) = gf_u.word [L31] COND FALSE !(w == 0x00000000 || w == 0x80000000) [L33-L34] COND FALSE !((w >= 0x00800000 && w <= 0x7f7fffff) || (w >= 0x80800000 && w <= 0xff7fffff)) [L36-L37] COND FALSE !((w >= 0x00000001 && w <= 0x007fffff) || (w >= 0x80000001 && w <= 0x807fffff)) [L39] COND FALSE !(w == 0x7f800000 || w == 0xff800000) [L42] return 0; [L46] COND TRUE __fpclassify_float(x) == 0 [L47] return y; [L72] float res = fmax_float(x, y); [L57] return x != x; [L75] EXPR isnan_float(x) && !isnan_float(y) [L57] return x != x; [L75] EXPR isnan_float(x) && !isnan_float(y) [L75] COND TRUE isnan_float(x) && !isnan_float(y) && res != y [L76] reach_error() - UnprovableResult [Line: 82]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 47 locations, 2 error locations. Started 1 CEGAR loops. OverallTime: 944.4ms, OverallIterations: 6, TraceHistogramMax: 1, EmptinessCheckTime: 15.3ms, AutomataDifference: 250.8ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 10.4ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 343 SDtfs, 79 SDslu, 503 SDs, 0 SdLazy, 88 SolverSat, 6 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 92.8ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 23 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 61.8ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=48occurred in iteration=5, InterpolantAutomatonStates: 20, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: 46.4ms AutomataMinimizationTime, 5 MinimizatonAttempts, 62 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 19.1ms SsaConstructionTime, 145.6ms SatisfiabilityAnalysisTime, 225.7ms InterpolantComputationTime, 116 NumberOfCodeBlocks, 116 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 89 ConstructedInterpolants, 0 QuantifiedInterpolants, 104 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:54:12,164 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... ### Bit-precise run ### This is Ultimate 0.2.1-dev-20ed64e [2021-08-26 01:54:14,118 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-08-26 01:54:14,121 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-08-26 01:54:14,160 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-08-26 01:54:14,160 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-08-26 01:54:14,164 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-08-26 01:54:14,165 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-08-26 01:54:14,170 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-08-26 01:54:14,172 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-08-26 01:54:14,176 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-08-26 01:54:14,178 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-08-26 01:54:14,181 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-08-26 01:54:14,182 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-08-26 01:54:14,184 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-08-26 01:54:14,186 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-08-26 01:54:14,189 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-08-26 01:54:14,190 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-08-26 01:54:14,191 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-08-26 01:54:14,193 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-08-26 01:54:14,198 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-08-26 01:54:14,200 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-08-26 01:54:14,201 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-08-26 01:54:14,203 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-08-26 01:54:14,203 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-08-26 01:54:14,225 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-08-26 01:54:14,226 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-08-26 01:54:14,226 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-08-26 01:54:14,228 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-08-26 01:54:14,228 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-08-26 01:54:14,229 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-08-26 01:54:14,229 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-08-26 01:54:14,230 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-08-26 01:54:14,232 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-08-26 01:54:14,232 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-08-26 01:54:14,233 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-08-26 01:54:14,234 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-08-26 01:54:14,234 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-08-26 01:54:14,235 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-08-26 01:54:14,235 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-08-26 01:54:14,236 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-08-26 01:54:14,237 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-08-26 01:54:14,241 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:54:14,280 INFO L113 SettingsManager]: Loading preferences was successful [2021-08-26 01:54:14,280 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-08-26 01:54:14,281 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-08-26 01:54:14,281 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-08-26 01:54:14,283 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-08-26 01:54:14,283 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-08-26 01:54:14,284 INFO L138 SettingsManager]: * Use SBE=true [2021-08-26 01:54:14,284 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-08-26 01:54:14,284 INFO L138 SettingsManager]: * sizeof long=4 [2021-08-26 01:54:14,284 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-08-26 01:54:14,285 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-08-26 01:54:14,285 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-08-26 01:54:14,286 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-08-26 01:54:14,286 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-08-26 01:54:14,286 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2021-08-26 01:54:14,286 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2021-08-26 01:54:14,286 INFO L138 SettingsManager]: * sizeof long double=12 [2021-08-26 01:54:14,286 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-08-26 01:54:14,287 INFO L138 SettingsManager]: * Use constant arrays=true [2021-08-26 01:54:14,287 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-08-26 01:54:14,287 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-08-26 01:54:14,287 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-08-26 01:54:14,287 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-08-26 01:54:14,287 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-08-26 01:54:14,288 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-08-26 01:54:14,288 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-08-26 01:54:14,288 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-08-26 01:54:14,288 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2021-08-26 01:54:14,288 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2021-08-26 01:54:14,289 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-08-26 01:54:14,289 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-08-26 01:54:14,289 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-08-26 01:54:14,289 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 -> 32adbfac5f3e3ea232180afd045da0027ca6d993 [2021-08-26 01:54:14,628 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-08-26 01:54:14,650 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-08-26 01:54:14,653 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-08-26 01:54:14,654 INFO L271 PluginConnector]: Initializing CDTParser... [2021-08-26 01:54:14,655 INFO L275 PluginConnector]: CDTParser initialized [2021-08-26 01:54:14,655 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/float-newlib/float_req_bl_1251.c [2021-08-26 01:54:14,724 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/089ddd2aa/21503b29ae7a44b19550b92d8ddc5c04/FLAG9143feb2e [2021-08-26 01:54:15,128 INFO L306 CDTParser]: Found 1 translation units. [2021-08-26 01:54:15,131 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/float_req_bl_1251.c [2021-08-26 01:54:15,138 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/089ddd2aa/21503b29ae7a44b19550b92d8ddc5c04/FLAG9143feb2e [2021-08-26 01:54:15,535 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/089ddd2aa/21503b29ae7a44b19550b92d8ddc5c04 [2021-08-26 01:54:15,540 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-08-26 01:54:15,542 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-08-26 01:54:15,546 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-08-26 01:54:15,546 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-08-26 01:54:15,554 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-08-26 01:54:15,555 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.08 01:54:15" (1/1) ... [2021-08-26 01:54:15,557 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@49723c67 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 01:54:15, skipping insertion in model container [2021-08-26 01:54:15,557 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.08 01:54:15" (1/1) ... [2021-08-26 01:54:15,566 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-08-26 01:54:15,581 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-08-26 01:54:15,714 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/float_req_bl_1251.c[1980,1993] [2021-08-26 01:54:15,717 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/float_req_bl_1251.c[2139,2152] [2021-08-26 01:54:15,718 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-26 01:54:15,728 INFO L203 MainTranslator]: Completed pre-run [2021-08-26 01:54:15,786 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/float_req_bl_1251.c[1980,1993] [2021-08-26 01:54:15,787 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/float_req_bl_1251.c[2139,2152] [2021-08-26 01:54:15,788 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-26 01:54:15,799 INFO L208 MainTranslator]: Completed translation [2021-08-26 01:54:15,800 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 01:54:15 WrapperNode [2021-08-26 01:54:15,800 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-08-26 01:54:15,801 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-08-26 01:54:15,802 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-08-26 01:54:15,802 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-08-26 01:54:15,807 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:54:15" (1/1) ... [2021-08-26 01:54:15,825 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:54:15" (1/1) ... [2021-08-26 01:54:15,855 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-08-26 01:54:15,856 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-08-26 01:54:15,856 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-08-26 01:54:15,856 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-08-26 01:54:15,862 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 01:54:15" (1/1) ... [2021-08-26 01:54:15,862 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 01:54:15" (1/1) ... [2021-08-26 01:54:15,876 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 01:54:15" (1/1) ... [2021-08-26 01:54:15,877 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 01:54:15" (1/1) ... [2021-08-26 01:54:15,888 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 01:54:15" (1/1) ... [2021-08-26 01:54:15,900 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 01:54:15" (1/1) ... [2021-08-26 01:54:15,904 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 01:54:15" (1/1) ... [2021-08-26 01:54:15,910 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-08-26 01:54:15,915 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-08-26 01:54:15,915 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-08-26 01:54:15,916 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-08-26 01:54:15,917 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 01:54:15" (1/1) ... [2021-08-26 01:54:15,922 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-08-26 01:54:15,928 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-26 01:54:15,946 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:54:15,977 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:54:15,994 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2021-08-26 01:54:15,994 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-08-26 01:54:15,994 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2021-08-26 01:54:15,995 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-08-26 01:54:15,995 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-08-26 01:54:15,995 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4 [2021-08-26 01:54:15,995 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-08-26 01:54:16,479 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-08-26 01:54:16,480 INFO L299 CfgBuilder]: Removed 30 assume(true) statements. [2021-08-26 01:54:16,481 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.08 01:54:16 BoogieIcfgContainer [2021-08-26 01:54:16,482 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-08-26 01:54:16,484 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-08-26 01:54:16,484 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-08-26 01:54:16,486 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-08-26 01:54:16,487 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.08 01:54:15" (1/3) ... [2021-08-26 01:54:16,488 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@39cb51b7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.08 01:54:16, skipping insertion in model container [2021-08-26 01:54:16,488 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 01:54:15" (2/3) ... [2021-08-26 01:54:16,489 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@39cb51b7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.08 01:54:16, skipping insertion in model container [2021-08-26 01:54:16,489 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.08 01:54:16" (3/3) ... [2021-08-26 01:54:16,490 INFO L111 eAbstractionObserver]: Analyzing ICFG float_req_bl_1251.c [2021-08-26 01:54:16,494 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-08-26 01:54:16,494 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2021-08-26 01:54:16,525 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-08-26 01:54:16,530 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:54:16,530 INFO L340 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2021-08-26 01:54:16,541 INFO L276 IsEmpty]: Start isEmpty. Operand has 47 states, 44 states have (on average 1.5681818181818181) internal successors, (69), 46 states have internal predecessors, (69), 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:54:16,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-08-26 01:54:16,545 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 01:54:16,546 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:54:16,546 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-26 01:54:16,550 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 01:54:16,550 INFO L82 PathProgramCache]: Analyzing trace with hash 1204154757, now seen corresponding path program 1 times [2021-08-26 01:54:16,559 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-26 01:54:16,560 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [340606632] [2021-08-26 01:54:16,560 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 01:54:16,560 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-26 01:54:16,561 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-26 01:54:16,563 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:54:16,595 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:54:16,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 01:54:16,699 INFO L263 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 1 conjunts are in the unsatisfiable core [2021-08-26 01:54:16,703 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-26 01:54:16,841 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:54:16,841 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-26 01:54:16,938 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:54:16,938 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-26 01:54:16,939 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [340606632] [2021-08-26 01:54:16,939 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [340606632] provided 2 perfect and 0 imperfect interpolant sequences [2021-08-26 01:54:16,940 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-08-26 01:54:16,940 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2021-08-26 01:54:16,942 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1632333313] [2021-08-26 01:54:16,945 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2021-08-26 01:54:16,946 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-26 01:54:16,957 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-08-26 01:54:16,957 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-08-26 01:54:16,960 INFO L87 Difference]: Start difference. First operand has 47 states, 44 states have (on average 1.5681818181818181) internal successors, (69), 46 states have internal predecessors, (69), 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 8.0) internal successors, (16), 2 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 01:54:16,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 01:54:16,982 INFO L93 Difference]: Finished difference Result 82 states and 122 transitions. [2021-08-26 01:54:16,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-08-26 01:54:16,984 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 8.0) internal successors, (16), 2 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2021-08-26 01:54:16,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 01:54:16,991 INFO L225 Difference]: With dead ends: 82 [2021-08-26 01:54:16,991 INFO L226 Difference]: Without dead ends: 43 [2021-08-26 01:54:16,994 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 30 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:54:17,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2021-08-26 01:54:17,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2021-08-26 01:54:17,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 41 states have (on average 1.4146341463414633) internal successors, (58), 42 states have internal predecessors, (58), 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:54:17,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 58 transitions. [2021-08-26 01:54:17,027 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 58 transitions. Word has length 16 [2021-08-26 01:54:17,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 01:54:17,028 INFO L470 AbstractCegarLoop]: Abstraction has 43 states and 58 transitions. [2021-08-26 01:54:17,028 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 8.0) internal successors, (16), 2 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 01:54:17,029 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 58 transitions. [2021-08-26 01:54:17,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-08-26 01:54:17,031 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 01:54:17,031 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-26 01:54:17,044 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2021-08-26 01:54:17,242 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:54:17,242 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-26 01:54:17,243 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 01:54:17,243 INFO L82 PathProgramCache]: Analyzing trace with hash 1262247077, now seen corresponding path program 1 times [2021-08-26 01:54:17,244 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-26 01:54:17,244 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1642332438] [2021-08-26 01:54:17,244 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 01:54:17,248 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-26 01:54:17,249 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-26 01:54:17,249 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:54:17,250 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:54:17,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 01:54:17,359 INFO L263 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 3 conjunts are in the unsatisfiable core [2021-08-26 01:54:17,360 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-26 01:54:17,473 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:54:17,473 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-26 01:54:17,575 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:54:17,576 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-26 01:54:17,576 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1642332438] [2021-08-26 01:54:17,576 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1642332438] provided 2 perfect and 0 imperfect interpolant sequences [2021-08-26 01:54:17,576 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-08-26 01:54:17,577 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 4 [2021-08-26 01:54:17,577 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [404119875] [2021-08-26 01:54:17,578 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-26 01:54:17,578 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-26 01:54:17,579 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-26 01:54:17,579 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-26 01:54:17,580 INFO L87 Difference]: Start difference. First operand 43 states and 58 transitions. Second operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 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:54:17,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 01:54:17,633 INFO L93 Difference]: Finished difference Result 82 states and 111 transitions. [2021-08-26 01:54:17,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-08-26 01:54:17,634 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 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 17 [2021-08-26 01:54:17,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 01:54:17,635 INFO L225 Difference]: With dead ends: 82 [2021-08-26 01:54:17,635 INFO L226 Difference]: Without dead ends: 50 [2021-08-26 01:54:17,636 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 21.9ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-26 01:54:17,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2021-08-26 01:54:17,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 45. [2021-08-26 01:54:17,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 43 states have (on average 1.3953488372093024) internal successors, (60), 44 states have internal predecessors, (60), 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:54:17,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 60 transitions. [2021-08-26 01:54:17,642 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 60 transitions. Word has length 17 [2021-08-26 01:54:17,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 01:54:17,642 INFO L470 AbstractCegarLoop]: Abstraction has 45 states and 60 transitions. [2021-08-26 01:54:17,643 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 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:54:17,643 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 60 transitions. [2021-08-26 01:54:17,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-08-26 01:54:17,643 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 01:54:17,644 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:54:17,656 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:54:17,854 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:54:17,854 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-26 01:54:17,855 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 01:54:17,856 INFO L82 PathProgramCache]: Analyzing trace with hash 44236684, now seen corresponding path program 1 times [2021-08-26 01:54:17,857 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-26 01:54:17,858 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [574270676] [2021-08-26 01:54:17,858 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 01:54:17,858 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-26 01:54:17,858 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-26 01:54:17,859 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:54:17,869 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:54:17,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 01:54:17,978 INFO L263 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 3 conjunts are in the unsatisfiable core [2021-08-26 01:54:17,980 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-26 01:54:18,046 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:54:18,047 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-26 01:54:18,123 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:54:18,123 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-26 01:54:18,123 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [574270676] [2021-08-26 01:54:18,123 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [574270676] provided 2 perfect and 0 imperfect interpolant sequences [2021-08-26 01:54:18,124 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-08-26 01:54:18,124 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2021-08-26 01:54:18,124 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1052248149] [2021-08-26 01:54:18,124 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-08-26 01:54:18,125 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-26 01:54:18,129 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-08-26 01:54:18,129 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-08-26 01:54:18,130 INFO L87 Difference]: Start difference. First operand 45 states and 60 transitions. Second operand has 6 states, 6 states have (on average 3.5) internal successors, (21), 6 states have internal predecessors, (21), 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:54:18,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 01:54:18,210 INFO L93 Difference]: Finished difference Result 96 states and 120 transitions. [2021-08-26 01:54:18,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-08-26 01:54:18,211 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.5) internal successors, (21), 6 states have internal predecessors, (21), 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:54:18,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 01:54:18,212 INFO L225 Difference]: With dead ends: 96 [2021-08-26 01:54:18,212 INFO L226 Difference]: Without dead ends: 83 [2021-08-26 01:54:18,212 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 30.8ms TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-08-26 01:54:18,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2021-08-26 01:54:18,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 47. [2021-08-26 01:54:18,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 45 states have (on average 1.3777777777777778) internal successors, (62), 46 states have internal predecessors, (62), 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:54:18,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 62 transitions. [2021-08-26 01:54:18,218 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 62 transitions. Word has length 18 [2021-08-26 01:54:18,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 01:54:18,218 INFO L470 AbstractCegarLoop]: Abstraction has 47 states and 62 transitions. [2021-08-26 01:54:18,218 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.5) internal successors, (21), 6 states have internal predecessors, (21), 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:54:18,219 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 62 transitions. [2021-08-26 01:54:18,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-08-26 01:54:18,219 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 01:54:18,219 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] [2021-08-26 01:54:18,230 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:54:18,428 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:54:18,428 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-26 01:54:18,429 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 01:54:18,429 INFO L82 PathProgramCache]: Analyzing trace with hash -1380709804, now seen corresponding path program 1 times [2021-08-26 01:54:18,429 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-26 01:54:18,429 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1279174141] [2021-08-26 01:54:18,429 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 01:54:18,430 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-26 01:54:18,430 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-26 01:54:18,430 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:54:18,431 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:54:18,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 01:54:18,525 INFO L263 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 12 conjunts are in the unsatisfiable core [2021-08-26 01:54:18,527 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-26 01:54:18,785 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:54:18,785 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-26 01:54:18,929 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:54:18,929 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-26 01:54:18,930 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1279174141] [2021-08-26 01:54:18,930 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1279174141] provided 2 perfect and 0 imperfect interpolant sequences [2021-08-26 01:54:18,930 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-08-26 01:54:18,930 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7, 7] imperfect sequences [] total 10 [2021-08-26 01:54:18,930 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [632876474] [2021-08-26 01:54:18,931 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-08-26 01:54:18,931 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-26 01:54:18,931 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-08-26 01:54:18,932 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2021-08-26 01:54:18,932 INFO L87 Difference]: Start difference. First operand 47 states and 62 transitions. Second operand has 10 states, 10 states have (on average 2.6) internal successors, (26), 10 states have internal predecessors, (26), 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:54:19,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 01:54:19,244 INFO L93 Difference]: Finished difference Result 149 states and 197 transitions. [2021-08-26 01:54:19,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-08-26 01:54:19,245 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.6) internal successors, (26), 10 states have internal predecessors, (26), 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 21 [2021-08-26 01:54:19,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 01:54:19,247 INFO L225 Difference]: With dead ends: 149 [2021-08-26 01:54:19,247 INFO L226 Difference]: Without dead ends: 140 [2021-08-26 01:54:19,247 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 173.3ms TimeCoverageRelationStatistics Valid=59, Invalid=151, Unknown=0, NotChecked=0, Total=210 [2021-08-26 01:54:19,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2021-08-26 01:54:19,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 75. [2021-08-26 01:54:19,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 73 states have (on average 1.3972602739726028) internal successors, (102), 74 states have internal predecessors, (102), 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:54:19,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 102 transitions. [2021-08-26 01:54:19,257 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 102 transitions. Word has length 21 [2021-08-26 01:54:19,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 01:54:19,257 INFO L470 AbstractCegarLoop]: Abstraction has 75 states and 102 transitions. [2021-08-26 01:54:19,257 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.6) internal successors, (26), 10 states have internal predecessors, (26), 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:54:19,258 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 102 transitions. [2021-08-26 01:54:19,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-08-26 01:54:19,258 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 01:54:19,259 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:54:19,269 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:54:19,468 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:54:19,469 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-26 01:54:19,469 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 01:54:19,470 INFO L82 PathProgramCache]: Analyzing trace with hash 147544209, now seen corresponding path program 1 times [2021-08-26 01:54:19,470 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-26 01:54:19,470 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [689416608] [2021-08-26 01:54:19,470 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 01:54:19,470 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-26 01:54:19,470 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-26 01:54:19,471 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:54:19,472 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:54:19,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 01:54:19,586 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 12 conjunts are in the unsatisfiable core [2021-08-26 01:54:19,587 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-26 01:54:20,181 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:54:20,181 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-26 01:54:20,376 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:54:20,377 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-26 01:54:20,377 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [689416608] [2021-08-26 01:54:20,377 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [689416608] provided 2 perfect and 0 imperfect interpolant sequences [2021-08-26 01:54:20,377 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-08-26 01:54:20,378 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9, 9] imperfect sequences [] total 15 [2021-08-26 01:54:20,378 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1638477178] [2021-08-26 01:54:20,378 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2021-08-26 01:54:20,379 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-26 01:54:20,379 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-08-26 01:54:20,380 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=150, Unknown=0, NotChecked=0, Total=210 [2021-08-26 01:54:20,380 INFO L87 Difference]: Start difference. First operand 75 states and 102 transitions. Second operand has 15 states, 15 states have (on average 2.6666666666666665) internal successors, (40), 15 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:54:21,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 01:54:21,216 INFO L93 Difference]: Finished difference Result 180 states and 237 transitions. [2021-08-26 01:54:21,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-08-26 01:54:21,220 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.6666666666666665) internal successors, (40), 15 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:54:21,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 01:54:21,221 INFO L225 Difference]: With dead ends: 180 [2021-08-26 01:54:21,222 INFO L226 Difference]: Without dead ends: 178 [2021-08-26 01:54:21,222 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 128 ImplicationChecksByTransitivity, 563.6ms TimeCoverageRelationStatistics Valid=185, Invalid=465, Unknown=0, NotChecked=0, Total=650 [2021-08-26 01:54:21,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2021-08-26 01:54:21,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 89. [2021-08-26 01:54:21,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 87 states have (on average 1.3908045977011494) internal successors, (121), 88 states have internal predecessors, (121), 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:54:21,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 121 transitions. [2021-08-26 01:54:21,234 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 121 transitions. Word has length 22 [2021-08-26 01:54:21,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 01:54:21,235 INFO L470 AbstractCegarLoop]: Abstraction has 89 states and 121 transitions. [2021-08-26 01:54:21,235 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.6666666666666665) internal successors, (40), 15 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:54:21,235 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 121 transitions. [2021-08-26 01:54:21,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-08-26 01:54:21,236 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 01:54:21,236 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, 1] [2021-08-26 01:54:21,252 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:54:21,447 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:54:21,447 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-26 01:54:21,447 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 01:54:21,447 INFO L82 PathProgramCache]: Analyzing trace with hash -1845695531, now seen corresponding path program 1 times [2021-08-26 01:54:21,448 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-26 01:54:21,448 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1037059919] [2021-08-26 01:54:21,448 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 01:54:21,448 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-26 01:54:21,448 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-26 01:54:21,449 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:54:21,451 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:54:21,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 01:54:21,571 INFO L263 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 12 conjunts are in the unsatisfiable core [2021-08-26 01:54:21,572 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-26 01:54:21,738 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:54:21,738 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-26 01:54:21,872 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:54:21,873 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-26 01:54:21,873 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1037059919] [2021-08-26 01:54:21,873 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1037059919] provided 2 perfect and 0 imperfect interpolant sequences [2021-08-26 01:54:21,873 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-08-26 01:54:21,874 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7, 7] imperfect sequences [] total 9 [2021-08-26 01:54:21,874 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1231371125] [2021-08-26 01:54:21,874 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-08-26 01:54:21,874 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-26 01:54:21,875 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-08-26 01:54:21,875 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2021-08-26 01:54:21,875 INFO L87 Difference]: Start difference. First operand 89 states and 121 transitions. Second operand has 9 states, 9 states have (on average 2.888888888888889) internal successors, (26), 9 states have internal predecessors, (26), 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:54:22,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 01:54:22,320 INFO L93 Difference]: Finished difference Result 166 states and 219 transitions. [2021-08-26 01:54:22,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-08-26 01:54:22,321 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.888888888888889) internal successors, (26), 9 states have internal predecessors, (26), 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 23 [2021-08-26 01:54:22,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 01:54:22,321 INFO L225 Difference]: With dead ends: 166 [2021-08-26 01:54:22,322 INFO L226 Difference]: Without dead ends: 131 [2021-08-26 01:54:22,322 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 206.8ms TimeCoverageRelationStatistics Valid=71, Invalid=139, Unknown=0, NotChecked=0, Total=210 [2021-08-26 01:54:22,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2021-08-26 01:54:22,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 89. [2021-08-26 01:54:22,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 87 states have (on average 1.3793103448275863) internal successors, (120), 88 states have internal predecessors, (120), 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:54:22,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 120 transitions. [2021-08-26 01:54:22,329 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 120 transitions. Word has length 23 [2021-08-26 01:54:22,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 01:54:22,330 INFO L470 AbstractCegarLoop]: Abstraction has 89 states and 120 transitions. [2021-08-26 01:54:22,330 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.888888888888889) internal successors, (26), 9 states have internal predecessors, (26), 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:54:22,330 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 120 transitions. [2021-08-26 01:54:22,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-08-26 01:54:22,331 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 01:54:22,331 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, 1, 1] [2021-08-26 01:54:22,347 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:54:22,543 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:54:22,543 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-26 01:54:22,544 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 01:54:22,544 INFO L82 PathProgramCache]: Analyzing trace with hash 156888005, now seen corresponding path program 1 times [2021-08-26 01:54:22,544 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-26 01:54:22,544 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [690891301] [2021-08-26 01:54:22,544 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 01:54:22,545 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-26 01:54:22,545 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-26 01:54:22,548 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:54:22,550 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:54:22,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 01:54:22,700 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 3 conjunts are in the unsatisfiable core [2021-08-26 01:54:22,701 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-26 01:54:22,777 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:54:22,778 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-26 01:54:22,835 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:54:22,836 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-26 01:54:22,836 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [690891301] [2021-08-26 01:54:22,836 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [690891301] provided 2 perfect and 0 imperfect interpolant sequences [2021-08-26 01:54:22,836 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-08-26 01:54:22,836 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2021-08-26 01:54:22,837 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2063909000] [2021-08-26 01:54:22,837 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-08-26 01:54:22,837 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-26 01:54:22,838 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-08-26 01:54:22,838 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-08-26 01:54:22,838 INFO L87 Difference]: Start difference. First operand 89 states and 120 transitions. Second operand has 6 states, 6 states have (on average 4.5) internal successors, (27), 6 states have internal predecessors, (27), 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:54:22,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 01:54:22,936 INFO L93 Difference]: Finished difference Result 157 states and 199 transitions. [2021-08-26 01:54:22,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-08-26 01:54:22,938 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.5) internal successors, (27), 6 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2021-08-26 01:54:22,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 01:54:22,938 INFO L225 Difference]: With dead ends: 157 [2021-08-26 01:54:22,939 INFO L226 Difference]: Without dead ends: 141 [2021-08-26 01:54:22,939 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 23.0ms TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-08-26 01:54:22,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2021-08-26 01:54:22,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 93. [2021-08-26 01:54:22,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 91 states have (on average 1.3626373626373627) internal successors, (124), 92 states have internal predecessors, (124), 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:54:22,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 124 transitions. [2021-08-26 01:54:22,947 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 124 transitions. Word has length 24 [2021-08-26 01:54:22,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 01:54:22,947 INFO L470 AbstractCegarLoop]: Abstraction has 93 states and 124 transitions. [2021-08-26 01:54:22,947 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.5) internal successors, (27), 6 states have internal predecessors, (27), 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:54:22,947 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 124 transitions. [2021-08-26 01:54:22,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-08-26 01:54:22,948 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 01:54:22,948 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, 1, 1] [2021-08-26 01:54:22,973 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:54:23,159 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:54:23,159 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-26 01:54:23,160 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 01:54:23,160 INFO L82 PathProgramCache]: Analyzing trace with hash -1621213116, now seen corresponding path program 1 times [2021-08-26 01:54:23,160 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-26 01:54:23,160 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1036503338] [2021-08-26 01:54:23,160 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 01:54:23,161 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-26 01:54:23,161 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-26 01:54:23,162 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:54:23,163 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:54:23,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 01:54:23,320 INFO L263 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 2 conjunts are in the unsatisfiable core [2021-08-26 01:54:23,321 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-26 01:54:23,379 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:54:23,380 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-26 01:54:23,424 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:54:23,425 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-26 01:54:23,425 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1036503338] [2021-08-26 01:54:23,425 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1036503338] provided 2 perfect and 0 imperfect interpolant sequences [2021-08-26 01:54:23,425 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-08-26 01:54:23,425 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2021-08-26 01:54:23,426 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [817628236] [2021-08-26 01:54:23,426 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-26 01:54:23,426 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-26 01:54:23,427 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-26 01:54:23,427 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-26 01:54:23,431 INFO L87 Difference]: Start difference. First operand 93 states and 124 transitions. Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 01:54:23,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 01:54:23,450 INFO L93 Difference]: Finished difference Result 96 states and 127 transitions. [2021-08-26 01:54:23,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-26 01:54:23,451 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2021-08-26 01:54:23,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 01:54:23,452 INFO L225 Difference]: With dead ends: 96 [2021-08-26 01:54:23,452 INFO L226 Difference]: Without dead ends: 94 [2021-08-26 01:54:23,452 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.9ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-26 01:54:23,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2021-08-26 01:54:23,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 93. [2021-08-26 01:54:23,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 91 states have (on average 1.3626373626373627) internal successors, (124), 92 states have internal predecessors, (124), 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:54:23,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 124 transitions. [2021-08-26 01:54:23,459 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 124 transitions. Word has length 24 [2021-08-26 01:54:23,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 01:54:23,459 INFO L470 AbstractCegarLoop]: Abstraction has 93 states and 124 transitions. [2021-08-26 01:54:23,459 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 01:54:23,459 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 124 transitions. [2021-08-26 01:54:23,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-08-26 01:54:23,460 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 01:54:23,461 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, 1, 1, 1] [2021-08-26 01:54:23,474 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:54:23,668 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:54:23,669 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-26 01:54:23,670 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 01:54:23,670 INFO L82 PathProgramCache]: Analyzing trace with hash 1741974657, now seen corresponding path program 1 times [2021-08-26 01:54:23,670 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-26 01:54:23,670 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1136298096] [2021-08-26 01:54:23,670 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 01:54:23,670 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-26 01:54:23,670 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-26 01:54:23,671 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-08-26 01:54:23,672 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2021-08-26 01:54:23,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 01:54:23,838 INFO L263 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 12 conjunts are in the unsatisfiable core [2021-08-26 01:54:23,840 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-26 01:54:24,023 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:54:24,024 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-26 01:54:24,152 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:54:24,152 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-26 01:54:24,152 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1136298096] [2021-08-26 01:54:24,153 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1136298096] provided 2 perfect and 0 imperfect interpolant sequences [2021-08-26 01:54:24,153 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-08-26 01:54:24,153 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7, 7] imperfect sequences [] total 10 [2021-08-26 01:54:24,153 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [506490991] [2021-08-26 01:54:24,153 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-08-26 01:54:24,154 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-26 01:54:24,154 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-08-26 01:54:24,154 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2021-08-26 01:54:24,154 INFO L87 Difference]: Start difference. First operand 93 states and 124 transitions. Second operand has 10 states, 10 states have (on average 3.0) internal successors, (30), 10 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:54:24,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 01:54:24,594 INFO L93 Difference]: Finished difference Result 131 states and 173 transitions. [2021-08-26 01:54:24,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-08-26 01:54:24,594 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.0) internal successors, (30), 10 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 25 [2021-08-26 01:54:24,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 01:54:24,595 INFO L225 Difference]: With dead ends: 131 [2021-08-26 01:54:24,595 INFO L226 Difference]: Without dead ends: 118 [2021-08-26 01:54:24,596 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 165.6ms TimeCoverageRelationStatistics Valid=58, Invalid=152, Unknown=0, NotChecked=0, Total=210 [2021-08-26 01:54:24,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2021-08-26 01:54:24,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 89. [2021-08-26 01:54:24,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 87 states have (on average 1.3563218390804597) internal successors, (118), 88 states have internal predecessors, (118), 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:54:24,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 118 transitions. [2021-08-26 01:54:24,601 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 118 transitions. Word has length 25 [2021-08-26 01:54:24,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 01:54:24,602 INFO L470 AbstractCegarLoop]: Abstraction has 89 states and 118 transitions. [2021-08-26 01:54:24,602 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.0) internal successors, (30), 10 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:54:24,602 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 118 transitions. [2021-08-26 01:54:24,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-08-26 01:54:24,603 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 01:54:24,603 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, 1, 1, 1] [2021-08-26 01:54:24,623 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2021-08-26 01:54:24,813 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-08-26 01:54:24,813 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-26 01:54:24,814 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 01:54:24,815 INFO L82 PathProgramCache]: Analyzing trace with hash 839729769, now seen corresponding path program 1 times [2021-08-26 01:54:24,815 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-26 01:54:24,815 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [274058973] [2021-08-26 01:54:24,815 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 01:54:24,815 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-26 01:54:24,815 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-26 01:54:24,816 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-08-26 01:54:24,819 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2021-08-26 01:54:25,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 01:54:25,036 INFO L263 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 13 conjunts are in the unsatisfiable core [2021-08-26 01:54:25,037 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-26 01:54:25,226 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:54:25,226 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-26 01:54:25,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:54:25,374 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-26 01:54:25,375 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [274058973] [2021-08-26 01:54:25,375 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [274058973] provided 2 perfect and 0 imperfect interpolant sequences [2021-08-26 01:54:25,375 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-08-26 01:54:25,375 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8, 8] imperfect sequences [] total 11 [2021-08-26 01:54:25,375 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [703121141] [2021-08-26 01:54:25,376 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-08-26 01:54:25,376 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-26 01:54:25,376 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-08-26 01:54:25,377 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2021-08-26 01:54:25,377 INFO L87 Difference]: Start difference. First operand 89 states and 118 transitions. Second operand has 11 states, 11 states have (on average 2.727272727272727) internal successors, (30), 11 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:54:25,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 01:54:25,739 INFO L93 Difference]: Finished difference Result 114 states and 147 transitions. [2021-08-26 01:54:25,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-08-26 01:54:25,739 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.727272727272727) internal successors, (30), 11 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 25 [2021-08-26 01:54:25,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 01:54:25,740 INFO L225 Difference]: With dead ends: 114 [2021-08-26 01:54:25,740 INFO L226 Difference]: Without dead ends: 78 [2021-08-26 01:54:25,740 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 226.1ms TimeCoverageRelationStatistics Valid=80, Invalid=226, Unknown=0, NotChecked=0, Total=306 [2021-08-26 01:54:25,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2021-08-26 01:54:25,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 76. [2021-08-26 01:54:25,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 74 states have (on average 1.3243243243243243) internal successors, (98), 75 states have internal predecessors, (98), 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:54:25,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 98 transitions. [2021-08-26 01:54:25,745 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 98 transitions. Word has length 25 [2021-08-26 01:54:25,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 01:54:25,745 INFO L470 AbstractCegarLoop]: Abstraction has 76 states and 98 transitions. [2021-08-26 01:54:25,745 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.727272727272727) internal successors, (30), 11 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:54:25,745 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 98 transitions. [2021-08-26 01:54:25,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-08-26 01:54:25,746 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 01:54:25,746 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, 1, 1, 1] [2021-08-26 01:54:25,766 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2021-08-26 01:54:25,957 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-08-26 01:54:25,957 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-26 01:54:25,958 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 01:54:25,958 INFO L82 PathProgramCache]: Analyzing trace with hash 1281876129, now seen corresponding path program 1 times [2021-08-26 01:54:25,959 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-26 01:54:25,959 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1494798634] [2021-08-26 01:54:25,959 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 01:54:25,959 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-26 01:54:25,959 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-26 01:54:25,960 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-08-26 01:54:25,973 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2021-08-26 01:54:26,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 01:54:26,195 INFO L263 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 12 conjunts are in the unsatisfiable core [2021-08-26 01:54:26,196 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-26 01:54:26,379 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:54:26,379 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-26 01:54:26,519 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:54:26,520 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-26 01:54:26,520 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1494798634] [2021-08-26 01:54:26,520 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1494798634] provided 2 perfect and 0 imperfect interpolant sequences [2021-08-26 01:54:26,520 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-08-26 01:54:26,520 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7, 7] imperfect sequences [] total 9 [2021-08-26 01:54:26,520 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1065137777] [2021-08-26 01:54:26,520 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-08-26 01:54:26,520 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-26 01:54:26,521 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-08-26 01:54:26,521 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2021-08-26 01:54:26,522 INFO L87 Difference]: Start difference. First operand 76 states and 98 transitions. Second operand has 9 states, 9 states have (on average 3.111111111111111) internal successors, (28), 9 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:54:26,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 01:54:26,753 INFO L93 Difference]: Finished difference Result 84 states and 104 transitions. [2021-08-26 01:54:26,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-08-26 01:54:26,761 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.111111111111111) internal successors, (28), 9 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) Word has length 25 [2021-08-26 01:54:26,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 01:54:26,762 INFO L225 Difference]: With dead ends: 84 [2021-08-26 01:54:26,762 INFO L226 Difference]: Without dead ends: 74 [2021-08-26 01:54:26,764 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 169.9ms TimeCoverageRelationStatistics Valid=58, Invalid=124, Unknown=0, NotChecked=0, Total=182 [2021-08-26 01:54:26,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2021-08-26 01:54:26,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2021-08-26 01:54:26,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 72 states have (on average 1.3055555555555556) internal successors, (94), 73 states have internal predecessors, (94), 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:54:26,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 94 transitions. [2021-08-26 01:54:26,769 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 94 transitions. Word has length 25 [2021-08-26 01:54:26,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 01:54:26,769 INFO L470 AbstractCegarLoop]: Abstraction has 74 states and 94 transitions. [2021-08-26 01:54:26,769 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.111111111111111) internal successors, (28), 9 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:54:26,770 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 94 transitions. [2021-08-26 01:54:26,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2021-08-26 01:54:26,773 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 01:54:26,774 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, 1, 1, 1, 1] [2021-08-26 01:54:26,787 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (12)] Forceful destruction successful, exit code 0 [2021-08-26 01:54:26,984 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-08-26 01:54:26,985 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-26 01:54:26,985 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 01:54:26,985 INFO L82 PathProgramCache]: Analyzing trace with hash -144403189, now seen corresponding path program 1 times [2021-08-26 01:54:26,985 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-26 01:54:26,985 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1737509891] [2021-08-26 01:54:26,986 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 01:54:26,986 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-26 01:54:26,986 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-26 01:54:26,986 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-08-26 01:54:26,987 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2021-08-26 01:54:27,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 01:54:27,215 INFO L263 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 9 conjunts are in the unsatisfiable core [2021-08-26 01:54:27,226 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-26 01:54:27,390 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:54:27,390 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-26 01:54:27,754 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:54:27,755 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-26 01:54:27,755 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1737509891] [2021-08-26 01:54:27,755 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1737509891] provided 2 perfect and 0 imperfect interpolant sequences [2021-08-26 01:54:27,755 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-08-26 01:54:27,755 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [] total 10 [2021-08-26 01:54:27,755 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1714215062] [2021-08-26 01:54:27,756 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-08-26 01:54:27,756 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-26 01:54:27,756 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-08-26 01:54:27,757 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2021-08-26 01:54:27,757 INFO L87 Difference]: Start difference. First operand 74 states and 94 transitions. Second operand has 10 states, 10 states have (on average 4.4) internal successors, (44), 10 states have internal predecessors, (44), 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:54:28,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 01:54:28,010 INFO L93 Difference]: Finished difference Result 82 states and 101 transitions. [2021-08-26 01:54:28,010 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-08-26 01:54:28,011 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.4) internal successors, (44), 10 states have internal predecessors, (44), 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 26 [2021-08-26 01:54:28,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 01:54:28,011 INFO L225 Difference]: With dead ends: 82 [2021-08-26 01:54:28,011 INFO L226 Difference]: Without dead ends: 74 [2021-08-26 01:54:28,012 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 291.0ms TimeCoverageRelationStatistics Valid=56, Invalid=126, Unknown=0, NotChecked=0, Total=182 [2021-08-26 01:54:28,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2021-08-26 01:54:28,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2021-08-26 01:54:28,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 72 states have (on average 1.2916666666666667) internal successors, (93), 73 states have internal predecessors, (93), 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:54:28,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 93 transitions. [2021-08-26 01:54:28,018 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 93 transitions. Word has length 26 [2021-08-26 01:54:28,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 01:54:28,018 INFO L470 AbstractCegarLoop]: Abstraction has 74 states and 93 transitions. [2021-08-26 01:54:28,018 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.4) internal successors, (44), 10 states have internal predecessors, (44), 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:54:28,019 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 93 transitions. [2021-08-26 01:54:28,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2021-08-26 01:54:28,019 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 01:54:28,019 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, 1, 1, 1, 1] [2021-08-26 01:54:28,036 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (13)] Forceful destruction successful, exit code 0 [2021-08-26 01:54:28,233 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-08-26 01:54:28,233 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-26 01:54:28,233 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 01:54:28,234 INFO L82 PathProgramCache]: Analyzing trace with hash -953749815, now seen corresponding path program 1 times [2021-08-26 01:54:28,234 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-26 01:54:28,234 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1909561154] [2021-08-26 01:54:28,234 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 01:54:28,234 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-26 01:54:28,234 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-26 01:54:28,235 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-08-26 01:54:28,236 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2021-08-26 01:54:28,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 01:54:28,494 INFO L263 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 12 conjunts are in the unsatisfiable core [2021-08-26 01:54:28,496 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-26 01:54:28,863 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:54:28,863 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-26 01:54:29,208 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:54:29,209 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-26 01:54:29,209 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1909561154] [2021-08-26 01:54:29,209 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1909561154] provided 2 perfect and 0 imperfect interpolant sequences [2021-08-26 01:54:29,209 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-08-26 01:54:29,209 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9, 9] imperfect sequences [] total 16 [2021-08-26 01:54:29,209 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [728947240] [2021-08-26 01:54:29,210 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2021-08-26 01:54:29,210 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-26 01:54:29,211 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-08-26 01:54:29,211 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=190, Unknown=0, NotChecked=0, Total=240 [2021-08-26 01:54:29,211 INFO L87 Difference]: Start difference. First operand 74 states and 93 transitions. Second operand has 16 states, 16 states have (on average 2.75) internal successors, (44), 16 states have internal predecessors, (44), 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:54:31,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 01:54:31,500 INFO L93 Difference]: Finished difference Result 154 states and 169 transitions. [2021-08-26 01:54:31,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-08-26 01:54:31,501 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.75) internal successors, (44), 16 states have internal predecessors, (44), 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 26 [2021-08-26 01:54:31,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 01:54:31,501 INFO L225 Difference]: With dead ends: 154 [2021-08-26 01:54:31,501 INFO L226 Difference]: Without dead ends: 134 [2021-08-26 01:54:31,502 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 636.4ms TimeCoverageRelationStatistics Valid=186, Invalid=464, Unknown=0, NotChecked=0, Total=650 [2021-08-26 01:54:31,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2021-08-26 01:54:31,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 72. [2021-08-26 01:54:31,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 70 states have (on average 1.2428571428571429) internal successors, (87), 71 states have internal predecessors, (87), 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:54:31,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 87 transitions. [2021-08-26 01:54:31,506 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 87 transitions. Word has length 26 [2021-08-26 01:54:31,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 01:54:31,507 INFO L470 AbstractCegarLoop]: Abstraction has 72 states and 87 transitions. [2021-08-26 01:54:31,507 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.75) internal successors, (44), 16 states have internal predecessors, (44), 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:54:31,507 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 87 transitions. [2021-08-26 01:54:31,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-08-26 01:54:31,507 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 01:54:31,507 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, 1, 1, 1, 1, 1] [2021-08-26 01:54:31,518 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (14)] Forceful destruction successful, exit code 0 [2021-08-26 01:54:31,716 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-08-26 01:54:31,717 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-26 01:54:31,717 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 01:54:31,717 INFO L82 PathProgramCache]: Analyzing trace with hash -1548503636, now seen corresponding path program 1 times [2021-08-26 01:54:31,718 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-26 01:54:31,718 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [160089929] [2021-08-26 01:54:31,718 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 01:54:31,718 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-26 01:54:31,718 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-26 01:54:31,719 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-08-26 01:54:31,767 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2021-08-26 01:54:32,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 01:54:32,055 INFO L263 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 22 conjunts are in the unsatisfiable core [2021-08-26 01:54:32,057 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-26 01:54:32,471 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:54:32,472 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-26 01:54:32,759 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:54:32,760 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-26 01:54:32,760 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [160089929] [2021-08-26 01:54:32,760 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [160089929] provided 2 perfect and 0 imperfect interpolant sequences [2021-08-26 01:54:32,760 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-08-26 01:54:32,760 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12, 12] imperfect sequences [] total 15 [2021-08-26 01:54:32,760 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2097265204] [2021-08-26 01:54:32,761 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2021-08-26 01:54:32,761 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-26 01:54:32,761 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-08-26 01:54:32,761 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2021-08-26 01:54:32,762 INFO L87 Difference]: Start difference. First operand 72 states and 87 transitions. Second operand has 15 states, 15 states have (on average 2.066666666666667) internal successors, (31), 15 states have internal predecessors, (31), 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:54:34,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 01:54:34,409 INFO L93 Difference]: Finished difference Result 195 states and 205 transitions. [2021-08-26 01:54:34,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2021-08-26 01:54:34,410 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.066666666666667) internal successors, (31), 15 states have internal predecessors, (31), 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 27 [2021-08-26 01:54:34,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 01:54:34,410 INFO L225 Difference]: With dead ends: 195 [2021-08-26 01:54:34,410 INFO L226 Difference]: Without dead ends: 158 [2021-08-26 01:54:34,412 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 36 SyntacticMatches, 3 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 439 ImplicationChecksByTransitivity, 1332.7ms TimeCoverageRelationStatistics Valid=455, Invalid=1437, Unknown=0, NotChecked=0, Total=1892 [2021-08-26 01:54:34,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2021-08-26 01:54:34,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 43. [2021-08-26 01:54:34,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 42 states have (on average 1.2619047619047619) internal successors, (53), 42 states have internal predecessors, (53), 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:54:34,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 53 transitions. [2021-08-26 01:54:34,416 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 53 transitions. Word has length 27 [2021-08-26 01:54:34,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 01:54:34,416 INFO L470 AbstractCegarLoop]: Abstraction has 43 states and 53 transitions. [2021-08-26 01:54:34,416 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.066666666666667) internal successors, (31), 15 states have internal predecessors, (31), 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:54:34,416 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 53 transitions. [2021-08-26 01:54:34,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2021-08-26 01:54:34,417 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 01:54:34,417 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, 1, 1, 1, 1, 1, 1] [2021-08-26 01:54:34,440 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (15)] Forceful destruction successful, exit code 0 [2021-08-26 01:54:34,630 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-08-26 01:54:34,630 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-26 01:54:34,631 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 01:54:34,631 INFO L82 PathProgramCache]: Analyzing trace with hash 1364791880, now seen corresponding path program 1 times [2021-08-26 01:54:34,631 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-26 01:54:34,631 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [489057535] [2021-08-26 01:54:34,631 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 01:54:34,631 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-26 01:54:34,632 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-26 01:54:34,633 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-08-26 01:54:34,635 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2021-08-26 01:54:34,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 01:54:34,952 INFO L263 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 21 conjunts are in the unsatisfiable core [2021-08-26 01:54:34,964 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-26 01:54:35,296 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:54:35,296 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-26 01:54:35,559 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:54:35,560 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-26 01:54:35,560 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [489057535] [2021-08-26 01:54:35,560 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [489057535] provided 2 perfect and 0 imperfect interpolant sequences [2021-08-26 01:54:35,560 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-08-26 01:54:35,560 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10, 10] imperfect sequences [] total 12 [2021-08-26 01:54:35,560 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1930759949] [2021-08-26 01:54:35,561 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-08-26 01:54:35,561 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-26 01:54:35,561 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-08-26 01:54:35,561 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2021-08-26 01:54:35,562 INFO L87 Difference]: Start difference. First operand 43 states and 53 transitions. Second operand has 12 states, 12 states have (on average 2.5833333333333335) internal successors, (31), 12 states have internal predecessors, (31), 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:54:36,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 01:54:36,481 INFO L93 Difference]: Finished difference Result 125 states and 140 transitions. [2021-08-26 01:54:36,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2021-08-26 01:54:36,482 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.5833333333333335) internal successors, (31), 12 states have internal predecessors, (31), 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 28 [2021-08-26 01:54:36,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 01:54:36,483 INFO L225 Difference]: With dead ends: 125 [2021-08-26 01:54:36,483 INFO L226 Difference]: Without dead ends: 101 [2021-08-26 01:54:36,484 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 41 SyntacticMatches, 3 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 142 ImplicationChecksByTransitivity, 569.1ms TimeCoverageRelationStatistics Valid=209, Invalid=603, Unknown=0, NotChecked=0, Total=812 [2021-08-26 01:54:36,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2021-08-26 01:54:36,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 41. [2021-08-26 01:54:36,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 40 states have (on average 1.225) internal successors, (49), 40 states have internal predecessors, (49), 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:54:36,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 49 transitions. [2021-08-26 01:54:36,487 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 49 transitions. Word has length 28 [2021-08-26 01:54:36,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 01:54:36,488 INFO L470 AbstractCegarLoop]: Abstraction has 41 states and 49 transitions. [2021-08-26 01:54:36,488 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.5833333333333335) internal successors, (31), 12 states have internal predecessors, (31), 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:54:36,488 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 49 transitions. [2021-08-26 01:54:36,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-08-26 01:54:36,488 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 01:54:36,488 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-26 01:54:36,503 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (16)] Forceful destruction successful, exit code 0 [2021-08-26 01:54:36,689 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-08-26 01:54:36,689 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-26 01:54:36,689 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 01:54:36,689 INFO L82 PathProgramCache]: Analyzing trace with hash 430789518, now seen corresponding path program 1 times [2021-08-26 01:54:36,690 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-26 01:54:36,690 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1266167184] [2021-08-26 01:54:36,690 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 01:54:36,690 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-26 01:54:36,690 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-26 01:54:36,691 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-08-26 01:54:36,691 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (17)] Waiting until timeout for monitored process [2021-08-26 01:54:37,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 01:54:37,030 INFO L263 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 10 conjunts are in the unsatisfiable core [2021-08-26 01:54:37,031 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-26 01:54:37,253 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:54:37,254 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-26 01:54:37,617 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:54:37,618 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-26 01:54:37,618 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1266167184] [2021-08-26 01:54:37,618 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1266167184] provided 2 perfect and 0 imperfect interpolant sequences [2021-08-26 01:54:37,618 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-08-26 01:54:37,618 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [] total 10 [2021-08-26 01:54:37,619 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1124686013] [2021-08-26 01:54:37,621 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-08-26 01:54:37,621 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-26 01:54:37,621 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-08-26 01:54:37,622 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2021-08-26 01:54:37,622 INFO L87 Difference]: Start difference. First operand 41 states and 49 transitions. Second operand has 10 states, 10 states have (on average 4.7) internal successors, (47), 10 states have internal predecessors, (47), 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:54:38,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 01:54:38,117 INFO L93 Difference]: Finished difference Result 52 states and 59 transitions. [2021-08-26 01:54:38,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-08-26 01:54:38,118 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.7) internal successors, (47), 10 states have internal predecessors, (47), 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 32 [2021-08-26 01:54:38,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 01:54:38,119 INFO L225 Difference]: With dead ends: 52 [2021-08-26 01:54:38,119 INFO L226 Difference]: Without dead ends: 41 [2021-08-26 01:54:38,119 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 488.1ms TimeCoverageRelationStatistics Valid=60, Invalid=150, Unknown=0, NotChecked=0, Total=210 [2021-08-26 01:54:38,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2021-08-26 01:54:38,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2021-08-26 01:54:38,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 40 states have (on average 1.2) internal successors, (48), 40 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 01:54:38,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 48 transitions. [2021-08-26 01:54:38,124 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 48 transitions. Word has length 32 [2021-08-26 01:54:38,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 01:54:38,124 INFO L470 AbstractCegarLoop]: Abstraction has 41 states and 48 transitions. [2021-08-26 01:54:38,124 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.7) internal successors, (47), 10 states have internal predecessors, (47), 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:54:38,124 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 48 transitions. [2021-08-26 01:54:38,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-08-26 01:54:38,125 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 01:54:38,125 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-26 01:54:38,137 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (17)] Ended with exit code 0 [2021-08-26 01:54:38,335 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-08-26 01:54:38,335 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-26 01:54:38,336 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 01:54:38,336 INFO L82 PathProgramCache]: Analyzing trace with hash 1131854096, now seen corresponding path program 1 times [2021-08-26 01:54:38,336 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-26 01:54:38,336 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1913187468] [2021-08-26 01:54:38,336 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 01:54:38,337 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-26 01:54:38,337 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-26 01:54:38,338 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-08-26 01:54:38,338 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (18)] Waiting until timeout for monitored process [2021-08-26 01:54:38,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 01:54:38,718 INFO L263 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 15 conjunts are in the unsatisfiable core [2021-08-26 01:54:38,721 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-26 01:54:38,958 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:54:38,959 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-26 01:54:39,235 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:54:39,236 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-26 01:54:39,236 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1913187468] [2021-08-26 01:54:39,236 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1913187468] provided 2 perfect and 0 imperfect interpolant sequences [2021-08-26 01:54:39,236 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-08-26 01:54:39,237 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8, 8] imperfect sequences [] total 14 [2021-08-26 01:54:39,237 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1895156463] [2021-08-26 01:54:39,237 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-08-26 01:54:39,238 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-26 01:54:39,238 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-08-26 01:54:39,238 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2021-08-26 01:54:39,239 INFO L87 Difference]: Start difference. First operand 41 states and 48 transitions. Second operand has 14 states, 14 states have (on average 3.142857142857143) internal successors, (44), 14 states have internal predecessors, (44), 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:54:39,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 01:54:39,706 INFO L93 Difference]: Finished difference Result 55 states and 61 transitions. [2021-08-26 01:54:39,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-08-26 01:54:39,706 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.142857142857143) internal successors, (44), 14 states have internal predecessors, (44), 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 32 [2021-08-26 01:54:39,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 01:54:39,706 INFO L225 Difference]: With dead ends: 55 [2021-08-26 01:54:39,707 INFO L226 Difference]: Without dead ends: 41 [2021-08-26 01:54:39,707 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 444.5ms TimeCoverageRelationStatistics Valid=113, Invalid=349, Unknown=0, NotChecked=0, Total=462 [2021-08-26 01:54:39,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2021-08-26 01:54:39,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 39. [2021-08-26 01:54:39,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 38 states have (on average 1.105263157894737) internal successors, (42), 38 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:54:39,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 42 transitions. [2021-08-26 01:54:39,712 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 42 transitions. Word has length 32 [2021-08-26 01:54:39,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 01:54:39,712 INFO L470 AbstractCegarLoop]: Abstraction has 39 states and 42 transitions. [2021-08-26 01:54:39,712 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.142857142857143) internal successors, (44), 14 states have internal predecessors, (44), 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:54:39,712 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 42 transitions. [2021-08-26 01:54:39,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2021-08-26 01:54:39,713 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 01:54:39,713 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-26 01:54:39,728 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (18)] Forceful destruction successful, exit code 0 [2021-08-26 01:54:39,924 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-08-26 01:54:39,924 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-26 01:54:39,925 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 01:54:39,925 INFO L82 PathProgramCache]: Analyzing trace with hash -1713269395, now seen corresponding path program 1 times [2021-08-26 01:54:39,925 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-26 01:54:39,925 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [164056698] [2021-08-26 01:54:39,925 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 01:54:39,925 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-26 01:54:39,925 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-26 01:54:39,926 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-08-26 01:54:39,927 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (19)] Waiting until timeout for monitored process [2021-08-26 01:54:40,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 01:54:40,318 INFO L263 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 11 conjunts are in the unsatisfiable core [2021-08-26 01:54:40,320 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-26 01:54:40,758 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:54:40,759 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-26 01:54:40,967 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:54:40,967 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-26 01:54:40,967 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [164056698] [2021-08-26 01:54:40,967 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [164056698] provided 2 perfect and 0 imperfect interpolant sequences [2021-08-26 01:54:40,967 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-08-26 01:54:40,967 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7, 7] imperfect sequences [] total 12 [2021-08-26 01:54:40,969 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2092539661] [2021-08-26 01:54:40,970 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-08-26 01:54:40,970 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-26 01:54:40,970 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-08-26 01:54:40,970 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2021-08-26 01:54:40,971 INFO L87 Difference]: Start difference. First operand 39 states and 42 transitions. Second operand has 12 states, 12 states have (on average 4.583333333333333) internal successors, (55), 12 states have internal predecessors, (55), 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:54:41,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 01:54:41,436 INFO L93 Difference]: Finished difference Result 79 states and 81 transitions. [2021-08-26 01:54:41,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-08-26 01:54:41,438 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.583333333333333) internal successors, (55), 12 states have internal predecessors, (55), 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 33 [2021-08-26 01:54:41,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 01:54:41,438 INFO L225 Difference]: With dead ends: 79 [2021-08-26 01:54:41,438 INFO L226 Difference]: Without dead ends: 61 [2021-08-26 01:54:41,439 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 312.1ms TimeCoverageRelationStatistics Valid=90, Invalid=252, Unknown=0, NotChecked=0, Total=342 [2021-08-26 01:54:41,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2021-08-26 01:54:41,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 39. [2021-08-26 01:54:41,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 38 states have (on average 1.0789473684210527) internal successors, (41), 38 states have internal predecessors, (41), 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:54:41,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 41 transitions. [2021-08-26 01:54:41,443 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 41 transitions. Word has length 33 [2021-08-26 01:54:41,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 01:54:41,444 INFO L470 AbstractCegarLoop]: Abstraction has 39 states and 41 transitions. [2021-08-26 01:54:41,444 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.583333333333333) internal successors, (55), 12 states have internal predecessors, (55), 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:54:41,444 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 41 transitions. [2021-08-26 01:54:41,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2021-08-26 01:54:41,444 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 01:54:41,444 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-26 01:54:41,464 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (19)] Ended with exit code 0 [2021-08-26 01:54:41,656 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-08-26 01:54:41,656 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-26 01:54:41,656 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 01:54:41,657 INFO L82 PathProgramCache]: Analyzing trace with hash 739407273, now seen corresponding path program 1 times [2021-08-26 01:54:41,657 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-26 01:54:41,657 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1611722803] [2021-08-26 01:54:41,657 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 01:54:41,657 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-26 01:54:41,657 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-26 01:54:41,658 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-08-26 01:54:41,660 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (20)] Waiting until timeout for monitored process [2021-08-26 01:54:42,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 01:54:42,092 INFO L263 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 3 conjunts are in the unsatisfiable core [2021-08-26 01:54:42,093 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-26 01:54:42,172 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:54:42,172 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-26 01:54:42,241 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:54:42,241 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-26 01:54:42,241 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1611722803] [2021-08-26 01:54:42,241 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1611722803] provided 2 perfect and 0 imperfect interpolant sequences [2021-08-26 01:54:42,242 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-08-26 01:54:42,242 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 4 [2021-08-26 01:54:42,242 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2070451211] [2021-08-26 01:54:42,242 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-26 01:54:42,242 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-26 01:54:42,243 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-26 01:54:42,243 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-26 01:54:42,243 INFO L87 Difference]: Start difference. First operand 39 states and 41 transitions. Second operand has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 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:54:42,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 01:54:42,274 INFO L93 Difference]: Finished difference Result 39 states and 41 transitions. [2021-08-26 01:54:42,274 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-26 01:54:42,274 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 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) Word has length 35 [2021-08-26 01:54:42,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 01:54:42,274 INFO L225 Difference]: With dead ends: 39 [2021-08-26 01:54:42,274 INFO L226 Difference]: Without dead ends: 0 [2021-08-26 01:54:42,275 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 9.2ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-26 01:54:42,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2021-08-26 01:54:42,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2021-08-26 01:54:42,275 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:54:42,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2021-08-26 01:54:42,275 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 35 [2021-08-26 01:54:42,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 01:54:42,275 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-08-26 01:54:42,275 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 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:54:42,276 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2021-08-26 01:54:42,276 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-08-26 01:54:42,278 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION [2021-08-26 01:54:42,278 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION [2021-08-26 01:54:42,287 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (20)] Forceful destruction successful, exit code 0 [2021-08-26 01:54:42,478 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-08-26 01:54:42,480 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2021-08-26 01:54:42,483 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-26 01:54:42,617 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-26 01:54:42,689 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-26 01:54:42,741 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-26 01:54:42,742 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-26 01:54:42,744 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-26 01:54:42,748 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-26 01:54:42,809 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-26 01:54:42,821 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-26 01:54:42,839 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-26 01:54:42,852 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-26 01:54:42,928 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-26 01:54:42,931 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-26 01:54:42,932 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-26 01:54:46,560 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION(line 82) no Hoare annotation was computed. [2021-08-26 01:54:46,560 INFO L857 garLoopResultBuilder]: For program point L69(line 69) no Hoare annotation was computed. [2021-08-26 01:54:46,560 INFO L857 garLoopResultBuilder]: For program point L36(lines 36 42) no Hoare annotation was computed. [2021-08-26 01:54:46,560 INFO L857 garLoopResultBuilder]: For program point L69-2(line 69) no Hoare annotation was computed. [2021-08-26 01:54:46,560 INFO L857 garLoopResultBuilder]: For program point L36-1(lines 36 42) no Hoare annotation was computed. [2021-08-26 01:54:46,560 INFO L857 garLoopResultBuilder]: For program point L69-3(lines 69 70) no Hoare annotation was computed. [2021-08-26 01:54:46,560 INFO L857 garLoopResultBuilder]: For program point L69-5(lines 69 85) no Hoare annotation was computed. [2021-08-26 01:54:46,560 INFO L857 garLoopResultBuilder]: For program point L69-7(lines 69 85) no Hoare annotation was computed. [2021-08-26 01:54:46,560 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2021-08-26 01:54:46,561 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2021-08-26 01:54:46,561 INFO L857 garLoopResultBuilder]: For program point L53(line 53) no Hoare annotation was computed. [2021-08-26 01:54:46,561 INFO L857 garLoopResultBuilder]: For program point L53-2(line 53) no Hoare annotation was computed. [2021-08-26 01:54:46,561 INFO L853 garLoopResultBuilder]: At program point L53-3(lines 45 54) the Hoare annotation is: (let ((.cse1 (not (fp.eq ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~x~0))) (.cse0 (= ULTIMATE.start_fmax_float_~y ULTIMATE.start_main_~y~0)) (.cse2 (fp ((_ extract 31 31) ULTIMATE.start___fpclassify_float_~w~0) ((_ extract 30 23) ULTIMATE.start___fpclassify_float_~w~0) ((_ extract 22 0) ULTIMATE.start___fpclassify_float_~w~0)))) (or (and (= (_ bv0 32) |ULTIMATE.start_isnan_float_#res|) (fp.eq ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0) .cse0 (= ULTIMATE.start_main_~y~0 |ULTIMATE.start_fmax_float_#res|) .cse1) (and .cse0 (not (fp.eq ULTIMATE.start_fmax_float_~x ULTIMATE.start_fmax_float_~x)) (= ULTIMATE.start_fmax_float_~y .cse2) (= ULTIMATE.start_fmax_float_~y ULTIMATE.start___fpclassify_float_~x) .cse1 (fp.eq |ULTIMATE.start_fmax_float_#res| ULTIMATE.start_main_~y~0)) (and (not (fp.eq ULTIMATE.start_fmax_float_~y ULTIMATE.start_fmax_float_~y)) (fp.eq ULTIMATE.start_fmax_float_~x ULTIMATE.start_main_~x~0) .cse0 (not (fp.eq ULTIMATE.start___fpclassify_float_~x ULTIMATE.start___fpclassify_float_~x)) (not (fp.eq .cse2 .cse2)) (= (_ bv1 32) |ULTIMATE.start_isnan_float_#res|) (fp.eq |ULTIMATE.start_fmax_float_#res| ULTIMATE.start_main_~x~0)))) [2021-08-26 01:54:46,561 INFO L857 garLoopResultBuilder]: For program point L70(line 70) no Hoare annotation was computed. [2021-08-26 01:54:46,561 INFO L857 garLoopResultBuilder]: For program point L70-2(line 70) no Hoare annotation was computed. [2021-08-26 01:54:46,561 INFO L860 garLoopResultBuilder]: At program point L87(lines 59 88) the Hoare annotation is: true [2021-08-26 01:54:46,562 INFO L857 garLoopResultBuilder]: For program point L46(lines 46 48) no Hoare annotation was computed. [2021-08-26 01:54:46,562 INFO L857 garLoopResultBuilder]: For program point L39(lines 39 42) no Hoare annotation was computed. [2021-08-26 01:54:46,562 INFO L857 garLoopResultBuilder]: For program point L39-1(lines 39 42) no Hoare annotation was computed. [2021-08-26 01:54:46,562 INFO L857 garLoopResultBuilder]: For program point L81(line 81) no Hoare annotation was computed. [2021-08-26 01:54:46,562 INFO L857 garLoopResultBuilder]: For program point L81-2(lines 81 84) no Hoare annotation was computed. [2021-08-26 01:54:46,562 INFO L857 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2021-08-26 01:54:46,562 INFO L853 garLoopResultBuilder]: At program point L57(line 57) the Hoare annotation is: (let ((.cse0 (fp.eq ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~x~0))) (or (and (= (_ bv0 32) |ULTIMATE.start_isnan_float_#res|) .cse0) (and (not .cse0) (= (_ bv1 32) |ULTIMATE.start_isnan_float_#res|)))) [2021-08-26 01:54:46,562 INFO L853 garLoopResultBuilder]: At program point L57-1(line 57) the Hoare annotation is: (and |ULTIMATE.start_main_#t~short15| (let ((.cse0 (fp.eq ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0))) (or (and (not .cse0) (= (_ bv1 32) |ULTIMATE.start_isnan_float_#res|)) (and (= (_ bv0 32) |ULTIMATE.start_isnan_float_#res|) .cse0))) (not (fp.eq ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~x~0))) [2021-08-26 01:54:46,562 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 76) no Hoare annotation was computed. [2021-08-26 01:54:46,563 INFO L853 garLoopResultBuilder]: At program point L57-2(line 57) the Hoare annotation is: (let ((.cse0 (not |ULTIMATE.start_main_#t~short19|)) (.cse1 (not |ULTIMATE.start_main_#t~short15|)) (.cse2 (fp.eq ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~x~0))) (or (and (not (fp.eq ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0)) .cse0 .cse1 (not .cse2) (= (_ bv1 32) |ULTIMATE.start_isnan_float_#res|)) (and (= (_ bv0 32) |ULTIMATE.start_isnan_float_#res|) .cse0 .cse1 .cse2))) [2021-08-26 01:54:46,563 INFO L853 garLoopResultBuilder]: At program point L57-3(line 57) the Hoare annotation is: (and |ULTIMATE.start_main_#t~short18| (let ((.cse0 (fp.eq ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0))) (or (and (not .cse0) (= (_ bv1 32) |ULTIMATE.start_isnan_float_#res|)) (and (= (_ bv0 32) |ULTIMATE.start_isnan_float_#res|) .cse0))) (not |ULTIMATE.start_main_#t~short19|) (not |ULTIMATE.start_main_#t~short15|) (fp.eq ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~x~0)) [2021-08-26 01:54:46,563 INFO L853 garLoopResultBuilder]: At program point L57-4(line 57) the Hoare annotation is: (let ((.cse2 (not (fp.eq ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~x~0))) (.cse3 (= (_ bv1 32) |ULTIMATE.start_isnan_float_#res|)) (.cse0 (= ULTIMATE.start_fmax_float_~y ULTIMATE.start_main_~y~0)) (.cse1 (fp ((_ extract 31 31) ULTIMATE.start___fpclassify_float_~w~0) ((_ extract 30 23) ULTIMATE.start___fpclassify_float_~w~0) ((_ extract 22 0) ULTIMATE.start___fpclassify_float_~w~0)))) (or (and (fp.eq ULTIMATE.start_main_~res~0 ULTIMATE.start_main_~y~0) .cse0 (not (fp.eq ULTIMATE.start_fmax_float_~x ULTIMATE.start_fmax_float_~x)) (= ULTIMATE.start_fmax_float_~y .cse1) (= ULTIMATE.start_fmax_float_~y ULTIMATE.start___fpclassify_float_~x) .cse2 .cse3 (fp.eq |ULTIMATE.start_fmax_float_#res| ULTIMATE.start_main_~y~0)) (and (fp.eq ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0) .cse0 (= ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~res~0) (= ULTIMATE.start_main_~y~0 |ULTIMATE.start_fmax_float_#res|) .cse2 .cse3) (and (= (_ bv0 32) |ULTIMATE.start_isnan_float_#res|) (not (fp.eq ULTIMATE.start_fmax_float_~y ULTIMATE.start_fmax_float_~y)) (fp.eq ULTIMATE.start_fmax_float_~x ULTIMATE.start_main_~x~0) .cse0 (not (fp.eq ULTIMATE.start___fpclassify_float_~x ULTIMATE.start___fpclassify_float_~x)) (fp.eq ULTIMATE.start_main_~res~0 ULTIMATE.start_main_~x~0) (not (fp.eq .cse1 .cse1)) (fp.eq |ULTIMATE.start_fmax_float_#res| ULTIMATE.start_main_~x~0)))) [2021-08-26 01:54:46,563 INFO L853 garLoopResultBuilder]: At program point L57-5(line 57) the Hoare annotation is: (let ((.cse0 (= (_ bv0 32) |ULTIMATE.start_isnan_float_#res|)) (.cse1 (= ULTIMATE.start_fmax_float_~y ULTIMATE.start_main_~y~0)) (.cse2 (not (fp.eq ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~x~0)))) (or (and |ULTIMATE.start_main_#t~short23| (fp.eq ULTIMATE.start_main_~res~0 ULTIMATE.start_main_~y~0) .cse0 .cse1 (not (fp.eq ULTIMATE.start_fmax_float_~x ULTIMATE.start_fmax_float_~x)) (= ULTIMATE.start_fmax_float_~y (fp ((_ extract 31 31) ULTIMATE.start___fpclassify_float_~w~0) ((_ extract 30 23) ULTIMATE.start___fpclassify_float_~w~0) ((_ extract 22 0) ULTIMATE.start___fpclassify_float_~w~0))) (= ULTIMATE.start_fmax_float_~y ULTIMATE.start___fpclassify_float_~x) .cse2 (fp.eq |ULTIMATE.start_fmax_float_#res| ULTIMATE.start_main_~y~0)) (and |ULTIMATE.start_main_#t~short23| .cse0 (fp.eq ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0) .cse1 (= ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~res~0) (= ULTIMATE.start_main_~y~0 |ULTIMATE.start_fmax_float_#res|) .cse2))) [2021-08-26 01:54:46,563 INFO L853 garLoopResultBuilder]: At program point L57-6(line 57) the Hoare annotation is: (or (and (not (fp.eq ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~x~0)) (= (_ bv1 32) |ULTIMATE.start_isnan_float_#res|)) (and (= (_ bv0 32) |ULTIMATE.start_isnan_float_#res|) (not (fp.eq ULTIMATE.start_fmax_float_~y ULTIMATE.start_fmax_float_~y)) (fp.eq ULTIMATE.start_fmax_float_~x ULTIMATE.start_main_~x~0) (= ULTIMATE.start_fmax_float_~y ULTIMATE.start_main_~y~0) (not (fp.eq ULTIMATE.start___fpclassify_float_~x ULTIMATE.start___fpclassify_float_~x)) (fp.eq ULTIMATE.start_main_~res~0 ULTIMATE.start_main_~x~0) (not (let ((.cse0 (fp ((_ extract 31 31) ULTIMATE.start___fpclassify_float_~w~0) ((_ extract 30 23) ULTIMATE.start___fpclassify_float_~w~0) ((_ extract 22 0) ULTIMATE.start___fpclassify_float_~w~0)))) (fp.eq .cse0 .cse0))) (fp.eq |ULTIMATE.start_fmax_float_#res| ULTIMATE.start_main_~x~0))) [2021-08-26 01:54:46,563 INFO L853 garLoopResultBuilder]: At program point L57-7(line 57) the Hoare annotation is: (and (not (fp.eq ULTIMATE.start_fmax_float_~y ULTIMATE.start_fmax_float_~y)) (fp.eq ULTIMATE.start_fmax_float_~x ULTIMATE.start_main_~x~0) (= ULTIMATE.start_fmax_float_~y ULTIMATE.start_main_~y~0) (not (fp.eq ULTIMATE.start___fpclassify_float_~x ULTIMATE.start___fpclassify_float_~x)) (fp.eq ULTIMATE.start_main_~res~0 ULTIMATE.start_main_~x~0) (not (let ((.cse0 (fp ((_ extract 31 31) ULTIMATE.start___fpclassify_float_~w~0) ((_ extract 30 23) ULTIMATE.start___fpclassify_float_~w~0) ((_ extract 22 0) ULTIMATE.start___fpclassify_float_~w~0)))) (fp.eq .cse0 .cse0))) (= (_ bv1 32) |ULTIMATE.start_isnan_float_#res|) (fp.eq |ULTIMATE.start_fmax_float_#res| ULTIMATE.start_main_~x~0)) [2021-08-26 01:54:46,563 INFO L857 garLoopResultBuilder]: For program point L82(line 82) no Hoare annotation was computed. [2021-08-26 01:54:46,563 INFO L857 garLoopResultBuilder]: For program point L33(lines 33 42) no Hoare annotation was computed. [2021-08-26 01:54:46,563 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2021-08-26 01:54:46,563 INFO L857 garLoopResultBuilder]: For program point L33-1(lines 33 42) no Hoare annotation was computed. [2021-08-26 01:54:46,563 INFO L857 garLoopResultBuilder]: For program point L25-1(lines 25 29) no Hoare annotation was computed. [2021-08-26 01:54:46,563 INFO L853 garLoopResultBuilder]: At program point L25-2(lines 25 29) the Hoare annotation is: (let ((.cse1 (= ULTIMATE.start_fmax_float_~y ULTIMATE.start_main_~y~0)) (.cse0 (fp.eq ULTIMATE.start_fmax_float_~y ULTIMATE.start_fmax_float_~y)) (.cse2 (fp.eq ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~x~0))) (or (and (= ULTIMATE.start_fmax_float_~x ULTIMATE.start_main_~x~0) (not .cse0) .cse1 (= ULTIMATE.start_fmax_float_~x ULTIMATE.start___fpclassify_float_~x) .cse2 (= (_ bv1 32) |ULTIMATE.start_isnan_float_#res|)) (and (= (_ bv0 32) |ULTIMATE.start_isnan_float_#res|) .cse1 (not (fp.eq ULTIMATE.start_fmax_float_~x ULTIMATE.start_fmax_float_~x)) .cse0 (not .cse2)))) [2021-08-26 01:54:46,563 INFO L857 garLoopResultBuilder]: For program point L25-3(lines 22 43) no Hoare annotation was computed. [2021-08-26 01:54:46,563 INFO L857 garLoopResultBuilder]: For program point L25-5(lines 25 29) no Hoare annotation was computed. [2021-08-26 01:54:46,563 INFO L853 garLoopResultBuilder]: At program point L25-6(lines 25 29) the Hoare annotation is: (let ((.cse0 (= ULTIMATE.start_fmax_float_~y ULTIMATE.start_main_~y~0)) (.cse1 (= ULTIMATE.start_fmax_float_~y ULTIMATE.start___fpclassify_float_~x))) (or (and (= (_ bv0 32) |ULTIMATE.start_isnan_float_#res|) .cse0 (not (fp.eq ULTIMATE.start_fmax_float_~x ULTIMATE.start_fmax_float_~x)) (fp.eq ULTIMATE.start_fmax_float_~y ULTIMATE.start_fmax_float_~y) .cse1 (not (fp.eq ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~x~0))) (and (fp.eq ULTIMATE.start_fmax_float_~x ULTIMATE.start_main_~x~0) .cse0 (not (fp.eq ULTIMATE.start___fpclassify_float_~x ULTIMATE.start___fpclassify_float_~x)) .cse1 (= (_ bv1 32) |ULTIMATE.start_isnan_float_#res|)))) [2021-08-26 01:54:46,564 INFO L857 garLoopResultBuilder]: For program point L25-7(lines 22 43) no Hoare annotation was computed. [2021-08-26 01:54:46,564 INFO L857 garLoopResultBuilder]: For program point L50(lines 50 52) no Hoare annotation was computed. [2021-08-26 01:54:46,564 INFO L857 garLoopResultBuilder]: For program point L75(line 75) no Hoare annotation was computed. [2021-08-26 01:54:46,564 INFO L853 garLoopResultBuilder]: At program point L42(lines 22 43) the Hoare annotation is: (let ((.cse1 (fp.eq ULTIMATE.start_fmax_float_~y ULTIMATE.start_fmax_float_~y)) (.cse0 (= ULTIMATE.start_fmax_float_~y ULTIMATE.start_main_~y~0)) (.cse2 (fp.eq ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~x~0))) (or (and (= (_ bv0 32) |ULTIMATE.start_isnan_float_#res|) .cse0 (not (fp.eq ULTIMATE.start_fmax_float_~x ULTIMATE.start_fmax_float_~x)) .cse1 (not .cse2)) (and (= ULTIMATE.start_fmax_float_~x ULTIMATE.start_main_~x~0) (not .cse1) .cse0 (= ULTIMATE.start_fmax_float_~x ULTIMATE.start___fpclassify_float_~x) .cse2 (= (_ bv1 32) |ULTIMATE.start_isnan_float_#res|) (not (= (_ bv0 32) |ULTIMATE.start___fpclassify_float_#res|)) (= ULTIMATE.start_fmax_float_~x (fp ((_ extract 31 31) ULTIMATE.start___fpclassify_float_~w~0) ((_ extract 30 23) ULTIMATE.start___fpclassify_float_~w~0) ((_ extract 22 0) ULTIMATE.start___fpclassify_float_~w~0)))))) [2021-08-26 01:54:46,564 INFO L853 garLoopResultBuilder]: At program point L42-1(lines 22 43) the Hoare annotation is: (let ((.cse2 (fp ((_ extract 31 31) ULTIMATE.start___fpclassify_float_~w~0) ((_ extract 30 23) ULTIMATE.start___fpclassify_float_~w~0) ((_ extract 22 0) ULTIMATE.start___fpclassify_float_~w~0)))) (let ((.cse1 (= ULTIMATE.start_fmax_float_~y ULTIMATE.start_main_~y~0)) (.cse3 (= ULTIMATE.start_fmax_float_~y .cse2)) (.cse4 (= ULTIMATE.start_fmax_float_~y ULTIMATE.start___fpclassify_float_~x)) (.cse0 (= (_ bv0 32) |ULTIMATE.start___fpclassify_float_#res|))) (or (and .cse0 (fp.eq ULTIMATE.start_fmax_float_~x ULTIMATE.start_main_~x~0) .cse1 (not (fp.eq .cse2 .cse2)) .cse3 .cse4 (= (_ bv1 32) |ULTIMATE.start_isnan_float_#res|)) (and .cse1 (not (fp.eq ULTIMATE.start_fmax_float_~x ULTIMATE.start_fmax_float_~x)) .cse3 (fp.eq ULTIMATE.start_fmax_float_~y ULTIMATE.start_main_~y~0) .cse4 (not (fp.eq ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~x~0)) (not .cse0))))) [2021-08-26 01:54:46,564 INFO L857 garLoopResultBuilder]: For program point L75-2(lines 75 78) no Hoare annotation was computed. [2021-08-26 01:54:46,564 INFO L857 garLoopResultBuilder]: For program point L76(line 76) no Hoare annotation was computed. [2021-08-26 01:54:46,567 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-08-26 01:54:46,591 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.08 01:54:46 BoogieIcfgContainer [2021-08-26 01:54:46,591 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-08-26 01:54:46,592 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-08-26 01:54:46,592 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-08-26 01:54:46,592 INFO L275 PluginConnector]: Witness Printer initialized [2021-08-26 01:54:46,592 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.08 01:54:16" (3/4) ... [2021-08-26 01:54:46,595 INFO L137 WitnessPrinter]: Generating witness for correct program [2021-08-26 01:54:46,604 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 22 nodes and edges [2021-08-26 01:54:46,604 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2021-08-26 01:54:46,605 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2021-08-26 01:54:46,605 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2021-08-26 01:54:46,623 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (0bv32 == \result && ~fp.eq~FLOAT(x, x)) || (!~fp.eq~FLOAT(x, x) && 1bv32 == \result) [2021-08-26 01:54:46,624 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (aux-isnan_float(x) && !isnan_float(y)-aux && ((!~fp.eq~FLOAT(y, y) && 1bv32 == \result) || (0bv32 == \result && ~fp.eq~FLOAT(y, y)))) && !~fp.eq~FLOAT(x, x) [2021-08-26 01:54:46,624 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((!~fp.eq~FLOAT(y, y) && !aux-(isnan_float(x) && !isnan_float(y)) || (!isnan_float(x) && isnan_float(y))-aux) && !aux-isnan_float(x) && !isnan_float(y)-aux) && !~fp.eq~FLOAT(x, x)) && 1bv32 == \result) || (((0bv32 == \result && !aux-(isnan_float(x) && !isnan_float(y)) || (!isnan_float(x) && isnan_float(y))-aux) && !aux-isnan_float(x) && !isnan_float(y)-aux) && ~fp.eq~FLOAT(x, x)) [2021-08-26 01:54:46,624 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((aux-!isnan_float(x) && isnan_float(y)-aux && ((!~fp.eq~FLOAT(y, y) && 1bv32 == \result) || (0bv32 == \result && ~fp.eq~FLOAT(y, y)))) && !aux-(isnan_float(x) && !isnan_float(y)) || (!isnan_float(x) && isnan_float(y))-aux) && !aux-isnan_float(x) && !isnan_float(y)-aux) && ~fp.eq~FLOAT(x, x) [2021-08-26 01:54:46,625 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((x == x && !~fp.eq~FLOAT(y, y)) && y == y) && x == x) && ~fp.eq~FLOAT(x, x)) && 1bv32 == \result) || ((((0bv32 == \result && y == y) && !~fp.eq~FLOAT(x, x)) && ~fp.eq~FLOAT(y, y)) && !~fp.eq~FLOAT(x, x)) [2021-08-26 01:54:46,625 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((0bv32 == \result && y == y) && !~fp.eq~FLOAT(x, x)) && ~fp.eq~FLOAT(y, y)) && !~fp.eq~FLOAT(x, x)) || (((((((x == x && !~fp.eq~FLOAT(y, y)) && y == y) && x == x) && ~fp.eq~FLOAT(x, x)) && 1bv32 == \result) && !(0bv32 == \result)) && x == ~fp~LONGDOUBLE(w[31:31], w[30:23], w[22:0])) [2021-08-26 01:54:46,625 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((0bv32 == \result && ~fp.eq~FLOAT(y, y)) && y == y) && y == \result) && !~fp.eq~FLOAT(x, x)) || (((((y == y && !~fp.eq~FLOAT(x, x)) && y == ~fp~LONGDOUBLE(w[31:31], w[30:23], w[22:0])) && y == x) && !~fp.eq~FLOAT(x, x)) && ~fp.eq~FLOAT(\result, y))) || ((((((!~fp.eq~FLOAT(y, y) && ~fp.eq~FLOAT(x, x)) && y == y) && !~fp.eq~FLOAT(x, x)) && !~fp.eq~FLOAT(~fp~LONGDOUBLE(w[31:31], w[30:23], w[22:0]), ~fp~LONGDOUBLE(w[31:31], w[30:23], w[22:0]))) && 1bv32 == \result) && ~fp.eq~FLOAT(\result, x)) [2021-08-26 01:54:46,625 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((0bv32 == \result && y == y) && !~fp.eq~FLOAT(x, x)) && ~fp.eq~FLOAT(y, y)) && y == x) && !~fp.eq~FLOAT(x, x)) || ((((~fp.eq~FLOAT(x, x) && y == y) && !~fp.eq~FLOAT(x, x)) && y == x) && 1bv32 == \result) [2021-08-26 01:54:46,626 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((~fp.eq~FLOAT(res, y) && y == y) && !~fp.eq~FLOAT(x, x)) && y == ~fp~LONGDOUBLE(w[31:31], w[30:23], w[22:0])) && y == x) && !~fp.eq~FLOAT(x, x)) && 1bv32 == \result) && ~fp.eq~FLOAT(\result, y)) || (((((~fp.eq~FLOAT(y, y) && y == y) && y == res) && y == \result) && !~fp.eq~FLOAT(x, x)) && 1bv32 == \result)) || (((((((0bv32 == \result && !~fp.eq~FLOAT(y, y)) && ~fp.eq~FLOAT(x, x)) && y == y) && !~fp.eq~FLOAT(x, x)) && ~fp.eq~FLOAT(res, x)) && !~fp.eq~FLOAT(~fp~LONGDOUBLE(w[31:31], w[30:23], w[22:0]), ~fp~LONGDOUBLE(w[31:31], w[30:23], w[22:0]))) && ~fp.eq~FLOAT(\result, x)) [2021-08-26 01:54:46,626 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((0bv32 == \result && ~fp.eq~FLOAT(x, x)) && y == y) && !~fp.eq~FLOAT(~fp~LONGDOUBLE(w[31:31], w[30:23], w[22:0]), ~fp~LONGDOUBLE(w[31:31], w[30:23], w[22:0]))) && y == ~fp~LONGDOUBLE(w[31:31], w[30:23], w[22:0])) && y == x) && 1bv32 == \result) || ((((((y == y && !~fp.eq~FLOAT(x, x)) && y == ~fp~LONGDOUBLE(w[31:31], w[30:23], w[22:0])) && ~fp.eq~FLOAT(y, y)) && y == x) && !~fp.eq~FLOAT(x, x)) && !(0bv32 == \result)) [2021-08-26 01:54:46,626 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((aux-isnan_float(x) && !isnan_float(y)-aux && ~fp.eq~FLOAT(res, y)) && 0bv32 == \result) && y == y) && !~fp.eq~FLOAT(x, x)) && y == ~fp~LONGDOUBLE(w[31:31], w[30:23], w[22:0])) && y == x) && !~fp.eq~FLOAT(x, x)) && ~fp.eq~FLOAT(\result, y)) || ((((((aux-isnan_float(x) && !isnan_float(y)-aux && 0bv32 == \result) && ~fp.eq~FLOAT(y, y)) && y == y) && y == res) && y == \result) && !~fp.eq~FLOAT(x, x)) [2021-08-26 01:54:46,627 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (!~fp.eq~FLOAT(x, x) && 1bv32 == \result) || (((((((0bv32 == \result && !~fp.eq~FLOAT(y, y)) && ~fp.eq~FLOAT(x, x)) && y == y) && !~fp.eq~FLOAT(x, x)) && ~fp.eq~FLOAT(res, x)) && !~fp.eq~FLOAT(~fp~LONGDOUBLE(w[31:31], w[30:23], w[22:0]), ~fp~LONGDOUBLE(w[31:31], w[30:23], w[22:0]))) && ~fp.eq~FLOAT(\result, x)) [2021-08-26 01:54:46,627 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((!~fp.eq~FLOAT(y, y) && ~fp.eq~FLOAT(x, x)) && y == y) && !~fp.eq~FLOAT(x, x)) && ~fp.eq~FLOAT(res, x)) && !~fp.eq~FLOAT(~fp~LONGDOUBLE(w[31:31], w[30:23], w[22:0]), ~fp~LONGDOUBLE(w[31:31], w[30:23], w[22:0]))) && 1bv32 == \result) && ~fp.eq~FLOAT(\result, x) [2021-08-26 01:54:46,647 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2021-08-26 01:54:46,647 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-08-26 01:54:46,648 INFO L168 Benchmark]: Toolchain (without parser) took 31105.61 ms. Allocated memory was 65.0 MB in the beginning and 130.0 MB in the end (delta: 65.0 MB). Free memory was 45.2 MB in the beginning and 81.5 MB in the end (delta: -36.3 MB). Peak memory consumption was 27.3 MB. Max. memory is 16.1 GB. [2021-08-26 01:54:46,649 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 65.0 MB. Free memory was 45.2 MB in the beginning and 45.2 MB in the end (delta: 32.5 kB). There was no memory consumed. Max. memory is 16.1 GB. [2021-08-26 01:54:46,649 INFO L168 Benchmark]: CACSL2BoogieTranslator took 255.05 ms. Allocated memory is still 65.0 MB. Free memory was 45.0 MB in the beginning and 47.5 MB in the end (delta: -2.5 MB). Peak memory consumption was 10.5 MB. Max. memory is 16.1 GB. [2021-08-26 01:54:46,649 INFO L168 Benchmark]: Boogie Procedure Inliner took 53.57 ms. Allocated memory is still 65.0 MB. Free memory was 47.5 MB in the beginning and 45.4 MB in the end (delta: 2.1 MB). There was no memory consumed. Max. memory is 16.1 GB. [2021-08-26 01:54:46,650 INFO L168 Benchmark]: Boogie Preprocessor took 58.17 ms. Allocated memory is still 65.0 MB. Free memory was 45.4 MB in the beginning and 43.8 MB in the end (delta: 1.7 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-08-26 01:54:46,650 INFO L168 Benchmark]: RCFGBuilder took 567.57 ms. Allocated memory is still 65.0 MB. Free memory was 43.8 MB in the beginning and 39.5 MB in the end (delta: 4.2 MB). Peak memory consumption was 20.5 MB. Max. memory is 16.1 GB. [2021-08-26 01:54:46,650 INFO L168 Benchmark]: TraceAbstraction took 30107.42 ms. Allocated memory was 65.0 MB in the beginning and 130.0 MB in the end (delta: 65.0 MB). Free memory was 39.0 MB in the beginning and 86.8 MB in the end (delta: -47.8 MB). Peak memory consumption was 75.2 MB. Max. memory is 16.1 GB. [2021-08-26 01:54:46,651 INFO L168 Benchmark]: Witness Printer took 55.64 ms. Allocated memory is still 130.0 MB. Free memory was 86.8 MB in the beginning and 81.5 MB in the end (delta: 5.2 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. [2021-08-26 01:54:46,652 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 65.0 MB. Free memory was 45.2 MB in the beginning and 45.2 MB in the end (delta: 32.5 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 255.05 ms. Allocated memory is still 65.0 MB. Free memory was 45.0 MB in the beginning and 47.5 MB in the end (delta: -2.5 MB). Peak memory consumption was 10.5 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 53.57 ms. Allocated memory is still 65.0 MB. Free memory was 47.5 MB in the beginning and 45.4 MB in the end (delta: 2.1 MB). There was no memory consumed. Max. memory is 16.1 GB. * Boogie Preprocessor took 58.17 ms. Allocated memory is still 65.0 MB. Free memory was 45.4 MB in the beginning and 43.8 MB in the end (delta: 1.7 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * RCFGBuilder took 567.57 ms. Allocated memory is still 65.0 MB. Free memory was 43.8 MB in the beginning and 39.5 MB in the end (delta: 4.2 MB). Peak memory consumption was 20.5 MB. Max. memory is 16.1 GB. * TraceAbstraction took 30107.42 ms. Allocated memory was 65.0 MB in the beginning and 130.0 MB in the end (delta: 65.0 MB). Free memory was 39.0 MB in the beginning and 86.8 MB in the end (delta: -47.8 MB). Peak memory consumption was 75.2 MB. Max. memory is 16.1 GB. * Witness Printer took 55.64 ms. Allocated memory is still 130.0 MB. Free memory was 86.8 MB in the beginning and 81.5 MB in the end (delta: 5.2 MB). Peak memory consumption was 4.2 MB. 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 - PositiveResult [Line: 76]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 82]: 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, 47 locations, 2 error locations. Started 1 CEGAR loops. OverallTime: 30043.1ms, OverallIterations: 19, TraceHistogramMax: 1, EmptinessCheckTime: 23.5ms, AutomataDifference: 9563.9ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 4080.3ms, InitialAbstractionConstructionTime: 7.2ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 1146 SDtfs, 2600 SDslu, 4552 SDs, 0 SdLazy, 2015 SolverSat, 263 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 5174.0ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1045 GetRequests, 774 SyntacticMatches, 6 SemanticMatches, 265 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 929 ImplicationChecksByTransitivity, 5666.9ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=93occurred in iteration=7, InterpolantAutomatonStates: 211, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: 122.0ms AutomataMinimizationTime, 19 MinimizatonAttempts, 578 StatesRemovedByMinimization, 14 NontrivialMinimizations, HoareAnnotationStatistics: 0.0ms HoareAnnotationTime, 14 LocationsWithAnnotation, 14 PreInvPairs, 48 NumberOfFragments, 616 HoareAnnotationTreeSize, 14 FomulaSimplifications, 584044 FormulaSimplificationTreeSizeReduction, 531.2ms HoareSimplificationTime, 14 FomulaSimplificationsInter, 78839 FormulaSimplificationTreeSizeReductionInter, 3541.1ms HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 235.8ms SsaConstructionTime, 596.9ms SatisfiabilityAnalysisTime, 7840.7ms InterpolantComputationTime, 479 NumberOfCodeBlocks, 479 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 920 ConstructedInterpolants, 31 QuantifiedInterpolants, 3559 SizeOfPredicates, 145 NumberOfNonLiveVariables, 1646 ConjunctsInSsa, 188 ConjunctsInUnsatCore, 38 InterpolantComputations, 38 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 2 specifications checked. All of them hold - InvariantResult [Line: 22]: Loop Invariant Derived loop invariant: ((((((0bv32 == \result && ~fp.eq~FLOAT(x, x)) && y == y) && !~fp.eq~FLOAT(~fp~LONGDOUBLE(w[31:31], w[30:23], w[22:0]), ~fp~LONGDOUBLE(w[31:31], w[30:23], w[22:0]))) && y == ~fp~LONGDOUBLE(w[31:31], w[30:23], w[22:0])) && y == x) && 1bv32 == \result) || ((((((y == y && !~fp.eq~FLOAT(x, x)) && y == ~fp~LONGDOUBLE(w[31:31], w[30:23], w[22:0])) && ~fp.eq~FLOAT(y, y)) && y == x) && !~fp.eq~FLOAT(x, x)) && !(0bv32 == \result)) - InvariantResult [Line: 57]: Loop Invariant Derived loop invariant: ((((((((~fp.eq~FLOAT(res, y) && y == y) && !~fp.eq~FLOAT(x, x)) && y == ~fp~LONGDOUBLE(w[31:31], w[30:23], w[22:0])) && y == x) && !~fp.eq~FLOAT(x, x)) && 1bv32 == \result) && ~fp.eq~FLOAT(\result, y)) || (((((~fp.eq~FLOAT(y, y) && y == y) && y == res) && y == \result) && !~fp.eq~FLOAT(x, x)) && 1bv32 == \result)) || (((((((0bv32 == \result && !~fp.eq~FLOAT(y, y)) && ~fp.eq~FLOAT(x, x)) && y == y) && !~fp.eq~FLOAT(x, x)) && ~fp.eq~FLOAT(res, x)) && !~fp.eq~FLOAT(~fp~LONGDOUBLE(w[31:31], w[30:23], w[22:0]), ~fp~LONGDOUBLE(w[31:31], w[30:23], w[22:0]))) && ~fp.eq~FLOAT(\result, x)) - InvariantResult [Line: 45]: Loop Invariant Derived loop invariant: (((((0bv32 == \result && ~fp.eq~FLOAT(y, y)) && y == y) && y == \result) && !~fp.eq~FLOAT(x, x)) || (((((y == y && !~fp.eq~FLOAT(x, x)) && y == ~fp~LONGDOUBLE(w[31:31], w[30:23], w[22:0])) && y == x) && !~fp.eq~FLOAT(x, x)) && ~fp.eq~FLOAT(\result, y))) || ((((((!~fp.eq~FLOAT(y, y) && ~fp.eq~FLOAT(x, x)) && y == y) && !~fp.eq~FLOAT(x, x)) && !~fp.eq~FLOAT(~fp~LONGDOUBLE(w[31:31], w[30:23], w[22:0]), ~fp~LONGDOUBLE(w[31:31], w[30:23], w[22:0]))) && 1bv32 == \result) && ~fp.eq~FLOAT(\result, x)) - InvariantResult [Line: 59]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 57]: Loop Invariant Derived loop invariant: (((aux-!isnan_float(x) && isnan_float(y)-aux && ((!~fp.eq~FLOAT(y, y) && 1bv32 == \result) || (0bv32 == \result && ~fp.eq~FLOAT(y, y)))) && !aux-(isnan_float(x) && !isnan_float(y)) || (!isnan_float(x) && isnan_float(y))-aux) && !aux-isnan_float(x) && !isnan_float(y)-aux) && ~fp.eq~FLOAT(x, x) - InvariantResult [Line: 57]: Loop Invariant Derived loop invariant: ((((!~fp.eq~FLOAT(y, y) && !aux-(isnan_float(x) && !isnan_float(y)) || (!isnan_float(x) && isnan_float(y))-aux) && !aux-isnan_float(x) && !isnan_float(y)-aux) && !~fp.eq~FLOAT(x, x)) && 1bv32 == \result) || (((0bv32 == \result && !aux-(isnan_float(x) && !isnan_float(y)) || (!isnan_float(x) && isnan_float(y))-aux) && !aux-isnan_float(x) && !isnan_float(y)-aux) && ~fp.eq~FLOAT(x, x)) - InvariantResult [Line: 22]: Loop Invariant Derived loop invariant: ((((0bv32 == \result && y == y) && !~fp.eq~FLOAT(x, x)) && ~fp.eq~FLOAT(y, y)) && !~fp.eq~FLOAT(x, x)) || (((((((x == x && !~fp.eq~FLOAT(y, y)) && y == y) && x == x) && ~fp.eq~FLOAT(x, x)) && 1bv32 == \result) && !(0bv32 == \result)) && x == ~fp~LONGDOUBLE(w[31:31], w[30:23], w[22:0])) - InvariantResult [Line: 25]: Loop Invariant Derived loop invariant: (((((x == x && !~fp.eq~FLOAT(y, y)) && y == y) && x == x) && ~fp.eq~FLOAT(x, x)) && 1bv32 == \result) || ((((0bv32 == \result && y == y) && !~fp.eq~FLOAT(x, x)) && ~fp.eq~FLOAT(y, y)) && !~fp.eq~FLOAT(x, x)) - InvariantResult [Line: 25]: Loop Invariant Derived loop invariant: (((((0bv32 == \result && y == y) && !~fp.eq~FLOAT(x, x)) && ~fp.eq~FLOAT(y, y)) && y == x) && !~fp.eq~FLOAT(x, x)) || ((((~fp.eq~FLOAT(x, x) && y == y) && !~fp.eq~FLOAT(x, x)) && y == x) && 1bv32 == \result) - InvariantResult [Line: 57]: Loop Invariant Derived loop invariant: ((((((((aux-isnan_float(x) && !isnan_float(y)-aux && ~fp.eq~FLOAT(res, y)) && 0bv32 == \result) && y == y) && !~fp.eq~FLOAT(x, x)) && y == ~fp~LONGDOUBLE(w[31:31], w[30:23], w[22:0])) && y == x) && !~fp.eq~FLOAT(x, x)) && ~fp.eq~FLOAT(\result, y)) || ((((((aux-isnan_float(x) && !isnan_float(y)-aux && 0bv32 == \result) && ~fp.eq~FLOAT(y, y)) && y == y) && y == res) && y == \result) && !~fp.eq~FLOAT(x, x)) - InvariantResult [Line: 57]: Loop Invariant Derived loop invariant: (!~fp.eq~FLOAT(x, x) && 1bv32 == \result) || (((((((0bv32 == \result && !~fp.eq~FLOAT(y, y)) && ~fp.eq~FLOAT(x, x)) && y == y) && !~fp.eq~FLOAT(x, x)) && ~fp.eq~FLOAT(res, x)) && !~fp.eq~FLOAT(~fp~LONGDOUBLE(w[31:31], w[30:23], w[22:0]), ~fp~LONGDOUBLE(w[31:31], w[30:23], w[22:0]))) && ~fp.eq~FLOAT(\result, x)) - InvariantResult [Line: 57]: Loop Invariant Derived loop invariant: (aux-isnan_float(x) && !isnan_float(y)-aux && ((!~fp.eq~FLOAT(y, y) && 1bv32 == \result) || (0bv32 == \result && ~fp.eq~FLOAT(y, y)))) && !~fp.eq~FLOAT(x, x) - InvariantResult [Line: 57]: Loop Invariant Derived loop invariant: (0bv32 == \result && ~fp.eq~FLOAT(x, x)) || (!~fp.eq~FLOAT(x, x) && 1bv32 == \result) - InvariantResult [Line: 57]: Loop Invariant Derived loop invariant: ((((((!~fp.eq~FLOAT(y, y) && ~fp.eq~FLOAT(x, x)) && y == y) && !~fp.eq~FLOAT(x, x)) && ~fp.eq~FLOAT(res, x)) && !~fp.eq~FLOAT(~fp~LONGDOUBLE(w[31:31], w[30:23], w[22:0]), ~fp~LONGDOUBLE(w[31:31], w[30:23], w[22:0]))) && 1bv32 == \result) && ~fp.eq~FLOAT(\result, x) RESULT: Ultimate proved your program to be correct! [2021-08-26 01:54:46,711 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...