./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/float-newlib/double_req_bl_1231b.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 839c364b 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_1231b.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 b9ce4e199e47d30d5336dd9ca9dceb5f51006e4e1d59090b80d072b498beba7b --- Real Ultimate output --- This is Ultimate 0.2.2-839c364b5d67a0f615c82cb70ab247790648d4a9-839c364 [2021-12-14 13:27:09,607 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-14 13:27:09,609 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-14 13:27:09,642 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-14 13:27:09,642 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-14 13:27:09,644 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-14 13:27:09,645 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-14 13:27:09,647 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-14 13:27:09,648 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-14 13:27:09,651 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-14 13:27:09,652 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-14 13:27:09,653 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-14 13:27:09,653 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-14 13:27:09,655 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-14 13:27:09,656 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-14 13:27:09,658 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-14 13:27:09,659 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-14 13:27:09,659 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-14 13:27:09,661 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-14 13:27:09,664 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-14 13:27:09,665 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-14 13:27:09,666 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-14 13:27:09,667 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-14 13:27:09,668 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-14 13:27:09,672 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-14 13:27:09,672 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-14 13:27:09,672 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-14 13:27:09,674 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-14 13:27:09,674 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-14 13:27:09,674 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-14 13:27:09,675 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-14 13:27:09,675 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-14 13:27:09,676 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-14 13:27:09,677 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-14 13:27:09,678 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-14 13:27:09,678 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-14 13:27:09,678 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-14 13:27:09,679 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-14 13:27:09,679 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-14 13:27:09,679 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-14 13:27:09,680 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-14 13:27:09,680 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2021-12-14 13:27:09,703 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-14 13:27:09,703 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-14 13:27:09,704 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-14 13:27:09,704 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-14 13:27:09,704 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-14 13:27:09,704 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-14 13:27:09,705 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-14 13:27:09,705 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-14 13:27:09,705 INFO L138 SettingsManager]: * Use SBE=true [2021-12-14 13:27:09,705 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-14 13:27:09,706 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-14 13:27:09,706 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-14 13:27:09,706 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-14 13:27:09,706 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-14 13:27:09,707 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-12-14 13:27:09,707 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-14 13:27:09,707 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-12-14 13:27:09,707 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-14 13:27:09,707 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-12-14 13:27:09,707 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-14 13:27:09,708 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-12-14 13:27:09,708 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-14 13:27:09,708 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-14 13:27:09,708 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-14 13:27:09,708 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-14 13:27:09,708 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-14 13:27:09,708 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-14 13:27:09,709 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-12-14 13:27:09,709 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-14 13:27:09,710 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-12-14 13:27:09,710 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-12-14 13:27:09,710 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-12-14 13:27:09,710 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-12-14 13:27:09,710 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-14 13:27:09,711 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 -> b9ce4e199e47d30d5336dd9ca9dceb5f51006e4e1d59090b80d072b498beba7b [2021-12-14 13:27:09,911 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-14 13:27:09,939 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-14 13:27:09,941 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-14 13:27:09,943 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-14 13:27:09,943 INFO L275 PluginConnector]: CDTParser initialized [2021-12-14 13:27:09,944 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/float-newlib/double_req_bl_1231b.c [2021-12-14 13:27:09,998 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e26276793/1cb6f8a2f5834b61b537785eb878900d/FLAGa8c51cfd0 [2021-12-14 13:27:10,364 INFO L306 CDTParser]: Found 1 translation units. [2021-12-14 13:27:10,364 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/double_req_bl_1231b.c [2021-12-14 13:27:10,369 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e26276793/1cb6f8a2f5834b61b537785eb878900d/FLAGa8c51cfd0 [2021-12-14 13:27:10,739 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e26276793/1cb6f8a2f5834b61b537785eb878900d [2021-12-14 13:27:10,741 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-14 13:27:10,742 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-14 13:27:10,744 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-14 13:27:10,744 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-14 13:27:10,746 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-14 13:27:10,747 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.12 01:27:10" (1/1) ... [2021-12-14 13:27:10,748 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2ff48e09 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 01:27:10, skipping insertion in model container [2021-12-14 13:27:10,748 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.12 01:27:10" (1/1) ... [2021-12-14 13:27:10,756 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-14 13:27:10,769 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-14 13:27:10,921 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_1231b.c[1765,1778] [2021-12-14 13:27:10,932 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-14 13:27:10,938 INFO L203 MainTranslator]: Completed pre-run [2021-12-14 13:27:10,962 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_1231b.c[1765,1778] [2021-12-14 13:27:10,963 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-14 13:27:10,973 INFO L208 MainTranslator]: Completed translation [2021-12-14 13:27:10,974 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 01:27:10 WrapperNode [2021-12-14 13:27:10,974 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-14 13:27:10,975 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-14 13:27:10,975 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-14 13:27:10,975 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-14 13:27:10,980 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 01:27:10" (1/1) ... [2021-12-14 13:27:10,986 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 01:27:10" (1/1) ... [2021-12-14 13:27:11,003 INFO L137 Inliner]: procedures = 18, calls = 16, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 52 [2021-12-14 13:27:11,004 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-14 13:27:11,005 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-14 13:27:11,005 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-14 13:27:11,005 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-14 13:27:11,011 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 01:27:10" (1/1) ... [2021-12-14 13:27:11,011 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 01:27:10" (1/1) ... [2021-12-14 13:27:11,017 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 01:27:10" (1/1) ... [2021-12-14 13:27:11,018 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 01:27:10" (1/1) ... [2021-12-14 13:27:11,036 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 01:27:10" (1/1) ... [2021-12-14 13:27:11,041 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 01:27:10" (1/1) ... [2021-12-14 13:27:11,043 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 01:27:10" (1/1) ... [2021-12-14 13:27:11,053 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-14 13:27:11,054 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-14 13:27:11,054 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-14 13:27:11,054 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-14 13:27:11,055 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 01:27:10" (1/1) ... [2021-12-14 13:27:11,061 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-14 13:27:11,071 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 13:27:11,082 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-12-14 13:27:11,087 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-12-14 13:27:11,115 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-14 13:27:11,116 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-12-14 13:27:11,116 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-12-14 13:27:11,116 INFO L130 BoogieDeclarations]: Found specification of procedure __fpclassify_double [2021-12-14 13:27:11,116 INFO L138 BoogieDeclarations]: Found implementation of procedure __fpclassify_double [2021-12-14 13:27:11,116 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2021-12-14 13:27:11,116 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-14 13:27:11,116 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-14 13:27:11,117 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-12-14 13:27:11,117 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-12-14 13:27:11,164 INFO L236 CfgBuilder]: Building ICFG [2021-12-14 13:27:11,165 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-14 13:27:11,263 INFO L277 CfgBuilder]: Performing block encoding [2021-12-14 13:27:11,275 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-14 13:27:11,275 INFO L301 CfgBuilder]: Removed 2 assume(true) statements. [2021-12-14 13:27:11,277 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 01:27:11 BoogieIcfgContainer [2021-12-14 13:27:11,277 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-14 13:27:11,278 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-12-14 13:27:11,278 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-12-14 13:27:11,281 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-12-14 13:27:11,282 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.12 01:27:10" (1/3) ... [2021-12-14 13:27:11,282 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@133de946 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.12 01:27:11, skipping insertion in model container [2021-12-14 13:27:11,282 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 01:27:10" (2/3) ... [2021-12-14 13:27:11,283 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@133de946 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.12 01:27:11, skipping insertion in model container [2021-12-14 13:27:11,283 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 01:27:11" (3/3) ... [2021-12-14 13:27:11,284 INFO L111 eAbstractionObserver]: Analyzing ICFG double_req_bl_1231b.c [2021-12-14 13:27:11,288 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-12-14 13:27:11,289 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-12-14 13:27:11,342 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-12-14 13:27:11,349 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, 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, mLoopAccelerationTechnique=FAST_UPR [2021-12-14 13:27:11,350 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-12-14 13:27:11,376 INFO L276 IsEmpty]: Start isEmpty. Operand has 29 states, 24 states have (on average 1.5) internal successors, (36), 25 states have internal predecessors, (36), 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) [2021-12-14 13:27:11,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-12-14 13:27:11,380 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 13:27:11,381 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 13:27:11,382 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 13:27:11,389 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 13:27:11,390 INFO L85 PathProgramCache]: Analyzing trace with hash 87468236, now seen corresponding path program 1 times [2021-12-14 13:27:11,397 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 13:27:11,398 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [400334850] [2021-12-14 13:27:11,398 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 13:27:11,400 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 13:27:11,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 13:27:11,576 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-14 13:27:11,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 13:27:11,588 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 13:27:11,589 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 13:27:11,589 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [400334850] [2021-12-14 13:27:11,590 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [400334850] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 13:27:11,590 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 13:27:11,590 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-14 13:27:11,591 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1043136650] [2021-12-14 13:27:11,592 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 13:27:11,595 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-14 13:27:11,596 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 13:27:11,620 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-14 13:27:11,621 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-14 13:27:11,622 INFO L87 Difference]: Start difference. First operand has 29 states, 24 states have (on average 1.5) internal successors, (36), 25 states have internal predecessors, (36), 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.333333333333333) internal successors, (13), 2 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) [2021-12-14 13:27:11,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 13:27:11,670 INFO L93 Difference]: Finished difference Result 53 states and 75 transitions. [2021-12-14 13:27:11,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-14 13:27:11,673 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 2 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 [2021-12-14 13:27:11,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 13:27:11,679 INFO L225 Difference]: With dead ends: 53 [2021-12-14 13:27:11,679 INFO L226 Difference]: Without dead ends: 25 [2021-12-14 13:27:11,686 INFO L932 BasicCegarLoop]: 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 [2021-12-14 13:27:11,689 INFO L933 BasicCegarLoop]: 36 mSDtfsCounter, 1 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-14 13:27:11,691 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1 Valid, 68 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-14 13:27:11,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2021-12-14 13:27:11,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2021-12-14 13:27:11,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 21 states have (on average 1.3333333333333333) internal successors, (28), 21 states have internal predecessors, (28), 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) [2021-12-14 13:27:11,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 32 transitions. [2021-12-14 13:27:11,725 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 32 transitions. Word has length 15 [2021-12-14 13:27:11,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 13:27:11,725 INFO L470 AbstractCegarLoop]: Abstraction has 25 states and 32 transitions. [2021-12-14 13:27:11,726 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 2 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) [2021-12-14 13:27:11,726 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 32 transitions. [2021-12-14 13:27:11,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-12-14 13:27:11,728 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 13:27:11,728 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 13:27:11,728 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-12-14 13:27:11,729 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 13:27:11,729 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 13:27:11,730 INFO L85 PathProgramCache]: Analyzing trace with hash -1072117413, now seen corresponding path program 1 times [2021-12-14 13:27:11,730 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 13:27:11,730 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [72723007] [2021-12-14 13:27:11,730 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 13:27:11,730 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 13:27:11,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 13:27:11,820 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-14 13:27:11,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 13:27:11,858 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 13:27:11,859 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 13:27:11,859 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [72723007] [2021-12-14 13:27:11,859 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [72723007] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 13:27:11,859 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 13:27:11,859 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-14 13:27:11,860 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [579658368] [2021-12-14 13:27:11,860 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 13:27:11,861 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-14 13:27:11,861 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 13:27:11,861 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-14 13:27:11,861 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-14 13:27:11,862 INFO L87 Difference]: Start difference. First operand 25 states and 32 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) [2021-12-14 13:27:11,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 13:27:11,898 INFO L93 Difference]: Finished difference Result 33 states and 41 transitions. [2021-12-14 13:27:11,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-14 13:27:11,899 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 [2021-12-14 13:27:11,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 13:27:11,900 INFO L225 Difference]: With dead ends: 33 [2021-12-14 13:27:11,900 INFO L226 Difference]: Without dead ends: 29 [2021-12-14 13:27:11,900 INFO L932 BasicCegarLoop]: 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 [2021-12-14 13:27:11,901 INFO L933 BasicCegarLoop]: 29 mSDtfsCounter, 1 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 105 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-14 13:27:11,902 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1 Valid, 105 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-14 13:27:11,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2021-12-14 13:27:11,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2021-12-14 13:27:11,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 24 states have (on average 1.2916666666666667) internal successors, (31), 24 states have internal predecessors, (31), 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) [2021-12-14 13:27:11,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 37 transitions. [2021-12-14 13:27:11,907 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 37 transitions. Word has length 16 [2021-12-14 13:27:11,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 13:27:11,907 INFO L470 AbstractCegarLoop]: Abstraction has 29 states and 37 transitions. [2021-12-14 13:27:11,907 INFO L471 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) [2021-12-14 13:27:11,908 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 37 transitions. [2021-12-14 13:27:11,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-12-14 13:27:11,908 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 13:27:11,908 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 13:27:11,909 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-12-14 13:27:11,909 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 13:27:11,909 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 13:27:11,909 INFO L85 PathProgramCache]: Analyzing trace with hash 1361378825, now seen corresponding path program 1 times [2021-12-14 13:27:11,909 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 13:27:11,910 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [373601693] [2021-12-14 13:27:11,910 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 13:27:11,910 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 13:27:11,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 13:27:11,945 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-14 13:27:11,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 13:27:11,964 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 13:27:11,964 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 13:27:11,964 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [373601693] [2021-12-14 13:27:11,964 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [373601693] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 13:27:11,965 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 13:27:11,965 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-14 13:27:11,965 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [615234012] [2021-12-14 13:27:11,965 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 13:27:11,965 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-14 13:27:11,966 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 13:27:11,966 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-14 13:27:11,966 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-14 13:27:11,966 INFO L87 Difference]: Start difference. First operand 29 states and 37 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) [2021-12-14 13:27:11,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 13:27:11,984 INFO L93 Difference]: Finished difference Result 37 states and 46 transitions. [2021-12-14 13:27:11,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-14 13:27:11,985 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 [2021-12-14 13:27:11,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 13:27:11,985 INFO L225 Difference]: With dead ends: 37 [2021-12-14 13:27:11,985 INFO L226 Difference]: Without dead ends: 33 [2021-12-14 13:27:11,986 INFO L932 BasicCegarLoop]: 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 [2021-12-14 13:27:11,987 INFO L933 BasicCegarLoop]: 34 mSDtfsCounter, 1 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 121 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-14 13:27:11,987 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1 Valid, 121 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-14 13:27:11,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2021-12-14 13:27:11,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 29. [2021-12-14 13:27:11,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 24 states have (on average 1.2916666666666667) internal successors, (31), 24 states have internal predecessors, (31), 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) [2021-12-14 13:27:11,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 37 transitions. [2021-12-14 13:27:11,991 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 37 transitions. Word has length 17 [2021-12-14 13:27:11,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 13:27:11,991 INFO L470 AbstractCegarLoop]: Abstraction has 29 states and 37 transitions. [2021-12-14 13:27:11,992 INFO L471 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) [2021-12-14 13:27:11,992 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 37 transitions. [2021-12-14 13:27:11,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-12-14 13:27:11,992 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 13:27:11,992 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 13:27:11,993 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-12-14 13:27:11,993 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 13:27:11,993 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 13:27:11,993 INFO L85 PathProgramCache]: Analyzing trace with hash -2128342377, now seen corresponding path program 1 times [2021-12-14 13:27:11,993 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 13:27:11,994 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [225410931] [2021-12-14 13:27:11,994 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 13:27:11,994 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 13:27:12,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 13:27:12,027 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-14 13:27:12,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 13:27:12,052 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 13:27:12,052 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 13:27:12,052 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [225410931] [2021-12-14 13:27:12,052 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [225410931] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 13:27:12,052 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 13:27:12,052 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-14 13:27:12,053 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [228230247] [2021-12-14 13:27:12,053 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 13:27:12,053 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-14 13:27:12,053 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 13:27:12,054 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-14 13:27:12,054 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-14 13:27:12,054 INFO L87 Difference]: Start difference. First operand 29 states and 37 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) [2021-12-14 13:27:12,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 13:27:12,073 INFO L93 Difference]: Finished difference Result 37 states and 46 transitions. [2021-12-14 13:27:12,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-14 13:27:12,073 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 [2021-12-14 13:27:12,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 13:27:12,074 INFO L225 Difference]: With dead ends: 37 [2021-12-14 13:27:12,074 INFO L226 Difference]: Without dead ends: 33 [2021-12-14 13:27:12,074 INFO L932 BasicCegarLoop]: 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 [2021-12-14 13:27:12,075 INFO L933 BasicCegarLoop]: 34 mSDtfsCounter, 1 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 121 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-14 13:27:12,075 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1 Valid, 121 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-14 13:27:12,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2021-12-14 13:27:12,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 29. [2021-12-14 13:27:12,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 24 states have (on average 1.2916666666666667) internal successors, (31), 24 states have internal predecessors, (31), 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) [2021-12-14 13:27:12,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 37 transitions. [2021-12-14 13:27:12,079 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 37 transitions. Word has length 18 [2021-12-14 13:27:12,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 13:27:12,080 INFO L470 AbstractCegarLoop]: Abstraction has 29 states and 37 transitions. [2021-12-14 13:27:12,080 INFO L471 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) [2021-12-14 13:27:12,080 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 37 transitions. [2021-12-14 13:27:12,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-12-14 13:27:12,081 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 13:27:12,081 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 13:27:12,081 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-12-14 13:27:12,081 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 13:27:12,081 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 13:27:12,082 INFO L85 PathProgramCache]: Analyzing trace with hash -259243195, now seen corresponding path program 1 times [2021-12-14 13:27:12,082 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 13:27:12,082 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1576878241] [2021-12-14 13:27:12,082 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 13:27:12,082 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 13:27:12,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 13:27:12,118 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-14 13:27:12,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 13:27:12,145 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 13:27:12,145 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 13:27:12,145 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1576878241] [2021-12-14 13:27:12,145 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1576878241] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 13:27:12,145 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 13:27:12,146 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-14 13:27:12,146 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1463317844] [2021-12-14 13:27:12,146 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 13:27:12,146 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-14 13:27:12,146 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 13:27:12,147 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-14 13:27:12,147 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-14 13:27:12,147 INFO L87 Difference]: Start difference. First operand 29 states and 37 transitions. Second operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 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) [2021-12-14 13:27:12,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 13:27:12,166 INFO L93 Difference]: Finished difference Result 37 states and 46 transitions. [2021-12-14 13:27:12,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-14 13:27:12,166 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 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 19 [2021-12-14 13:27:12,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 13:27:12,167 INFO L225 Difference]: With dead ends: 37 [2021-12-14 13:27:12,167 INFO L226 Difference]: Without dead ends: 33 [2021-12-14 13:27:12,167 INFO L932 BasicCegarLoop]: 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 [2021-12-14 13:27:12,168 INFO L933 BasicCegarLoop]: 34 mSDtfsCounter, 1 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 121 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-14 13:27:12,169 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1 Valid, 121 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-14 13:27:12,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2021-12-14 13:27:12,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 29. [2021-12-14 13:27:12,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 24 states have (on average 1.2916666666666667) internal successors, (31), 24 states have internal predecessors, (31), 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) [2021-12-14 13:27:12,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 37 transitions. [2021-12-14 13:27:12,173 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 37 transitions. Word has length 19 [2021-12-14 13:27:12,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 13:27:12,173 INFO L470 AbstractCegarLoop]: Abstraction has 29 states and 37 transitions. [2021-12-14 13:27:12,173 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 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) [2021-12-14 13:27:12,173 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 37 transitions. [2021-12-14 13:27:12,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-12-14 13:27:12,174 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 13:27:12,174 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 13:27:12,174 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-12-14 13:27:12,174 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 13:27:12,175 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 13:27:12,175 INFO L85 PathProgramCache]: Analyzing trace with hash 1483567140, now seen corresponding path program 1 times [2021-12-14 13:27:12,175 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 13:27:12,175 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2140913489] [2021-12-14 13:27:12,175 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 13:27:12,175 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 13:27:12,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-14 13:27:12,195 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-14 13:27:12,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-14 13:27:12,218 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-14 13:27:12,218 INFO L628 BasicCegarLoop]: Counterexample is feasible [2021-12-14 13:27:12,219 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2021-12-14 13:27:12,220 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-12-14 13:27:12,222 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2021-12-14 13:27:12,223 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-12-14 13:27:12,240 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.12 01:27:12 BoogieIcfgContainer [2021-12-14 13:27:12,244 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-12-14 13:27:12,244 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-12-14 13:27:12,244 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-12-14 13:27:12,244 INFO L275 PluginConnector]: Witness Printer initialized [2021-12-14 13:27:12,245 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 01:27:11" (3/4) ... [2021-12-14 13:27:12,246 INFO L140 WitnessPrinter]: No result that supports witness generation found [2021-12-14 13:27:12,246 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-12-14 13:27:12,247 INFO L158 Benchmark]: Toolchain (without parser) took 1504.47ms. Allocated memory is still 104.9MB. Free memory was 68.9MB in the beginning and 38.4MB in the end (delta: 30.5MB). Peak memory consumption was 29.3MB. Max. memory is 16.1GB. [2021-12-14 13:27:12,248 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 104.9MB. Free memory is still 84.9MB. There was no memory consumed. Max. memory is 16.1GB. [2021-12-14 13:27:12,248 INFO L158 Benchmark]: CACSL2BoogieTranslator took 230.26ms. Allocated memory is still 104.9MB. Free memory was 68.6MB in the beginning and 80.1MB in the end (delta: -11.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2021-12-14 13:27:12,249 INFO L158 Benchmark]: Boogie Procedure Inliner took 28.99ms. Allocated memory is still 104.9MB. Free memory was 80.1MB in the beginning and 78.7MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. [2021-12-14 13:27:12,249 INFO L158 Benchmark]: Boogie Preprocessor took 48.32ms. Allocated memory is still 104.9MB. Free memory was 78.7MB in the beginning and 77.2MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-14 13:27:12,250 INFO L158 Benchmark]: RCFGBuilder took 223.73ms. Allocated memory is still 104.9MB. Free memory was 77.2MB in the beginning and 66.0MB in the end (delta: 11.2MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2021-12-14 13:27:12,251 INFO L158 Benchmark]: TraceAbstraction took 965.27ms. Allocated memory is still 104.9MB. Free memory was 65.6MB in the beginning and 39.0MB in the end (delta: 26.6MB). Peak memory consumption was 27.8MB. Max. memory is 16.1GB. [2021-12-14 13:27:12,253 INFO L158 Benchmark]: Witness Printer took 2.40ms. Allocated memory is still 104.9MB. Free memory was 39.0MB in the beginning and 38.4MB in the end (delta: 622.4kB). There was no memory consumed. Max. memory is 16.1GB. [2021-12-14 13:27:12,254 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.19ms. Allocated memory is still 104.9MB. Free memory is still 84.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 230.26ms. Allocated memory is still 104.9MB. Free memory was 68.6MB in the beginning and 80.1MB in the end (delta: -11.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 28.99ms. Allocated memory is still 104.9MB. Free memory was 80.1MB in the beginning and 78.7MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 48.32ms. Allocated memory is still 104.9MB. Free memory was 78.7MB in the beginning and 77.2MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 223.73ms. Allocated memory is still 104.9MB. Free memory was 77.2MB in the beginning and 66.0MB in the end (delta: 11.2MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * TraceAbstraction took 965.27ms. Allocated memory is still 104.9MB. Free memory was 65.6MB in the beginning and 39.0MB in the end (delta: 26.6MB). Peak memory consumption was 27.8MB. Max. memory is 16.1GB. * Witness Printer took 2.40ms. Allocated memory is still 104.9MB. Free memory was 39.0MB in the beginning and 38.4MB in the end (delta: 622.4kB). 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: 70]: 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 69, overapproximation of someBinaryArithmeticDOUBLEoperation at line 63. Possible FailurePath: [L62] double x = __VERIFIER_nondet_double(); [L63] double y = 0.0 / 0.0; [L64] CALL, EXPR isnan_double(x) [L18] return x != x; VAL [\old(x)=4294967299, \result=0, x=4294967299] [L64] RET, EXPR isnan_double(x) [L64] COND TRUE !isnan_double(x) [L66] CALL, EXPR fmin_double(x, y) [L47] CALL, EXPR __fpclassify_double(x) VAL [\old(x)=4294967299] [L20] __uint32_t msw, lsw; VAL [\old(x)=4294967299, x=4294967299] [L23] ieee_double_shape_type ew_u; [L24] ew_u.value = (x) [L25] EXPR ew_u.parts.msw [L25] (msw) = ew_u.parts.msw [L26] EXPR ew_u.parts.lsw [L26] (lsw) = ew_u.parts.lsw [L29-L30] COND FALSE !((msw == 0x00000000 && lsw == 0x00000000) || (msw == 0x80000000 && lsw == 0x00000000)) VAL [\old(x)=4294967299, lsw=4294967297, msw=2146435073, x=4294967299] [L32-L33] COND FALSE !((msw >= 0x00100000 && msw <= 0x7fefffff) || (msw >= 0x80100000 && msw <= 0xffefffff)) VAL [\old(x)=4294967299, lsw=4294967297, msw=2146435073, x=4294967299] [L35-L36] COND FALSE !(( msw <= 0x000fffff) || (msw >= 0x80000000 && msw <= 0x800fffff)) VAL [\old(x)=4294967299, lsw=4294967297, msw=2146435073, x=4294967299] [L39-L40] COND FALSE !((msw == 0x7ff00000 && lsw == 0x00000000) || (msw == 0xfff00000 && lsw == 0x00000000)) [L43] return 0; VAL [\old(x)=4294967299, \result=0, lsw=4294967297, msw=2146435073, x=4294967299] [L47] RET, EXPR __fpclassify_double(x) VAL [\old(x)=4294967299, \old(y)=4294967298, __fpclassify_double(x)=0, x=4294967299, y=4294967298] [L47] COND TRUE __fpclassify_double(x) == 0 [L48] return y; VAL [\old(x)=4294967299, \old(y)=4294967298, \result=4294967298, x=4294967299, y=4294967298] [L66] RET, EXPR fmin_double(x, y) [L66] double res = fmin_double(x, y); [L69] COND TRUE res != x VAL [res=4294967298, x=4294967299, y=4294967298] [L70] reach_error() VAL [res=4294967298, x=4294967299, y=4294967298] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 29 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 0.9s, OverallIterations: 6, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 5 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 5 mSDsluCounter, 536 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 369 mSDsCounter, 5 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 82 IncrementalHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 5 mSolverCounterUnsat, 167 mSDtfsCounter, 82 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=29occurred in iteration=0, 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.0s AutomataMinimizationTime, 5 MinimizatonAttempts, 12 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.3s InterpolantComputationTime, 104 NumberOfCodeBlocks, 104 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 80 ConstructedInterpolants, 0 QuantifiedInterpolants, 196 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 5 InterpolantComputations, 5 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2021-12-14 13:27:12,283 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_1231b.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 b9ce4e199e47d30d5336dd9ca9dceb5f51006e4e1d59090b80d072b498beba7b --- Real Ultimate output --- This is Ultimate 0.2.2-839c364b5d67a0f615c82cb70ab247790648d4a9-839c364 [2021-12-14 13:27:14,419 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-14 13:27:14,422 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-14 13:27:14,453 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-14 13:27:14,454 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-14 13:27:14,454 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-14 13:27:14,455 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-14 13:27:14,456 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-14 13:27:14,457 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-14 13:27:14,458 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-14 13:27:14,458 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-14 13:27:14,470 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-14 13:27:14,471 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-14 13:27:14,476 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-14 13:27:14,479 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-14 13:27:14,481 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-14 13:27:14,485 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-14 13:27:14,486 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-14 13:27:14,489 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-14 13:27:14,493 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-14 13:27:14,498 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-14 13:27:14,500 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-14 13:27:14,500 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-14 13:27:14,502 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-14 13:27:14,505 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-14 13:27:14,505 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-14 13:27:14,506 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-14 13:27:14,506 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-14 13:27:14,508 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-14 13:27:14,509 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-14 13:27:14,509 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-14 13:27:14,510 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-14 13:27:14,511 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-14 13:27:14,515 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-14 13:27:14,516 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-14 13:27:14,517 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-14 13:27:14,517 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-14 13:27:14,518 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-14 13:27:14,518 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-14 13:27:14,520 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-14 13:27:14,520 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-14 13:27:14,521 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2021-12-14 13:27:14,545 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-14 13:27:14,546 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-14 13:27:14,547 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-14 13:27:14,547 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-14 13:27:14,548 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-14 13:27:14,548 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-14 13:27:14,550 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-14 13:27:14,550 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-14 13:27:14,551 INFO L138 SettingsManager]: * Use SBE=true [2021-12-14 13:27:14,551 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-14 13:27:14,552 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-14 13:27:14,552 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-14 13:27:14,552 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-14 13:27:14,552 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-12-14 13:27:14,553 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-14 13:27:14,553 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-12-14 13:27:14,553 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-12-14 13:27:14,553 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2021-12-14 13:27:14,553 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2021-12-14 13:27:14,553 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-14 13:27:14,554 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-12-14 13:27:14,554 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-14 13:27:14,554 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-12-14 13:27:14,554 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-14 13:27:14,554 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-14 13:27:14,554 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-14 13:27:14,555 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-14 13:27:14,555 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-14 13:27:14,555 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-14 13:27:14,555 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-12-14 13:27:14,555 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2021-12-14 13:27:14,555 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2021-12-14 13:27:14,556 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-12-14 13:27:14,556 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-12-14 13:27:14,556 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-12-14 13:27:14,556 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-14 13:27:14,556 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-12-14 13:27:14,557 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 -> b9ce4e199e47d30d5336dd9ca9dceb5f51006e4e1d59090b80d072b498beba7b [2021-12-14 13:27:14,916 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-14 13:27:14,935 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-14 13:27:14,938 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-14 13:27:14,939 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-14 13:27:14,940 INFO L275 PluginConnector]: CDTParser initialized [2021-12-14 13:27:14,941 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/float-newlib/double_req_bl_1231b.c [2021-12-14 13:27:15,026 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3ea836d50/ccdbc31aacd0411a9b8a5fa49bbad651/FLAG5b6a48ee3 [2021-12-14 13:27:15,469 INFO L306 CDTParser]: Found 1 translation units. [2021-12-14 13:27:15,469 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/double_req_bl_1231b.c [2021-12-14 13:27:15,474 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3ea836d50/ccdbc31aacd0411a9b8a5fa49bbad651/FLAG5b6a48ee3 [2021-12-14 13:27:15,890 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3ea836d50/ccdbc31aacd0411a9b8a5fa49bbad651 [2021-12-14 13:27:15,892 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-14 13:27:15,893 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-14 13:27:15,894 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-14 13:27:15,895 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-14 13:27:15,897 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-14 13:27:15,897 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.12 01:27:15" (1/1) ... [2021-12-14 13:27:15,898 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@18e998d0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 01:27:15, skipping insertion in model container [2021-12-14 13:27:15,898 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.12 01:27:15" (1/1) ... [2021-12-14 13:27:15,903 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-14 13:27:15,914 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-14 13:27:16,005 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_1231b.c[1765,1778] [2021-12-14 13:27:16,017 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-14 13:27:16,026 INFO L203 MainTranslator]: Completed pre-run [2021-12-14 13:27:16,046 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_1231b.c[1765,1778] [2021-12-14 13:27:16,059 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-14 13:27:16,091 INFO L208 MainTranslator]: Completed translation [2021-12-14 13:27:16,093 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 01:27:16 WrapperNode [2021-12-14 13:27:16,093 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-14 13:27:16,094 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-14 13:27:16,095 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-14 13:27:16,095 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-14 13:27:16,100 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 01:27:16" (1/1) ... [2021-12-14 13:27:16,108 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 01:27:16" (1/1) ... [2021-12-14 13:27:16,121 INFO L137 Inliner]: procedures = 21, calls = 16, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 50 [2021-12-14 13:27:16,121 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-14 13:27:16,122 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-14 13:27:16,122 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-14 13:27:16,122 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-14 13:27:16,128 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 01:27:16" (1/1) ... [2021-12-14 13:27:16,128 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 01:27:16" (1/1) ... [2021-12-14 13:27:16,131 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 01:27:16" (1/1) ... [2021-12-14 13:27:16,132 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 01:27:16" (1/1) ... [2021-12-14 13:27:16,138 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 01:27:16" (1/1) ... [2021-12-14 13:27:16,141 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 01:27:16" (1/1) ... [2021-12-14 13:27:16,143 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 01:27:16" (1/1) ... [2021-12-14 13:27:16,145 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-14 13:27:16,146 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-14 13:27:16,146 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-14 13:27:16,146 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-14 13:27:16,147 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 01:27:16" (1/1) ... [2021-12-14 13:27:16,152 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-14 13:27:16,160 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 13:27:16,177 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-12-14 13:27:16,179 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-12-14 13:27:16,203 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-14 13:27:16,204 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8 [2021-12-14 13:27:16,204 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2021-12-14 13:27:16,204 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-12-14 13:27:16,204 INFO L130 BoogieDeclarations]: Found specification of procedure __fpclassify_double [2021-12-14 13:27:16,205 INFO L138 BoogieDeclarations]: Found implementation of procedure __fpclassify_double [2021-12-14 13:27:16,205 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2021-12-14 13:27:16,205 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-14 13:27:16,205 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-14 13:27:16,206 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-12-14 13:27:16,261 INFO L236 CfgBuilder]: Building ICFG [2021-12-14 13:27:16,263 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-14 13:27:16,419 INFO L277 CfgBuilder]: Performing block encoding [2021-12-14 13:27:16,423 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-14 13:27:16,423 INFO L301 CfgBuilder]: Removed 2 assume(true) statements. [2021-12-14 13:27:16,425 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 01:27:16 BoogieIcfgContainer [2021-12-14 13:27:16,425 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-14 13:27:16,426 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-12-14 13:27:16,426 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-12-14 13:27:16,428 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-12-14 13:27:16,438 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.12 01:27:15" (1/3) ... [2021-12-14 13:27:16,439 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@40ef3a5f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.12 01:27:16, skipping insertion in model container [2021-12-14 13:27:16,439 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 01:27:16" (2/3) ... [2021-12-14 13:27:16,440 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@40ef3a5f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.12 01:27:16, skipping insertion in model container [2021-12-14 13:27:16,440 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 01:27:16" (3/3) ... [2021-12-14 13:27:16,441 INFO L111 eAbstractionObserver]: Analyzing ICFG double_req_bl_1231b.c [2021-12-14 13:27:16,444 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-12-14 13:27:16,445 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-12-14 13:27:16,522 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-12-14 13:27:16,529 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, 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, mLoopAccelerationTechnique=FAST_UPR [2021-12-14 13:27:16,529 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-12-14 13:27:16,549 INFO L276 IsEmpty]: Start isEmpty. Operand has 27 states, 22 states have (on average 1.5454545454545454) internal successors, (34), 23 states have internal predecessors, (34), 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) [2021-12-14 13:27:16,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2021-12-14 13:27:16,552 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 13:27:16,553 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 13:27:16,553 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 13:27:16,557 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 13:27:16,557 INFO L85 PathProgramCache]: Analyzing trace with hash -1684133472, now seen corresponding path program 1 times [2021-12-14 13:27:16,564 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-14 13:27:16,564 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2043015136] [2021-12-14 13:27:16,564 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 13:27:16,565 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-14 13:27:16,565 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-14 13:27:16,567 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-14 13:27:16,630 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2021-12-14 13:27:16,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 13:27:16,682 INFO L263 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 1 conjunts are in the unsatisfiable core [2021-12-14 13:27:16,686 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 13:27:16,733 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 13:27:16,733 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-14 13:27:16,734 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-14 13:27:16,734 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2043015136] [2021-12-14 13:27:16,735 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2043015136] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 13:27:16,735 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 13:27:16,735 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-14 13:27:16,737 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1146854084] [2021-12-14 13:27:16,737 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 13:27:16,740 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2021-12-14 13:27:16,741 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-14 13:27:16,759 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-12-14 13:27:16,760 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-12-14 13:27:16,761 INFO L87 Difference]: Start difference. First operand has 27 states, 22 states have (on average 1.5454545454545454) internal successors, (34), 23 states have internal predecessors, (34), 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 6.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) [2021-12-14 13:27:16,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 13:27:16,779 INFO L93 Difference]: Finished difference Result 49 states and 71 transitions. [2021-12-14 13:27:16,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-12-14 13:27:16,780 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 6.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 [2021-12-14 13:27:16,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 13:27:16,785 INFO L225 Difference]: With dead ends: 49 [2021-12-14 13:27:16,785 INFO L226 Difference]: Without dead ends: 23 [2021-12-14 13:27:16,787 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-12-14 13:27:16,790 INFO L933 BasicCegarLoop]: 35 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, 35 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 [2021-12-14 13:27:16,790 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-14 13:27:16,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2021-12-14 13:27:16,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2021-12-14 13:27:16,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 19 states have (on average 1.368421052631579) internal successors, (26), 19 states have internal predecessors, (26), 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) [2021-12-14 13:27:16,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 30 transitions. [2021-12-14 13:27:16,822 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 30 transitions. Word has length 14 [2021-12-14 13:27:16,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 13:27:16,822 INFO L470 AbstractCegarLoop]: Abstraction has 23 states and 30 transitions. [2021-12-14 13:27:16,822 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 6.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) [2021-12-14 13:27:16,822 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 30 transitions. [2021-12-14 13:27:16,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-12-14 13:27:16,823 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 13:27:16,823 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 13:27:16,831 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Ended with exit code 0 [2021-12-14 13:27:17,029 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-14 13:27:17,029 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 13:27:17,030 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 13:27:17,030 INFO L85 PathProgramCache]: Analyzing trace with hash -1014515731, now seen corresponding path program 1 times [2021-12-14 13:27:17,030 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-14 13:27:17,031 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1467374277] [2021-12-14 13:27:17,031 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 13:27:17,031 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-14 13:27:17,031 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-14 13:27:17,037 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-14 13:27:17,038 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2021-12-14 13:27:17,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 13:27:17,098 INFO L263 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 3 conjunts are in the unsatisfiable core [2021-12-14 13:27:17,099 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 13:27:17,158 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 13:27:17,159 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-14 13:27:17,159 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-14 13:27:17,159 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1467374277] [2021-12-14 13:27:17,159 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1467374277] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 13:27:17,165 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 13:27:17,165 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-14 13:27:17,165 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1367585036] [2021-12-14 13:27:17,165 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 13:27:17,167 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-14 13:27:17,167 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-14 13:27:17,167 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-14 13:27:17,168 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-14 13:27:17,168 INFO L87 Difference]: Start difference. First operand 23 states and 30 transitions. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 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) [2021-12-14 13:27:17,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 13:27:17,267 INFO L93 Difference]: Finished difference Result 30 states and 38 transitions. [2021-12-14 13:27:17,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-14 13:27:17,268 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 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 [2021-12-14 13:27:17,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 13:27:17,270 INFO L225 Difference]: With dead ends: 30 [2021-12-14 13:27:17,270 INFO L226 Difference]: Without dead ends: 26 [2021-12-14 13:27:17,271 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-14 13:27:17,272 INFO L933 BasicCegarLoop]: 29 mSDtfsCounter, 0 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 80 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-14 13:27:17,272 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 80 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-14 13:27:17,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2021-12-14 13:27:17,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2021-12-14 13:27:17,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 21 states have (on average 1.3333333333333333) internal successors, (28), 21 states have internal predecessors, (28), 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) [2021-12-14 13:27:17,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 34 transitions. [2021-12-14 13:27:17,279 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 34 transitions. Word has length 15 [2021-12-14 13:27:17,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 13:27:17,279 INFO L470 AbstractCegarLoop]: Abstraction has 26 states and 34 transitions. [2021-12-14 13:27:17,280 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 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) [2021-12-14 13:27:17,280 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 34 transitions. [2021-12-14 13:27:17,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-12-14 13:27:17,282 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 13:27:17,282 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 13:27:17,292 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2021-12-14 13:27:17,492 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-14 13:27:17,493 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 13:27:17,493 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 13:27:17,493 INFO L85 PathProgramCache]: Analyzing trace with hash -1185853373, now seen corresponding path program 1 times [2021-12-14 13:27:17,495 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-14 13:27:17,496 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1159369906] [2021-12-14 13:27:17,496 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 13:27:17,496 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-14 13:27:17,496 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-14 13:27:17,520 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-14 13:27:17,522 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2021-12-14 13:27:17,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 13:27:17,597 INFO L263 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 3 conjunts are in the unsatisfiable core [2021-12-14 13:27:17,598 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 13:27:17,642 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 13:27:17,643 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-14 13:27:17,643 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-14 13:27:17,643 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1159369906] [2021-12-14 13:27:17,643 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1159369906] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 13:27:17,644 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 13:27:17,644 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-14 13:27:17,644 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [515703890] [2021-12-14 13:27:17,644 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 13:27:17,644 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-14 13:27:17,645 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-14 13:27:17,645 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-14 13:27:17,645 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-14 13:27:17,646 INFO L87 Difference]: Start difference. First operand 26 states and 34 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) [2021-12-14 13:27:17,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 13:27:17,667 INFO L93 Difference]: Finished difference Result 33 states and 42 transitions. [2021-12-14 13:27:17,667 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-14 13:27:17,667 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 [2021-12-14 13:27:17,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 13:27:17,668 INFO L225 Difference]: With dead ends: 33 [2021-12-14 13:27:17,668 INFO L226 Difference]: Without dead ends: 29 [2021-12-14 13:27:17,669 INFO L932 BasicCegarLoop]: 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 [2021-12-14 13:27:17,670 INFO L933 BasicCegarLoop]: 33 mSDtfsCounter, 0 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 89 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-14 13:27:17,670 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 89 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-14 13:27:17,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2021-12-14 13:27:17,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 26. [2021-12-14 13:27:17,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 21 states have (on average 1.3333333333333333) internal successors, (28), 21 states have internal predecessors, (28), 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) [2021-12-14 13:27:17,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 34 transitions. [2021-12-14 13:27:17,675 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 34 transitions. Word has length 16 [2021-12-14 13:27:17,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 13:27:17,675 INFO L470 AbstractCegarLoop]: Abstraction has 26 states and 34 transitions. [2021-12-14 13:27:17,676 INFO L471 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) [2021-12-14 13:27:17,676 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 34 transitions. [2021-12-14 13:27:17,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-12-14 13:27:17,676 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 13:27:17,676 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 13:27:17,695 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2021-12-14 13:27:17,886 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-14 13:27:17,886 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 13:27:17,887 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 13:27:17,887 INFO L85 PathProgramCache]: Analyzing trace with hash 1347661745, now seen corresponding path program 1 times [2021-12-14 13:27:17,887 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-14 13:27:17,887 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [553405449] [2021-12-14 13:27:17,888 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 13:27:17,888 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-14 13:27:17,888 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-14 13:27:17,890 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-14 13:27:17,891 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2021-12-14 13:27:17,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 13:27:17,951 INFO L263 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 3 conjunts are in the unsatisfiable core [2021-12-14 13:27:17,952 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 13:27:17,985 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 13:27:17,986 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-14 13:27:17,986 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-14 13:27:17,986 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [553405449] [2021-12-14 13:27:17,986 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [553405449] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 13:27:17,986 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 13:27:17,986 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-14 13:27:17,987 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [236324276] [2021-12-14 13:27:17,987 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 13:27:17,987 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-14 13:27:17,987 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-14 13:27:17,988 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-14 13:27:17,988 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-14 13:27:17,988 INFO L87 Difference]: Start difference. First operand 26 states and 34 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, (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) [2021-12-14 13:27:18,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 13:27:18,006 INFO L93 Difference]: Finished difference Result 33 states and 42 transitions. [2021-12-14 13:27:18,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-14 13:27:18,007 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, (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 [2021-12-14 13:27:18,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 13:27:18,008 INFO L225 Difference]: With dead ends: 33 [2021-12-14 13:27:18,008 INFO L226 Difference]: Without dead ends: 29 [2021-12-14 13:27:18,008 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-14 13:27:18,009 INFO L933 BasicCegarLoop]: 33 mSDtfsCounter, 0 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 89 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-14 13:27:18,009 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 89 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-14 13:27:18,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2021-12-14 13:27:18,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 26. [2021-12-14 13:27:18,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 21 states have (on average 1.3333333333333333) internal successors, (28), 21 states have internal predecessors, (28), 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) [2021-12-14 13:27:18,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 34 transitions. [2021-12-14 13:27:18,013 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 34 transitions. Word has length 17 [2021-12-14 13:27:18,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 13:27:18,018 INFO L470 AbstractCegarLoop]: Abstraction has 26 states and 34 transitions. [2021-12-14 13:27:18,019 INFO L471 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, (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) [2021-12-14 13:27:18,019 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 34 transitions. [2021-12-14 13:27:18,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-12-14 13:27:18,019 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 13:27:18,020 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 13:27:18,032 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Ended with exit code 0 [2021-12-14 13:27:18,228 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-14 13:27:18,228 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 13:27:18,230 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 13:27:18,231 INFO L85 PathProgramCache]: Analyzing trace with hash 1832266503, now seen corresponding path program 1 times [2021-12-14 13:27:18,231 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-14 13:27:18,232 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1996354799] [2021-12-14 13:27:18,232 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 13:27:18,234 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-14 13:27:18,235 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-14 13:27:18,238 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-14 13:27:18,244 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2021-12-14 13:27:18,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 13:27:18,319 INFO L263 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 3 conjunts are in the unsatisfiable core [2021-12-14 13:27:18,320 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 13:27:18,358 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 13:27:18,358 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-14 13:27:18,358 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-14 13:27:18,359 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1996354799] [2021-12-14 13:27:18,359 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1996354799] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 13:27:18,359 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 13:27:18,359 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-14 13:27:18,359 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1250854204] [2021-12-14 13:27:18,359 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 13:27:18,360 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-14 13:27:18,360 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-14 13:27:18,360 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-14 13:27:18,360 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-14 13:27:18,361 INFO L87 Difference]: Start difference. First operand 26 states and 34 transitions. Second operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 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) [2021-12-14 13:27:18,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 13:27:18,402 INFO L93 Difference]: Finished difference Result 33 states and 42 transitions. [2021-12-14 13:27:18,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-14 13:27:18,402 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 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 [2021-12-14 13:27:18,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 13:27:18,403 INFO L225 Difference]: With dead ends: 33 [2021-12-14 13:27:18,403 INFO L226 Difference]: Without dead ends: 29 [2021-12-14 13:27:18,403 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-14 13:27:18,404 INFO L933 BasicCegarLoop]: 33 mSDtfsCounter, 0 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 89 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-14 13:27:18,404 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 89 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-14 13:27:18,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2021-12-14 13:27:18,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 26. [2021-12-14 13:27:18,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 21 states have (on average 1.3333333333333333) internal successors, (28), 21 states have internal predecessors, (28), 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) [2021-12-14 13:27:18,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 34 transitions. [2021-12-14 13:27:18,409 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 34 transitions. Word has length 18 [2021-12-14 13:27:18,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 13:27:18,410 INFO L470 AbstractCegarLoop]: Abstraction has 26 states and 34 transitions. [2021-12-14 13:27:18,410 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 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) [2021-12-14 13:27:18,410 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 34 transitions. [2021-12-14 13:27:18,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-12-14 13:27:18,411 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 13:27:18,411 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 13:27:18,420 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2021-12-14 13:27:18,620 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-14 13:27:18,621 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 13:27:18,621 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 13:27:18,621 INFO L85 PathProgramCache]: Analyzing trace with hash -1575197112, now seen corresponding path program 1 times [2021-12-14 13:27:18,622 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-14 13:27:18,622 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [670527140] [2021-12-14 13:27:18,622 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 13:27:18,622 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-14 13:27:18,622 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-14 13:27:18,623 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-14 13:27:18,624 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2021-12-14 13:27:18,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 13:27:18,699 INFO L263 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 22 conjunts are in the unsatisfiable core [2021-12-14 13:27:18,701 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 13:27:18,839 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 13 [2021-12-14 13:27:19,870 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 13:27:19,871 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-14 13:27:19,871 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-14 13:27:19,871 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [670527140] [2021-12-14 13:27:19,871 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [670527140] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 13:27:19,871 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 13:27:19,871 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-12-14 13:27:19,871 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [345128121] [2021-12-14 13:27:19,872 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 13:27:19,872 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-12-14 13:27:19,872 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-14 13:27:19,872 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-12-14 13:27:19,873 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2021-12-14 13:27:19,873 INFO L87 Difference]: Start difference. First operand 26 states and 34 transitions. Second operand has 10 states, 9 states have (on average 1.7777777777777777) internal successors, (16), 10 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) [2021-12-14 13:27:19,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 13:27:19,990 INFO L93 Difference]: Finished difference Result 45 states and 58 transitions. [2021-12-14 13:27:19,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-12-14 13:27:19,991 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 1.7777777777777777) internal successors, (16), 10 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 [2021-12-14 13:27:19,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 13:27:19,991 INFO L225 Difference]: With dead ends: 45 [2021-12-14 13:27:19,991 INFO L226 Difference]: Without dead ends: 25 [2021-12-14 13:27:19,992 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2021-12-14 13:27:19,992 INFO L933 BasicCegarLoop]: 15 mSDtfsCounter, 21 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 99 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 29 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-14 13:27:19,992 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [21 Valid, 99 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 27 Invalid, 0 Unknown, 29 Unchecked, 0.0s Time] [2021-12-14 13:27:19,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2021-12-14 13:27:19,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2021-12-14 13:27:19,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 20 states have (on average 1.3) internal successors, (26), 21 states have internal predecessors, (26), 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) [2021-12-14 13:27:19,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 31 transitions. [2021-12-14 13:27:19,995 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 31 transitions. Word has length 18 [2021-12-14 13:27:19,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 13:27:19,996 INFO L470 AbstractCegarLoop]: Abstraction has 25 states and 31 transitions. [2021-12-14 13:27:19,996 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 1.7777777777777777) internal successors, (16), 10 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) [2021-12-14 13:27:19,996 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 31 transitions. [2021-12-14 13:27:19,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-12-14 13:27:19,997 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 13:27:19,997 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 13:27:20,011 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2021-12-14 13:27:20,210 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-14 13:27:20,211 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 13:27:20,211 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 13:27:20,212 INFO L85 PathProgramCache]: Analyzing trace with hash 789982401, now seen corresponding path program 1 times [2021-12-14 13:27:20,212 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-14 13:27:20,212 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1779533835] [2021-12-14 13:27:20,212 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 13:27:20,212 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-14 13:27:20,213 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-14 13:27:20,215 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-14 13:27:20,249 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2021-12-14 13:27:20,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 13:27:20,299 INFO L263 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 3 conjunts are in the unsatisfiable core [2021-12-14 13:27:20,314 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 13:27:20,350 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-12-14 13:27:20,350 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-14 13:27:20,350 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-14 13:27:20,350 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1779533835] [2021-12-14 13:27:20,350 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1779533835] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 13:27:20,350 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 13:27:20,350 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-14 13:27:20,350 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1913883729] [2021-12-14 13:27:20,350 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 13:27:20,350 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-14 13:27:20,351 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-14 13:27:20,351 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-14 13:27:20,351 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-14 13:27:20,351 INFO L87 Difference]: Start difference. First operand 25 states and 31 transitions. Second operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 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) [2021-12-14 13:27:20,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 13:27:20,401 INFO L93 Difference]: Finished difference Result 32 states and 39 transitions. [2021-12-14 13:27:20,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-14 13:27:20,401 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 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 [2021-12-14 13:27:20,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 13:27:20,402 INFO L225 Difference]: With dead ends: 32 [2021-12-14 13:27:20,402 INFO L226 Difference]: Without dead ends: 28 [2021-12-14 13:27:20,402 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-14 13:27:20,403 INFO L933 BasicCegarLoop]: 28 mSDtfsCounter, 0 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-14 13:27:20,403 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 77 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-14 13:27:20,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2021-12-14 13:27:20,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2021-12-14 13:27:20,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 22 states have (on average 1.2727272727272727) internal successors, (28), 23 states have internal predecessors, (28), 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) [2021-12-14 13:27:20,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 35 transitions. [2021-12-14 13:27:20,406 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 35 transitions. Word has length 23 [2021-12-14 13:27:20,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 13:27:20,406 INFO L470 AbstractCegarLoop]: Abstraction has 28 states and 35 transitions. [2021-12-14 13:27:20,406 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 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) [2021-12-14 13:27:20,406 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 35 transitions. [2021-12-14 13:27:20,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-12-14 13:27:20,407 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 13:27:20,407 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 13:27:20,434 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Ended with exit code 0 [2021-12-14 13:27:20,618 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-14 13:27:20,620 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 13:27:20,620 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 13:27:20,621 INFO L85 PathProgramCache]: Analyzing trace with hash -1141759769, now seen corresponding path program 1 times [2021-12-14 13:27:20,621 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-14 13:27:20,621 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1467583209] [2021-12-14 13:27:20,621 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 13:27:20,621 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-14 13:27:20,621 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-14 13:27:20,622 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-14 13:27:20,624 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2021-12-14 13:27:20,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 13:27:20,688 INFO L263 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 3 conjunts are in the unsatisfiable core [2021-12-14 13:27:20,689 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 13:27:20,728 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-12-14 13:27:20,728 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-14 13:27:20,728 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-14 13:27:20,728 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1467583209] [2021-12-14 13:27:20,728 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1467583209] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 13:27:20,728 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 13:27:20,728 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-14 13:27:20,728 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1829185350] [2021-12-14 13:27:20,729 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 13:27:20,729 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-14 13:27:20,729 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-14 13:27:20,730 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-14 13:27:20,730 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-14 13:27:20,730 INFO L87 Difference]: Start difference. First operand 28 states and 35 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) [2021-12-14 13:27:20,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 13:27:20,748 INFO L93 Difference]: Finished difference Result 35 states and 43 transitions. [2021-12-14 13:27:20,748 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-14 13:27:20,748 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 [2021-12-14 13:27:20,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 13:27:20,750 INFO L225 Difference]: With dead ends: 35 [2021-12-14 13:27:20,750 INFO L226 Difference]: Without dead ends: 31 [2021-12-14 13:27:20,750 INFO L932 BasicCegarLoop]: 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 [2021-12-14 13:27:20,751 INFO L933 BasicCegarLoop]: 32 mSDtfsCounter, 0 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 86 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-14 13:27:20,751 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 86 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-14 13:27:20,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2021-12-14 13:27:20,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 28. [2021-12-14 13:27:20,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 22 states have (on average 1.2727272727272727) internal successors, (28), 23 states have internal predecessors, (28), 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) [2021-12-14 13:27:20,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 35 transitions. [2021-12-14 13:27:20,759 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 35 transitions. Word has length 24 [2021-12-14 13:27:20,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 13:27:20,760 INFO L470 AbstractCegarLoop]: Abstraction has 28 states and 35 transitions. [2021-12-14 13:27:20,760 INFO L471 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) [2021-12-14 13:27:20,760 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 35 transitions. [2021-12-14 13:27:20,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-12-14 13:27:20,763 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 13:27:20,764 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 13:27:20,777 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Ended with exit code 0 [2021-12-14 13:27:20,972 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-14 13:27:20,973 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 13:27:20,974 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 13:27:20,974 INFO L85 PathProgramCache]: Analyzing trace with hash -1641177467, now seen corresponding path program 1 times [2021-12-14 13:27:20,974 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-14 13:27:20,974 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [756004054] [2021-12-14 13:27:20,975 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 13:27:20,975 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-14 13:27:20,975 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-14 13:27:20,977 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-14 13:27:20,978 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2021-12-14 13:27:21,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 13:27:21,061 INFO L263 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 3 conjunts are in the unsatisfiable core [2021-12-14 13:27:21,061 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 13:27:21,091 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-12-14 13:27:21,091 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-14 13:27:21,091 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-14 13:27:21,091 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [756004054] [2021-12-14 13:27:21,091 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [756004054] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 13:27:21,091 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 13:27:21,091 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-14 13:27:21,092 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1130289607] [2021-12-14 13:27:21,092 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 13:27:21,092 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-14 13:27:21,092 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-14 13:27:21,092 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-14 13:27:21,092 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-14 13:27:21,093 INFO L87 Difference]: Start difference. First operand 28 states and 35 transitions. Second operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 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) [2021-12-14 13:27:21,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 13:27:21,102 INFO L93 Difference]: Finished difference Result 35 states and 43 transitions. [2021-12-14 13:27:21,102 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-14 13:27:21,102 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 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 [2021-12-14 13:27:21,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 13:27:21,103 INFO L225 Difference]: With dead ends: 35 [2021-12-14 13:27:21,103 INFO L226 Difference]: Without dead ends: 31 [2021-12-14 13:27:21,103 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-14 13:27:21,104 INFO L933 BasicCegarLoop]: 32 mSDtfsCounter, 0 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 86 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-14 13:27:21,104 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 86 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-14 13:27:21,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2021-12-14 13:27:21,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 28. [2021-12-14 13:27:21,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 22 states have (on average 1.2727272727272727) internal successors, (28), 23 states have internal predecessors, (28), 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) [2021-12-14 13:27:21,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 35 transitions. [2021-12-14 13:27:21,107 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 35 transitions. Word has length 25 [2021-12-14 13:27:21,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 13:27:21,107 INFO L470 AbstractCegarLoop]: Abstraction has 28 states and 35 transitions. [2021-12-14 13:27:21,108 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 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) [2021-12-14 13:27:21,108 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 35 transitions. [2021-12-14 13:27:21,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-12-14 13:27:21,108 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 13:27:21,108 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 13:27:21,127 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2021-12-14 13:27:21,318 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-14 13:27:21,318 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 13:27:21,318 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 13:27:21,319 INFO L85 PathProgramCache]: Analyzing trace with hash -984557701, now seen corresponding path program 1 times [2021-12-14 13:27:21,319 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-14 13:27:21,319 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [995228415] [2021-12-14 13:27:21,319 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 13:27:21,319 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-14 13:27:21,319 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-14 13:27:21,321 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-14 13:27:21,323 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2021-12-14 13:27:21,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 13:27:21,393 INFO L263 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 4 conjunts are in the unsatisfiable core [2021-12-14 13:27:21,396 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 13:27:21,564 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-12-14 13:27:21,564 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-14 13:27:21,565 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-14 13:27:21,565 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [995228415] [2021-12-14 13:27:21,565 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [995228415] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 13:27:21,565 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 13:27:21,565 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-14 13:27:21,565 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [93378118] [2021-12-14 13:27:21,566 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 13:27:21,566 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-14 13:27:21,566 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-14 13:27:21,566 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-14 13:27:21,566 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-14 13:27:21,567 INFO L87 Difference]: Start difference. First operand 28 states and 35 transitions. Second operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 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) [2021-12-14 13:27:21,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 13:27:21,580 INFO L93 Difference]: Finished difference Result 37 states and 42 transitions. [2021-12-14 13:27:21,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-14 13:27:21,580 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 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 25 [2021-12-14 13:27:21,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 13:27:21,596 INFO L225 Difference]: With dead ends: 37 [2021-12-14 13:27:21,596 INFO L226 Difference]: Without dead ends: 32 [2021-12-14 13:27:21,597 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-14 13:27:21,598 INFO L933 BasicCegarLoop]: 29 mSDtfsCounter, 4 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 2 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-14 13:27:21,599 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4 Valid, 77 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 2 Unchecked, 0.0s Time] [2021-12-14 13:27:21,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2021-12-14 13:27:21,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 28. [2021-12-14 13:27:21,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 22 states have (on average 1.2272727272727273) internal successors, (27), 23 states have internal predecessors, (27), 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) [2021-12-14 13:27:21,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 34 transitions. [2021-12-14 13:27:21,616 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 34 transitions. Word has length 25 [2021-12-14 13:27:21,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 13:27:21,616 INFO L470 AbstractCegarLoop]: Abstraction has 28 states and 34 transitions. [2021-12-14 13:27:21,617 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 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) [2021-12-14 13:27:21,617 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 34 transitions. [2021-12-14 13:27:21,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-12-14 13:27:21,620 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 13:27:21,620 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 13:27:21,630 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (11)] Ended with exit code 0 [2021-12-14 13:27:21,831 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-14 13:27:21,831 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 13:27:21,832 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 13:27:21,832 INFO L85 PathProgramCache]: Analyzing trace with hash -982710659, now seen corresponding path program 1 times [2021-12-14 13:27:21,832 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-14 13:27:21,832 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [137423673] [2021-12-14 13:27:21,832 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 13:27:21,832 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-14 13:27:21,832 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-14 13:27:21,834 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-14 13:27:21,835 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2021-12-14 13:27:21,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 13:27:21,956 INFO L263 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 11 conjunts are in the unsatisfiable core [2021-12-14 13:27:21,958 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 13:27:22,228 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-14 13:27:22,228 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-14 13:27:22,229 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-14 13:27:22,229 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [137423673] [2021-12-14 13:27:22,229 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [137423673] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 13:27:22,229 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 13:27:22,229 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-14 13:27:22,229 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [591738727] [2021-12-14 13:27:22,229 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 13:27:22,229 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-14 13:27:22,229 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-14 13:27:22,230 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-14 13:27:22,230 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-12-14 13:27:22,230 INFO L87 Difference]: Start difference. First operand 28 states and 34 transitions. Second operand has 7 states, 7 states have (on average 3.0) internal successors, (21), 7 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) [2021-12-14 13:27:22,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 13:27:22,264 INFO L93 Difference]: Finished difference Result 41 states and 46 transitions. [2021-12-14 13:27:22,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-14 13:27:22,264 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.0) internal successors, (21), 7 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 [2021-12-14 13:27:22,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 13:27:22,264 INFO L225 Difference]: With dead ends: 41 [2021-12-14 13:27:22,265 INFO L226 Difference]: Without dead ends: 34 [2021-12-14 13:27:22,265 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2021-12-14 13:27:22,265 INFO L933 BasicCegarLoop]: 25 mSDtfsCounter, 7 mSDsluCounter, 99 mSDsCounter, 0 mSdLazyCounter, 1 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 124 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 22 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-14 13:27:22,266 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [8 Valid, 124 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1 Invalid, 0 Unknown, 22 Unchecked, 0.0s Time] [2021-12-14 13:27:22,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2021-12-14 13:27:22,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 30. [2021-12-14 13:27:22,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 25 states have internal predecessors, (28), 2 states have call successors, (2), 1 states have call predecessors, (2), 4 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) [2021-12-14 13:27:22,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 36 transitions. [2021-12-14 13:27:22,269 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 36 transitions. Word has length 25 [2021-12-14 13:27:22,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 13:27:22,270 INFO L470 AbstractCegarLoop]: Abstraction has 30 states and 36 transitions. [2021-12-14 13:27:22,270 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.0) internal successors, (21), 7 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) [2021-12-14 13:27:22,270 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 36 transitions. [2021-12-14 13:27:22,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2021-12-14 13:27:22,270 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 13:27:22,270 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 13:27:22,291 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (12)] Forceful destruction successful, exit code 0 [2021-12-14 13:27:22,471 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-14 13:27:22,472 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 13:27:22,472 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 13:27:22,472 INFO L85 PathProgramCache]: Analyzing trace with hash -1961064157, now seen corresponding path program 1 times [2021-12-14 13:27:22,473 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-14 13:27:22,473 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1836331455] [2021-12-14 13:27:22,474 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 13:27:22,474 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-14 13:27:22,474 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-14 13:27:22,480 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-14 13:27:22,481 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2021-12-14 13:27:22,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 13:27:22,575 INFO L263 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 11 conjunts are in the unsatisfiable core [2021-12-14 13:27:22,582 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 13:27:22,832 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-14 13:27:22,832 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-14 13:27:22,832 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-14 13:27:22,832 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1836331455] [2021-12-14 13:27:22,832 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1836331455] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 13:27:22,832 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 13:27:22,833 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-14 13:27:22,833 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1454942364] [2021-12-14 13:27:22,833 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 13:27:22,833 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-14 13:27:22,833 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-14 13:27:22,833 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-14 13:27:22,833 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-12-14 13:27:22,833 INFO L87 Difference]: Start difference. First operand 30 states and 36 transitions. Second operand has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 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) [2021-12-14 13:27:22,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 13:27:22,862 INFO L93 Difference]: Finished difference Result 43 states and 48 transitions. [2021-12-14 13:27:22,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-12-14 13:27:22,862 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 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 26 [2021-12-14 13:27:22,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 13:27:22,862 INFO L225 Difference]: With dead ends: 43 [2021-12-14 13:27:22,862 INFO L226 Difference]: Without dead ends: 36 [2021-12-14 13:27:22,863 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2021-12-14 13:27:22,863 INFO L933 BasicCegarLoop]: 25 mSDtfsCounter, 7 mSDsluCounter, 99 mSDsCounter, 0 mSdLazyCounter, 1 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 124 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 26 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-14 13:27:22,863 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [8 Valid, 124 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1 Invalid, 0 Unknown, 26 Unchecked, 0.0s Time] [2021-12-14 13:27:22,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2021-12-14 13:27:22,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 30. [2021-12-14 13:27:22,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 25 states have internal predecessors, (28), 2 states have call successors, (2), 1 states have call predecessors, (2), 4 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) [2021-12-14 13:27:22,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 36 transitions. [2021-12-14 13:27:22,866 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 36 transitions. Word has length 26 [2021-12-14 13:27:22,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 13:27:22,866 INFO L470 AbstractCegarLoop]: Abstraction has 30 states and 36 transitions. [2021-12-14 13:27:22,866 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 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) [2021-12-14 13:27:22,866 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 36 transitions. [2021-12-14 13:27:22,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2021-12-14 13:27:22,866 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 13:27:22,866 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 13:27:22,880 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (13)] Forceful destruction successful, exit code 0 [2021-12-14 13:27:23,077 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-14 13:27:23,078 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 13:27:23,078 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 13:27:23,078 INFO L85 PathProgramCache]: Analyzing trace with hash -688209493, now seen corresponding path program 1 times [2021-12-14 13:27:23,078 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-14 13:27:23,078 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1167835385] [2021-12-14 13:27:23,078 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 13:27:23,078 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-14 13:27:23,079 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-14 13:27:23,079 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-14 13:27:23,080 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2021-12-14 13:27:23,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 13:27:23,147 INFO L263 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 3 conjunts are in the unsatisfiable core [2021-12-14 13:27:23,148 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 13:27:23,185 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-12-14 13:27:23,185 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-14 13:27:23,185 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-14 13:27:23,186 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1167835385] [2021-12-14 13:27:23,186 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1167835385] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 13:27:23,186 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 13:27:23,186 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-14 13:27:23,186 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1320010752] [2021-12-14 13:27:23,186 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 13:27:23,187 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-14 13:27:23,187 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-14 13:27:23,187 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-14 13:27:23,187 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-14 13:27:23,187 INFO L87 Difference]: Start difference. First operand 30 states and 36 transitions. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 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) [2021-12-14 13:27:23,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 13:27:23,209 INFO L93 Difference]: Finished difference Result 35 states and 41 transitions. [2021-12-14 13:27:23,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-14 13:27:23,210 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 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 26 [2021-12-14 13:27:23,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 13:27:23,210 INFO L225 Difference]: With dead ends: 35 [2021-12-14 13:27:23,210 INFO L226 Difference]: Without dead ends: 31 [2021-12-14 13:27:23,211 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-14 13:27:23,211 INFO L933 BasicCegarLoop]: 31 mSDtfsCounter, 0 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 83 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-14 13:27:23,211 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 83 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-14 13:27:23,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2021-12-14 13:27:23,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 28. [2021-12-14 13:27:23,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 22 states have (on average 1.2272727272727273) internal successors, (27), 23 states have internal predecessors, (27), 2 states have call successors, (2), 1 states have call predecessors, (2), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2021-12-14 13:27:23,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 33 transitions. [2021-12-14 13:27:23,215 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 33 transitions. Word has length 26 [2021-12-14 13:27:23,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 13:27:23,215 INFO L470 AbstractCegarLoop]: Abstraction has 28 states and 33 transitions. [2021-12-14 13:27:23,215 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 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) [2021-12-14 13:27:23,215 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 33 transitions. [2021-12-14 13:27:23,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2021-12-14 13:27:23,216 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 13:27:23,216 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 13:27:23,244 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (14)] Forceful destruction successful, exit code 0 [2021-12-14 13:27:23,424 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-14 13:27:23,425 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 13:27:23,425 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 13:27:23,425 INFO L85 PathProgramCache]: Analyzing trace with hash 199294188, now seen corresponding path program 1 times [2021-12-14 13:27:23,426 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-14 13:27:23,426 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1081725437] [2021-12-14 13:27:23,426 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 13:27:23,426 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-14 13:27:23,427 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-14 13:27:23,427 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-14 13:27:23,429 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2021-12-14 13:27:23,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 13:27:23,504 INFO L263 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 13 conjunts are in the unsatisfiable core [2021-12-14 13:27:23,516 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 13:27:24,167 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-14 13:27:24,167 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-14 13:27:24,482 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-14 13:27:24,482 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1081725437] [2021-12-14 13:27:24,483 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1081725437] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-14 13:27:24,483 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [133277612] [2021-12-14 13:27:24,483 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 13:27:24,483 INFO L168 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2021-12-14 13:27:24,483 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2021-12-14 13:27:24,515 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2021-12-14 13:27:24,523 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (16)] Waiting until timeout for monitored process [2021-12-14 13:27:24,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 13:27:24,777 INFO L263 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 10 conjunts are in the unsatisfiable core [2021-12-14 13:27:24,778 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 13:27:25,481 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-12-14 13:27:25,481 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-14 13:27:25,481 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [133277612] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 13:27:25,481 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-14 13:27:25,481 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [9] total 14 [2021-12-14 13:27:25,481 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [811200988] [2021-12-14 13:27:25,481 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 13:27:25,482 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-14 13:27:25,482 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-14 13:27:25,482 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-14 13:27:25,482 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=258, Unknown=0, NotChecked=0, Total=306 [2021-12-14 13:27:25,482 INFO L87 Difference]: Start difference. First operand 28 states and 33 transitions. Second operand has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 states have internal predecessors, (18), 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) [2021-12-14 13:27:25,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 13:27:25,824 INFO L93 Difference]: Finished difference Result 32 states and 36 transitions. [2021-12-14 13:27:25,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-14 13:27:25,824 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 states have internal predecessors, (18), 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 26 [2021-12-14 13:27:25,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 13:27:25,824 INFO L225 Difference]: With dead ends: 32 [2021-12-14 13:27:25,825 INFO L226 Difference]: Without dead ends: 28 [2021-12-14 13:27:25,825 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=82, Invalid=380, Unknown=0, NotChecked=0, Total=462 [2021-12-14 13:27:25,825 INFO L933 BasicCegarLoop]: 23 mSDtfsCounter, 17 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 110 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-14 13:27:25,825 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [17 Valid, 110 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-14 13:27:25,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2021-12-14 13:27:25,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 27. [2021-12-14 13:27:25,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 21 states have (on average 1.1904761904761905) internal successors, (25), 23 states have internal predecessors, (25), 2 states have call successors, (2), 1 states have call predecessors, (2), 3 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2021-12-14 13:27:25,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 31 transitions. [2021-12-14 13:27:25,828 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 31 transitions. Word has length 26 [2021-12-14 13:27:25,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 13:27:25,828 INFO L470 AbstractCegarLoop]: Abstraction has 27 states and 31 transitions. [2021-12-14 13:27:25,828 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 states have internal predecessors, (18), 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) [2021-12-14 13:27:25,828 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 31 transitions. [2021-12-14 13:27:25,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-12-14 13:27:25,829 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 13:27:25,829 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 13:27:25,834 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (16)] Ended with exit code 0 [2021-12-14 13:27:26,040 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (15)] Ended with exit code 0 [2021-12-14 13:27:26,232 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-14 13:27:26,232 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 13:27:26,233 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 13:27:26,233 INFO L85 PathProgramCache]: Analyzing trace with hash -865134783, now seen corresponding path program 1 times [2021-12-14 13:27:26,233 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-14 13:27:26,233 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [926321291] [2021-12-14 13:27:26,233 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 13:27:26,233 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-14 13:27:26,233 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-14 13:27:26,234 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-14 13:27:26,236 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (17)] Waiting until timeout for monitored process [2021-12-14 13:27:26,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 13:27:26,321 INFO L263 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 11 conjunts are in the unsatisfiable core [2021-12-14 13:27:26,322 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 13:27:26,530 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-14 13:27:26,530 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-14 13:27:26,531 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-14 13:27:26,531 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [926321291] [2021-12-14 13:27:26,531 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [926321291] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 13:27:26,531 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 13:27:26,531 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-14 13:27:26,531 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1709055376] [2021-12-14 13:27:26,531 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 13:27:26,531 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-14 13:27:26,531 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-14 13:27:26,532 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-14 13:27:26,532 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-12-14 13:27:26,532 INFO L87 Difference]: Start difference. First operand 27 states and 31 transitions. Second operand has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 7 states have internal predecessors, (23), 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) [2021-12-14 13:27:26,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 13:27:26,586 INFO L93 Difference]: Finished difference Result 36 states and 40 transitions. [2021-12-14 13:27:26,586 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-12-14 13:27:26,586 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 7 states have internal predecessors, (23), 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 27 [2021-12-14 13:27:26,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 13:27:26,587 INFO L225 Difference]: With dead ends: 36 [2021-12-14 13:27:26,587 INFO L226 Difference]: Without dead ends: 29 [2021-12-14 13:27:26,587 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2021-12-14 13:27:26,588 INFO L933 BasicCegarLoop]: 19 mSDtfsCounter, 3 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 1 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 94 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 26 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-14 13:27:26,588 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4 Valid, 94 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1 Invalid, 0 Unknown, 26 Unchecked, 0.0s Time] [2021-12-14 13:27:26,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2021-12-14 13:27:26,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 27. [2021-12-14 13:27:26,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 21 states have (on average 1.1904761904761905) internal successors, (25), 23 states have internal predecessors, (25), 2 states have call successors, (2), 1 states have call predecessors, (2), 3 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2021-12-14 13:27:26,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 31 transitions. [2021-12-14 13:27:26,590 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 31 transitions. Word has length 27 [2021-12-14 13:27:26,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 13:27:26,590 INFO L470 AbstractCegarLoop]: Abstraction has 27 states and 31 transitions. [2021-12-14 13:27:26,591 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 7 states have internal predecessors, (23), 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) [2021-12-14 13:27:26,591 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 31 transitions. [2021-12-14 13:27:26,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2021-12-14 13:27:26,591 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 13:27:26,591 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 13:27:26,604 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (17)] Forceful destruction successful, exit code 0 [2021-12-14 13:27:26,800 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-14 13:27:26,800 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 13:27:26,800 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 13:27:26,800 INFO L85 PathProgramCache]: Analyzing trace with hash 109054183, now seen corresponding path program 1 times [2021-12-14 13:27:26,800 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-14 13:27:26,800 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [521879997] [2021-12-14 13:27:26,801 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 13:27:26,801 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-14 13:27:26,801 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-14 13:27:26,811 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-14 13:27:26,813 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (18)] Waiting until timeout for monitored process [2021-12-14 13:27:26,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 13:27:26,915 INFO L263 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 13 conjunts are in the unsatisfiable core [2021-12-14 13:27:26,916 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 13:27:26,988 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 13 [2021-12-14 13:27:27,130 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-14 13:27:27,130 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-14 13:27:27,130 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-14 13:27:27,130 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [521879997] [2021-12-14 13:27:27,130 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [521879997] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 13:27:27,130 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 13:27:27,130 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-14 13:27:27,130 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [401191091] [2021-12-14 13:27:27,131 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 13:27:27,131 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-14 13:27:27,131 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-14 13:27:27,131 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-14 13:27:27,131 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-12-14 13:27:27,131 INFO L87 Difference]: Start difference. First operand 27 states and 31 transitions. Second operand has 7 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 7 states have internal predecessors, (24), 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) [2021-12-14 13:27:27,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 13:27:27,158 INFO L93 Difference]: Finished difference Result 34 states and 37 transitions. [2021-12-14 13:27:27,158 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-12-14 13:27:27,159 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 7 states have internal predecessors, (24), 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 28 [2021-12-14 13:27:27,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 13:27:27,159 INFO L225 Difference]: With dead ends: 34 [2021-12-14 13:27:27,159 INFO L226 Difference]: Without dead ends: 27 [2021-12-14 13:27:27,159 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2021-12-14 13:27:27,160 INFO L933 BasicCegarLoop]: 17 mSDtfsCounter, 3 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 1 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 84 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 26 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-14 13:27:27,160 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4 Valid, 84 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1 Invalid, 0 Unknown, 26 Unchecked, 0.0s Time] [2021-12-14 13:27:27,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2021-12-14 13:27:27,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 25. [2021-12-14 13:27:27,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 20 states have (on average 1.2) internal successors, (24), 21 states have internal predecessors, (24), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-14 13:27:27,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 28 transitions. [2021-12-14 13:27:27,162 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 28 transitions. Word has length 28 [2021-12-14 13:27:27,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 13:27:27,162 INFO L470 AbstractCegarLoop]: Abstraction has 25 states and 28 transitions. [2021-12-14 13:27:27,162 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 7 states have internal predecessors, (24), 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) [2021-12-14 13:27:27,162 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 28 transitions. [2021-12-14 13:27:27,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2021-12-14 13:27:27,162 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 13:27:27,162 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 13:27:27,188 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (18)] Forceful destruction successful, exit code 0 [2021-12-14 13:27:27,388 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-14 13:27:27,388 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 13:27:27,389 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 13:27:27,389 INFO L85 PathProgramCache]: Analyzing trace with hash -1698400280, now seen corresponding path program 1 times [2021-12-14 13:27:27,389 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-14 13:27:27,389 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2033351728] [2021-12-14 13:27:27,389 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 13:27:27,389 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-14 13:27:27,390 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-14 13:27:27,391 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-14 13:27:27,392 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (19)] Waiting until timeout for monitored process [2021-12-14 13:27:27,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 13:27:27,457 INFO L263 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 3 conjunts are in the unsatisfiable core [2021-12-14 13:27:27,458 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 13:27:27,506 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-12-14 13:27:27,507 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-14 13:27:27,507 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-14 13:27:27,507 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2033351728] [2021-12-14 13:27:27,507 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2033351728] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 13:27:27,507 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 13:27:27,507 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-14 13:27:27,510 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1558600789] [2021-12-14 13:27:27,510 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 13:27:27,510 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-14 13:27:27,510 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-14 13:27:27,511 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-14 13:27:27,511 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-14 13:27:27,511 INFO L87 Difference]: Start difference. First operand 25 states and 28 transitions. Second operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 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) [2021-12-14 13:27:27,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 13:27:27,537 INFO L93 Difference]: Finished difference Result 25 states and 28 transitions. [2021-12-14 13:27:27,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-14 13:27:27,538 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 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 28 [2021-12-14 13:27:27,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 13:27:27,538 INFO L225 Difference]: With dead ends: 25 [2021-12-14 13:27:27,538 INFO L226 Difference]: Without dead ends: 0 [2021-12-14 13:27:27,538 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-14 13:27:27,539 INFO L933 BasicCegarLoop]: 22 mSDtfsCounter, 0 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-14 13:27:27,539 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 58 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-14 13:27:27,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2021-12-14 13:27:27,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2021-12-14 13:27:27,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 13:27:27,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2021-12-14 13:27:27,539 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 28 [2021-12-14 13:27:27,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 13:27:27,540 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-12-14 13:27:27,540 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 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) [2021-12-14 13:27:27,540 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2021-12-14 13:27:27,540 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-12-14 13:27:27,541 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2021-12-14 13:27:27,575 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (19)] Forceful destruction successful, exit code 0 [2021-12-14 13:27:27,743 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-14 13:27:27,745 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2021-12-14 13:27:28,105 INFO L858 garLoopResultBuilder]: For program point __fpclassify_doubleFINAL(lines 19 44) no Hoare annotation was computed. [2021-12-14 13:27:28,105 INFO L861 garLoopResultBuilder]: At program point __fpclassify_doubleENTRY(lines 19 44) the Hoare annotation is: true [2021-12-14 13:27:28,105 INFO L858 garLoopResultBuilder]: For program point L32(lines 32 43) no Hoare annotation was computed. [2021-12-14 13:27:28,105 INFO L858 garLoopResultBuilder]: For program point __fpclassify_doubleEXIT(lines 19 44) no Hoare annotation was computed. [2021-12-14 13:27:28,105 INFO L858 garLoopResultBuilder]: For program point L22-1(lines 22 27) no Hoare annotation was computed. [2021-12-14 13:27:28,105 INFO L854 garLoopResultBuilder]: At program point L22-2(lines 22 27) the Hoare annotation is: (= |__fpclassify_double_#in~x| __fpclassify_double_~x) [2021-12-14 13:27:28,105 INFO L858 garLoopResultBuilder]: For program point L22-3(lines 19 44) no Hoare annotation was computed. [2021-12-14 13:27:28,105 INFO L858 garLoopResultBuilder]: For program point L39(lines 39 43) no Hoare annotation was computed. [2021-12-14 13:27:28,106 INFO L858 garLoopResultBuilder]: For program point L35(lines 35 43) no Hoare annotation was computed. [2021-12-14 13:27:28,106 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2021-12-14 13:27:28,106 INFO L858 garLoopResultBuilder]: For program point L64(lines 64 73) no Hoare annotation was computed. [2021-12-14 13:27:28,106 INFO L858 garLoopResultBuilder]: For program point L64-2(lines 64 73) no Hoare annotation was computed. [2021-12-14 13:27:28,106 INFO L858 garLoopResultBuilder]: For program point L52(line 52) no Hoare annotation was computed. [2021-12-14 13:27:28,106 INFO L858 garLoopResultBuilder]: For program point L52-2(line 52) no Hoare annotation was computed. [2021-12-14 13:27:28,106 INFO L854 garLoopResultBuilder]: At program point L52-3(lines 46 53) the Hoare annotation is: (and (= (_ bv0 32) |ULTIMATE.start_isnan_double_#res#1|) (= |ULTIMATE.start_fmin_double_#res#1| |ULTIMATE.start_main_~x~0#1|) (fp.eq |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~x~0#1|) (= |ULTIMATE.start_fmin_double_~x#1| |ULTIMATE.start_main_~x~0#1|)) [2021-12-14 13:27:28,106 INFO L861 garLoopResultBuilder]: At program point L75(lines 55 76) the Hoare annotation is: true [2021-12-14 13:27:28,106 INFO L858 garLoopResultBuilder]: For program point L69(lines 69 72) no Hoare annotation was computed. [2021-12-14 13:27:28,106 INFO L858 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2021-12-14 13:27:28,106 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2021-12-14 13:27:28,106 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2021-12-14 13:27:28,106 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 70) no Hoare annotation was computed. [2021-12-14 13:27:28,106 INFO L854 garLoopResultBuilder]: At program point L18(line 18) the Hoare annotation is: (and (exists ((currentRoundingMode RoundingMode)) (= (fp.div currentRoundingMode (_ +zero 11 53) (_ +zero 11 53)) |ULTIMATE.start_main_~y~0#1|)) (let ((.cse0 (fp.eq |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~x~0#1|))) (or (and (= (_ bv0 32) |ULTIMATE.start_isnan_double_#res#1|) .cse0) (and (= (_ bv1 32) |ULTIMATE.start_isnan_double_#res#1|) (not .cse0))))) [2021-12-14 13:27:28,106 INFO L854 garLoopResultBuilder]: At program point L49(line 49) the Hoare annotation is: (and (= (_ bv0 32) |ULTIMATE.start_isnan_double_#res#1|) (exists ((currentRoundingMode RoundingMode)) (= |ULTIMATE.start_fmin_double_~y#1| (fp.div currentRoundingMode (_ +zero 11 53) (_ +zero 11 53)))) (fp.eq |ULTIMATE.start_fmin_double_~x#1| |ULTIMATE.start_fmin_double_~x#1|) (= |ULTIMATE.start_fmin_double_~x#1| |ULTIMATE.start_main_~x~0#1|)) [2021-12-14 13:27:28,106 INFO L858 garLoopResultBuilder]: For program point L49-1(lines 49 50) no Hoare annotation was computed. [2021-12-14 13:27:28,106 INFO L854 garLoopResultBuilder]: At program point L47(line 47) the Hoare annotation is: (and (= (_ bv0 32) |ULTIMATE.start_isnan_double_#res#1|) (exists ((currentRoundingMode RoundingMode)) (= |ULTIMATE.start_fmin_double_~y#1| (fp.div currentRoundingMode (_ +zero 11 53) (_ +zero 11 53)))) (fp.eq |ULTIMATE.start_fmin_double_~x#1| |ULTIMATE.start_fmin_double_~x#1|) (= |ULTIMATE.start_fmin_double_~x#1| |ULTIMATE.start_main_~x~0#1|)) [2021-12-14 13:27:28,107 INFO L858 garLoopResultBuilder]: For program point L47-1(lines 47 48) no Hoare annotation was computed. [2021-12-14 13:27:28,107 INFO L858 garLoopResultBuilder]: For program point L70(line 70) no Hoare annotation was computed. [2021-12-14 13:27:28,109 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 13:27:28,109 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-12-14 13:27:28,115 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2021-12-14 13:27:28,120 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2021-12-14 13:27:28,126 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.12 01:27:28 BoogieIcfgContainer [2021-12-14 13:27:28,126 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-12-14 13:27:28,127 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-12-14 13:27:28,127 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-12-14 13:27:28,128 INFO L275 PluginConnector]: Witness Printer initialized [2021-12-14 13:27:28,128 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 01:27:16" (3/4) ... [2021-12-14 13:27:28,130 INFO L137 WitnessPrinter]: Generating witness for correct program [2021-12-14 13:27:28,134 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __fpclassify_double [2021-12-14 13:27:28,138 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 18 nodes and edges [2021-12-14 13:27:28,138 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 8 nodes and edges [2021-12-14 13:27:28,138 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2021-12-14 13:27:28,139 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2021-12-14 13:27:28,153 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (\exists currentRoundingMode : FloatRoundingMode :: ~fp.div~DOUBLE(currentRoundingMode, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE()) == y) && ((0bv32 == \result && ~fp.eq~DOUBLE(x, x)) || (1bv32 == \result && !~fp.eq~DOUBLE(x, x))) [2021-12-14 13:27:28,154 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: \old(x) == x [2021-12-14 13:27:28,154 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((0bv32 == \result && \result == x) && ~fp.eq~DOUBLE(x, x)) && x == x [2021-12-14 13:27:28,167 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2021-12-14 13:27:28,167 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-12-14 13:27:28,168 INFO L158 Benchmark]: Toolchain (without parser) took 12273.92ms. Allocated memory was 48.2MB in the beginning and 86.0MB in the end (delta: 37.7MB). Free memory was 24.6MB in the beginning and 41.2MB in the end (delta: -16.6MB). Peak memory consumption was 20.0MB. Max. memory is 16.1GB. [2021-12-14 13:27:28,168 INFO L158 Benchmark]: CDTParser took 0.26ms. Allocated memory is still 48.2MB. Free memory was 31.1MB in the beginning and 31.1MB in the end (delta: 39.9kB). There was no memory consumed. Max. memory is 16.1GB. [2021-12-14 13:27:28,168 INFO L158 Benchmark]: CACSL2BoogieTranslator took 199.41ms. Allocated memory was 48.2MB in the beginning and 58.7MB in the end (delta: 10.5MB). Free memory was 24.5MB in the beginning and 41.9MB in the end (delta: -17.4MB). Peak memory consumption was 3.4MB. Max. memory is 16.1GB. [2021-12-14 13:27:28,168 INFO L158 Benchmark]: Boogie Procedure Inliner took 27.11ms. Allocated memory is still 58.7MB. Free memory was 41.9MB in the beginning and 40.3MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. [2021-12-14 13:27:28,169 INFO L158 Benchmark]: Boogie Preprocessor took 23.28ms. Allocated memory is still 58.7MB. Free memory was 40.3MB in the beginning and 38.9MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-14 13:27:28,169 INFO L158 Benchmark]: RCFGBuilder took 278.89ms. Allocated memory is still 58.7MB. Free memory was 38.9MB in the beginning and 39.2MB in the end (delta: -345.9kB). Peak memory consumption was 11.8MB. Max. memory is 16.1GB. [2021-12-14 13:27:28,170 INFO L158 Benchmark]: TraceAbstraction took 11700.35ms. Allocated memory was 58.7MB in the beginning and 86.0MB in the end (delta: 27.3MB). Free memory was 38.8MB in the beginning and 44.0MB in the end (delta: -5.3MB). Peak memory consumption was 22.8MB. Max. memory is 16.1GB. [2021-12-14 13:27:28,170 INFO L158 Benchmark]: Witness Printer took 39.72ms. Allocated memory is still 86.0MB. Free memory was 44.0MB in the beginning and 41.2MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-14 13:27:28,174 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.26ms. Allocated memory is still 48.2MB. Free memory was 31.1MB in the beginning and 31.1MB in the end (delta: 39.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 199.41ms. Allocated memory was 48.2MB in the beginning and 58.7MB in the end (delta: 10.5MB). Free memory was 24.5MB in the beginning and 41.9MB in the end (delta: -17.4MB). Peak memory consumption was 3.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 27.11ms. Allocated memory is still 58.7MB. Free memory was 41.9MB in the beginning and 40.3MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 23.28ms. Allocated memory is still 58.7MB. Free memory was 40.3MB in the beginning and 38.9MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 278.89ms. Allocated memory is still 58.7MB. Free memory was 38.9MB in the beginning and 39.2MB in the end (delta: -345.9kB). Peak memory consumption was 11.8MB. Max. memory is 16.1GB. * TraceAbstraction took 11700.35ms. Allocated memory was 58.7MB in the beginning and 86.0MB in the end (delta: 27.3MB). Free memory was 38.8MB in the beginning and 44.0MB in the end (delta: -5.3MB). Peak memory consumption was 22.8MB. Max. memory is 16.1GB. * Witness Printer took 39.72ms. Allocated memory is still 86.0MB. Free memory was 44.0MB in the beginning and 41.2MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] * 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: 70]: 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, 27 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 11.6s, OverallIterations: 17, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.4s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 66 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 62 mSDsluCounter, 1484 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 131 IncrementalHoareTripleChecker+Unchecked, 1023 mSDsCounter, 8 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 148 IncrementalHoareTripleChecker+Invalid, 287 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 8 mSolverCounterUnsat, 461 mSDtfsCounter, 148 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 416 GetRequests, 341 SyntacticMatches, 0 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 1.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=30occurred in iteration=11, InterpolantAutomatonStates: 91, 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, 17 MinimizatonAttempts, 37 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 13 PreInvPairs, 18 NumberOfFragments, 76 HoareAnnotationTreeSize, 13 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 7 FomulaSimplificationsInter, 254 FormulaSimplificationTreeSizeReductionInter, 0.3s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 4.5s InterpolantComputationTime, 407 NumberOfCodeBlocks, 407 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 389 ConstructedInterpolants, 65 QuantifiedInterpolants, 1584 SizeOfPredicates, 62 NumberOfNonLiveVariables, 1424 ConjunctsInSsa, 123 ConjunctsInUnsatCore, 18 InterpolantComputations, 17 PerfectInterpolantSequences, 67/72 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: 18]: Loop Invariant [2021-12-14 13:27:28,191 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2021-12-14 13:27:28,192 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] Derived loop invariant: (\exists currentRoundingMode : FloatRoundingMode :: ~fp.div~DOUBLE(currentRoundingMode, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE()) == y) && ((0bv32 == \result && ~fp.eq~DOUBLE(x, x)) || (1bv32 == \result && !~fp.eq~DOUBLE(x, x))) - InvariantResult [Line: 55]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 46]: Loop Invariant Derived loop invariant: ((0bv32 == \result && \result == x) && ~fp.eq~DOUBLE(x, x)) && x == x - InvariantResult [Line: 22]: Loop Invariant Derived loop invariant: \old(x) == x RESULT: Ultimate proved your program to be correct! [2021-12-14 13:27:28,235 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