./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/float-newlib/double_req_bl_1252a.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 6c24879c Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/float-newlib/double_req_bl_1252a.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 2743c9c1eae15f6a9812481781d831b3850f89be91644ec8a207d83f9a71b29e --- Real Ultimate output --- This is Ultimate 0.2.2-?-6c24879 [2022-07-12 03:04:07,055 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-12 03:04:07,058 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-12 03:04:07,094 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-12 03:04:07,094 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-12 03:04:07,096 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-12 03:04:07,098 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-12 03:04:07,101 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-12 03:04:07,103 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-12 03:04:07,107 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-12 03:04:07,109 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-12 03:04:07,111 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-12 03:04:07,112 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-12 03:04:07,114 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-12 03:04:07,116 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-12 03:04:07,120 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-12 03:04:07,121 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-12 03:04:07,124 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-12 03:04:07,125 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-12 03:04:07,131 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-12 03:04:07,134 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-12 03:04:07,135 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-12 03:04:07,136 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-12 03:04:07,136 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-12 03:04:07,138 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-12 03:04:07,145 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-12 03:04:07,146 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-12 03:04:07,146 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-12 03:04:07,148 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-12 03:04:07,148 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-12 03:04:07,149 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-12 03:04:07,150 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-12 03:04:07,151 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-12 03:04:07,152 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-12 03:04:07,153 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-12 03:04:07,154 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-12 03:04:07,154 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-12 03:04:07,154 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-12 03:04:07,156 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-12 03:04:07,156 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-12 03:04:07,157 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-12 03:04:07,159 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-12 03:04:07,160 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-07-12 03:04:07,198 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-12 03:04:07,199 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-12 03:04:07,199 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-12 03:04:07,200 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-12 03:04:07,201 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-12 03:04:07,201 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-12 03:04:07,202 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-12 03:04:07,202 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-12 03:04:07,202 INFO L138 SettingsManager]: * Use SBE=true [2022-07-12 03:04:07,203 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-12 03:04:07,203 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-12 03:04:07,203 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-12 03:04:07,203 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-12 03:04:07,204 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-12 03:04:07,204 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-12 03:04:07,204 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-12 03:04:07,204 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-12 03:04:07,204 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-12 03:04:07,204 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-12 03:04:07,205 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-12 03:04:07,205 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-12 03:04:07,205 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-12 03:04:07,205 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-12 03:04:07,205 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-12 03:04:07,206 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-12 03:04:07,206 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-12 03:04:07,206 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-12 03:04:07,206 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-12 03:04:07,206 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-12 03:04:07,207 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-12 03:04:07,207 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-12 03:04:07,207 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-12 03:04:07,207 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-12 03:04:07,207 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 -> 2743c9c1eae15f6a9812481781d831b3850f89be91644ec8a207d83f9a71b29e [2022-07-12 03:04:07,492 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-12 03:04:07,518 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-12 03:04:07,521 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-12 03:04:07,522 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-12 03:04:07,523 INFO L275 PluginConnector]: CDTParser initialized [2022-07-12 03:04:07,525 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/float-newlib/double_req_bl_1252a.c [2022-07-12 03:04:07,592 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/100b830d2/823361d7df9b4234bebf8fb0f5cb621d/FLAGf259b25b7 [2022-07-12 03:04:07,994 INFO L306 CDTParser]: Found 1 translation units. [2022-07-12 03:04:07,999 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/double_req_bl_1252a.c [2022-07-12 03:04:08,008 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/100b830d2/823361d7df9b4234bebf8fb0f5cb621d/FLAGf259b25b7 [2022-07-12 03:04:08,406 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/100b830d2/823361d7df9b4234bebf8fb0f5cb621d [2022-07-12 03:04:08,408 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-12 03:04:08,409 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-12 03:04:08,413 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-12 03:04:08,413 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-12 03:04:08,416 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-12 03:04:08,417 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.07 03:04:08" (1/1) ... [2022-07-12 03:04:08,418 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@772cf85c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:04:08, skipping insertion in model container [2022-07-12 03:04:08,418 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.07 03:04:08" (1/1) ... [2022-07-12 03:04:08,424 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-12 03:04:08,442 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-12 03:04:08,675 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/double_req_bl_1252a.c[2154,2167] [2022-07-12 03:04:08,678 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-12 03:04:08,684 INFO L203 MainTranslator]: Completed pre-run [2022-07-12 03:04:08,714 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/double_req_bl_1252a.c[2154,2167] [2022-07-12 03:04:08,715 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-12 03:04:08,725 INFO L208 MainTranslator]: Completed translation [2022-07-12 03:04:08,726 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:04:08 WrapperNode [2022-07-12 03:04:08,726 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-12 03:04:08,727 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-12 03:04:08,727 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-12 03:04:08,727 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-12 03:04:08,734 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:04:08" (1/1) ... [2022-07-12 03:04:08,752 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:04:08" (1/1) ... [2022-07-12 03:04:08,778 INFO L137 Inliner]: procedures = 18, calls = 20, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 67 [2022-07-12 03:04:08,779 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-12 03:04:08,780 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-12 03:04:08,780 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-12 03:04:08,780 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-12 03:04:08,787 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:04:08" (1/1) ... [2022-07-12 03:04:08,788 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:04:08" (1/1) ... [2022-07-12 03:04:08,794 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:04:08" (1/1) ... [2022-07-12 03:04:08,795 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:04:08" (1/1) ... [2022-07-12 03:04:08,813 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:04:08" (1/1) ... [2022-07-12 03:04:08,818 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:04:08" (1/1) ... [2022-07-12 03:04:08,824 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:04:08" (1/1) ... [2022-07-12 03:04:08,831 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-12 03:04:08,834 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-12 03:04:08,835 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-12 03:04:08,835 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-12 03:04:08,836 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:04:08" (1/1) ... [2022-07-12 03:04:08,842 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-12 03:04:08,853 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 03:04:08,872 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) [2022-07-12 03:04:08,899 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 [2022-07-12 03:04:08,914 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-12 03:04:08,915 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-12 03:04:08,915 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-12 03:04:08,915 INFO L130 BoogieDeclarations]: Found specification of procedure __fpclassify_double [2022-07-12 03:04:08,915 INFO L138 BoogieDeclarations]: Found implementation of procedure __fpclassify_double [2022-07-12 03:04:08,915 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2022-07-12 03:04:08,915 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-12 03:04:08,916 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-12 03:04:08,916 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-12 03:04:08,916 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-12 03:04:08,998 INFO L234 CfgBuilder]: Building ICFG [2022-07-12 03:04:09,000 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-12 03:04:09,157 INFO L275 CfgBuilder]: Performing block encoding [2022-07-12 03:04:09,162 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-12 03:04:09,162 INFO L299 CfgBuilder]: Removed 4 assume(true) statements. [2022-07-12 03:04:09,164 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 03:04:09 BoogieIcfgContainer [2022-07-12 03:04:09,164 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-12 03:04:09,165 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-12 03:04:09,166 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-12 03:04:09,169 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-12 03:04:09,169 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.07 03:04:08" (1/3) ... [2022-07-12 03:04:09,169 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3218a482 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.07 03:04:09, skipping insertion in model container [2022-07-12 03:04:09,170 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:04:08" (2/3) ... [2022-07-12 03:04:09,170 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3218a482 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.07 03:04:09, skipping insertion in model container [2022-07-12 03:04:09,170 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 03:04:09" (3/3) ... [2022-07-12 03:04:09,171 INFO L111 eAbstractionObserver]: Analyzing ICFG double_req_bl_1252a.c [2022-07-12 03:04:09,184 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-12 03:04:09,185 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-12 03:04:09,257 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-12 03:04:09,263 INFO L357 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, mAutomataTypeConcurrency=PETRI_NET, 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, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@579693d1, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@711cdfbb [2022-07-12 03:04:09,263 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-12 03:04:09,269 INFO L276 IsEmpty]: Start isEmpty. Operand has 31 states, 26 states have (on average 1.5384615384615385) internal successors, (40), 27 states have internal predecessors, (40), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-12 03:04:09,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-07-12 03:04:09,291 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 03:04:09,292 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 03:04:09,292 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 03:04:09,306 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 03:04:09,306 INFO L85 PathProgramCache]: Analyzing trace with hash -1634587165, now seen corresponding path program 1 times [2022-07-12 03:04:09,315 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 03:04:09,316 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1643723186] [2022-07-12 03:04:09,316 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:04:09,317 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 03:04:09,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:04:09,502 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 03:04:09,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:04:09,523 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 03:04:09,524 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 03:04:09,525 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1643723186] [2022-07-12 03:04:09,526 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1643723186] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 03:04:09,527 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 03:04:09,527 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-12 03:04:09,529 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [976841223] [2022-07-12 03:04:09,530 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 03:04:09,534 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-12 03:04:09,534 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 03:04:09,558 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-12 03:04:09,559 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 03:04:09,561 INFO L87 Difference]: Start difference. First operand has 31 states, 26 states have (on average 1.5384615384615385) internal successors, (40), 27 states have internal predecessors, (40), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-12 03:04:09,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 03:04:09,623 INFO L93 Difference]: Finished difference Result 59 states and 86 transitions. [2022-07-12 03:04:09,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-12 03:04:09,627 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2022-07-12 03:04:09,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 03:04:09,633 INFO L225 Difference]: With dead ends: 59 [2022-07-12 03:04:09,634 INFO L226 Difference]: Without dead ends: 28 [2022-07-12 03:04:09,637 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 03:04:09,645 INFO L413 NwaCegarLoop]: 38 mSDtfsCounter, 1 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 71 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 03:04:09,646 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 71 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 03:04:09,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2022-07-12 03:04:09,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2022-07-12 03:04:09,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 24 states have (on average 1.3333333333333333) internal successors, (32), 24 states have internal predecessors, (32), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-12 03:04:09,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 36 transitions. [2022-07-12 03:04:09,693 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 36 transitions. Word has length 14 [2022-07-12 03:04:09,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 03:04:09,694 INFO L495 AbstractCegarLoop]: Abstraction has 28 states and 36 transitions. [2022-07-12 03:04:09,696 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-12 03:04:09,696 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 36 transitions. [2022-07-12 03:04:09,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-07-12 03:04:09,699 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 03:04:09,699 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 03:04:09,700 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-12 03:04:09,700 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 03:04:09,702 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 03:04:09,703 INFO L85 PathProgramCache]: Analyzing trace with hash -1992797582, now seen corresponding path program 1 times [2022-07-12 03:04:09,703 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 03:04:09,703 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1171953777] [2022-07-12 03:04:09,703 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:04:09,704 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 03:04:09,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:04:09,819 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 03:04:09,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:04:09,905 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 03:04:09,905 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 03:04:09,906 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1171953777] [2022-07-12 03:04:09,907 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1171953777] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 03:04:09,907 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 03:04:09,907 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-12 03:04:09,908 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1671217832] [2022-07-12 03:04:09,908 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 03:04:09,909 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-12 03:04:09,910 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 03:04:09,910 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-12 03:04:09,911 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-12 03:04:09,911 INFO L87 Difference]: Start difference. First operand 28 states and 36 transitions. Second operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-12 03:04:09,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 03:04:09,975 INFO L93 Difference]: Finished difference Result 41 states and 51 transitions. [2022-07-12 03:04:09,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-12 03:04:09,976 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2022-07-12 03:04:09,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 03:04:09,979 INFO L225 Difference]: With dead ends: 41 [2022-07-12 03:04:09,979 INFO L226 Difference]: Without dead ends: 32 [2022-07-12 03:04:09,979 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-12 03:04:09,981 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 1 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 118 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 03:04:09,981 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 118 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-12 03:04:09,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2022-07-12 03:04:09,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2022-07-12 03:04:09,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 27 states have (on average 1.2962962962962963) internal successors, (35), 27 states have internal predecessors, (35), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2022-07-12 03:04:09,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 41 transitions. [2022-07-12 03:04:09,992 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 41 transitions. Word has length 15 [2022-07-12 03:04:09,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 03:04:09,993 INFO L495 AbstractCegarLoop]: Abstraction has 32 states and 41 transitions. [2022-07-12 03:04:09,993 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-12 03:04:09,993 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 41 transitions. [2022-07-12 03:04:09,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-07-12 03:04:09,994 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 03:04:09,995 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 03:04:09,995 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-12 03:04:09,995 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 03:04:09,996 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 03:04:09,996 INFO L85 PathProgramCache]: Analyzing trace with hash -118167546, now seen corresponding path program 1 times [2022-07-12 03:04:09,996 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 03:04:09,997 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [757968492] [2022-07-12 03:04:09,997 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:04:09,997 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 03:04:10,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:04:10,049 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 03:04:10,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:04:10,109 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 03:04:10,110 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 03:04:10,110 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [757968492] [2022-07-12 03:04:10,110 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [757968492] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 03:04:10,111 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 03:04:10,111 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-12 03:04:10,111 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1476248806] [2022-07-12 03:04:10,111 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 03:04:10,112 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-12 03:04:10,112 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 03:04:10,112 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-12 03:04:10,113 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-12 03:04:10,113 INFO L87 Difference]: Start difference. First operand 32 states and 41 transitions. Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-12 03:04:10,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 03:04:10,159 INFO L93 Difference]: Finished difference Result 45 states and 56 transitions. [2022-07-12 03:04:10,160 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-12 03:04:10,161 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2022-07-12 03:04:10,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 03:04:10,162 INFO L225 Difference]: With dead ends: 45 [2022-07-12 03:04:10,163 INFO L226 Difference]: Without dead ends: 36 [2022-07-12 03:04:10,164 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-12 03:04:10,166 INFO L413 NwaCegarLoop]: 38 mSDtfsCounter, 1 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 134 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 03:04:10,168 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 134 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 03:04:10,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2022-07-12 03:04:10,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 32. [2022-07-12 03:04:10,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 27 states have (on average 1.2962962962962963) internal successors, (35), 27 states have internal predecessors, (35), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2022-07-12 03:04:10,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 41 transitions. [2022-07-12 03:04:10,180 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 41 transitions. Word has length 16 [2022-07-12 03:04:10,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 03:04:10,181 INFO L495 AbstractCegarLoop]: Abstraction has 32 states and 41 transitions. [2022-07-12 03:04:10,181 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-12 03:04:10,181 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 41 transitions. [2022-07-12 03:04:10,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-07-12 03:04:10,182 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 03:04:10,182 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 03:04:10,183 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-12 03:04:10,183 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 03:04:10,184 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 03:04:10,184 INFO L85 PathProgramCache]: Analyzing trace with hash -774061834, now seen corresponding path program 1 times [2022-07-12 03:04:10,188 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 03:04:10,188 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1532951452] [2022-07-12 03:04:10,188 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:04:10,189 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 03:04:10,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:04:10,254 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 03:04:10,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:04:10,296 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 03:04:10,298 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 03:04:10,298 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1532951452] [2022-07-12 03:04:10,298 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1532951452] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 03:04:10,298 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 03:04:10,299 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-12 03:04:10,299 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1431258881] [2022-07-12 03:04:10,299 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 03:04:10,300 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-12 03:04:10,300 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 03:04:10,301 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-12 03:04:10,301 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-12 03:04:10,302 INFO L87 Difference]: Start difference. First operand 32 states and 41 transitions. Second operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-12 03:04:10,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 03:04:10,338 INFO L93 Difference]: Finished difference Result 45 states and 56 transitions. [2022-07-12 03:04:10,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-12 03:04:10,339 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2022-07-12 03:04:10,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 03:04:10,340 INFO L225 Difference]: With dead ends: 45 [2022-07-12 03:04:10,340 INFO L226 Difference]: Without dead ends: 36 [2022-07-12 03:04:10,341 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-12 03:04:10,342 INFO L413 NwaCegarLoop]: 38 mSDtfsCounter, 1 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 134 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 03:04:10,343 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 134 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 03:04:10,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2022-07-12 03:04:10,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 32. [2022-07-12 03:04:10,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 27 states have (on average 1.2962962962962963) internal successors, (35), 27 states have internal predecessors, (35), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2022-07-12 03:04:10,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 41 transitions. [2022-07-12 03:04:10,349 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 41 transitions. Word has length 17 [2022-07-12 03:04:10,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 03:04:10,349 INFO L495 AbstractCegarLoop]: Abstraction has 32 states and 41 transitions. [2022-07-12 03:04:10,350 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-12 03:04:10,350 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 41 transitions. [2022-07-12 03:04:10,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-07-12 03:04:10,351 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 03:04:10,351 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 03:04:10,351 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-12 03:04:10,351 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 03:04:10,352 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 03:04:10,352 INFO L85 PathProgramCache]: Analyzing trace with hash 1728168458, now seen corresponding path program 1 times [2022-07-12 03:04:10,352 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 03:04:10,352 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [847674828] [2022-07-12 03:04:10,353 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:04:10,353 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 03:04:10,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:04:10,404 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 03:04:10,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:04:10,471 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 03:04:10,471 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 03:04:10,471 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [847674828] [2022-07-12 03:04:10,471 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [847674828] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 03:04:10,472 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 03:04:10,472 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-12 03:04:10,472 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [815247940] [2022-07-12 03:04:10,472 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 03:04:10,472 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-12 03:04:10,473 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 03:04:10,473 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-12 03:04:10,473 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-12 03:04:10,473 INFO L87 Difference]: Start difference. First operand 32 states and 41 transitions. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-12 03:04:10,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 03:04:10,503 INFO L93 Difference]: Finished difference Result 45 states and 56 transitions. [2022-07-12 03:04:10,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-12 03:04:10,503 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 18 [2022-07-12 03:04:10,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 03:04:10,504 INFO L225 Difference]: With dead ends: 45 [2022-07-12 03:04:10,504 INFO L226 Difference]: Without dead ends: 36 [2022-07-12 03:04:10,505 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-12 03:04:10,506 INFO L413 NwaCegarLoop]: 38 mSDtfsCounter, 1 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 134 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 03:04:10,506 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 134 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 03:04:10,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2022-07-12 03:04:10,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 32. [2022-07-12 03:04:10,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 27 states have (on average 1.2962962962962963) internal successors, (35), 27 states have internal predecessors, (35), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2022-07-12 03:04:10,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 41 transitions. [2022-07-12 03:04:10,512 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 41 transitions. Word has length 18 [2022-07-12 03:04:10,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 03:04:10,512 INFO L495 AbstractCegarLoop]: Abstraction has 32 states and 41 transitions. [2022-07-12 03:04:10,512 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-12 03:04:10,512 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 41 transitions. [2022-07-12 03:04:10,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-07-12 03:04:10,513 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 03:04:10,513 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 03:04:10,513 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-07-12 03:04:10,514 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 03:04:10,514 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 03:04:10,514 INFO L85 PathProgramCache]: Analyzing trace with hash -79286005, now seen corresponding path program 1 times [2022-07-12 03:04:10,514 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 03:04:10,514 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [889764780] [2022-07-12 03:04:10,515 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:04:10,515 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 03:04:10,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-12 03:04:10,543 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-12 03:04:10,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-12 03:04:10,593 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-12 03:04:10,594 INFO L271 BasicCegarLoop]: Counterexample is feasible [2022-07-12 03:04:10,595 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-07-12 03:04:10,596 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-07-12 03:04:10,605 INFO L356 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2022-07-12 03:04:10,608 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-07-12 03:04:10,653 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.07 03:04:10 BoogieIcfgContainer [2022-07-12 03:04:10,653 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-07-12 03:04:10,654 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-07-12 03:04:10,654 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-07-12 03:04:10,655 INFO L275 PluginConnector]: Witness Printer initialized [2022-07-12 03:04:10,655 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 03:04:09" (3/4) ... [2022-07-12 03:04:10,658 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-07-12 03:04:10,658 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-07-12 03:04:10,659 INFO L158 Benchmark]: Toolchain (without parser) took 2249.63ms. Allocated memory was 94.4MB in the beginning and 138.4MB in the end (delta: 44.0MB). Free memory was 57.1MB in the beginning and 89.3MB in the end (delta: -32.2MB). Peak memory consumption was 10.7MB. Max. memory is 16.1GB. [2022-07-12 03:04:10,659 INFO L158 Benchmark]: CDTParser took 0.33ms. Allocated memory is still 94.4MB. Free memory is still 73.5MB. There was no memory consumed. Max. memory is 16.1GB. [2022-07-12 03:04:10,660 INFO L158 Benchmark]: CACSL2BoogieTranslator took 313.47ms. Allocated memory is still 94.4MB. Free memory was 57.0MB in the beginning and 70.3MB in the end (delta: -13.3MB). Peak memory consumption was 5.7MB. Max. memory is 16.1GB. [2022-07-12 03:04:10,660 INFO L158 Benchmark]: Boogie Procedure Inliner took 52.32ms. Allocated memory is still 94.4MB. Free memory was 70.3MB in the beginning and 68.7MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-12 03:04:10,660 INFO L158 Benchmark]: Boogie Preprocessor took 53.17ms. Allocated memory is still 94.4MB. Free memory was 68.7MB in the beginning and 67.2MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-12 03:04:10,661 INFO L158 Benchmark]: RCFGBuilder took 330.18ms. Allocated memory is still 94.4MB. Free memory was 67.2MB in the beginning and 55.4MB in the end (delta: 11.9MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2022-07-12 03:04:10,661 INFO L158 Benchmark]: TraceAbstraction took 1487.93ms. Allocated memory was 94.4MB in the beginning and 138.4MB in the end (delta: 44.0MB). Free memory was 54.9MB in the beginning and 90.0MB in the end (delta: -35.2MB). Peak memory consumption was 11.3MB. Max. memory is 16.1GB. [2022-07-12 03:04:10,661 INFO L158 Benchmark]: Witness Printer took 3.98ms. Allocated memory is still 138.4MB. Free memory was 90.0MB in the beginning and 89.3MB in the end (delta: 715.6kB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-12 03:04:10,664 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.33ms. Allocated memory is still 94.4MB. Free memory is still 73.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 313.47ms. Allocated memory is still 94.4MB. Free memory was 57.0MB in the beginning and 70.3MB in the end (delta: -13.3MB). Peak memory consumption was 5.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 52.32ms. Allocated memory is still 94.4MB. Free memory was 70.3MB in the beginning and 68.7MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 53.17ms. Allocated memory is still 94.4MB. Free memory was 68.7MB in the beginning and 67.2MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 330.18ms. Allocated memory is still 94.4MB. Free memory was 67.2MB in the beginning and 55.4MB in the end (delta: 11.9MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * TraceAbstraction took 1487.93ms. Allocated memory was 94.4MB in the beginning and 138.4MB in the end (delta: 44.0MB). Free memory was 54.9MB in the beginning and 90.0MB in the end (delta: -35.2MB). Peak memory consumption was 11.3MB. Max. memory is 16.1GB. * Witness Printer took 3.98ms. Allocated memory is still 138.4MB. Free memory was 90.0MB in the beginning and 89.3MB in the end (delta: 715.6kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 87]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 86, overapproximation of someUnaryDOUBLEoperation at line 81. Possible FailurePath: [L81] double x = -0.0; [L82] double y = 0.0; [L83] CALL, EXPR fmax_double(x, y) [L54] CALL, EXPR __fpclassify_double(x) VAL [\old(x)=4294967298] [L26] __uint32_t msw, lsw; VAL [\old(x)=4294967298, x=4294967298] [L29] ieee_double_shape_type ew_u; [L30] ew_u.value = (x) [L31] EXPR ew_u.parts.msw [L31] (msw) = ew_u.parts.msw [L32] EXPR ew_u.parts.lsw [L32] (lsw) = ew_u.parts.lsw [L35-L36] COND FALSE !((msw == 0x00000000 && lsw == 0x00000000) || (msw == 0x80000000 && lsw == 0x00000000)) VAL [\old(x)=4294967298, lsw=4294967297, msw=4293918721, x=4294967298] [L38-L39] COND FALSE !((msw >= 0x00100000 && msw <= 0x7fefffff) || (msw >= 0x80100000 && msw <= 0xffefffff)) VAL [\old(x)=4294967298, lsw=4294967297, msw=4293918721, x=4294967298] [L41-L42] COND FALSE !(( msw <= 0x000fffff) || (msw >= 0x80000000 && msw <= 0x800fffff)) VAL [\old(x)=4294967298, lsw=4294967297, msw=4293918721, x=4294967298] [L45-L46] COND FALSE !((msw == 0x7ff00000 && lsw == 0x00000000) || (msw == 0xfff00000 && lsw == 0x00000000)) [L49] return 0; VAL [\old(x)=4294967298, \result=0, lsw=4294967297, msw=4293918721, x=4294967298] [L54] RET, EXPR __fpclassify_double(x) VAL [\old(x)=4294967298, \old(y)=0, __fpclassify_double(x)=0, x=4294967298, y=0] [L54] COND TRUE __fpclassify_double(x) == 0 [L55] return y; VAL [\old(x)=4294967298, \old(y)=0, \result=0, x=4294967298, y=0] [L83] RET, EXPR fmax_double(x, y) [L83] double res = fmax_double(x, y); [L86] EXPR res == 0.0 && __signbit_double(res) == 0 VAL [res=0, res == 0.0 && __signbit_double(res) == 0=0, x=4294967298, y=0] [L86] COND TRUE !(res == 0.0 && __signbit_double(res) == 0) [L87] reach_error() VAL [res=0, x=4294967298, y=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 31 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.4s, OverallIterations: 6, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 5 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 5 mSDsluCounter, 591 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 406 mSDsCounter, 5 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 95 IncrementalHoareTripleChecker+Invalid, 100 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 5 mSolverCounterUnsat, 185 mSDtfsCounter, 95 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 29 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=32occurred in iteration=2, InterpolantAutomatonStates: 23, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 5 MinimizatonAttempts, 12 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.5s InterpolantComputationTime, 98 NumberOfCodeBlocks, 98 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 75 ConstructedInterpolants, 0 QuantifiedInterpolants, 207 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 [2022-07-12 03:04:10,716 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... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/float-newlib/double_req_bl_1252a.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 2743c9c1eae15f6a9812481781d831b3850f89be91644ec8a207d83f9a71b29e --- Real Ultimate output --- This is Ultimate 0.2.2-?-6c24879 [2022-07-12 03:04:12,718 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-12 03:04:12,721 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-12 03:04:12,775 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-12 03:04:12,776 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-12 03:04:12,777 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-12 03:04:12,784 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-12 03:04:12,787 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-12 03:04:12,790 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-12 03:04:12,794 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-12 03:04:12,796 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-12 03:04:12,800 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-12 03:04:12,801 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-12 03:04:12,803 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-12 03:04:12,804 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-12 03:04:12,807 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-12 03:04:12,808 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-12 03:04:12,810 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-12 03:04:12,812 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-12 03:04:12,817 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-12 03:04:12,818 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-12 03:04:12,819 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-12 03:04:12,822 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-12 03:04:12,823 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-12 03:04:12,825 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-12 03:04:12,832 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-12 03:04:12,833 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-12 03:04:12,833 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-12 03:04:12,834 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-12 03:04:12,834 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-12 03:04:12,835 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-12 03:04:12,835 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-12 03:04:12,838 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-12 03:04:12,838 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-12 03:04:12,840 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-12 03:04:12,841 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-12 03:04:12,841 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-12 03:04:12,842 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-12 03:04:12,842 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-12 03:04:12,842 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-12 03:04:12,843 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-12 03:04:12,844 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-12 03:04:12,849 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2022-07-12 03:04:12,886 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-12 03:04:12,887 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-12 03:04:12,887 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-12 03:04:12,888 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-12 03:04:12,888 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-12 03:04:12,889 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-12 03:04:12,889 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-12 03:04:12,890 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-12 03:04:12,890 INFO L138 SettingsManager]: * Use SBE=true [2022-07-12 03:04:12,891 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-12 03:04:12,891 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-12 03:04:12,891 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-12 03:04:12,891 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-12 03:04:12,892 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-12 03:04:12,892 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-12 03:04:12,892 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-12 03:04:12,892 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-07-12 03:04:12,892 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-07-12 03:04:12,893 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-07-12 03:04:12,893 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-12 03:04:12,893 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-12 03:04:12,893 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-12 03:04:12,893 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-12 03:04:12,894 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-12 03:04:12,894 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-12 03:04:12,894 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-12 03:04:12,894 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-12 03:04:12,894 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-12 03:04:12,895 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-12 03:04:12,895 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-12 03:04:12,895 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-07-12 03:04:12,895 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-07-12 03:04:12,896 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-12 03:04:12,896 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-12 03:04:12,896 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-12 03:04:12,896 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-07-12 03:04:12,897 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 -> 2743c9c1eae15f6a9812481781d831b3850f89be91644ec8a207d83f9a71b29e [2022-07-12 03:04:13,243 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-12 03:04:13,262 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-12 03:04:13,264 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-12 03:04:13,265 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-12 03:04:13,265 INFO L275 PluginConnector]: CDTParser initialized [2022-07-12 03:04:13,267 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/float-newlib/double_req_bl_1252a.c [2022-07-12 03:04:13,340 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3e38ee2c3/ee90868a367646279a1a4c28df1a277f/FLAGfcb61392e [2022-07-12 03:04:13,818 INFO L306 CDTParser]: Found 1 translation units. [2022-07-12 03:04:13,819 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/double_req_bl_1252a.c [2022-07-12 03:04:13,830 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3e38ee2c3/ee90868a367646279a1a4c28df1a277f/FLAGfcb61392e [2022-07-12 03:04:14,344 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3e38ee2c3/ee90868a367646279a1a4c28df1a277f [2022-07-12 03:04:14,346 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-12 03:04:14,347 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-12 03:04:14,350 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-12 03:04:14,350 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-12 03:04:14,354 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-12 03:04:14,355 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.07 03:04:14" (1/1) ... [2022-07-12 03:04:14,356 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@43368b0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:04:14, skipping insertion in model container [2022-07-12 03:04:14,356 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.07 03:04:14" (1/1) ... [2022-07-12 03:04:14,363 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-12 03:04:14,379 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-12 03:04:14,503 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/double_req_bl_1252a.c[2154,2167] [2022-07-12 03:04:14,540 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-12 03:04:14,559 INFO L203 MainTranslator]: Completed pre-run [2022-07-12 03:04:14,599 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/double_req_bl_1252a.c[2154,2167] [2022-07-12 03:04:14,602 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-12 03:04:14,619 INFO L208 MainTranslator]: Completed translation [2022-07-12 03:04:14,620 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:04:14 WrapperNode [2022-07-12 03:04:14,620 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-12 03:04:14,621 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-12 03:04:14,621 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-12 03:04:14,621 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-12 03:04:14,627 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:04:14" (1/1) ... [2022-07-12 03:04:14,645 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:04:14" (1/1) ... [2022-07-12 03:04:14,671 INFO L137 Inliner]: procedures = 21, calls = 20, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 65 [2022-07-12 03:04:14,672 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-12 03:04:14,673 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-12 03:04:14,673 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-12 03:04:14,674 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-12 03:04:14,681 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:04:14" (1/1) ... [2022-07-12 03:04:14,682 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:04:14" (1/1) ... [2022-07-12 03:04:14,691 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:04:14" (1/1) ... [2022-07-12 03:04:14,692 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:04:14" (1/1) ... [2022-07-12 03:04:14,711 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:04:14" (1/1) ... [2022-07-12 03:04:14,715 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:04:14" (1/1) ... [2022-07-12 03:04:14,722 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:04:14" (1/1) ... [2022-07-12 03:04:14,724 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-12 03:04:14,725 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-12 03:04:14,725 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-12 03:04:14,725 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-12 03:04:14,726 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:04:14" (1/1) ... [2022-07-12 03:04:14,734 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-12 03:04:14,743 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 03:04:14,761 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) [2022-07-12 03:04:14,782 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 [2022-07-12 03:04:14,799 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-12 03:04:14,799 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8 [2022-07-12 03:04:14,799 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-07-12 03:04:14,800 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-12 03:04:14,800 INFO L130 BoogieDeclarations]: Found specification of procedure __fpclassify_double [2022-07-12 03:04:14,800 INFO L138 BoogieDeclarations]: Found implementation of procedure __fpclassify_double [2022-07-12 03:04:14,800 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2022-07-12 03:04:14,800 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-12 03:04:14,801 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-12 03:04:14,801 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-12 03:04:14,889 INFO L234 CfgBuilder]: Building ICFG [2022-07-12 03:04:14,891 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-12 03:04:15,141 INFO L275 CfgBuilder]: Performing block encoding [2022-07-12 03:04:15,146 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-12 03:04:15,147 INFO L299 CfgBuilder]: Removed 4 assume(true) statements. [2022-07-12 03:04:15,148 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 03:04:15 BoogieIcfgContainer [2022-07-12 03:04:15,153 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-12 03:04:15,155 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-12 03:04:15,155 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-12 03:04:15,180 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-12 03:04:15,180 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.07 03:04:14" (1/3) ... [2022-07-12 03:04:15,181 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@11e8aeec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.07 03:04:15, skipping insertion in model container [2022-07-12 03:04:15,181 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:04:14" (2/3) ... [2022-07-12 03:04:15,181 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@11e8aeec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.07 03:04:15, skipping insertion in model container [2022-07-12 03:04:15,182 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 03:04:15" (3/3) ... [2022-07-12 03:04:15,183 INFO L111 eAbstractionObserver]: Analyzing ICFG double_req_bl_1252a.c [2022-07-12 03:04:15,202 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-12 03:04:15,203 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-12 03:04:15,268 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-12 03:04:15,282 INFO L357 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, mAutomataTypeConcurrency=PETRI_NET, 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, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@7ade4f52, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@7172c362 [2022-07-12 03:04:15,282 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-12 03:04:15,286 INFO L276 IsEmpty]: Start isEmpty. Operand has 29 states, 24 states have (on average 1.5833333333333333) internal successors, (38), 25 states have internal predecessors, (38), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-12 03:04:15,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-07-12 03:04:15,294 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 03:04:15,294 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 03:04:15,295 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 03:04:15,301 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 03:04:15,302 INFO L85 PathProgramCache]: Analyzing trace with hash 1130952206, now seen corresponding path program 1 times [2022-07-12 03:04:15,312 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 03:04:15,313 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1304852194] [2022-07-12 03:04:15,313 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:04:15,314 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 03:04:15,314 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 03:04:15,323 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) [2022-07-12 03:04:15,329 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2022-07-12 03:04:15,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:04:15,425 INFO L263 TraceCheckSpWp]: Trace formula consists of 41 conjuncts, 1 conjunts are in the unsatisfiable core [2022-07-12 03:04:15,429 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 03:04:15,452 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 03:04:15,452 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 03:04:15,453 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 03:04:15,454 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1304852194] [2022-07-12 03:04:15,455 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1304852194] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 03:04:15,455 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 03:04:15,456 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-12 03:04:15,459 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1270355140] [2022-07-12 03:04:15,459 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 03:04:15,464 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-07-12 03:04:15,465 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 03:04:15,495 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-07-12 03:04:15,496 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-12 03:04:15,498 INFO L87 Difference]: Start difference. First operand has 29 states, 24 states have (on average 1.5833333333333333) internal successors, (38), 25 states have internal predecessors, (38), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-12 03:04:15,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 03:04:15,523 INFO L93 Difference]: Finished difference Result 55 states and 82 transitions. [2022-07-12 03:04:15,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-07-12 03:04:15,525 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2022-07-12 03:04:15,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 03:04:15,532 INFO L225 Difference]: With dead ends: 55 [2022-07-12 03:04:15,532 INFO L226 Difference]: Without dead ends: 26 [2022-07-12 03:04:15,535 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-12 03:04:15,544 INFO L413 NwaCegarLoop]: 37 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 03:04:15,546 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 03:04:15,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2022-07-12 03:04:15,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2022-07-12 03:04:15,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 22 states have (on average 1.3636363636363635) internal successors, (30), 22 states have internal predecessors, (30), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-12 03:04:15,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 34 transitions. [2022-07-12 03:04:15,587 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 34 transitions. Word has length 13 [2022-07-12 03:04:15,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 03:04:15,588 INFO L495 AbstractCegarLoop]: Abstraction has 26 states and 34 transitions. [2022-07-12 03:04:15,588 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-12 03:04:15,588 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 34 transitions. [2022-07-12 03:04:15,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-07-12 03:04:15,590 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 03:04:15,590 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 03:04:15,603 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2022-07-12 03:04:15,800 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 03:04:15,801 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 03:04:15,802 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 03:04:15,802 INFO L85 PathProgramCache]: Analyzing trace with hash 1285201507, now seen corresponding path program 1 times [2022-07-12 03:04:15,802 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 03:04:15,803 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1052764132] [2022-07-12 03:04:15,804 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:04:15,804 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 03:04:15,804 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 03:04:15,806 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) [2022-07-12 03:04:15,830 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2022-07-12 03:04:15,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:04:15,863 INFO L263 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-12 03:04:15,864 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 03:04:15,909 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 03:04:15,909 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 03:04:15,909 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 03:04:15,909 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1052764132] [2022-07-12 03:04:15,910 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1052764132] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 03:04:15,910 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 03:04:15,910 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-12 03:04:15,910 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [524904677] [2022-07-12 03:04:15,910 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 03:04:15,916 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-12 03:04:15,916 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 03:04:15,918 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-12 03:04:15,918 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-12 03:04:15,920 INFO L87 Difference]: Start difference. First operand 26 states and 34 transitions. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-12 03:04:15,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 03:04:15,976 INFO L93 Difference]: Finished difference Result 38 states and 48 transitions. [2022-07-12 03:04:15,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-12 03:04:15,977 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2022-07-12 03:04:15,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 03:04:15,985 INFO L225 Difference]: With dead ends: 38 [2022-07-12 03:04:15,985 INFO L226 Difference]: Without dead ends: 29 [2022-07-12 03:04:15,986 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-12 03:04:15,988 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 0 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 90 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 03:04:15,989 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 90 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 03:04:15,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2022-07-12 03:04:15,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2022-07-12 03:04:15,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 24 states have (on average 1.3333333333333333) internal successors, (32), 24 states have internal predecessors, (32), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2022-07-12 03:04:15,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 38 transitions. [2022-07-12 03:04:15,997 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 38 transitions. Word has length 14 [2022-07-12 03:04:15,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 03:04:15,997 INFO L495 AbstractCegarLoop]: Abstraction has 29 states and 38 transitions. [2022-07-12 03:04:15,998 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-12 03:04:15,998 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 38 transitions. [2022-07-12 03:04:15,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-07-12 03:04:15,999 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 03:04:15,999 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 03:04:16,012 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2022-07-12 03:04:16,209 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 03:04:16,210 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 03:04:16,211 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 03:04:16,211 INFO L85 PathProgramCache]: Analyzing trace with hash 1497908235, now seen corresponding path program 1 times [2022-07-12 03:04:16,211 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 03:04:16,211 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1706761414] [2022-07-12 03:04:16,212 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:04:16,212 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 03:04:16,212 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 03:04:16,213 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) [2022-07-12 03:04:16,215 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2022-07-12 03:04:16,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:04:16,280 INFO L263 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 11 conjunts are in the unsatisfiable core [2022-07-12 03:04:16,283 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 03:04:16,542 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 03:04:16,542 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 03:04:16,543 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 03:04:16,543 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1706761414] [2022-07-12 03:04:16,543 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1706761414] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 03:04:16,543 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 03:04:16,543 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-12 03:04:16,544 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [741452043] [2022-07-12 03:04:16,544 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 03:04:16,544 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 03:04:16,544 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 03:04:16,545 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 03:04:16,545 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-12 03:04:16,545 INFO L87 Difference]: Start difference. First operand 29 states and 38 transitions. Second operand has 6 states, 5 states have (on average 2.6) internal successors, (13), 6 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-12 03:04:16,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 03:04:16,631 INFO L93 Difference]: Finished difference Result 56 states and 73 transitions. [2022-07-12 03:04:16,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-12 03:04:16,632 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.6) internal successors, (13), 6 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2022-07-12 03:04:16,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 03:04:16,633 INFO L225 Difference]: With dead ends: 56 [2022-07-12 03:04:16,633 INFO L226 Difference]: Without dead ends: 31 [2022-07-12 03:04:16,634 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-07-12 03:04:16,635 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 18 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 102 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 25 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 03:04:16,635 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 102 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 25 Unchecked, 0.1s Time] [2022-07-12 03:04:16,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2022-07-12 03:04:16,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2022-07-12 03:04:16,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 25 states have (on average 1.32) internal successors, (33), 26 states have internal predecessors, (33), 2 states have call successors, (2), 1 states have call predecessors, (2), 3 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2022-07-12 03:04:16,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 40 transitions. [2022-07-12 03:04:16,642 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 40 transitions. Word has length 15 [2022-07-12 03:04:16,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 03:04:16,642 INFO L495 AbstractCegarLoop]: Abstraction has 31 states and 40 transitions. [2022-07-12 03:04:16,642 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.6) internal successors, (13), 6 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-12 03:04:16,642 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 40 transitions. [2022-07-12 03:04:16,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-07-12 03:04:16,643 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 03:04:16,643 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 03:04:16,658 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2022-07-12 03:04:16,854 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 03:04:16,854 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 03:04:16,855 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 03:04:16,855 INFO L85 PathProgramCache]: Analyzing trace with hash -2116811041, now seen corresponding path program 1 times [2022-07-12 03:04:16,855 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 03:04:16,856 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1710179443] [2022-07-12 03:04:16,856 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:04:16,856 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 03:04:16,856 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 03:04:16,857 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) [2022-07-12 03:04:16,859 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2022-07-12 03:04:16,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:04:16,911 INFO L263 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-12 03:04:16,912 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 03:04:16,929 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 03:04:16,930 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 03:04:16,930 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 03:04:16,930 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1710179443] [2022-07-12 03:04:16,930 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1710179443] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 03:04:16,930 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 03:04:16,930 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-12 03:04:16,931 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [59511434] [2022-07-12 03:04:16,931 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 03:04:16,931 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-12 03:04:16,931 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 03:04:16,932 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-12 03:04:16,932 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-12 03:04:16,932 INFO L87 Difference]: Start difference. First operand 31 states and 40 transitions. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-12 03:04:17,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 03:04:17,045 INFO L93 Difference]: Finished difference Result 43 states and 54 transitions. [2022-07-12 03:04:17,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-12 03:04:17,046 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2022-07-12 03:04:17,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 03:04:17,047 INFO L225 Difference]: With dead ends: 43 [2022-07-12 03:04:17,047 INFO L226 Difference]: Without dead ends: 34 [2022-07-12 03:04:17,048 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-12 03:04:17,049 INFO L413 NwaCegarLoop]: 37 mSDtfsCounter, 0 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 99 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 03:04:17,049 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 99 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-12 03:04:17,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2022-07-12 03:04:17,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 31. [2022-07-12 03:04:17,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 25 states have (on average 1.32) internal successors, (33), 26 states have internal predecessors, (33), 2 states have call successors, (2), 1 states have call predecessors, (2), 3 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2022-07-12 03:04:17,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 40 transitions. [2022-07-12 03:04:17,055 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 40 transitions. Word has length 16 [2022-07-12 03:04:17,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 03:04:17,055 INFO L495 AbstractCegarLoop]: Abstraction has 31 states and 40 transitions. [2022-07-12 03:04:17,059 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-12 03:04:17,060 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 40 transitions. [2022-07-12 03:04:17,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-07-12 03:04:17,061 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 03:04:17,062 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 03:04:17,070 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2022-07-12 03:04:17,267 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 03:04:17,268 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 03:04:17,269 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 03:04:17,269 INFO L85 PathProgramCache]: Analyzing trace with hash 172315143, now seen corresponding path program 1 times [2022-07-12 03:04:17,270 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 03:04:17,270 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [347751038] [2022-07-12 03:04:17,270 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:04:17,270 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 03:04:17,271 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 03:04:17,274 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) [2022-07-12 03:04:17,280 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2022-07-12 03:04:17,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:04:17,342 INFO L263 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 11 conjunts are in the unsatisfiable core [2022-07-12 03:04:17,344 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 03:04:17,513 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 03:04:17,513 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 03:04:17,514 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 03:04:17,514 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [347751038] [2022-07-12 03:04:17,514 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [347751038] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 03:04:17,514 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 03:04:17,514 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-12 03:04:17,514 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1059846916] [2022-07-12 03:04:17,514 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 03:04:17,515 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 03:04:17,515 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 03:04:17,515 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 03:04:17,516 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-12 03:04:17,516 INFO L87 Difference]: Start difference. First operand 31 states and 40 transitions. Second operand has 6 states, 5 states have (on average 3.0) internal successors, (15), 6 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-12 03:04:17,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 03:04:17,668 INFO L93 Difference]: Finished difference Result 57 states and 72 transitions. [2022-07-12 03:04:17,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-12 03:04:17,672 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.0) internal successors, (15), 6 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2022-07-12 03:04:17,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 03:04:17,673 INFO L225 Difference]: With dead ends: 57 [2022-07-12 03:04:17,673 INFO L226 Difference]: Without dead ends: 30 [2022-07-12 03:04:17,673 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-07-12 03:04:17,674 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 18 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 88 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 25 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 03:04:17,675 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 88 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 25 Unchecked, 0.1s Time] [2022-07-12 03:04:17,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2022-07-12 03:04:17,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 28. [2022-07-12 03:04:17,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 23 states have (on average 1.3043478260869565) internal successors, (30), 24 states have internal predecessors, (30), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-07-12 03:04:17,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 35 transitions. [2022-07-12 03:04:17,679 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 35 transitions. Word has length 17 [2022-07-12 03:04:17,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 03:04:17,679 INFO L495 AbstractCegarLoop]: Abstraction has 28 states and 35 transitions. [2022-07-12 03:04:17,680 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.0) internal successors, (15), 6 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-12 03:04:17,680 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 35 transitions. [2022-07-12 03:04:17,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-07-12 03:04:17,680 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 03:04:17,680 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 03:04:17,698 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2022-07-12 03:04:17,894 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 03:04:17,895 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 03:04:17,896 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 03:04:17,896 INFO L85 PathProgramCache]: Analyzing trace with hash -1943218574, now seen corresponding path program 1 times [2022-07-12 03:04:17,896 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 03:04:17,896 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1748073426] [2022-07-12 03:04:17,896 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:04:17,896 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 03:04:17,897 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 03:04:17,898 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) [2022-07-12 03:04:17,901 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2022-07-12 03:04:17,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:04:17,961 INFO L263 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-12 03:04:17,962 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 03:04:17,976 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-07-12 03:04:17,976 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 03:04:17,976 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 03:04:17,976 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1748073426] [2022-07-12 03:04:17,976 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1748073426] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 03:04:17,976 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 03:04:17,977 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-12 03:04:17,977 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1935481420] [2022-07-12 03:04:17,977 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 03:04:17,977 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-12 03:04:17,977 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 03:04:17,978 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-12 03:04:17,978 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-12 03:04:17,978 INFO L87 Difference]: Start difference. First operand 28 states and 35 transitions. Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-12 03:04:18,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 03:04:18,144 INFO L93 Difference]: Finished difference Result 40 states and 49 transitions. [2022-07-12 03:04:18,144 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-12 03:04:18,145 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 22 [2022-07-12 03:04:18,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 03:04:18,145 INFO L225 Difference]: With dead ends: 40 [2022-07-12 03:04:18,145 INFO L226 Difference]: Without dead ends: 31 [2022-07-12 03:04:18,146 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-12 03:04:18,146 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 0 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 87 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-12 03:04:18,147 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 87 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-12 03:04:18,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2022-07-12 03:04:18,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2022-07-12 03:04:18,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 25 states have (on average 1.28) internal successors, (32), 26 states have internal predecessors, (32), 2 states have call successors, (2), 1 states have call predecessors, (2), 3 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2022-07-12 03:04:18,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 39 transitions. [2022-07-12 03:04:18,152 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 39 transitions. Word has length 22 [2022-07-12 03:04:18,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 03:04:18,152 INFO L495 AbstractCegarLoop]: Abstraction has 31 states and 39 transitions. [2022-07-12 03:04:18,153 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-12 03:04:18,153 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 39 transitions. [2022-07-12 03:04:18,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-07-12 03:04:18,154 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 03:04:18,154 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 03:04:18,163 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2022-07-12 03:04:18,359 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 03:04:18,360 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 03:04:18,360 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 03:04:18,360 INFO L85 PathProgramCache]: Analyzing trace with hash -1682849308, now seen corresponding path program 1 times [2022-07-12 03:04:18,360 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 03:04:18,360 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1069225501] [2022-07-12 03:04:18,361 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:04:18,361 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 03:04:18,361 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 03:04:18,362 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) [2022-07-12 03:04:18,363 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2022-07-12 03:04:18,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:04:18,425 INFO L263 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 11 conjunts are in the unsatisfiable core [2022-07-12 03:04:18,427 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 03:04:18,603 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-12 03:04:18,603 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 03:04:18,604 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 03:04:18,604 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1069225501] [2022-07-12 03:04:18,604 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1069225501] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 03:04:18,605 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 03:04:18,605 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-12 03:04:18,605 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1687267567] [2022-07-12 03:04:18,605 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 03:04:18,606 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 03:04:18,606 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 03:04:18,607 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 03:04:18,607 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-12 03:04:18,607 INFO L87 Difference]: Start difference. First operand 31 states and 39 transitions. Second operand has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-12 03:04:18,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 03:04:18,754 INFO L93 Difference]: Finished difference Result 45 states and 55 transitions. [2022-07-12 03:04:18,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-12 03:04:18,760 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 23 [2022-07-12 03:04:18,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 03:04:18,761 INFO L225 Difference]: With dead ends: 45 [2022-07-12 03:04:18,761 INFO L226 Difference]: Without dead ends: 31 [2022-07-12 03:04:18,762 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-07-12 03:04:18,762 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 16 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 102 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 19 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 03:04:18,763 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 102 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 19 Unchecked, 0.1s Time] [2022-07-12 03:04:18,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2022-07-12 03:04:18,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2022-07-12 03:04:18,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 25 states have (on average 1.24) internal successors, (31), 26 states have internal predecessors, (31), 2 states have call successors, (2), 1 states have call predecessors, (2), 3 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2022-07-12 03:04:18,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 38 transitions. [2022-07-12 03:04:18,767 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 38 transitions. Word has length 23 [2022-07-12 03:04:18,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 03:04:18,767 INFO L495 AbstractCegarLoop]: Abstraction has 31 states and 38 transitions. [2022-07-12 03:04:18,767 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-12 03:04:18,767 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 38 transitions. [2022-07-12 03:04:18,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-07-12 03:04:18,768 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 03:04:18,768 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 03:04:18,781 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2022-07-12 03:04:18,981 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 03:04:18,981 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 03:04:18,982 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 03:04:18,982 INFO L85 PathProgramCache]: Analyzing trace with hash 474937390, now seen corresponding path program 1 times [2022-07-12 03:04:18,982 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 03:04:18,982 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1553764295] [2022-07-12 03:04:18,982 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:04:18,982 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 03:04:18,983 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 03:04:18,984 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) [2022-07-12 03:04:18,985 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2022-07-12 03:04:19,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:04:19,056 INFO L263 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-12 03:04:19,058 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 03:04:19,072 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-07-12 03:04:19,073 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 03:04:19,073 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 03:04:19,073 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1553764295] [2022-07-12 03:04:19,073 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1553764295] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 03:04:19,073 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 03:04:19,074 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-12 03:04:19,074 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [422921262] [2022-07-12 03:04:19,074 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 03:04:19,074 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-12 03:04:19,074 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 03:04:19,075 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-12 03:04:19,075 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-12 03:04:19,075 INFO L87 Difference]: Start difference. First operand 31 states and 38 transitions. Second operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-12 03:04:19,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 03:04:19,360 INFO L93 Difference]: Finished difference Result 41 states and 49 transitions. [2022-07-12 03:04:19,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-12 03:04:19,360 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 24 [2022-07-12 03:04:19,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 03:04:19,361 INFO L225 Difference]: With dead ends: 41 [2022-07-12 03:04:19,361 INFO L226 Difference]: Without dead ends: 32 [2022-07-12 03:04:19,361 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-12 03:04:19,362 INFO L413 NwaCegarLoop]: 35 mSDtfsCounter, 0 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 94 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-12 03:04:19,363 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 94 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-12 03:04:19,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2022-07-12 03:04:19,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 29. [2022-07-12 03:04:19,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 24 states have (on average 1.25) internal successors, (30), 24 states have internal predecessors, (30), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-07-12 03:04:19,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 35 transitions. [2022-07-12 03:04:19,367 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 35 transitions. Word has length 24 [2022-07-12 03:04:19,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 03:04:19,367 INFO L495 AbstractCegarLoop]: Abstraction has 29 states and 35 transitions. [2022-07-12 03:04:19,367 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-12 03:04:19,367 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 35 transitions. [2022-07-12 03:04:19,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-07-12 03:04:19,368 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 03:04:19,368 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 03:04:19,381 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2022-07-12 03:04:19,578 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 03:04:19,579 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 03:04:19,579 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 03:04:19,579 INFO L85 PathProgramCache]: Analyzing trace with hash -1777787178, now seen corresponding path program 1 times [2022-07-12 03:04:19,579 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 03:04:19,579 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1084857502] [2022-07-12 03:04:19,579 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:04:19,580 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 03:04:19,580 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 03:04:19,581 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) [2022-07-12 03:04:19,582 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2022-07-12 03:04:19,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:04:19,663 INFO L263 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 8 conjunts are in the unsatisfiable core [2022-07-12 03:04:19,665 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 03:04:19,721 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-07-12 03:04:19,722 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 03:04:19,722 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 03:04:19,722 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1084857502] [2022-07-12 03:04:19,722 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1084857502] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 03:04:19,723 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 03:04:19,723 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-12 03:04:19,723 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [412679920] [2022-07-12 03:04:19,723 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 03:04:19,724 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 03:04:19,724 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 03:04:19,724 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 03:04:19,725 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-12 03:04:19,725 INFO L87 Difference]: Start difference. First operand 29 states and 35 transitions. Second operand has 6 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-12 03:04:19,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 03:04:19,829 INFO L93 Difference]: Finished difference Result 42 states and 47 transitions. [2022-07-12 03:04:19,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-12 03:04:19,830 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 24 [2022-07-12 03:04:19,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 03:04:19,834 INFO L225 Difference]: With dead ends: 42 [2022-07-12 03:04:19,834 INFO L226 Difference]: Without dead ends: 39 [2022-07-12 03:04:19,835 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2022-07-12 03:04:19,835 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 34 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 114 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 03:04:19,835 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 114 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-12 03:04:19,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2022-07-12 03:04:19,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 32. [2022-07-12 03:04:19,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 27 states have (on average 1.2222222222222223) internal successors, (33), 27 states have internal predecessors, (33), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-07-12 03:04:19,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 38 transitions. [2022-07-12 03:04:19,840 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 38 transitions. Word has length 24 [2022-07-12 03:04:19,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 03:04:19,840 INFO L495 AbstractCegarLoop]: Abstraction has 32 states and 38 transitions. [2022-07-12 03:04:19,840 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-12 03:04:19,840 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 38 transitions. [2022-07-12 03:04:19,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-07-12 03:04:19,841 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 03:04:19,841 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 03:04:19,854 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2022-07-12 03:04:20,051 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 03:04:20,052 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 03:04:20,052 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 03:04:20,052 INFO L85 PathProgramCache]: Analyzing trace with hash -1835045480, now seen corresponding path program 1 times [2022-07-12 03:04:20,053 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 03:04:20,053 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2072364647] [2022-07-12 03:04:20,053 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:04:20,053 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 03:04:20,053 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 03:04:20,054 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) [2022-07-12 03:04:20,058 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2022-07-12 03:04:20,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:04:20,125 INFO L263 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 7 conjunts are in the unsatisfiable core [2022-07-12 03:04:20,127 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 03:04:20,172 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-07-12 03:04:20,172 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 03:04:20,173 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 03:04:20,173 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2072364647] [2022-07-12 03:04:20,173 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2072364647] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 03:04:20,173 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 03:04:20,173 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-12 03:04:20,173 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [632751678] [2022-07-12 03:04:20,173 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 03:04:20,174 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-12 03:04:20,174 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 03:04:20,174 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-12 03:04:20,174 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 03:04:20,174 INFO L87 Difference]: Start difference. First operand 32 states and 38 transitions. Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-12 03:04:20,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 03:04:20,190 INFO L93 Difference]: Finished difference Result 41 states and 47 transitions. [2022-07-12 03:04:20,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-12 03:04:20,190 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 24 [2022-07-12 03:04:20,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 03:04:20,191 INFO L225 Difference]: With dead ends: 41 [2022-07-12 03:04:20,191 INFO L226 Difference]: Without dead ends: 31 [2022-07-12 03:04:20,191 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 03:04:20,192 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 12 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 03:04:20,192 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 41 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 03:04:20,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2022-07-12 03:04:20,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2022-07-12 03:04:20,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 26 states have (on average 1.1923076923076923) internal successors, (31), 26 states have internal predecessors, (31), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-07-12 03:04:20,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 36 transitions. [2022-07-12 03:04:20,196 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 36 transitions. Word has length 24 [2022-07-12 03:04:20,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 03:04:20,196 INFO L495 AbstractCegarLoop]: Abstraction has 31 states and 36 transitions. [2022-07-12 03:04:20,196 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-12 03:04:20,197 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 36 transitions. [2022-07-12 03:04:20,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-07-12 03:04:20,197 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 03:04:20,197 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 03:04:20,207 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2022-07-12 03:04:20,407 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 03:04:20,407 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 03:04:20,408 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 03:04:20,408 INFO L85 PathProgramCache]: Analyzing trace with hash 1323122336, now seen corresponding path program 1 times [2022-07-12 03:04:20,408 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 03:04:20,408 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [130162921] [2022-07-12 03:04:20,408 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:04:20,408 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 03:04:20,408 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 03:04:20,409 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) [2022-07-12 03:04:20,410 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2022-07-12 03:04:20,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:04:20,480 INFO L263 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 11 conjunts are in the unsatisfiable core [2022-07-12 03:04:20,482 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 03:04:20,580 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-12 03:04:20,580 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 03:04:20,580 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 03:04:20,580 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [130162921] [2022-07-12 03:04:20,581 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [130162921] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 03:04:20,581 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 03:04:20,581 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-12 03:04:20,581 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [910879766] [2022-07-12 03:04:20,581 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 03:04:20,582 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 03:04:20,582 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 03:04:20,582 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 03:04:20,582 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-12 03:04:20,583 INFO L87 Difference]: Start difference. First operand 31 states and 36 transitions. Second operand has 6 states, 6 states have (on average 3.5) internal successors, (21), 6 states have internal predecessors, (21), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-12 03:04:20,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 03:04:20,612 INFO L93 Difference]: Finished difference Result 42 states and 46 transitions. [2022-07-12 03:04:20,615 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-12 03:04:20,616 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), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 25 [2022-07-12 03:04:20,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 03:04:20,616 INFO L225 Difference]: With dead ends: 42 [2022-07-12 03:04:20,616 INFO L226 Difference]: Without dead ends: 25 [2022-07-12 03:04:20,617 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-07-12 03:04:20,617 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 14 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 84 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 16 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 03:04:20,617 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 84 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 16 Unchecked, 0.0s Time] [2022-07-12 03:04:20,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2022-07-12 03:04:20,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2022-07-12 03:04:20,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 21 states have (on average 1.0476190476190477) internal successors, (22), 21 states have internal predecessors, (22), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-12 03:04:20,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 26 transitions. [2022-07-12 03:04:20,621 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 26 transitions. Word has length 25 [2022-07-12 03:04:20,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 03:04:20,621 INFO L495 AbstractCegarLoop]: Abstraction has 25 states and 26 transitions. [2022-07-12 03:04:20,621 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.5) internal successors, (21), 6 states have internal predecessors, (21), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-12 03:04:20,621 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 26 transitions. [2022-07-12 03:04:20,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-07-12 03:04:20,621 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 03:04:20,622 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 03:04:20,634 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (12)] Forceful destruction successful, exit code 0 [2022-07-12 03:04:20,822 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 03:04:20,822 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 03:04:20,823 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 03:04:20,823 INFO L85 PathProgramCache]: Analyzing trace with hash 2065734315, now seen corresponding path program 1 times [2022-07-12 03:04:20,823 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 03:04:20,823 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1769826791] [2022-07-12 03:04:20,823 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:04:20,823 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 03:04:20,824 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 03:04:20,825 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) [2022-07-12 03:04:20,826 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2022-07-12 03:04:20,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:04:20,911 INFO L263 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 17 conjunts are in the unsatisfiable core [2022-07-12 03:04:20,913 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 03:04:21,040 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-07-12 03:04:21,040 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 03:04:21,040 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 03:04:21,040 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1769826791] [2022-07-12 03:04:21,040 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1769826791] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 03:04:21,040 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 03:04:21,040 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-07-12 03:04:21,041 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1258334832] [2022-07-12 03:04:21,041 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 03:04:21,041 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-12 03:04:21,041 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 03:04:21,041 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-12 03:04:21,042 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2022-07-12 03:04:21,042 INFO L87 Difference]: Start difference. First operand 25 states and 26 transitions. Second operand has 10 states, 10 states have (on average 1.9) internal successors, (19), 10 states have internal predecessors, (19), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-12 03:04:21,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 03:04:21,166 INFO L93 Difference]: Finished difference Result 25 states and 26 transitions. [2022-07-12 03:04:21,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-12 03:04:21,166 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 1.9) internal successors, (19), 10 states have internal predecessors, (19), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 28 [2022-07-12 03:04:21,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 03:04:21,167 INFO L225 Difference]: With dead ends: 25 [2022-07-12 03:04:21,167 INFO L226 Difference]: Without dead ends: 0 [2022-07-12 03:04:21,167 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=56, Invalid=184, Unknown=0, NotChecked=0, Total=240 [2022-07-12 03:04:21,168 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 18 mSDsluCounter, 113 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 130 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 7 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 03:04:21,168 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 130 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 39 Invalid, 0 Unknown, 7 Unchecked, 0.0s Time] [2022-07-12 03:04:21,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-07-12 03:04:21,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-07-12 03:04:21,169 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) [2022-07-12 03:04:21,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-07-12 03:04:21,169 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 28 [2022-07-12 03:04:21,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 03:04:21,169 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-07-12 03:04:21,169 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 1.9) internal successors, (19), 10 states have internal predecessors, (19), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-12 03:04:21,169 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-07-12 03:04:21,169 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-07-12 03:04:21,172 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-07-12 03:04:21,187 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (13)] Forceful destruction successful, exit code 0 [2022-07-12 03:04:21,388 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 03:04:21,390 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-07-12 03:04:21,490 INFO L899 garLoopResultBuilder]: For program point __fpclassify_doubleFINAL(lines 25 50) no Hoare annotation was computed. [2022-07-12 03:04:21,490 INFO L902 garLoopResultBuilder]: At program point __fpclassify_doubleENTRY(lines 25 50) the Hoare annotation is: true [2022-07-12 03:04:21,490 INFO L899 garLoopResultBuilder]: For program point L38(lines 38 49) no Hoare annotation was computed. [2022-07-12 03:04:21,490 INFO L899 garLoopResultBuilder]: For program point L28-1(lines 28 33) no Hoare annotation was computed. [2022-07-12 03:04:21,490 INFO L895 garLoopResultBuilder]: At program point L28-2(lines 28 33) the Hoare annotation is: (= |__fpclassify_double_#in~x| __fpclassify_double_~x) [2022-07-12 03:04:21,490 INFO L899 garLoopResultBuilder]: For program point L28-3(lines 25 50) no Hoare annotation was computed. [2022-07-12 03:04:21,490 INFO L899 garLoopResultBuilder]: For program point __fpclassify_doubleEXIT(lines 25 50) no Hoare annotation was computed. [2022-07-12 03:04:21,490 INFO L899 garLoopResultBuilder]: For program point L45(lines 45 49) no Hoare annotation was computed. [2022-07-12 03:04:21,490 INFO L899 garLoopResultBuilder]: For program point L41(lines 41 49) no Hoare annotation was computed. [2022-07-12 03:04:21,491 INFO L895 garLoopResultBuilder]: At program point L56(line 56) the Hoare annotation is: (and (= |ULTIMATE.start_fmax_double_~x#1| (fp.neg (_ +zero 11 53))) (= (_ +zero 11 53) |ULTIMATE.start_fmax_double_~y#1|)) [2022-07-12 03:04:21,491 INFO L899 garLoopResultBuilder]: For program point L56-1(lines 56 57) no Hoare annotation was computed. [2022-07-12 03:04:21,491 INFO L899 garLoopResultBuilder]: For program point L65-1(lines 65 69) no Hoare annotation was computed. [2022-07-12 03:04:21,491 INFO L899 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2022-07-12 03:04:21,491 INFO L895 garLoopResultBuilder]: At program point L65-2(lines 65 69) the Hoare annotation is: (and (= |ULTIMATE.start_fmax_double_~x#1| (fp.neg (_ +zero 11 53))) |ULTIMATE.start_main_#t~short12#1| (= (_ +zero 11 53) |ULTIMATE.start_fmax_double_~y#1|) (= |ULTIMATE.start_main_~res~0#1| (_ +zero 11 53)) (= (_ +zero 11 53) |ULTIMATE.start_fmax_double_#res#1|) (= (_ +zero 11 53) |ULTIMATE.start___signbit_double_~x#1|)) [2022-07-12 03:04:21,491 INFO L899 garLoopResultBuilder]: For program point L65-3(lines 65 69) no Hoare annotation was computed. [2022-07-12 03:04:21,491 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2022-07-12 03:04:21,491 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-07-12 03:04:21,491 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 87) no Hoare annotation was computed. [2022-07-12 03:04:21,491 INFO L899 garLoopResultBuilder]: For program point L86(line 86) no Hoare annotation was computed. [2022-07-12 03:04:21,491 INFO L899 garLoopResultBuilder]: For program point L86-2(lines 86 89) no Hoare annotation was computed. [2022-07-12 03:04:21,492 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-07-12 03:04:21,492 INFO L902 garLoopResultBuilder]: At program point L91(lines 74 92) the Hoare annotation is: true [2022-07-12 03:04:21,492 INFO L899 garLoopResultBuilder]: For program point L87(line 87) no Hoare annotation was computed. [2022-07-12 03:04:21,492 INFO L895 garLoopResultBuilder]: At program point L54(line 54) the Hoare annotation is: (and (= |ULTIMATE.start_fmax_double_~x#1| (fp.neg (_ +zero 11 53))) (= (_ +zero 11 53) |ULTIMATE.start_fmax_double_~y#1|)) [2022-07-12 03:04:21,492 INFO L899 garLoopResultBuilder]: For program point L54-1(lines 54 55) no Hoare annotation was computed. [2022-07-12 03:04:21,492 INFO L895 garLoopResultBuilder]: At program point L71(lines 62 72) the Hoare annotation is: (and (= |ULTIMATE.start_fmax_double_~x#1| (fp.neg (_ +zero 11 53))) |ULTIMATE.start_main_#t~short12#1| (= (_ +zero 11 53) |ULTIMATE.start_fmax_double_~y#1|) (= (_ bv0 32) |ULTIMATE.start___signbit_double_#res#1|)) [2022-07-12 03:04:21,492 INFO L899 garLoopResultBuilder]: For program point L59(line 59) no Hoare annotation was computed. [2022-07-12 03:04:21,492 INFO L899 garLoopResultBuilder]: For program point L59-2(line 59) no Hoare annotation was computed. [2022-07-12 03:04:21,492 INFO L895 garLoopResultBuilder]: At program point L59-3(lines 52 60) the Hoare annotation is: (and (= |ULTIMATE.start_fmax_double_~x#1| (fp.neg (_ +zero 11 53))) (= (_ +zero 11 53) |ULTIMATE.start_fmax_double_~y#1|) (= (_ +zero 11 53) |ULTIMATE.start_fmax_double_#res#1|)) [2022-07-12 03:04:21,495 INFO L356 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 03:04:21,497 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-07-12 03:04:21,512 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.07 03:04:21 BoogieIcfgContainer [2022-07-12 03:04:21,514 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-07-12 03:04:21,515 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-07-12 03:04:21,515 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-07-12 03:04:21,515 INFO L275 PluginConnector]: Witness Printer initialized [2022-07-12 03:04:21,516 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 03:04:15" (3/4) ... [2022-07-12 03:04:21,519 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-07-12 03:04:21,525 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __fpclassify_double [2022-07-12 03:04:21,529 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 20 nodes and edges [2022-07-12 03:04:21,529 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 9 nodes and edges [2022-07-12 03:04:21,529 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2022-07-12 03:04:21,530 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-07-12 03:04:21,550 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: \old(x) == x [2022-07-12 03:04:21,550 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (x == ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE()) && ~Pluszero~LONGDOUBLE() == y) && ~Pluszero~LONGDOUBLE() == \result [2022-07-12 03:04:21,551 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((x == ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE()) && aux-res == 0.0 && __signbit_double(res) == 0-aux) && ~Pluszero~LONGDOUBLE() == y) && res == ~Pluszero~LONGDOUBLE()) && ~Pluszero~LONGDOUBLE() == \result) && ~Pluszero~LONGDOUBLE() == x [2022-07-12 03:04:21,551 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((x == ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE()) && aux-res == 0.0 && __signbit_double(res) == 0-aux) && ~Pluszero~LONGDOUBLE() == y) && 0bv32 == \result [2022-07-12 03:04:21,563 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2022-07-12 03:04:21,564 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-07-12 03:04:21,564 INFO L158 Benchmark]: Toolchain (without parser) took 7217.43ms. Allocated memory was 65.0MB in the beginning and 79.7MB in the end (delta: 14.7MB). Free memory was 45.1MB in the beginning and 39.1MB in the end (delta: 6.0MB). Peak memory consumption was 20.8MB. Max. memory is 16.1GB. [2022-07-12 03:04:21,565 INFO L158 Benchmark]: CDTParser took 0.29ms. Allocated memory is still 65.0MB. Free memory was 46.9MB in the beginning and 46.8MB in the end (delta: 48.6kB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-12 03:04:21,565 INFO L158 Benchmark]: CACSL2BoogieTranslator took 270.28ms. Allocated memory is still 65.0MB. Free memory was 44.9MB in the beginning and 47.0MB in the end (delta: -2.0MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2022-07-12 03:04:21,565 INFO L158 Benchmark]: Boogie Procedure Inliner took 50.83ms. Allocated memory is still 65.0MB. Free memory was 46.8MB in the beginning and 45.2MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-12 03:04:21,566 INFO L158 Benchmark]: Boogie Preprocessor took 51.66ms. Allocated memory is still 65.0MB. Free memory was 45.2MB in the beginning and 43.7MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-12 03:04:21,566 INFO L158 Benchmark]: RCFGBuilder took 428.42ms. Allocated memory is still 65.0MB. Free memory was 43.7MB in the beginning and 31.6MB in the end (delta: 12.2MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2022-07-12 03:04:21,567 INFO L158 Benchmark]: TraceAbstraction took 6359.14ms. Allocated memory was 65.0MB in the beginning and 79.7MB in the end (delta: 14.7MB). Free memory was 31.2MB in the beginning and 42.6MB in the end (delta: -11.4MB). Peak memory consumption was 5.4MB. Max. memory is 16.1GB. [2022-07-12 03:04:21,567 INFO L158 Benchmark]: Witness Printer took 49.21ms. Allocated memory is still 79.7MB. Free memory was 42.6MB in the beginning and 39.1MB in the end (delta: 3.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-07-12 03:04:21,571 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.29ms. Allocated memory is still 65.0MB. Free memory was 46.9MB in the beginning and 46.8MB in the end (delta: 48.6kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 270.28ms. Allocated memory is still 65.0MB. Free memory was 44.9MB in the beginning and 47.0MB in the end (delta: -2.0MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 50.83ms. Allocated memory is still 65.0MB. Free memory was 46.8MB in the beginning and 45.2MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 51.66ms. Allocated memory is still 65.0MB. Free memory was 45.2MB in the beginning and 43.7MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 428.42ms. Allocated memory is still 65.0MB. Free memory was 43.7MB in the beginning and 31.6MB in the end (delta: 12.2MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * TraceAbstraction took 6359.14ms. Allocated memory was 65.0MB in the beginning and 79.7MB in the end (delta: 14.7MB). Free memory was 31.2MB in the beginning and 42.6MB in the end (delta: -11.4MB). Peak memory consumption was 5.4MB. Max. memory is 16.1GB. * Witness Printer took 49.21ms. Allocated memory is still 79.7MB. Free memory was 42.6MB in the beginning and 39.1MB in the end (delta: 3.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 87]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 29 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 6.2s, OverallIterations: 12, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.1s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 136 SdHoareTripleChecker+Valid, 1.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 130 mSDsluCounter, 1068 SdHoareTripleChecker+Invalid, 0.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 92 IncrementalHoareTripleChecker+Unchecked, 718 mSDsCounter, 5 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 155 IncrementalHoareTripleChecker+Invalid, 252 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 5 mSolverCounterUnsat, 350 mSDtfsCounter, 155 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 247 GetRequests, 196 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=32occurred in iteration=9, InterpolantAutomatonStates: 66, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 12 MinimizatonAttempts, 15 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 8 LocationsWithAnnotation, 16 PreInvPairs, 23 NumberOfFragments, 62 HoareAnnotationTreeSize, 16 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 8 FomulaSimplificationsInter, 43 FormulaSimplificationTreeSizeReductionInter, 0.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 245 NumberOfCodeBlocks, 245 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 233 ConstructedInterpolants, 26 QuantifiedInterpolants, 869 SizeOfPredicates, 46 NumberOfNonLiveVariables, 891 ConjunctsInSsa, 89 ConjunctsInUnsatCore, 12 InterpolantComputations, 12 PerfectInterpolantSequences, 42/42 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 62]: Loop Invariant Derived loop invariant: ((x == ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE()) && aux-res == 0.0 && __signbit_double(res) == 0-aux) && ~Pluszero~LONGDOUBLE() == y) && 0bv32 == \result - InvariantResult [Line: 65]: Loop Invariant Derived loop invariant: ((((x == ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE()) && aux-res == 0.0 && __signbit_double(res) == 0-aux) && ~Pluszero~LONGDOUBLE() == y) && res == ~Pluszero~LONGDOUBLE()) && ~Pluszero~LONGDOUBLE() == \result) && ~Pluszero~LONGDOUBLE() == x - InvariantResult [Line: 74]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 52]: Loop Invariant Derived loop invariant: (x == ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE()) && ~Pluszero~LONGDOUBLE() == y) && ~Pluszero~LONGDOUBLE() == \result - InvariantResult [Line: 28]: Loop Invariant Derived loop invariant: \old(x) == x RESULT: Ultimate proved your program to be correct! [2022-07-12 03:04:21,627 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... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE