./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/float-newlib/float_req_bl_1231.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_1231.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 8039b1e35b9e459b273890fa707790cd9b2d1812 ....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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_1231.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 8039b1e35b9e459b273890fa707790cd9b2d1812 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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:53:56,997 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-08-26 01:53:57,000 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-08-26 01:53:57,038 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-08-26 01:53:57,039 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-08-26 01:53:57,042 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-08-26 01:53:57,043 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-08-26 01:53:57,048 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-08-26 01:53:57,050 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-08-26 01:53:57,054 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-08-26 01:53:57,055 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-08-26 01:53:57,058 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-08-26 01:53:57,059 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-08-26 01:53:57,061 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-08-26 01:53:57,062 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-08-26 01:53:57,065 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-08-26 01:53:57,066 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-08-26 01:53:57,067 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-08-26 01:53:57,069 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-08-26 01:53:57,074 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-08-26 01:53:57,075 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-08-26 01:53:57,076 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-08-26 01:53:57,078 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-08-26 01:53:57,079 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-08-26 01:53:57,085 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-08-26 01:53:57,085 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-08-26 01:53:57,085 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-08-26 01:53:57,093 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-08-26 01:53:57,093 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-08-26 01:53:57,094 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-08-26 01:53:57,094 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-08-26 01:53:57,095 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-08-26 01:53:57,096 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-08-26 01:53:57,097 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-08-26 01:53:57,098 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-08-26 01:53:57,098 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-08-26 01:53:57,099 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-08-26 01:53:57,099 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-08-26 01:53:57,099 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-08-26 01:53:57,101 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-08-26 01:53:57,102 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-08-26 01:53:57,106 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:53:57,141 INFO L113 SettingsManager]: Loading preferences was successful [2021-08-26 01:53:57,141 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-08-26 01:53:57,142 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-08-26 01:53:57,143 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-08-26 01:53:57,145 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-08-26 01:53:57,145 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-08-26 01:53:57,145 INFO L138 SettingsManager]: * Use SBE=true [2021-08-26 01:53:57,145 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-08-26 01:53:57,146 INFO L138 SettingsManager]: * sizeof long=4 [2021-08-26 01:53:57,146 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-08-26 01:53:57,147 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-08-26 01:53:57,147 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-08-26 01:53:57,147 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-08-26 01:53:57,147 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-08-26 01:53:57,147 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-08-26 01:53:57,148 INFO L138 SettingsManager]: * sizeof long double=12 [2021-08-26 01:53:57,148 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-08-26 01:53:57,148 INFO L138 SettingsManager]: * Use constant arrays=true [2021-08-26 01:53:57,148 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-08-26 01:53:57,149 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-08-26 01:53:57,149 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-08-26 01:53:57,149 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-08-26 01:53:57,149 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-08-26 01:53:57,149 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-08-26 01:53:57,150 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-08-26 01:53:57,150 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-08-26 01:53:57,150 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-08-26 01:53:57,150 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-08-26 01:53:57,150 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-08-26 01:53:57,151 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-08-26 01:53:57,151 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 -> 8039b1e35b9e459b273890fa707790cd9b2d1812 [2021-08-26 01:53:57,443 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-08-26 01:53:57,460 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-08-26 01:53:57,462 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-08-26 01:53:57,463 INFO L271 PluginConnector]: Initializing CDTParser... [2021-08-26 01:53:57,464 INFO L275 PluginConnector]: CDTParser initialized [2021-08-26 01:53:57,465 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/float-newlib/float_req_bl_1231.c [2021-08-26 01:53:57,524 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1ab77bee0/8a5145e471c643d0bdc0c5ae0d1b1bb0/FLAGe99165d1c [2021-08-26 01:53:57,982 INFO L306 CDTParser]: Found 1 translation units. [2021-08-26 01:53:57,983 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/float_req_bl_1231.c [2021-08-26 01:53:57,989 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1ab77bee0/8a5145e471c643d0bdc0c5ae0d1b1bb0/FLAGe99165d1c [2021-08-26 01:53:58,375 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1ab77bee0/8a5145e471c643d0bdc0c5ae0d1b1bb0 [2021-08-26 01:53:58,377 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-08-26 01:53:58,379 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-08-26 01:53:58,382 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-08-26 01:53:58,382 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-08-26 01:53:58,387 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-08-26 01:53:58,388 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.08 01:53:58" (1/1) ... [2021-08-26 01:53:58,389 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@43e85387 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 01:53:58, skipping insertion in model container [2021-08-26 01:53:58,389 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.08 01:53:58" (1/1) ... [2021-08-26 01:53:58,394 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-08-26 01:53:58,410 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-08-26 01:53:58,545 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_1231.c[1835,1848] [2021-08-26 01:53:58,548 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_1231.c[1994,2007] [2021-08-26 01:53:58,549 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-26 01:53:58,555 INFO L203 MainTranslator]: Completed pre-run [2021-08-26 01:53:58,615 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_1231.c[1835,1848] [2021-08-26 01:53:58,621 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_1231.c[1994,2007] [2021-08-26 01:53:58,627 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-26 01:53:58,639 INFO L208 MainTranslator]: Completed translation [2021-08-26 01:53:58,641 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 01:53:58 WrapperNode [2021-08-26 01:53:58,641 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-08-26 01:53:58,642 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-08-26 01:53:58,642 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-08-26 01:53:58,642 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-08-26 01:53:58,648 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:53:58" (1/1) ... [2021-08-26 01:53:58,663 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:53:58" (1/1) ... [2021-08-26 01:53:58,693 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-08-26 01:53:58,694 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-08-26 01:53:58,694 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-08-26 01:53:58,694 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-08-26 01:53:58,701 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 01:53:58" (1/1) ... [2021-08-26 01:53:58,701 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 01:53:58" (1/1) ... [2021-08-26 01:53:58,714 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 01:53:58" (1/1) ... [2021-08-26 01:53:58,716 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 01:53:58" (1/1) ... [2021-08-26 01:53:58,725 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 01:53:58" (1/1) ... [2021-08-26 01:53:58,738 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 01:53:58" (1/1) ... [2021-08-26 01:53:58,741 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 01:53:58" (1/1) ... [2021-08-26 01:53:58,747 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-08-26 01:53:58,748 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-08-26 01:53:58,749 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-08-26 01:53:58,749 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-08-26 01:53:58,750 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 01:53:58" (1/1) ... [2021-08-26 01:53:58,756 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-08-26 01:53:58,762 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-26 01:53:58,778 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:53:58,812 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:53:58,830 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-08-26 01:53:58,831 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-08-26 01:53:58,831 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2021-08-26 01:53:58,831 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-08-26 01:53:58,831 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-08-26 01:53:58,831 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-08-26 01:53:58,831 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-08-26 01:53:59,312 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-08-26 01:53:59,312 INFO L299 CfgBuilder]: Removed 30 assume(true) statements. [2021-08-26 01:53:59,314 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.08 01:53:59 BoogieIcfgContainer [2021-08-26 01:53:59,314 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-08-26 01:53:59,315 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-08-26 01:53:59,315 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-08-26 01:53:59,318 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-08-26 01:53:59,318 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.08 01:53:58" (1/3) ... [2021-08-26 01:53:59,319 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@23b15718 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.08 01:53:59, skipping insertion in model container [2021-08-26 01:53:59,319 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 01:53:58" (2/3) ... [2021-08-26 01:53:59,319 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@23b15718 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.08 01:53:59, skipping insertion in model container [2021-08-26 01:53:59,320 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.08 01:53:59" (3/3) ... [2021-08-26 01:53:59,321 INFO L111 eAbstractionObserver]: Analyzing ICFG float_req_bl_1231.c [2021-08-26 01:53:59,325 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-08-26 01:53:59,325 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2021-08-26 01:53:59,362 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-08-26 01:53:59,368 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:53:59,368 INFO L340 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2021-08-26 01:53:59,380 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:53:59,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-08-26 01:53:59,385 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 01:53:59,385 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:53:59,386 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-26 01:53:59,390 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 01:53:59,390 INFO L82 PathProgramCache]: Analyzing trace with hash 1204154757, now seen corresponding path program 1 times [2021-08-26 01:53:59,398 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 01:53:59,398 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1890134406] [2021-08-26 01:53:59,399 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 01:53:59,399 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 01:53:59,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 01:53:59,556 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:53:59,556 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 01:53:59,557 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1890134406] [2021-08-26 01:53:59,557 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1890134406] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-26 01:53:59,557 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-26 01:53:59,558 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-26 01:53:59,559 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [686764611] [2021-08-26 01:53:59,563 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-26 01:53:59,563 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 01:53:59,573 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-26 01:53:59,574 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-26 01:53:59,576 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:53:59,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 01:53:59,641 INFO L93 Difference]: Finished difference Result 90 states and 134 transitions. [2021-08-26 01:53:59,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-08-26 01:53:59,643 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:53:59,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 01:53:59,650 INFO L225 Difference]: With dead ends: 90 [2021-08-26 01:53:59,650 INFO L226 Difference]: Without dead ends: 50 [2021-08-26 01:53:59,653 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 20.6ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-26 01:53:59,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2021-08-26 01:53:59,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 45. [2021-08-26 01:53:59,680 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:53:59,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 60 transitions. [2021-08-26 01:53:59,683 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 60 transitions. Word has length 16 [2021-08-26 01:53:59,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 01:53:59,683 INFO L470 AbstractCegarLoop]: Abstraction has 45 states and 60 transitions. [2021-08-26 01:53:59,683 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:53:59,684 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 60 transitions. [2021-08-26 01:53:59,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-08-26 01:53:59,684 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 01:53:59,685 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:53:59,685 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-08-26 01:53:59,685 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-26 01:53:59,686 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 01:53:59,686 INFO L82 PathProgramCache]: Analyzing trace with hash 44236684, now seen corresponding path program 1 times [2021-08-26 01:53:59,686 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 01:53:59,687 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1946577289] [2021-08-26 01:53:59,687 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 01:53:59,687 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 01:53:59,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 01:53:59,801 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:53:59,802 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 01:53:59,802 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1946577289] [2021-08-26 01:53:59,802 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1946577289] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-26 01:53:59,802 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-26 01:53:59,802 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-26 01:53:59,803 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [3702348] [2021-08-26 01:53:59,804 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-26 01:53:59,804 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 01:53:59,805 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-26 01:53:59,806 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-26 01:53:59,807 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:53:59,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 01:53:59,884 INFO L93 Difference]: Finished difference Result 77 states and 97 transitions. [2021-08-26 01:53:59,885 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-26 01:53:59,885 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:53:59,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 01:53:59,888 INFO L225 Difference]: With dead ends: 77 [2021-08-26 01:53:59,889 INFO L226 Difference]: Without dead ends: 64 [2021-08-26 01:53:59,891 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 34.9ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-26 01:53:59,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2021-08-26 01:53:59,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 47. [2021-08-26 01:53:59,899 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:53:59,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 62 transitions. [2021-08-26 01:53:59,905 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 62 transitions. Word has length 18 [2021-08-26 01:53:59,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 01:53:59,906 INFO L470 AbstractCegarLoop]: Abstraction has 47 states and 62 transitions. [2021-08-26 01:53:59,906 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:53:59,906 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 62 transitions. [2021-08-26 01:53:59,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-08-26 01:53:59,908 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 01:53:59,908 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:53:59,909 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-08-26 01:53:59,909 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-26 01:53:59,910 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 01:53:59,911 INFO L82 PathProgramCache]: Analyzing trace with hash -674173253, now seen corresponding path program 1 times [2021-08-26 01:53:59,911 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 01:53:59,911 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1583557389] [2021-08-26 01:53:59,911 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 01:53:59,912 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 01:53:59,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 01:54:00,021 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:00,022 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 01:54:00,022 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1583557389] [2021-08-26 01:54:00,023 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1583557389] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-26 01:54:00,023 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-26 01:54:00,023 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-26 01:54:00,024 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1441741596] [2021-08-26 01:54:00,024 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-26 01:54:00,025 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 01:54:00,033 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-26 01:54:00,033 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-26 01:54:00,034 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:00,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 01:54:00,105 INFO L93 Difference]: Finished difference Result 79 states and 99 transitions. [2021-08-26 01:54:00,106 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-26 01:54:00,106 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:00,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 01:54:00,108 INFO L225 Difference]: With dead ends: 79 [2021-08-26 01:54:00,108 INFO L226 Difference]: Without dead ends: 66 [2021-08-26 01:54:00,109 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 18.9ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-26 01:54:00,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2021-08-26 01:54:00,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 47. [2021-08-26 01:54:00,118 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:00,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 62 transitions. [2021-08-26 01:54:00,120 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 62 transitions. Word has length 19 [2021-08-26 01:54:00,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 01:54:00,121 INFO L470 AbstractCegarLoop]: Abstraction has 47 states and 62 transitions. [2021-08-26 01:54:00,122 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:00,122 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 62 transitions. [2021-08-26 01:54:00,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-08-26 01:54:00,123 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 01:54:00,123 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:00,123 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-08-26 01:54:00,124 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-26 01:54:00,125 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 01:54:00,125 INFO L82 PathProgramCache]: Analyzing trace with hash -1345927737, now seen corresponding path program 1 times [2021-08-26 01:54:00,125 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 01:54:00,125 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1135455225] [2021-08-26 01:54:00,126 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 01:54:00,126 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 01:54:00,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 01:54:00,190 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:00,191 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 01:54:00,191 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1135455225] [2021-08-26 01:54:00,191 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1135455225] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-26 01:54:00,191 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-26 01:54:00,191 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-26 01:54:00,191 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1276649424] [2021-08-26 01:54:00,192 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-26 01:54:00,192 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 01:54:00,192 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-26 01:54:00,193 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-26 01:54:00,193 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:00,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 01:54:00,242 INFO L93 Difference]: Finished difference Result 81 states and 101 transitions. [2021-08-26 01:54:00,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-26 01:54:00,243 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:00,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 01:54:00,244 INFO L225 Difference]: With dead ends: 81 [2021-08-26 01:54:00,244 INFO L226 Difference]: Without dead ends: 68 [2021-08-26 01:54:00,244 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 17.6ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-26 01:54:00,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2021-08-26 01:54:00,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 47. [2021-08-26 01:54:00,247 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:00,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 62 transitions. [2021-08-26 01:54:00,248 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 62 transitions. Word has length 20 [2021-08-26 01:54:00,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 01:54:00,248 INFO L470 AbstractCegarLoop]: Abstraction has 47 states and 62 transitions. [2021-08-26 01:54:00,252 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:00,253 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 62 transitions. [2021-08-26 01:54:00,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-08-26 01:54:00,253 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 01:54:00,254 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:00,254 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-08-26 01:54:00,254 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-26 01:54:00,254 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 01:54:00,255 INFO L82 PathProgramCache]: Analyzing trace with hash -1380709804, now seen corresponding path program 1 times [2021-08-26 01:54:00,255 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 01:54:00,255 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1535069774] [2021-08-26 01:54:00,255 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 01:54:00,255 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 01:54:00,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 01:54:00,312 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:00,312 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 01:54:00,312 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1535069774] [2021-08-26 01:54:00,313 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1535069774] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-26 01:54:00,313 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-26 01:54:00,313 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-26 01:54:00,313 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1566056155] [2021-08-26 01:54:00,314 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-26 01:54:00,314 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 01:54:00,314 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-26 01:54:00,315 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-26 01:54:00,315 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:00,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 01:54:00,330 INFO L93 Difference]: Finished difference Result 50 states and 65 transitions. [2021-08-26 01:54:00,330 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-26 01:54:00,331 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:00,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 01:54:00,331 INFO L225 Difference]: With dead ends: 50 [2021-08-26 01:54:00,331 INFO L226 Difference]: Without dead ends: 48 [2021-08-26 01:54:00,332 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.7ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-26 01:54:00,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2021-08-26 01:54:00,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2021-08-26 01:54:00,335 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:00,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 63 transitions. [2021-08-26 01:54:00,335 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 63 transitions. Word has length 21 [2021-08-26 01:54:00,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 01:54:00,336 INFO L470 AbstractCegarLoop]: Abstraction has 48 states and 63 transitions. [2021-08-26 01:54:00,336 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:00,336 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 63 transitions. [2021-08-26 01:54:00,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-08-26 01:54:00,337 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 01:54:00,337 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:00,337 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-08-26 01:54:00,337 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-26 01:54:00,338 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 01:54:00,338 INFO L82 PathProgramCache]: Analyzing trace with hash 147544209, now seen corresponding path program 1 times [2021-08-26 01:54:00,338 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 01:54:00,338 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1537385030] [2021-08-26 01:54:00,338 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 01:54:00,339 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 01:54:00,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-26 01:54:00,371 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-26 01:54:00,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-26 01:54:00,411 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-26 01:54:00,411 INFO L626 BasicCegarLoop]: Counterexample is feasible [2021-08-26 01:54:00,412 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION [2021-08-26 01:54:00,414 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION [2021-08-26 01:54:00,414 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-08-26 01:54:00,419 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-08-26 01:54:00,457 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.08 01:54:00 BoogieIcfgContainer [2021-08-26 01:54:00,457 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-08-26 01:54:00,457 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-08-26 01:54:00,457 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-08-26 01:54:00,458 INFO L275 PluginConnector]: Witness Printer initialized [2021-08-26 01:54:00,458 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.08 01:53:59" (3/4) ... [2021-08-26 01:54:00,461 INFO L140 WitnessPrinter]: No result that supports witness generation found [2021-08-26 01:54:00,461 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-08-26 01:54:00,463 INFO L168 Benchmark]: Toolchain (without parser) took 2083.09 ms. Allocated memory was 65.0 MB in the beginning and 79.7 MB in the end (delta: 14.7 MB). Free memory was 45.0 MB in the beginning and 53.0 MB in the end (delta: -7.9 MB). Peak memory consumption was 5.7 MB. Max. memory is 16.1 GB. [2021-08-26 01:54:00,463 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 65.0 MB. Free memory was 45.5 MB in the beginning and 45.4 MB in the end (delta: 84.0 kB). There was no memory consumed. Max. memory is 16.1 GB. [2021-08-26 01:54:00,464 INFO L168 Benchmark]: CACSL2BoogieTranslator took 259.32 ms. Allocated memory is still 65.0 MB. Free memory was 44.9 MB in the beginning and 47.3 MB in the end (delta: -2.4 MB). Peak memory consumption was 10.5 MB. Max. memory is 16.1 GB. [2021-08-26 01:54:00,464 INFO L168 Benchmark]: Boogie Procedure Inliner took 51.27 ms. Allocated memory is still 65.0 MB. Free memory was 47.3 MB in the beginning and 45.1 MB in the end (delta: 2.2 MB). There was no memory consumed. Max. memory is 16.1 GB. [2021-08-26 01:54:00,464 INFO L168 Benchmark]: Boogie Preprocessor took 53.49 ms. Allocated memory is still 65.0 MB. Free memory was 45.1 MB in the beginning and 43.5 MB in the end (delta: 1.6 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-08-26 01:54:00,465 INFO L168 Benchmark]: RCFGBuilder took 565.84 ms. Allocated memory is still 65.0 MB. Free memory was 43.5 MB in the beginning and 39.2 MB in the end (delta: 4.3 MB). Peak memory consumption was 20.5 MB. Max. memory is 16.1 GB. [2021-08-26 01:54:00,465 INFO L168 Benchmark]: TraceAbstraction took 1141.61 ms. Allocated memory was 65.0 MB in the beginning and 79.7 MB in the end (delta: 14.7 MB). Free memory was 38.6 MB in the beginning and 53.2 MB in the end (delta: -14.6 MB). There was no memory consumed. Max. memory is 16.1 GB. [2021-08-26 01:54:00,466 INFO L168 Benchmark]: Witness Printer took 3.55 ms. Allocated memory is still 79.7 MB. Free memory was 53.2 MB in the beginning and 53.0 MB in the end (delta: 249.2 kB). There was no memory consumed. Max. memory is 16.1 GB. [2021-08-26 01:54:00,468 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 45.5 MB in the beginning and 45.4 MB in the end (delta: 84.0 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 259.32 ms. Allocated memory is still 65.0 MB. Free memory was 44.9 MB in the beginning and 47.3 MB in the end (delta: -2.4 MB). Peak memory consumption was 10.5 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 51.27 ms. Allocated memory is still 65.0 MB. Free memory was 47.3 MB in the beginning and 45.1 MB in the end (delta: 2.2 MB). There was no memory consumed. Max. memory is 16.1 GB. * Boogie Preprocessor took 53.49 ms. Allocated memory is still 65.0 MB. Free memory was 45.1 MB in the beginning and 43.5 MB in the end (delta: 1.6 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * RCFGBuilder took 565.84 ms. Allocated memory is still 65.0 MB. Free memory was 43.5 MB in the beginning and 39.2 MB in the end (delta: 4.3 MB). Peak memory consumption was 20.5 MB. Max. memory is 16.1 GB. * TraceAbstraction took 1141.61 ms. Allocated memory was 65.0 MB in the beginning and 79.7 MB in the end (delta: 14.7 MB). Free memory was 38.6 MB in the beginning and 53.2 MB in the end (delta: -14.6 MB). There was no memory consumed. Max. memory is 16.1 GB. * Witness Printer took 3.55 ms. Allocated memory is still 79.7 MB. Free memory was 53.2 MB in the beginning and 53.0 MB in the end (delta: 249.2 kB). There was no memory consumed. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0ms ErrorAutomatonConstructionTimeTotal, 0.0ms FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0ms ErrorAutomatonConstructionTimeAvg, 0.0ms ErrorAutomatonDifferenceTimeAvg, 0.0ms ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 77]: 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 76. Possible FailurePath: [L68] float x = __VERIFIER_nondet_float(); [L69] float y = __VERIFIER_nondet_float(); [L59] return x != x; [L70] EXPR isnan_float(x) && !isnan_float(y) [L59] return x != x; [L70] EXPR isnan_float(x) && !isnan_float(y) [L70-L71] (isnan_float(x) && !isnan_float(y)) || (!isnan_float(x) && isnan_float(y)) [L70-L71] COND TRUE (isnan_float(x) && !isnan_float(y)) || (!isnan_float(x) && isnan_float(y)) [L15] __uint32_t w; [L18] ieee_float_shape_type gf_u; [L19] gf_u.value = (x) [L20] EXPR gf_u.word [L20] (w) = gf_u.word [L23] COND FALSE !(w == 0x00000000 || w == 0x80000000) [L25-L26] COND FALSE !((w >= 0x00800000 && w <= 0x7f7fffff) || (w >= 0x80800000 && w <= 0xff7fffff)) [L28-L29] COND FALSE !((w >= 0x00000001 && w <= 0x007fffff) || (w >= 0x80000001 && w <= 0x807fffff)) [L31] COND FALSE !(w == 0x7f800000 || w == 0xff800000) [L34] return 0; [L38] COND TRUE __fpclassify_float(x) == 0 [L39] return y; [L73] float res = fmin_float(x, y); [L59] return x != x; [L76] EXPR isnan_float(x) && !isnan_float(y) [L59] return x != x; [L76] EXPR isnan_float(x) && !isnan_float(y) [L76] COND TRUE isnan_float(x) && !isnan_float(y) && res != y [L77] reach_error() - UnprovableResult [Line: 83]: 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: 1057.2ms, OverallIterations: 6, TraceHistogramMax: 1, EmptinessCheckTime: 12.3ms, AutomataDifference: 328.3ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 8.7ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 343 SDtfs, 79 SDslu, 503 SDs, 0 SdLazy, 88 SolverSat, 6 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 132.7ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 23 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 96.0ms 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: 50.6ms AutomataMinimizationTime, 5 MinimizatonAttempts, 62 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 24.0ms SsaConstructionTime, 137.1ms SatisfiabilityAnalysisTime, 308.6ms 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:00,503 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:02,340 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-08-26 01:54:02,345 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-08-26 01:54:02,384 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-08-26 01:54:02,385 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-08-26 01:54:02,388 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-08-26 01:54:02,390 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-08-26 01:54:02,394 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-08-26 01:54:02,396 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-08-26 01:54:02,400 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-08-26 01:54:02,401 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-08-26 01:54:02,405 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-08-26 01:54:02,405 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-08-26 01:54:02,407 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-08-26 01:54:02,409 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-08-26 01:54:02,412 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-08-26 01:54:02,412 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-08-26 01:54:02,413 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-08-26 01:54:02,415 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-08-26 01:54:02,421 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-08-26 01:54:02,422 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-08-26 01:54:02,424 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-08-26 01:54:02,426 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-08-26 01:54:02,427 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-08-26 01:54:02,433 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-08-26 01:54:02,434 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-08-26 01:54:02,434 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-08-26 01:54:02,436 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-08-26 01:54:02,436 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-08-26 01:54:02,437 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-08-26 01:54:02,437 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-08-26 01:54:02,438 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-08-26 01:54:02,438 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-08-26 01:54:02,439 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-08-26 01:54:02,440 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-08-26 01:54:02,440 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-08-26 01:54:02,441 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-08-26 01:54:02,441 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-08-26 01:54:02,441 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-08-26 01:54:02,442 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-08-26 01:54:02,443 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-08-26 01:54:02,444 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:02,480 INFO L113 SettingsManager]: Loading preferences was successful [2021-08-26 01:54:02,481 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-08-26 01:54:02,482 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-08-26 01:54:02,482 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-08-26 01:54:02,484 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-08-26 01:54:02,484 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-08-26 01:54:02,484 INFO L138 SettingsManager]: * Use SBE=true [2021-08-26 01:54:02,485 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-08-26 01:54:02,485 INFO L138 SettingsManager]: * sizeof long=4 [2021-08-26 01:54:02,485 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-08-26 01:54:02,486 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-08-26 01:54:02,486 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-08-26 01:54:02,486 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-08-26 01:54:02,486 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-08-26 01:54:02,486 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2021-08-26 01:54:02,487 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2021-08-26 01:54:02,487 INFO L138 SettingsManager]: * sizeof long double=12 [2021-08-26 01:54:02,487 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-08-26 01:54:02,487 INFO L138 SettingsManager]: * Use constant arrays=true [2021-08-26 01:54:02,487 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-08-26 01:54:02,488 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-08-26 01:54:02,493 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-08-26 01:54:02,494 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-08-26 01:54:02,494 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-08-26 01:54:02,494 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-08-26 01:54:02,494 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-08-26 01:54:02,495 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-08-26 01:54:02,495 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2021-08-26 01:54:02,495 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2021-08-26 01:54:02,495 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-08-26 01:54:02,495 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-08-26 01:54:02,496 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-08-26 01:54:02,496 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 -> 8039b1e35b9e459b273890fa707790cd9b2d1812 [2021-08-26 01:54:02,813 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-08-26 01:54:02,841 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-08-26 01:54:02,844 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-08-26 01:54:02,845 INFO L271 PluginConnector]: Initializing CDTParser... [2021-08-26 01:54:02,845 INFO L275 PluginConnector]: CDTParser initialized [2021-08-26 01:54:02,848 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/float-newlib/float_req_bl_1231.c [2021-08-26 01:54:02,913 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/058894dd9/eb0aa165164c4bcc8e4fc4ea29738800/FLAG5342c153d [2021-08-26 01:54:03,359 INFO L306 CDTParser]: Found 1 translation units. [2021-08-26 01:54:03,360 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/float_req_bl_1231.c [2021-08-26 01:54:03,366 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/058894dd9/eb0aa165164c4bcc8e4fc4ea29738800/FLAG5342c153d [2021-08-26 01:54:03,748 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/058894dd9/eb0aa165164c4bcc8e4fc4ea29738800 [2021-08-26 01:54:03,751 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-08-26 01:54:03,752 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-08-26 01:54:03,753 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-08-26 01:54:03,753 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-08-26 01:54:03,757 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-08-26 01:54:03,758 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.08 01:54:03" (1/1) ... [2021-08-26 01:54:03,759 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@59fb081a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 01:54:03, skipping insertion in model container [2021-08-26 01:54:03,759 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.08 01:54:03" (1/1) ... [2021-08-26 01:54:03,765 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-08-26 01:54:03,780 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-08-26 01:54:03,901 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_1231.c[1835,1848] [2021-08-26 01:54:03,904 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_1231.c[1994,2007] [2021-08-26 01:54:03,905 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-26 01:54:03,917 INFO L203 MainTranslator]: Completed pre-run [2021-08-26 01:54:03,942 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_1231.c[1835,1848] [2021-08-26 01:54:03,943 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_1231.c[1994,2007] [2021-08-26 01:54:03,944 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-26 01:54:04,003 INFO L208 MainTranslator]: Completed translation [2021-08-26 01:54:04,004 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 01:54:04 WrapperNode [2021-08-26 01:54:04,005 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-08-26 01:54:04,006 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-08-26 01:54:04,006 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-08-26 01:54:04,006 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-08-26 01:54:04,012 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:04" (1/1) ... [2021-08-26 01:54:04,031 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:04" (1/1) ... [2021-08-26 01:54:04,062 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-08-26 01:54:04,063 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-08-26 01:54:04,063 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-08-26 01:54:04,063 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-08-26 01:54:04,069 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:04" (1/1) ... [2021-08-26 01:54:04,070 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:04" (1/1) ... [2021-08-26 01:54:04,085 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:04" (1/1) ... [2021-08-26 01:54:04,085 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:04" (1/1) ... [2021-08-26 01:54:04,097 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:04" (1/1) ... [2021-08-26 01:54:04,112 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:04" (1/1) ... [2021-08-26 01:54:04,116 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:04" (1/1) ... [2021-08-26 01:54:04,122 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-08-26 01:54:04,126 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-08-26 01:54:04,127 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-08-26 01:54:04,128 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-08-26 01:54:04,129 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 01:54:04" (1/1) ... [2021-08-26 01:54:04,135 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-08-26 01:54:04,140 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-26 01:54:04,162 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:04,183 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:04,202 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2021-08-26 01:54:04,202 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-08-26 01:54:04,202 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2021-08-26 01:54:04,203 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-08-26 01:54:04,203 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-08-26 01:54:04,203 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4 [2021-08-26 01:54:04,203 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-08-26 01:54:04,646 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-08-26 01:54:04,646 INFO L299 CfgBuilder]: Removed 30 assume(true) statements. [2021-08-26 01:54:04,647 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.08 01:54:04 BoogieIcfgContainer [2021-08-26 01:54:04,647 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-08-26 01:54:04,649 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-08-26 01:54:04,649 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-08-26 01:54:04,651 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-08-26 01:54:04,651 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.08 01:54:03" (1/3) ... [2021-08-26 01:54:04,652 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6561a800 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.08 01:54:04, skipping insertion in model container [2021-08-26 01:54:04,652 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 01:54:04" (2/3) ... [2021-08-26 01:54:04,652 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6561a800 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.08 01:54:04, skipping insertion in model container [2021-08-26 01:54:04,653 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.08 01:54:04" (3/3) ... [2021-08-26 01:54:04,654 INFO L111 eAbstractionObserver]: Analyzing ICFG float_req_bl_1231.c [2021-08-26 01:54:04,658 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-08-26 01:54:04,658 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2021-08-26 01:54:04,699 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-08-26 01:54:04,704 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2021-08-26 01:54:04,705 INFO L340 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2021-08-26 01:54:04,716 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:04,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-08-26 01:54:04,720 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 01:54:04,721 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:04,722 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-26 01:54:04,726 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 01:54:04,726 INFO L82 PathProgramCache]: Analyzing trace with hash 1204154757, now seen corresponding path program 1 times [2021-08-26 01:54:04,736 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-26 01:54:04,736 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2054962159] [2021-08-26 01:54:04,737 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 01:54:04,737 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-26 01:54:04,738 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-26 01:54:04,740 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:04,757 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:04,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 01:54:04,905 INFO L263 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 1 conjunts are in the unsatisfiable core [2021-08-26 01:54:04,910 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-26 01:54:05,043 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:05,043 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-26 01:54:05,134 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:05,135 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-26 01:54:05,135 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2054962159] [2021-08-26 01:54:05,136 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2054962159] provided 2 perfect and 0 imperfect interpolant sequences [2021-08-26 01:54:05,136 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-08-26 01:54:05,136 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2021-08-26 01:54:05,138 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2030590648] [2021-08-26 01:54:05,142 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2021-08-26 01:54:05,142 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-26 01:54:05,151 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-08-26 01:54:05,151 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-08-26 01:54:05,153 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:05,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 01:54:05,167 INFO L93 Difference]: Finished difference Result 82 states and 122 transitions. [2021-08-26 01:54:05,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-08-26 01:54:05,168 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:05,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 01:54:05,175 INFO L225 Difference]: With dead ends: 82 [2021-08-26 01:54:05,175 INFO L226 Difference]: Without dead ends: 43 [2021-08-26 01:54:05,178 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:05,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2021-08-26 01:54:05,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2021-08-26 01:54:05,202 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:05,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 58 transitions. [2021-08-26 01:54:05,204 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 58 transitions. Word has length 16 [2021-08-26 01:54:05,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 01:54:05,205 INFO L470 AbstractCegarLoop]: Abstraction has 43 states and 58 transitions. [2021-08-26 01:54:05,205 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:05,205 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 58 transitions. [2021-08-26 01:54:05,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-08-26 01:54:05,206 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 01:54:05,206 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:05,241 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:05,416 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:05,417 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-26 01:54:05,418 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 01:54:05,418 INFO L82 PathProgramCache]: Analyzing trace with hash 1262247077, now seen corresponding path program 1 times [2021-08-26 01:54:05,418 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-26 01:54:05,418 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1741021365] [2021-08-26 01:54:05,419 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 01:54:05,419 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-26 01:54:05,419 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-26 01:54:05,420 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:05,423 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:05,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 01:54:05,562 INFO L263 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 3 conjunts are in the unsatisfiable core [2021-08-26 01:54:05,563 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-26 01:54:05,677 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:05,677 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-26 01:54:05,793 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:05,794 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-26 01:54:05,794 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1741021365] [2021-08-26 01:54:05,795 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1741021365] provided 2 perfect and 0 imperfect interpolant sequences [2021-08-26 01:54:05,796 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-08-26 01:54:05,796 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 4 [2021-08-26 01:54:05,796 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1306418819] [2021-08-26 01:54:05,798 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-26 01:54:05,798 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-26 01:54:05,799 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-26 01:54:05,799 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-26 01:54:05,801 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:05,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 01:54:05,868 INFO L93 Difference]: Finished difference Result 82 states and 111 transitions. [2021-08-26 01:54:05,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-08-26 01:54:05,869 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:05,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 01:54:05,870 INFO L225 Difference]: With dead ends: 82 [2021-08-26 01:54:05,870 INFO L226 Difference]: Without dead ends: 50 [2021-08-26 01:54:05,871 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 20.5ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-26 01:54:05,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2021-08-26 01:54:05,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 45. [2021-08-26 01:54:05,876 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:05,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 60 transitions. [2021-08-26 01:54:05,877 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 60 transitions. Word has length 17 [2021-08-26 01:54:05,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 01:54:05,878 INFO L470 AbstractCegarLoop]: Abstraction has 45 states and 60 transitions. [2021-08-26 01:54:05,878 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:05,878 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 60 transitions. [2021-08-26 01:54:05,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-08-26 01:54:05,879 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 01:54:05,879 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:05,892 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:06,089 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:06,089 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-26 01:54:06,090 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 01:54:06,090 INFO L82 PathProgramCache]: Analyzing trace with hash 44236684, now seen corresponding path program 1 times [2021-08-26 01:54:06,091 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-26 01:54:06,091 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1170569810] [2021-08-26 01:54:06,091 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 01:54:06,091 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-26 01:54:06,092 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-26 01:54:06,092 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:06,093 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:06,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 01:54:06,224 INFO L263 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 3 conjunts are in the unsatisfiable core [2021-08-26 01:54:06,225 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-26 01:54:06,308 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:06,308 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-26 01:54:06,371 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:06,372 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-26 01:54:06,372 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1170569810] [2021-08-26 01:54:06,372 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1170569810] provided 2 perfect and 0 imperfect interpolant sequences [2021-08-26 01:54:06,372 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-08-26 01:54:06,372 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2021-08-26 01:54:06,373 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1618156019] [2021-08-26 01:54:06,373 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-08-26 01:54:06,373 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-26 01:54:06,374 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-08-26 01:54:06,374 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-08-26 01:54:06,375 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:06,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 01:54:06,435 INFO L93 Difference]: Finished difference Result 96 states and 120 transitions. [2021-08-26 01:54:06,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-08-26 01:54:06,436 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:06,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 01:54:06,437 INFO L225 Difference]: With dead ends: 96 [2021-08-26 01:54:06,437 INFO L226 Difference]: Without dead ends: 83 [2021-08-26 01:54:06,438 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 30.1ms TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-08-26 01:54:06,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2021-08-26 01:54:06,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 47. [2021-08-26 01:54:06,449 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:06,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 62 transitions. [2021-08-26 01:54:06,450 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 62 transitions. Word has length 18 [2021-08-26 01:54:06,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 01:54:06,450 INFO L470 AbstractCegarLoop]: Abstraction has 47 states and 62 transitions. [2021-08-26 01:54:06,450 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:06,451 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 62 transitions. [2021-08-26 01:54:06,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-08-26 01:54:06,451 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 01:54:06,451 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:06,464 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:06,662 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:06,663 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-26 01:54:06,664 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 01:54:06,664 INFO L82 PathProgramCache]: Analyzing trace with hash -1380709804, now seen corresponding path program 1 times [2021-08-26 01:54:06,665 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-26 01:54:06,665 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [450606801] [2021-08-26 01:54:06,665 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 01:54:06,665 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-26 01:54:06,665 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-26 01:54:06,666 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:06,691 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:06,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 01:54:06,771 INFO L263 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 12 conjunts are in the unsatisfiable core [2021-08-26 01:54:06,773 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-26 01:54:07,050 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:07,051 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-26 01:54:07,192 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:07,192 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-26 01:54:07,192 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [450606801] [2021-08-26 01:54:07,193 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [450606801] provided 2 perfect and 0 imperfect interpolant sequences [2021-08-26 01:54:07,193 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-08-26 01:54:07,193 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7, 7] imperfect sequences [] total 10 [2021-08-26 01:54:07,193 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1417891753] [2021-08-26 01:54:07,194 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-08-26 01:54:07,194 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-26 01:54:07,194 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-08-26 01:54:07,195 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2021-08-26 01:54:07,195 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:07,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 01:54:07,570 INFO L93 Difference]: Finished difference Result 149 states and 197 transitions. [2021-08-26 01:54:07,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-08-26 01:54:07,571 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:07,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 01:54:07,573 INFO L225 Difference]: With dead ends: 149 [2021-08-26 01:54:07,573 INFO L226 Difference]: Without dead ends: 140 [2021-08-26 01:54:07,573 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 185.0ms TimeCoverageRelationStatistics Valid=59, Invalid=151, Unknown=0, NotChecked=0, Total=210 [2021-08-26 01:54:07,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2021-08-26 01:54:07,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 75. [2021-08-26 01:54:07,581 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:07,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 102 transitions. [2021-08-26 01:54:07,582 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 102 transitions. Word has length 21 [2021-08-26 01:54:07,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 01:54:07,582 INFO L470 AbstractCegarLoop]: Abstraction has 75 states and 102 transitions. [2021-08-26 01:54:07,583 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:07,583 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 102 transitions. [2021-08-26 01:54:07,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-08-26 01:54:07,584 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 01:54:07,584 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:07,595 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:07,794 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:07,795 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-26 01:54:07,795 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 01:54:07,795 INFO L82 PathProgramCache]: Analyzing trace with hash 147544209, now seen corresponding path program 1 times [2021-08-26 01:54:07,795 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-26 01:54:07,796 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1697919704] [2021-08-26 01:54:07,796 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 01:54:07,796 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-26 01:54:07,796 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-26 01:54:07,797 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:07,798 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:07,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 01:54:07,918 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 12 conjunts are in the unsatisfiable core [2021-08-26 01:54:07,920 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-26 01:54:08,468 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:08,469 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-26 01:54:08,667 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:08,668 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-26 01:54:08,668 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1697919704] [2021-08-26 01:54:08,668 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1697919704] provided 2 perfect and 0 imperfect interpolant sequences [2021-08-26 01:54:08,668 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-08-26 01:54:08,670 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9, 9] imperfect sequences [] total 15 [2021-08-26 01:54:08,671 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1059597328] [2021-08-26 01:54:08,671 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2021-08-26 01:54:08,672 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-26 01:54:08,673 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-08-26 01:54:08,673 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=150, Unknown=0, NotChecked=0, Total=210 [2021-08-26 01:54:08,673 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:09,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 01:54:09,524 INFO L93 Difference]: Finished difference Result 180 states and 237 transitions. [2021-08-26 01:54:09,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-08-26 01:54:09,526 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:09,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 01:54:09,528 INFO L225 Difference]: With dead ends: 180 [2021-08-26 01:54:09,528 INFO L226 Difference]: Without dead ends: 178 [2021-08-26 01:54:09,528 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 128 ImplicationChecksByTransitivity, 544.5ms TimeCoverageRelationStatistics Valid=185, Invalid=465, Unknown=0, NotChecked=0, Total=650 [2021-08-26 01:54:09,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2021-08-26 01:54:09,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 89. [2021-08-26 01:54:09,537 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:09,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 121 transitions. [2021-08-26 01:54:09,538 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 121 transitions. Word has length 22 [2021-08-26 01:54:09,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 01:54:09,539 INFO L470 AbstractCegarLoop]: Abstraction has 89 states and 121 transitions. [2021-08-26 01:54:09,539 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:09,539 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 121 transitions. [2021-08-26 01:54:09,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-08-26 01:54:09,540 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 01:54:09,540 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:09,556 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:09,755 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:09,756 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-26 01:54:09,756 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 01:54:09,756 INFO L82 PathProgramCache]: Analyzing trace with hash -1845695531, now seen corresponding path program 1 times [2021-08-26 01:54:09,756 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-26 01:54:09,756 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1940762420] [2021-08-26 01:54:09,756 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 01:54:09,757 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-26 01:54:09,757 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-26 01:54:09,758 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:09,760 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:09,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 01:54:09,897 INFO L263 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 12 conjunts are in the unsatisfiable core [2021-08-26 01:54:09,898 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-26 01:54:10,052 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-26 01:54:10,052 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-26 01:54:10,158 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:10,159 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-26 01:54:10,159 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1940762420] [2021-08-26 01:54:10,159 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1940762420] provided 2 perfect and 0 imperfect interpolant sequences [2021-08-26 01:54:10,159 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-08-26 01:54:10,159 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7, 7] imperfect sequences [] total 9 [2021-08-26 01:54:10,159 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2131880959] [2021-08-26 01:54:10,160 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-08-26 01:54:10,160 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-26 01:54:10,160 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-08-26 01:54:10,161 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2021-08-26 01:54:10,161 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:10,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 01:54:10,669 INFO L93 Difference]: Finished difference Result 166 states and 219 transitions. [2021-08-26 01:54:10,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-08-26 01:54:10,670 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:10,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 01:54:10,670 INFO L225 Difference]: With dead ends: 166 [2021-08-26 01:54:10,670 INFO L226 Difference]: Without dead ends: 131 [2021-08-26 01:54:10,671 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 195.2ms TimeCoverageRelationStatistics Valid=71, Invalid=139, Unknown=0, NotChecked=0, Total=210 [2021-08-26 01:54:10,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2021-08-26 01:54:10,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 89. [2021-08-26 01:54:10,678 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:10,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 120 transitions. [2021-08-26 01:54:10,679 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 120 transitions. Word has length 23 [2021-08-26 01:54:10,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 01:54:10,680 INFO L470 AbstractCegarLoop]: Abstraction has 89 states and 120 transitions. [2021-08-26 01:54:10,680 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:10,680 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 120 transitions. [2021-08-26 01:54:10,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-08-26 01:54:10,682 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 01:54:10,682 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:10,697 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Ended with exit code 0 [2021-08-26 01:54:10,891 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:10,892 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-26 01:54:10,892 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 01:54:10,892 INFO L82 PathProgramCache]: Analyzing trace with hash 156888005, now seen corresponding path program 1 times [2021-08-26 01:54:10,893 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-26 01:54:10,893 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1124931810] [2021-08-26 01:54:10,893 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 01:54:10,893 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-26 01:54:10,893 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-26 01:54:10,894 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:10,913 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:11,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 01:54:11,063 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 3 conjunts are in the unsatisfiable core [2021-08-26 01:54:11,064 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-26 01:54:11,136 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,136 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-26 01:54:11,199 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,199 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-26 01:54:11,200 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1124931810] [2021-08-26 01:54:11,200 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1124931810] provided 2 perfect and 0 imperfect interpolant sequences [2021-08-26 01:54:11,200 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-08-26 01:54:11,200 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2021-08-26 01:54:11,200 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2126611922] [2021-08-26 01:54:11,201 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-08-26 01:54:11,201 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-26 01:54:11,201 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-08-26 01:54:11,202 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-08-26 01:54:11,202 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:11,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 01:54:11,261 INFO L93 Difference]: Finished difference Result 157 states and 199 transitions. [2021-08-26 01:54:11,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-08-26 01:54:11,262 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:11,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 01:54:11,263 INFO L225 Difference]: With dead ends: 157 [2021-08-26 01:54:11,263 INFO L226 Difference]: Without dead ends: 141 [2021-08-26 01:54:11,264 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 26.3ms TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-08-26 01:54:11,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2021-08-26 01:54:11,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 93. [2021-08-26 01:54:11,271 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:11,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 124 transitions. [2021-08-26 01:54:11,272 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 124 transitions. Word has length 24 [2021-08-26 01:54:11,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 01:54:11,272 INFO L470 AbstractCegarLoop]: Abstraction has 93 states and 124 transitions. [2021-08-26 01:54:11,272 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:11,272 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 124 transitions. [2021-08-26 01:54:11,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-08-26 01:54:11,273 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 01:54:11,273 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:11,294 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:11,496 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:11,499 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-26 01:54:11,499 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 01:54:11,499 INFO L82 PathProgramCache]: Analyzing trace with hash -1621213116, now seen corresponding path program 1 times [2021-08-26 01:54:11,500 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-26 01:54:11,500 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [99597680] [2021-08-26 01:54:11,500 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 01:54:11,500 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-26 01:54:11,500 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-26 01:54:11,501 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:11,501 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:11,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 01:54:11,653 INFO L263 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 2 conjunts are in the unsatisfiable core [2021-08-26 01:54:11,654 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-26 01:54:11,714 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,714 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-26 01:54:11,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:11,759 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-26 01:54:11,759 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [99597680] [2021-08-26 01:54:11,759 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [99597680] provided 2 perfect and 0 imperfect interpolant sequences [2021-08-26 01:54:11,760 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-08-26 01:54:11,760 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2021-08-26 01:54:11,760 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1149805197] [2021-08-26 01:54:11,760 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-26 01:54:11,760 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-26 01:54:11,761 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-26 01:54:11,761 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-26 01:54:11,761 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:11,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 01:54:11,789 INFO L93 Difference]: Finished difference Result 96 states and 127 transitions. [2021-08-26 01:54:11,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-26 01:54:11,790 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:11,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 01:54:11,791 INFO L225 Difference]: With dead ends: 96 [2021-08-26 01:54:11,791 INFO L226 Difference]: Without dead ends: 94 [2021-08-26 01:54:11,791 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:11,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2021-08-26 01:54:11,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 93. [2021-08-26 01:54:11,797 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:11,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 124 transitions. [2021-08-26 01:54:11,798 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 124 transitions. Word has length 24 [2021-08-26 01:54:11,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 01:54:11,798 INFO L470 AbstractCegarLoop]: Abstraction has 93 states and 124 transitions. [2021-08-26 01:54:11,799 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:11,799 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 124 transitions. [2021-08-26 01:54:11,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-08-26 01:54:11,799 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 01:54:11,800 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:11,813 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:12,013 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:12,014 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-26 01:54:12,014 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 01:54:12,014 INFO L82 PathProgramCache]: Analyzing trace with hash 1741974657, now seen corresponding path program 1 times [2021-08-26 01:54:12,015 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-26 01:54:12,015 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1057249771] [2021-08-26 01:54:12,016 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 01:54:12,016 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-26 01:54:12,016 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-26 01:54:12,017 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:12,018 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:12,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 01:54:12,180 INFO L263 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 12 conjunts are in the unsatisfiable core [2021-08-26 01:54:12,181 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-26 01:54:12,360 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:12,360 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-26 01:54:12,488 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:12,488 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-26 01:54:12,488 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1057249771] [2021-08-26 01:54:12,489 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1057249771] provided 2 perfect and 0 imperfect interpolant sequences [2021-08-26 01:54:12,489 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-08-26 01:54:12,489 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7, 7] imperfect sequences [] total 10 [2021-08-26 01:54:12,489 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1625629531] [2021-08-26 01:54:12,489 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-08-26 01:54:12,490 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-26 01:54:12,490 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-08-26 01:54:12,490 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2021-08-26 01:54:12,490 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:12,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 01:54:12,769 INFO L93 Difference]: Finished difference Result 131 states and 173 transitions. [2021-08-26 01:54:12,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-08-26 01:54:12,770 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:12,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 01:54:12,770 INFO L225 Difference]: With dead ends: 131 [2021-08-26 01:54:12,770 INFO L226 Difference]: Without dead ends: 118 [2021-08-26 01:54:12,771 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 161.7ms TimeCoverageRelationStatistics Valid=58, Invalid=152, Unknown=0, NotChecked=0, Total=210 [2021-08-26 01:54:12,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2021-08-26 01:54:12,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 89. [2021-08-26 01:54:12,776 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:12,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 118 transitions. [2021-08-26 01:54:12,776 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 118 transitions. Word has length 25 [2021-08-26 01:54:12,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 01:54:12,776 INFO L470 AbstractCegarLoop]: Abstraction has 89 states and 118 transitions. [2021-08-26 01:54:12,777 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:12,777 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 118 transitions. [2021-08-26 01:54:12,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-08-26 01:54:12,777 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 01:54:12,778 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:12,792 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:12,988 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:12,988 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-26 01:54:12,989 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 01:54:12,989 INFO L82 PathProgramCache]: Analyzing trace with hash 839729769, now seen corresponding path program 1 times [2021-08-26 01:54:12,989 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-26 01:54:12,989 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1349849621] [2021-08-26 01:54:12,989 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 01:54:12,989 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-26 01:54:12,990 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-26 01:54:12,991 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:12,993 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:13,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 01:54:13,199 INFO L263 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 13 conjunts are in the unsatisfiable core [2021-08-26 01:54:13,200 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-26 01:54:13,365 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:13,365 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-26 01:54:13,488 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:13,489 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-26 01:54:13,489 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1349849621] [2021-08-26 01:54:13,489 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1349849621] provided 2 perfect and 0 imperfect interpolant sequences [2021-08-26 01:54:13,489 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-08-26 01:54:13,489 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8, 8] imperfect sequences [] total 11 [2021-08-26 01:54:13,489 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1767475651] [2021-08-26 01:54:13,490 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-08-26 01:54:13,491 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-26 01:54:13,491 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-08-26 01:54:13,493 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2021-08-26 01:54:13,493 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:13,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 01:54:13,899 INFO L93 Difference]: Finished difference Result 114 states and 147 transitions. [2021-08-26 01:54:13,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-08-26 01:54:13,899 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:13,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 01:54:13,900 INFO L225 Difference]: With dead ends: 114 [2021-08-26 01:54:13,900 INFO L226 Difference]: Without dead ends: 78 [2021-08-26 01:54:13,900 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 237.1ms TimeCoverageRelationStatistics Valid=80, Invalid=226, Unknown=0, NotChecked=0, Total=306 [2021-08-26 01:54:13,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2021-08-26 01:54:13,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 76. [2021-08-26 01:54:13,903 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:13,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 98 transitions. [2021-08-26 01:54:13,904 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 98 transitions. Word has length 25 [2021-08-26 01:54:13,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 01:54:13,904 INFO L470 AbstractCegarLoop]: Abstraction has 76 states and 98 transitions. [2021-08-26 01:54:13,904 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:13,904 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 98 transitions. [2021-08-26 01:54:13,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-08-26 01:54:13,904 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 01:54:13,905 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:13,915 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:14,114 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:14,115 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-26 01:54:14,115 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 01:54:14,115 INFO L82 PathProgramCache]: Analyzing trace with hash 1281876129, now seen corresponding path program 1 times [2021-08-26 01:54:14,115 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-26 01:54:14,115 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [984209732] [2021-08-26 01:54:14,116 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 01:54:14,116 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-26 01:54:14,116 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-26 01:54:14,116 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:14,117 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:14,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 01:54:14,322 INFO L263 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 12 conjunts are in the unsatisfiable core [2021-08-26 01:54:14,324 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-26 01:54:14,497 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:14,497 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-26 01:54:14,625 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:14,626 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-26 01:54:14,626 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [984209732] [2021-08-26 01:54:14,626 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [984209732] provided 2 perfect and 0 imperfect interpolant sequences [2021-08-26 01:54:14,626 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-08-26 01:54:14,626 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7, 7] imperfect sequences [] total 9 [2021-08-26 01:54:14,626 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1706586670] [2021-08-26 01:54:14,627 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-08-26 01:54:14,627 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-26 01:54:14,627 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-08-26 01:54:14,628 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2021-08-26 01:54:14,628 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:14,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 01:54:14,843 INFO L93 Difference]: Finished difference Result 84 states and 104 transitions. [2021-08-26 01:54:14,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-08-26 01:54:14,844 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:14,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 01:54:14,845 INFO L225 Difference]: With dead ends: 84 [2021-08-26 01:54:14,845 INFO L226 Difference]: Without dead ends: 74 [2021-08-26 01:54:14,845 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 175.5ms TimeCoverageRelationStatistics Valid=58, Invalid=124, Unknown=0, NotChecked=0, Total=182 [2021-08-26 01:54:14,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2021-08-26 01:54:14,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2021-08-26 01:54:14,849 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:14,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 94 transitions. [2021-08-26 01:54:14,849 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 94 transitions. Word has length 25 [2021-08-26 01:54:14,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 01:54:14,850 INFO L470 AbstractCegarLoop]: Abstraction has 74 states and 94 transitions. [2021-08-26 01:54:14,850 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:14,850 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 94 transitions. [2021-08-26 01:54:14,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2021-08-26 01:54:14,850 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 01:54:14,851 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:14,865 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:15,061 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:15,062 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-26 01:54:15,062 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 01:54:15,062 INFO L82 PathProgramCache]: Analyzing trace with hash -144403189, now seen corresponding path program 1 times [2021-08-26 01:54:15,062 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-26 01:54:15,062 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1780960178] [2021-08-26 01:54:15,063 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 01:54:15,063 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-26 01:54:15,063 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-26 01:54:15,063 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:15,065 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:15,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 01:54:15,289 INFO L263 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 9 conjunts are in the unsatisfiable core [2021-08-26 01:54:15,290 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-26 01:54:15,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:15,471 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-26 01:54:15,831 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:15,832 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-26 01:54:15,832 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1780960178] [2021-08-26 01:54:15,832 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1780960178] provided 2 perfect and 0 imperfect interpolant sequences [2021-08-26 01:54:15,832 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-08-26 01:54:15,832 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [] total 10 [2021-08-26 01:54:15,832 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [611225939] [2021-08-26 01:54:15,833 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-08-26 01:54:15,833 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-26 01:54:15,833 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-08-26 01:54:15,834 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2021-08-26 01:54:15,834 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:16,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 01:54:16,102 INFO L93 Difference]: Finished difference Result 82 states and 101 transitions. [2021-08-26 01:54:16,102 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-08-26 01:54:16,103 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:16,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 01:54:16,103 INFO L225 Difference]: With dead ends: 82 [2021-08-26 01:54:16,103 INFO L226 Difference]: Without dead ends: 74 [2021-08-26 01:54:16,104 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 293.9ms TimeCoverageRelationStatistics Valid=56, Invalid=126, Unknown=0, NotChecked=0, Total=182 [2021-08-26 01:54:16,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2021-08-26 01:54:16,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2021-08-26 01:54:16,107 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:16,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 93 transitions. [2021-08-26 01:54:16,107 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 93 transitions. Word has length 26 [2021-08-26 01:54:16,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 01:54:16,107 INFO L470 AbstractCegarLoop]: Abstraction has 74 states and 93 transitions. [2021-08-26 01:54:16,107 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:16,108 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 93 transitions. [2021-08-26 01:54:16,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2021-08-26 01:54:16,108 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 01:54:16,108 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:16,127 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:16,325 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:16,325 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-26 01:54:16,325 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 01:54:16,326 INFO L82 PathProgramCache]: Analyzing trace with hash -953749815, now seen corresponding path program 1 times [2021-08-26 01:54:16,326 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-26 01:54:16,326 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [479299279] [2021-08-26 01:54:16,326 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 01:54:16,326 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-26 01:54:16,326 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-26 01:54:16,327 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:16,336 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:16,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 01:54:16,586 INFO L263 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 12 conjunts are in the unsatisfiable core [2021-08-26 01:54:16,588 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-26 01:54:17,087 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,087 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-26 01:54:17,442 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,442 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-26 01:54:17,443 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [479299279] [2021-08-26 01:54:17,443 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [479299279] provided 2 perfect and 0 imperfect interpolant sequences [2021-08-26 01:54:17,443 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-08-26 01:54:17,444 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9, 9] imperfect sequences [] total 16 [2021-08-26 01:54:17,444 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1987196390] [2021-08-26 01:54:17,444 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2021-08-26 01:54:17,445 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-26 01:54:17,445 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-08-26 01:54:17,445 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=190, Unknown=0, NotChecked=0, Total=240 [2021-08-26 01:54:17,446 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:18,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 01:54:18,639 INFO L93 Difference]: Finished difference Result 154 states and 169 transitions. [2021-08-26 01:54:18,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-08-26 01:54:18,639 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:18,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 01:54:18,640 INFO L225 Difference]: With dead ends: 154 [2021-08-26 01:54:18,640 INFO L226 Difference]: Without dead ends: 134 [2021-08-26 01:54:18,641 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 806.7ms TimeCoverageRelationStatistics Valid=186, Invalid=464, Unknown=0, NotChecked=0, Total=650 [2021-08-26 01:54:18,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2021-08-26 01:54:18,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 72. [2021-08-26 01:54:18,645 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:18,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 87 transitions. [2021-08-26 01:54:18,646 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 87 transitions. Word has length 26 [2021-08-26 01:54:18,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 01:54:18,646 INFO L470 AbstractCegarLoop]: Abstraction has 72 states and 87 transitions. [2021-08-26 01:54:18,646 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:18,646 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 87 transitions. [2021-08-26 01:54:18,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-08-26 01:54:18,646 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 01:54:18,647 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:18,660 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:18,857 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:18,858 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-26 01:54:18,858 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 01:54:18,858 INFO L82 PathProgramCache]: Analyzing trace with hash -1548503636, now seen corresponding path program 1 times [2021-08-26 01:54:18,858 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-26 01:54:18,858 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1771328765] [2021-08-26 01:54:18,858 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 01:54:18,859 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-26 01:54:18,859 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-26 01:54:18,859 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:18,861 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:19,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 01:54:19,151 INFO L263 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 22 conjunts are in the unsatisfiable core [2021-08-26 01:54:19,152 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-26 01:54:19,596 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:19,597 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-26 01:54:19,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:19,906 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-26 01:54:19,907 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1771328765] [2021-08-26 01:54:19,907 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1771328765] provided 2 perfect and 0 imperfect interpolant sequences [2021-08-26 01:54:19,907 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-08-26 01:54:19,907 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12, 12] imperfect sequences [] total 15 [2021-08-26 01:54:19,907 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1909362504] [2021-08-26 01:54:19,907 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2021-08-26 01:54:19,908 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-26 01:54:19,908 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-08-26 01:54:19,908 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2021-08-26 01:54:19,909 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:21,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 01:54:21,538 INFO L93 Difference]: Finished difference Result 195 states and 205 transitions. [2021-08-26 01:54:21,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2021-08-26 01:54:21,539 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:21,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 01:54:21,540 INFO L225 Difference]: With dead ends: 195 [2021-08-26 01:54:21,540 INFO L226 Difference]: Without dead ends: 158 [2021-08-26 01:54:21,541 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 36 SyntacticMatches, 3 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 439 ImplicationChecksByTransitivity, 1314.8ms TimeCoverageRelationStatistics Valid=455, Invalid=1437, Unknown=0, NotChecked=0, Total=1892 [2021-08-26 01:54:21,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2021-08-26 01:54:21,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 43. [2021-08-26 01:54:21,544 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:21,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 53 transitions. [2021-08-26 01:54:21,544 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 53 transitions. Word has length 27 [2021-08-26 01:54:21,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 01:54:21,546 INFO L470 AbstractCegarLoop]: Abstraction has 43 states and 53 transitions. [2021-08-26 01:54:21,546 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:21,546 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 53 transitions. [2021-08-26 01:54:21,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2021-08-26 01:54:21,547 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 01:54:21,547 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:21,558 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:21,758 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:21,758 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-26 01:54:21,758 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 01:54:21,759 INFO L82 PathProgramCache]: Analyzing trace with hash 1364791880, now seen corresponding path program 1 times [2021-08-26 01:54:21,759 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-26 01:54:21,759 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2021419585] [2021-08-26 01:54:21,759 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 01:54:21,759 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-26 01:54:21,759 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-26 01:54:21,761 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:21,764 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:22,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 01:54:22,084 INFO L263 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 21 conjunts are in the unsatisfiable core [2021-08-26 01:54:22,086 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-26 01:54:22,410 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,410 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-26 01:54:22,689 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,689 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-26 01:54:22,689 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2021419585] [2021-08-26 01:54:22,689 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2021419585] provided 2 perfect and 0 imperfect interpolant sequences [2021-08-26 01:54:22,690 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-08-26 01:54:22,690 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10, 10] imperfect sequences [] total 12 [2021-08-26 01:54:22,691 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2118771855] [2021-08-26 01:54:22,691 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-08-26 01:54:22,692 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-26 01:54:22,692 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-08-26 01:54:22,692 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2021-08-26 01:54:22,692 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:23,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 01:54:23,480 INFO L93 Difference]: Finished difference Result 125 states and 140 transitions. [2021-08-26 01:54:23,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2021-08-26 01:54:23,481 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:23,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 01:54:23,482 INFO L225 Difference]: With dead ends: 125 [2021-08-26 01:54:23,482 INFO L226 Difference]: Without dead ends: 101 [2021-08-26 01:54:23,483 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 41 SyntacticMatches, 3 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 142 ImplicationChecksByTransitivity, 652.9ms TimeCoverageRelationStatistics Valid=209, Invalid=603, Unknown=0, NotChecked=0, Total=812 [2021-08-26 01:54:23,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2021-08-26 01:54:23,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 41. [2021-08-26 01:54:23,486 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:23,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 49 transitions. [2021-08-26 01:54:23,487 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 49 transitions. Word has length 28 [2021-08-26 01:54:23,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 01:54:23,487 INFO L470 AbstractCegarLoop]: Abstraction has 41 states and 49 transitions. [2021-08-26 01:54:23,487 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:23,487 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 49 transitions. [2021-08-26 01:54:23,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-08-26 01:54:23,488 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 01:54:23,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:23,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:23,699 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:23,699 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-26 01:54:23,699 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 01:54:23,700 INFO L82 PathProgramCache]: Analyzing trace with hash 430789518, now seen corresponding path program 1 times [2021-08-26 01:54:23,700 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-26 01:54:23,700 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1208393373] [2021-08-26 01:54:23,700 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 01:54:23,700 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-26 01:54:23,700 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-26 01:54:23,701 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:23,702 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:24,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 01:54:24,049 INFO L263 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 10 conjunts are in the unsatisfiable core [2021-08-26 01:54:24,050 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-26 01:54:24,266 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,266 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-26 01:54:24,626 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,626 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-26 01:54:24,627 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1208393373] [2021-08-26 01:54:24,627 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1208393373] provided 2 perfect and 0 imperfect interpolant sequences [2021-08-26 01:54:24,627 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-08-26 01:54:24,627 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [] total 10 [2021-08-26 01:54:24,627 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [944454242] [2021-08-26 01:54:24,628 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-08-26 01:54:24,628 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-26 01:54:24,628 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-08-26 01:54:24,628 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2021-08-26 01:54:24,629 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:25,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 01:54:25,783 INFO L93 Difference]: Finished difference Result 52 states and 59 transitions. [2021-08-26 01:54:25,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-08-26 01:54:25,783 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:25,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 01:54:25,784 INFO L225 Difference]: With dead ends: 52 [2021-08-26 01:54:25,784 INFO L226 Difference]: Without dead ends: 41 [2021-08-26 01:54:25,784 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 490.6ms TimeCoverageRelationStatistics Valid=60, Invalid=150, Unknown=0, NotChecked=0, Total=210 [2021-08-26 01:54:25,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2021-08-26 01:54:25,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2021-08-26 01:54:25,788 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:25,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 48 transitions. [2021-08-26 01:54:25,789 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 48 transitions. Word has length 32 [2021-08-26 01:54:25,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 01:54:25,789 INFO L470 AbstractCegarLoop]: Abstraction has 41 states and 48 transitions. [2021-08-26 01:54:25,789 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:25,789 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 48 transitions. [2021-08-26 01:54:25,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-08-26 01:54:25,790 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 01:54:25,790 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:25,804 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (17)] Forceful destruction successful, exit code 0 [2021-08-26 01:54:26,003 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:26,004 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-26 01:54:26,004 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 01:54:26,004 INFO L82 PathProgramCache]: Analyzing trace with hash 1131854096, now seen corresponding path program 1 times [2021-08-26 01:54:26,004 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-26 01:54:26,004 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1893144885] [2021-08-26 01:54:26,005 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 01:54:26,005 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-26 01:54:26,005 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-26 01:54:26,006 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:26,008 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:26,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 01:54:26,399 INFO L263 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 15 conjunts are in the unsatisfiable core [2021-08-26 01:54:26,401 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-26 01:54:26,634 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,634 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-26 01:54:26,894 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,895 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-26 01:54:26,895 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1893144885] [2021-08-26 01:54:26,895 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1893144885] provided 2 perfect and 0 imperfect interpolant sequences [2021-08-26 01:54:26,895 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-08-26 01:54:26,895 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8, 8] imperfect sequences [] total 14 [2021-08-26 01:54:26,896 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1927469267] [2021-08-26 01:54:26,898 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-08-26 01:54:26,898 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-26 01:54:26,898 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-08-26 01:54:26,899 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2021-08-26 01:54:26,899 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:27,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 01:54:27,371 INFO L93 Difference]: Finished difference Result 55 states and 61 transitions. [2021-08-26 01:54:27,372 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-08-26 01:54:27,372 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:27,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 01:54:27,372 INFO L225 Difference]: With dead ends: 55 [2021-08-26 01:54:27,372 INFO L226 Difference]: Without dead ends: 41 [2021-08-26 01:54:27,373 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 443.6ms TimeCoverageRelationStatistics Valid=113, Invalid=349, Unknown=0, NotChecked=0, Total=462 [2021-08-26 01:54:27,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2021-08-26 01:54:27,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 39. [2021-08-26 01:54:27,376 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:27,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 42 transitions. [2021-08-26 01:54:27,377 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 42 transitions. Word has length 32 [2021-08-26 01:54:27,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 01:54:27,377 INFO L470 AbstractCegarLoop]: Abstraction has 39 states and 42 transitions. [2021-08-26 01:54:27,377 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:27,377 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 42 transitions. [2021-08-26 01:54:27,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2021-08-26 01:54:27,378 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 01:54:27,378 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:27,392 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:27,589 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:27,590 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-26 01:54:27,590 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 01:54:27,590 INFO L82 PathProgramCache]: Analyzing trace with hash -1713269395, now seen corresponding path program 1 times [2021-08-26 01:54:27,590 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-26 01:54:27,590 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [409818893] [2021-08-26 01:54:27,590 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 01:54:27,590 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-26 01:54:27,590 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-26 01:54:27,591 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:27,592 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:28,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 01:54:28,048 INFO L263 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 11 conjunts are in the unsatisfiable core [2021-08-26 01:54:28,050 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-26 01:54:28,692 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,692 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-26 01:54:28,882 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,882 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-26 01:54:28,882 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [409818893] [2021-08-26 01:54:28,882 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [409818893] provided 2 perfect and 0 imperfect interpolant sequences [2021-08-26 01:54:28,883 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-08-26 01:54:28,883 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7, 7] imperfect sequences [] total 12 [2021-08-26 01:54:28,883 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1130396854] [2021-08-26 01:54:28,883 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-08-26 01:54:28,883 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-26 01:54:28,884 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-08-26 01:54:28,884 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2021-08-26 01:54:28,884 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:29,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 01:54:29,376 INFO L93 Difference]: Finished difference Result 79 states and 81 transitions. [2021-08-26 01:54:29,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-08-26 01:54:29,377 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:29,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 01:54:29,378 INFO L225 Difference]: With dead ends: 79 [2021-08-26 01:54:29,378 INFO L226 Difference]: Without dead ends: 61 [2021-08-26 01:54:29,378 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 589.5ms TimeCoverageRelationStatistics Valid=90, Invalid=252, Unknown=0, NotChecked=0, Total=342 [2021-08-26 01:54:29,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2021-08-26 01:54:29,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 39. [2021-08-26 01:54:29,382 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:29,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 41 transitions. [2021-08-26 01:54:29,382 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 41 transitions. Word has length 33 [2021-08-26 01:54:29,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 01:54:29,383 INFO L470 AbstractCegarLoop]: Abstraction has 39 states and 41 transitions. [2021-08-26 01:54:29,383 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:29,383 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 41 transitions. [2021-08-26 01:54:29,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2021-08-26 01:54:29,383 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 01:54:29,384 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:29,400 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:29,595 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:29,595 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-26 01:54:29,596 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 01:54:29,596 INFO L82 PathProgramCache]: Analyzing trace with hash 739407273, now seen corresponding path program 1 times [2021-08-26 01:54:29,596 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-26 01:54:29,596 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1988800457] [2021-08-26 01:54:29,596 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 01:54:29,597 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-26 01:54:29,597 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-26 01:54:29,598 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:29,602 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:30,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 01:54:30,055 INFO L263 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 3 conjunts are in the unsatisfiable core [2021-08-26 01:54:30,056 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-26 01:54:30,129 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:30,129 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-26 01:54:30,193 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:30,194 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-26 01:54:30,194 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1988800457] [2021-08-26 01:54:30,194 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1988800457] provided 2 perfect and 0 imperfect interpolant sequences [2021-08-26 01:54:30,194 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-08-26 01:54:30,194 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 4 [2021-08-26 01:54:30,194 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2115822299] [2021-08-26 01:54:30,198 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-26 01:54:30,198 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-26 01:54:30,198 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-26 01:54:30,198 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-26 01:54:30,199 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:30,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 01:54:30,229 INFO L93 Difference]: Finished difference Result 39 states and 41 transitions. [2021-08-26 01:54:30,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-26 01:54:30,229 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:30,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 01:54:30,230 INFO L225 Difference]: With dead ends: 39 [2021-08-26 01:54:30,230 INFO L226 Difference]: Without dead ends: 0 [2021-08-26 01:54:30,230 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.6ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-26 01:54:30,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2021-08-26 01:54:30,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2021-08-26 01:54:30,230 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:30,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2021-08-26 01:54:30,230 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 35 [2021-08-26 01:54:30,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 01:54:30,230 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-08-26 01:54:30,230 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:30,231 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2021-08-26 01:54:30,231 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-08-26 01:54:30,235 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION [2021-08-26 01:54:30,235 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION [2021-08-26 01:54:30,244 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:30,436 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:30,438 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2021-08-26 01:54:30,441 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-26 01:54:30,553 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-26 01:54:30,558 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-26 01:54:30,671 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-26 01:54:30,692 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-26 01:54:30,744 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-26 01:54:30,753 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-26 01:54:30,839 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-26 01:54:30,840 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-26 01:54:30,906 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-26 01:54:30,911 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-26 01:54:30,978 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-26 01:54:30,981 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-26 01:54:30,998 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-26 01:54:35,881 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION(line 83) no Hoare annotation was computed. [2021-08-26 01:54:35,881 INFO L857 garLoopResultBuilder]: For program point L77(line 77) no Hoare annotation was computed. [2021-08-26 01:54:35,881 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2021-08-26 01:54:35,881 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2021-08-26 01:54:35,881 INFO L857 garLoopResultBuilder]: For program point L28(lines 28 34) no Hoare annotation was computed. [2021-08-26 01:54:35,882 INFO L857 garLoopResultBuilder]: For program point L28-1(lines 28 34) no Hoare annotation was computed. [2021-08-26 01:54:35,882 INFO L857 garLoopResultBuilder]: For program point L70(line 70) no Hoare annotation was computed. [2021-08-26 01:54:35,882 INFO L857 garLoopResultBuilder]: For program point L70-2(line 70) no Hoare annotation was computed. [2021-08-26 01:54:35,882 INFO L857 garLoopResultBuilder]: For program point L70-3(lines 70 71) no Hoare annotation was computed. [2021-08-26 01:54:35,882 INFO L857 garLoopResultBuilder]: For program point L70-5(lines 70 86) no Hoare annotation was computed. [2021-08-26 01:54:35,882 INFO L857 garLoopResultBuilder]: For program point L70-7(lines 70 86) no Hoare annotation was computed. [2021-08-26 01:54:35,882 INFO L857 garLoopResultBuilder]: For program point L71(line 71) no Hoare annotation was computed. [2021-08-26 01:54:35,882 INFO L857 garLoopResultBuilder]: For program point L38(lines 38 39) no Hoare annotation was computed. [2021-08-26 01:54:35,882 INFO L857 garLoopResultBuilder]: For program point L71-2(line 71) no Hoare annotation was computed. [2021-08-26 01:54:35,883 INFO L860 garLoopResultBuilder]: At program point L88(lines 61 89) the Hoare annotation is: true [2021-08-26 01:54:35,883 INFO L857 garLoopResultBuilder]: For program point L31(lines 31 34) no Hoare annotation was computed. [2021-08-26 01:54:35,883 INFO L857 garLoopResultBuilder]: For program point L31-1(lines 31 34) no Hoare annotation was computed. [2021-08-26 01:54:35,883 INFO L857 garLoopResultBuilder]: For program point L40(lines 40 41) no Hoare annotation was computed. [2021-08-26 01:54:35,883 INFO L857 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2021-08-26 01:54:35,883 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 77) no Hoare annotation was computed. [2021-08-26 01:54:35,883 INFO L857 garLoopResultBuilder]: For program point L82(line 82) no Hoare annotation was computed. [2021-08-26 01:54:35,883 INFO L857 garLoopResultBuilder]: For program point L82-2(lines 82 85) no Hoare annotation was computed. [2021-08-26 01:54:35,884 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2021-08-26 01:54:35,884 INFO L857 garLoopResultBuilder]: For program point L25(lines 25 34) no Hoare annotation was computed. [2021-08-26 01:54:35,884 INFO L857 garLoopResultBuilder]: For program point L25-1(lines 25 34) no Hoare annotation was computed. [2021-08-26 01:54:35,884 INFO L857 garLoopResultBuilder]: For program point L83(line 83) no Hoare annotation was computed. [2021-08-26 01:54:35,884 INFO L857 garLoopResultBuilder]: For program point L17-1(lines 17 21) no Hoare annotation was computed. [2021-08-26 01:54:35,884 INFO L853 garLoopResultBuilder]: At program point L17-2(lines 17 21) the Hoare annotation is: (let ((.cse0 (fp.eq ULTIMATE.start_fmin_float_~y ULTIMATE.start_fmin_float_~y)) (.cse2 (= ULTIMATE.start_fmin_float_~y ULTIMATE.start_main_~y~0)) (.cse1 (fp.eq ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~x~0))) (or (and (= (_ bv0 32) |ULTIMATE.start_isnan_float_#res|) (not (fp.eq ULTIMATE.start_fmin_float_~x ULTIMATE.start_fmin_float_~x)) .cse0 (not .cse1) .cse2) (and (not .cse0) (= ULTIMATE.start_fmin_float_~x ULTIMATE.start___fpclassify_float_~x) (= ULTIMATE.start_fmin_float_~x ULTIMATE.start_main_~x~0) .cse2 .cse1 (= (_ bv1 32) |ULTIMATE.start_isnan_float_#res|)))) [2021-08-26 01:54:35,885 INFO L857 garLoopResultBuilder]: For program point L17-3(lines 14 35) no Hoare annotation was computed. [2021-08-26 01:54:35,885 INFO L857 garLoopResultBuilder]: For program point L17-5(lines 17 21) no Hoare annotation was computed. [2021-08-26 01:54:35,885 INFO L853 garLoopResultBuilder]: At program point L17-6(lines 17 21) the Hoare annotation is: (let ((.cse0 (= ULTIMATE.start_fmin_float_~y ULTIMATE.start___fpclassify_float_~x)) (.cse1 (= ULTIMATE.start_fmin_float_~y ULTIMATE.start_main_~y~0))) (or (and (= (_ bv0 32) |ULTIMATE.start_isnan_float_#res|) .cse0 (not (fp.eq ULTIMATE.start_fmin_float_~x ULTIMATE.start_fmin_float_~x)) (fp.eq ULTIMATE.start_fmin_float_~y ULTIMATE.start_fmin_float_~y) (not (fp.eq ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~x~0)) .cse1) (and .cse0 (fp.eq ULTIMATE.start_fmin_float_~x ULTIMATE.start_main_~x~0) (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:35,885 INFO L857 garLoopResultBuilder]: For program point L17-7(lines 14 35) no Hoare annotation was computed. [2021-08-26 01:54:35,885 INFO L853 garLoopResultBuilder]: At program point L34(lines 14 35) the Hoare annotation is: (let ((.cse0 (fp.eq ULTIMATE.start_fmin_float_~y ULTIMATE.start_fmin_float_~y)) (.cse2 (= ULTIMATE.start_fmin_float_~y ULTIMATE.start_main_~y~0)) (.cse1 (fp.eq ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~x~0))) (or (and (= (_ bv0 32) |ULTIMATE.start_isnan_float_#res|) (not (fp.eq ULTIMATE.start_fmin_float_~x ULTIMATE.start_fmin_float_~x)) .cse0 (not .cse1) .cse2) (and (not .cse0) (= ULTIMATE.start_fmin_float_~x ULTIMATE.start___fpclassify_float_~x) (= ULTIMATE.start_fmin_float_~x ULTIMATE.start_main_~x~0) .cse2 .cse1 (= (_ bv1 32) |ULTIMATE.start_isnan_float_#res|) (not (= (_ bv0 32) |ULTIMATE.start___fpclassify_float_#res|)) (= ULTIMATE.start_fmin_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:35,885 INFO L853 garLoopResultBuilder]: At program point L34-1(lines 14 35) the Hoare annotation is: (let ((.cse1 (fp ((_ extract 31 31) ULTIMATE.start___fpclassify_float_~w~0) ((_ extract 30 23) ULTIMATE.start___fpclassify_float_~w~0) ((_ extract 22 0) ULTIMATE.start___fpclassify_float_~w~0)))) (let ((.cse2 (= ULTIMATE.start_fmin_float_~y .cse1)) (.cse3 (= ULTIMATE.start_fmin_float_~y ULTIMATE.start_main_~y~0)) (.cse0 (= (_ bv0 32) |ULTIMATE.start___fpclassify_float_#res|))) (or (and .cse0 (fp.eq ULTIMATE.start_fmin_float_~x ULTIMATE.start_main_~x~0) (not (fp.eq ULTIMATE.start___fpclassify_float_~x ULTIMATE.start___fpclassify_float_~x)) (not (fp.eq .cse1 .cse1)) .cse2 .cse3 (= (_ bv1 32) |ULTIMATE.start_isnan_float_#res|)) (and (= ULTIMATE.start_fmin_float_~y ULTIMATE.start___fpclassify_float_~x) (not (fp.eq ULTIMATE.start_fmin_float_~x ULTIMATE.start_fmin_float_~x)) .cse2 (not (fp.eq ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~x~0)) .cse3 (fp.eq ULTIMATE.start_fmin_float_~y ULTIMATE.start_main_~y~0) (not .cse0))))) [2021-08-26 01:54:35,885 INFO L853 garLoopResultBuilder]: At program point L59(line 59) 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:35,885 INFO L853 garLoopResultBuilder]: At program point L59-1(line 59) the Hoare annotation is: (and |ULTIMATE.start_main_#t~short16| (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:35,886 INFO L853 garLoopResultBuilder]: At program point L59-2(line 59) the Hoare annotation is: (let ((.cse0 (not |ULTIMATE.start_main_#t~short20|)) (.cse2 (not |ULTIMATE.start_main_#t~short16|)) (.cse1 (fp.eq ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~x~0))) (or (and .cse0 (not (fp.eq ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0)) (not .cse1) .cse2 (= (_ bv1 32) |ULTIMATE.start_isnan_float_#res|)) (and .cse0 (= (_ bv0 32) |ULTIMATE.start_isnan_float_#res|) .cse2 .cse1))) [2021-08-26 01:54:35,886 INFO L853 garLoopResultBuilder]: At program point L59-3(line 59) the Hoare annotation is: (and (not |ULTIMATE.start_main_#t~short20|) |ULTIMATE.start_main_#t~short19| (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~short16|) (fp.eq ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~x~0)) [2021-08-26 01:54:35,886 INFO L853 garLoopResultBuilder]: At program point L59-4(line 59) the Hoare annotation is: (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))) (.cse2 (not (fp.eq ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~x~0))) (.cse1 (= ULTIMATE.start_fmin_float_~y ULTIMATE.start_main_~y~0)) (.cse3 (= (_ bv1 32) |ULTIMATE.start_isnan_float_#res|))) (or (and (= (_ bv0 32) |ULTIMATE.start_isnan_float_#res|) (not (fp.eq ULTIMATE.start_fmin_float_~y ULTIMATE.start_fmin_float_~y)) (fp.eq ULTIMATE.start_fmin_float_~x ULTIMATE.start_main_~x~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 (fp.eq .cse0 .cse0)) .cse1 (fp.eq |ULTIMATE.start_fmin_float_#res| ULTIMATE.start_main_~x~0)) (and (fp.eq ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0) (= ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~res~0) (= ULTIMATE.start_main_~y~0 |ULTIMATE.start_fmin_float_#res|) .cse2 .cse1 .cse3) (and (fp.eq ULTIMATE.start_main_~res~0 ULTIMATE.start_main_~y~0) (= ULTIMATE.start_fmin_float_~y ULTIMATE.start___fpclassify_float_~x) (not (fp.eq ULTIMATE.start_fmin_float_~x ULTIMATE.start_fmin_float_~x)) (= ULTIMATE.start_fmin_float_~y .cse0) .cse2 (fp.eq |ULTIMATE.start_fmin_float_#res| ULTIMATE.start_main_~y~0) .cse1 .cse3))) [2021-08-26 01:54:35,886 INFO L853 garLoopResultBuilder]: At program point L59-5(line 59) the Hoare annotation is: (let ((.cse0 (= (_ bv0 32) |ULTIMATE.start_isnan_float_#res|)) (.cse1 (not (fp.eq ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~x~0))) (.cse2 (= ULTIMATE.start_fmin_float_~y ULTIMATE.start_main_~y~0))) (or (and |ULTIMATE.start_main_#t~short24| (fp.eq ULTIMATE.start_main_~res~0 ULTIMATE.start_main_~y~0) .cse0 (= ULTIMATE.start_fmin_float_~y ULTIMATE.start___fpclassify_float_~x) (not (fp.eq ULTIMATE.start_fmin_float_~x ULTIMATE.start_fmin_float_~x)) (= ULTIMATE.start_fmin_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))) .cse1 (fp.eq |ULTIMATE.start_fmin_float_#res| ULTIMATE.start_main_~y~0) .cse2) (and |ULTIMATE.start_main_#t~short24| .cse0 (fp.eq ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0) (= ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~res~0) (= ULTIMATE.start_main_~y~0 |ULTIMATE.start_fmin_float_#res|) .cse1 .cse2))) [2021-08-26 01:54:35,886 INFO L853 garLoopResultBuilder]: At program point L59-6(line 59) the Hoare annotation is: (or (and (= (_ bv0 32) |ULTIMATE.start_isnan_float_#res|) (not (fp.eq ULTIMATE.start_fmin_float_~y ULTIMATE.start_fmin_float_~y)) (fp.eq ULTIMATE.start_fmin_float_~x ULTIMATE.start_main_~x~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))) (= ULTIMATE.start_fmin_float_~y ULTIMATE.start_main_~y~0) (fp.eq |ULTIMATE.start_fmin_float_#res| ULTIMATE.start_main_~x~0)) (and (not (fp.eq ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~x~0)) (= (_ bv1 32) |ULTIMATE.start_isnan_float_#res|))) [2021-08-26 01:54:35,886 INFO L853 garLoopResultBuilder]: At program point L59-7(line 59) the Hoare annotation is: (and (not (fp.eq ULTIMATE.start_fmin_float_~y ULTIMATE.start_fmin_float_~y)) (fp.eq ULTIMATE.start_fmin_float_~x ULTIMATE.start_main_~x~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))) (= ULTIMATE.start_fmin_float_~y ULTIMATE.start_main_~y~0) (= (_ bv1 32) |ULTIMATE.start_isnan_float_#res|) (fp.eq |ULTIMATE.start_fmin_float_#res| ULTIMATE.start_main_~x~0)) [2021-08-26 01:54:35,886 INFO L857 garLoopResultBuilder]: For program point L76(line 76) no Hoare annotation was computed. [2021-08-26 01:54:35,886 INFO L857 garLoopResultBuilder]: For program point L43(line 43) no Hoare annotation was computed. [2021-08-26 01:54:35,886 INFO L857 garLoopResultBuilder]: For program point L76-2(lines 76 79) no Hoare annotation was computed. [2021-08-26 01:54:35,886 INFO L857 garLoopResultBuilder]: For program point L43-2(line 43) no Hoare annotation was computed. [2021-08-26 01:54:35,886 INFO L853 garLoopResultBuilder]: At program point L43-3(lines 37 44) the Hoare annotation is: (let ((.cse0 (not (fp.eq ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~x~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))) (.cse1 (= ULTIMATE.start_fmin_float_~y ULTIMATE.start_main_~y~0))) (or (and (= (_ bv0 32) |ULTIMATE.start_isnan_float_#res|) (fp.eq ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0) (= ULTIMATE.start_main_~y~0 |ULTIMATE.start_fmin_float_#res|) .cse0 .cse1) (and (= ULTIMATE.start_fmin_float_~y ULTIMATE.start___fpclassify_float_~x) (not (fp.eq ULTIMATE.start_fmin_float_~x ULTIMATE.start_fmin_float_~x)) (= ULTIMATE.start_fmin_float_~y .cse2) .cse0 (fp.eq |ULTIMATE.start_fmin_float_#res| ULTIMATE.start_main_~y~0) .cse1) (and (not (fp.eq ULTIMATE.start_fmin_float_~y ULTIMATE.start_fmin_float_~y)) (fp.eq ULTIMATE.start_fmin_float_~x ULTIMATE.start_main_~x~0) (not (fp.eq ULTIMATE.start___fpclassify_float_~x ULTIMATE.start___fpclassify_float_~x)) (not (fp.eq .cse2 .cse2)) .cse1 (= (_ bv1 32) |ULTIMATE.start_isnan_float_#res|) (fp.eq |ULTIMATE.start_fmin_float_#res| ULTIMATE.start_main_~x~0)))) [2021-08-26 01:54:35,890 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-08-26 01:54:35,915 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.08 01:54:35 BoogieIcfgContainer [2021-08-26 01:54:35,915 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-08-26 01:54:35,916 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-08-26 01:54:35,916 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-08-26 01:54:35,916 INFO L275 PluginConnector]: Witness Printer initialized [2021-08-26 01:54:35,916 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:04" (3/4) ... [2021-08-26 01:54:35,919 INFO L137 WitnessPrinter]: Generating witness for correct program [2021-08-26 01:54:35,929 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 22 nodes and edges [2021-08-26 01:54:35,930 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2021-08-26 01:54:35,930 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2021-08-26 01:54:35,930 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2021-08-26 01:54:35,948 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:35,948 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:35,949 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((!aux-(isnan_float(x) && !isnan_float(y)) || (!isnan_float(x) && isnan_float(y))-aux && !~fp.eq~FLOAT(y, y)) && !~fp.eq~FLOAT(x, x)) && !aux-isnan_float(x) && !isnan_float(y)-aux) && 1bv32 == \result) || (((!aux-(isnan_float(x) && !isnan_float(y)) || (!isnan_float(x) && isnan_float(y))-aux && 0bv32 == \result) && !aux-isnan_float(x) && !isnan_float(y)-aux) && ~fp.eq~FLOAT(x, x)) [2021-08-26 01:54:35,949 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((!aux-(isnan_float(x) && !isnan_float(y)) || (!isnan_float(x) && isnan_float(y))-aux && aux-!isnan_float(x) && isnan_float(y)-aux) && ((!~fp.eq~FLOAT(y, y) && 1bv32 == \result) || (0bv32 == \result && ~fp.eq~FLOAT(y, y)))) && !aux-isnan_float(x) && !isnan_float(y)-aux) && ~fp.eq~FLOAT(x, x) [2021-08-26 01:54:35,949 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((0bv32 == \result && !~fp.eq~FLOAT(x, x)) && ~fp.eq~FLOAT(y, y)) && !~fp.eq~FLOAT(x, x)) && y == y) || (((((!~fp.eq~FLOAT(y, y) && x == x) && x == x) && y == y) && ~fp.eq~FLOAT(x, x)) && 1bv32 == \result) [2021-08-26 01:54:35,949 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((0bv32 == \result && !~fp.eq~FLOAT(x, x)) && ~fp.eq~FLOAT(y, y)) && !~fp.eq~FLOAT(x, x)) && y == y) || (((((((!~fp.eq~FLOAT(y, y) && x == x) && x == x) && y == y) && ~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:35,950 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((0bv32 == \result && ~fp.eq~FLOAT(y, y)) && y == \result) && !~fp.eq~FLOAT(x, x)) && y == y) || (((((y == x && !~fp.eq~FLOAT(x, x)) && y == ~fp~LONGDOUBLE(w[31:31], w[30:23], w[22:0])) && !~fp.eq~FLOAT(x, x)) && ~fp.eq~FLOAT(\result, y)) && y == y)) || ((((((!~fp.eq~FLOAT(y, y) && ~fp.eq~FLOAT(x, x)) && !~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]))) && y == y) && 1bv32 == \result) && ~fp.eq~FLOAT(\result, x)) [2021-08-26 01:54:35,950 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((0bv32 == \result && y == x) && !~fp.eq~FLOAT(x, x)) && ~fp.eq~FLOAT(y, y)) && !~fp.eq~FLOAT(x, x)) && y == y) || ((((y == x && ~fp.eq~FLOAT(x, x)) && !~fp.eq~FLOAT(x, x)) && y == y) && 1bv32 == \result) [2021-08-26 01:54:35,950 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((0bv32 == \result && !~fp.eq~FLOAT(y, y)) && ~fp.eq~FLOAT(x, x)) && !~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]))) && y == y) && ~fp.eq~FLOAT(\result, x)) || (((((~fp.eq~FLOAT(y, y) && y == res) && y == \result) && !~fp.eq~FLOAT(x, x)) && y == y) && 1bv32 == \result)) || (((((((~fp.eq~FLOAT(res, y) && y == x) && !~fp.eq~FLOAT(x, x)) && y == ~fp~LONGDOUBLE(w[31:31], w[30:23], w[22:0])) && !~fp.eq~FLOAT(x, x)) && ~fp.eq~FLOAT(\result, y)) && y == y) && 1bv32 == \result) [2021-08-26 01:54:35,950 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((0bv32 == \result && ~fp.eq~FLOAT(x, x)) && !~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]))) && y == ~fp~LONGDOUBLE(w[31:31], w[30:23], w[22:0])) && y == y) && 1bv32 == \result) || ((((((y == x && !~fp.eq~FLOAT(x, x)) && y == ~fp~LONGDOUBLE(w[31:31], w[30:23], w[22:0])) && !~fp.eq~FLOAT(x, x)) && y == y) && ~fp.eq~FLOAT(y, y)) && !(0bv32 == \result)) [2021-08-26 01:54:35,951 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 == x) && !~fp.eq~FLOAT(x, x)) && y == ~fp~LONGDOUBLE(w[31:31], w[30:23], w[22:0])) && !~fp.eq~FLOAT(x, x)) && ~fp.eq~FLOAT(\result, y)) && y == y) || ((((((aux-isnan_float(x) && !isnan_float(y)-aux && 0bv32 == \result) && ~fp.eq~FLOAT(y, y)) && y == res) && y == \result) && !~fp.eq~FLOAT(x, x)) && y == y) [2021-08-26 01:54:35,951 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((0bv32 == \result && !~fp.eq~FLOAT(y, y)) && ~fp.eq~FLOAT(x, x)) && !~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]))) && y == y) && ~fp.eq~FLOAT(\result, x)) || (!~fp.eq~FLOAT(x, x) && 1bv32 == \result) [2021-08-26 01:54:35,951 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((!~fp.eq~FLOAT(y, y) && ~fp.eq~FLOAT(x, x)) && !~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]))) && y == y) && 1bv32 == \result) && ~fp.eq~FLOAT(\result, x) [2021-08-26 01:54:35,971 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2021-08-26 01:54:35,971 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-08-26 01:54:35,973 INFO L168 Benchmark]: Toolchain (without parser) took 32220.07 ms. Allocated memory was 48.2 MB in the beginning and 125.8 MB in the end (delta: 77.6 MB). Free memory was 23.8 MB in the beginning and 73.4 MB in the end (delta: -49.6 MB). Peak memory consumption was 26.3 MB. Max. memory is 16.1 GB. [2021-08-26 01:54:35,973 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 48.2 MB. Free memory was 30.3 MB in the beginning and 30.3 MB in the end (delta: 40.0 kB). There was no memory consumed. Max. memory is 16.1 GB. [2021-08-26 01:54:35,973 INFO L168 Benchmark]: CACSL2BoogieTranslator took 251.75 ms. Allocated memory was 48.2 MB in the beginning and 58.7 MB in the end (delta: 10.5 MB). Free memory was 23.7 MB in the beginning and 42.1 MB in the end (delta: -18.4 MB). Peak memory consumption was 4.5 MB. Max. memory is 16.1 GB. [2021-08-26 01:54:35,974 INFO L168 Benchmark]: Boogie Procedure Inliner took 56.21 ms. Allocated memory is still 58.7 MB. Free memory was 42.1 MB in the beginning and 40.2 MB in the end (delta: 1.9 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-08-26 01:54:35,974 INFO L168 Benchmark]: Boogie Preprocessor took 62.80 ms. Allocated memory is still 58.7 MB. Free memory was 40.2 MB in the beginning and 38.4 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:35,974 INFO L168 Benchmark]: RCFGBuilder took 521.15 ms. Allocated memory is still 58.7 MB. Free memory was 38.4 MB in the beginning and 28.0 MB in the end (delta: 10.4 MB). Peak memory consumption was 11.9 MB. Max. memory is 16.1 GB. [2021-08-26 01:54:35,975 INFO L168 Benchmark]: TraceAbstraction took 31266.37 ms. Allocated memory was 58.7 MB in the beginning and 125.8 MB in the end (delta: 67.1 MB). Free memory was 27.5 MB in the beginning and 78.6 MB in the end (delta: -51.2 MB). Peak memory consumption was 64.4 MB. Max. memory is 16.1 GB. [2021-08-26 01:54:35,975 INFO L168 Benchmark]: Witness Printer took 55.94 ms. Allocated memory is still 125.8 MB. Free memory was 78.6 MB in the beginning and 73.4 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:35,976 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 48.2 MB. Free memory was 30.3 MB in the beginning and 30.3 MB in the end (delta: 40.0 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 251.75 ms. Allocated memory was 48.2 MB in the beginning and 58.7 MB in the end (delta: 10.5 MB). Free memory was 23.7 MB in the beginning and 42.1 MB in the end (delta: -18.4 MB). Peak memory consumption was 4.5 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 56.21 ms. Allocated memory is still 58.7 MB. Free memory was 42.1 MB in the beginning and 40.2 MB in the end (delta: 1.9 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 62.80 ms. Allocated memory is still 58.7 MB. Free memory was 40.2 MB in the beginning and 38.4 MB in the end (delta: 1.7 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * RCFGBuilder took 521.15 ms. Allocated memory is still 58.7 MB. Free memory was 38.4 MB in the beginning and 28.0 MB in the end (delta: 10.4 MB). Peak memory consumption was 11.9 MB. Max. memory is 16.1 GB. * TraceAbstraction took 31266.37 ms. Allocated memory was 58.7 MB in the beginning and 125.8 MB in the end (delta: 67.1 MB). Free memory was 27.5 MB in the beginning and 78.6 MB in the end (delta: -51.2 MB). Peak memory consumption was 64.4 MB. Max. memory is 16.1 GB. * Witness Printer took 55.94 ms. Allocated memory is still 125.8 MB. Free memory was 78.6 MB in the beginning and 73.4 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: 77]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 83]: 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: 31192.4ms, OverallIterations: 19, TraceHistogramMax: 1, EmptinessCheckTime: 19.9ms, AutomataDifference: 8968.6ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 5444.1ms, InitialAbstractionConstructionTime: 7.8ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 1146 SDtfs, 2600 SDslu, 4552 SDs, 0 SdLazy, 2015 SolverSat, 263 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 4277.9ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1045 GetRequests, 774 SyntacticMatches, 6 SemanticMatches, 265 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 929 ImplicationChecksByTransitivity, 6179.3ms 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: 115.1ms AutomataMinimizationTime, 19 MinimizatonAttempts, 578 StatesRemovedByMinimization, 14 NontrivialMinimizations, HoareAnnotationStatistics: 0.0ms HoareAnnotationTime, 14 LocationsWithAnnotation, 14 PreInvPairs, 48 NumberOfFragments, 617 HoareAnnotationTreeSize, 14 FomulaSimplifications, 643151 FormulaSimplificationTreeSizeReduction, 561.2ms HoareSimplificationTime, 14 FomulaSimplificationsInter, 19731 FormulaSimplificationTreeSizeReductionInter, 4873.8ms HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 272.8ms SsaConstructionTime, 641.9ms SatisfiabilityAnalysisTime, 8041.3ms 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: 17]: Loop Invariant Derived loop invariant: (((((0bv32 == \result && y == x) && !~fp.eq~FLOAT(x, x)) && ~fp.eq~FLOAT(y, y)) && !~fp.eq~FLOAT(x, x)) && y == y) || ((((y == x && ~fp.eq~FLOAT(x, x)) && !~fp.eq~FLOAT(x, x)) && y == y) && 1bv32 == \result) - InvariantResult [Line: 59]: Loop Invariant Derived loop invariant: (0bv32 == \result && ~fp.eq~FLOAT(x, x)) || (!~fp.eq~FLOAT(x, x) && 1bv32 == \result) - InvariantResult [Line: 59]: Loop Invariant Derived loop invariant: ((((((!~fp.eq~FLOAT(y, y) && ~fp.eq~FLOAT(x, x)) && !~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]))) && y == y) && 1bv32 == \result) && ~fp.eq~FLOAT(\result, x) - InvariantResult [Line: 59]: Loop Invariant Derived loop invariant: ((((((((aux-isnan_float(x) && !isnan_float(y)-aux && ~fp.eq~FLOAT(res, y)) && 0bv32 == \result) && y == x) && !~fp.eq~FLOAT(x, x)) && y == ~fp~LONGDOUBLE(w[31:31], w[30:23], w[22:0])) && !~fp.eq~FLOAT(x, x)) && ~fp.eq~FLOAT(\result, y)) && y == y) || ((((((aux-isnan_float(x) && !isnan_float(y)-aux && 0bv32 == \result) && ~fp.eq~FLOAT(y, y)) && y == res) && y == \result) && !~fp.eq~FLOAT(x, x)) && y == y) - InvariantResult [Line: 59]: Loop Invariant Derived loop invariant: ((((!aux-(isnan_float(x) && !isnan_float(y)) || (!isnan_float(x) && isnan_float(y))-aux && !~fp.eq~FLOAT(y, y)) && !~fp.eq~FLOAT(x, x)) && !aux-isnan_float(x) && !isnan_float(y)-aux) && 1bv32 == \result) || (((!aux-(isnan_float(x) && !isnan_float(y)) || (!isnan_float(x) && isnan_float(y))-aux && 0bv32 == \result) && !aux-isnan_float(x) && !isnan_float(y)-aux) && ~fp.eq~FLOAT(x, x)) - InvariantResult [Line: 59]: Loop Invariant Derived loop invariant: (((((((0bv32 == \result && !~fp.eq~FLOAT(y, y)) && ~fp.eq~FLOAT(x, x)) && !~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]))) && y == y) && ~fp.eq~FLOAT(\result, x)) || (!~fp.eq~FLOAT(x, x) && 1bv32 == \result) - InvariantResult [Line: 37]: Loop Invariant Derived loop invariant: (((((0bv32 == \result && ~fp.eq~FLOAT(y, y)) && y == \result) && !~fp.eq~FLOAT(x, x)) && y == y) || (((((y == x && !~fp.eq~FLOAT(x, x)) && y == ~fp~LONGDOUBLE(w[31:31], w[30:23], w[22:0])) && !~fp.eq~FLOAT(x, x)) && ~fp.eq~FLOAT(\result, y)) && y == y)) || ((((((!~fp.eq~FLOAT(y, y) && ~fp.eq~FLOAT(x, x)) && !~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]))) && y == y) && 1bv32 == \result) && ~fp.eq~FLOAT(\result, x)) - InvariantResult [Line: 61]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 59]: Loop Invariant Derived loop invariant: ((((((((0bv32 == \result && !~fp.eq~FLOAT(y, y)) && ~fp.eq~FLOAT(x, x)) && !~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]))) && y == y) && ~fp.eq~FLOAT(\result, x)) || (((((~fp.eq~FLOAT(y, y) && y == res) && y == \result) && !~fp.eq~FLOAT(x, x)) && y == y) && 1bv32 == \result)) || (((((((~fp.eq~FLOAT(res, y) && y == x) && !~fp.eq~FLOAT(x, x)) && y == ~fp~LONGDOUBLE(w[31:31], w[30:23], w[22:0])) && !~fp.eq~FLOAT(x, x)) && ~fp.eq~FLOAT(\result, y)) && y == y) && 1bv32 == \result) - InvariantResult [Line: 17]: Loop Invariant Derived loop invariant: ((((0bv32 == \result && !~fp.eq~FLOAT(x, x)) && ~fp.eq~FLOAT(y, y)) && !~fp.eq~FLOAT(x, x)) && y == y) || (((((!~fp.eq~FLOAT(y, y) && x == x) && x == x) && y == y) && ~fp.eq~FLOAT(x, x)) && 1bv32 == \result) - InvariantResult [Line: 14]: Loop Invariant Derived loop invariant: ((((0bv32 == \result && !~fp.eq~FLOAT(x, x)) && ~fp.eq~FLOAT(y, y)) && !~fp.eq~FLOAT(x, x)) && y == y) || (((((((!~fp.eq~FLOAT(y, y) && x == x) && x == x) && y == y) && ~fp.eq~FLOAT(x, x)) && 1bv32 == \result) && !(0bv32 == \result)) && x == ~fp~LONGDOUBLE(w[31:31], w[30:23], w[22:0])) - InvariantResult [Line: 59]: 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: 14]: Loop Invariant Derived loop invariant: ((((((0bv32 == \result && ~fp.eq~FLOAT(x, x)) && !~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]))) && y == ~fp~LONGDOUBLE(w[31:31], w[30:23], w[22:0])) && y == y) && 1bv32 == \result) || ((((((y == x && !~fp.eq~FLOAT(x, x)) && y == ~fp~LONGDOUBLE(w[31:31], w[30:23], w[22:0])) && !~fp.eq~FLOAT(x, x)) && y == y) && ~fp.eq~FLOAT(y, y)) && !(0bv32 == \result)) - InvariantResult [Line: 59]: Loop Invariant Derived loop invariant: (((!aux-(isnan_float(x) && !isnan_float(y)) || (!isnan_float(x) && isnan_float(y))-aux && aux-!isnan_float(x) && isnan_float(y)-aux) && ((!~fp.eq~FLOAT(y, y) && 1bv32 == \result) || (0bv32 == \result && ~fp.eq~FLOAT(y, y)))) && !aux-isnan_float(x) && !isnan_float(y)-aux) && ~fp.eq~FLOAT(x, x) RESULT: Ultimate proved your program to be correct! [2021-08-26 01:54:36,041 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...