./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/bitvector/byte_add-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 20ed64ec Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/bitvector/byte_add-1.i -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 409f93cc3fb27e0335e986593862ddeb482b815c .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/bitvector/byte_add-1.i -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 409f93cc3fb27e0335e986593862ddeb482b815c ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.2.1-dev-20ed64e [2021-08-25 19:53:33,875 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-08-25 19:53:33,877 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-08-25 19:53:33,908 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-08-25 19:53:33,909 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-08-25 19:53:33,912 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-08-25 19:53:33,913 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-08-25 19:53:33,916 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-08-25 19:53:33,918 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-08-25 19:53:33,921 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-08-25 19:53:33,921 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-08-25 19:53:33,924 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-08-25 19:53:33,924 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-08-25 19:53:33,926 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-08-25 19:53:33,927 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-08-25 19:53:33,930 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-08-25 19:53:33,931 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-08-25 19:53:33,932 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-08-25 19:53:33,933 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-08-25 19:53:33,938 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-08-25 19:53:33,939 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-08-25 19:53:33,940 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-08-25 19:53:33,941 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-08-25 19:53:33,942 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-08-25 19:53:33,943 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-08-25 19:53:33,943 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-08-25 19:53:33,944 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-08-25 19:53:33,949 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-08-25 19:53:33,950 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-08-25 19:53:33,950 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-08-25 19:53:33,950 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-08-25 19:53:33,951 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-08-25 19:53:33,952 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-08-25 19:53:33,952 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-08-25 19:53:33,953 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-08-25 19:53:33,953 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-08-25 19:53:33,954 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-08-25 19:53:33,954 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-08-25 19:53:33,954 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-08-25 19:53:33,955 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-08-25 19:53:33,956 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-08-25 19:53:33,956 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2021-08-25 19:53:33,985 INFO L113 SettingsManager]: Loading preferences was successful [2021-08-25 19:53:33,985 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-08-25 19:53:33,986 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-08-25 19:53:33,986 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-08-25 19:53:33,987 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-08-25 19:53:33,987 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-08-25 19:53:33,987 INFO L138 SettingsManager]: * Use SBE=true [2021-08-25 19:53:33,988 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-08-25 19:53:33,988 INFO L138 SettingsManager]: * sizeof long=4 [2021-08-25 19:53:33,988 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-08-25 19:53:33,989 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-08-25 19:53:33,989 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-08-25 19:53:33,989 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-08-25 19:53:33,989 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-08-25 19:53:33,989 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-08-25 19:53:33,989 INFO L138 SettingsManager]: * sizeof long double=12 [2021-08-25 19:53:33,989 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-08-25 19:53:33,989 INFO L138 SettingsManager]: * Use constant arrays=true [2021-08-25 19:53:33,990 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-08-25 19:53:33,990 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-08-25 19:53:33,990 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-08-25 19:53:33,990 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-08-25 19:53:33,990 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-08-25 19:53:33,990 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-08-25 19:53:33,991 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-08-25 19:53:33,991 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-08-25 19:53:33,991 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-08-25 19:53:33,991 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-08-25 19:53:33,991 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-08-25 19:53:33,991 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-08-25 19:53:33,991 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 -> 409f93cc3fb27e0335e986593862ddeb482b815c [2021-08-25 19:53:34,211 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-08-25 19:53:34,230 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-08-25 19:53:34,232 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-08-25 19:53:34,233 INFO L271 PluginConnector]: Initializing CDTParser... [2021-08-25 19:53:34,234 INFO L275 PluginConnector]: CDTParser initialized [2021-08-25 19:53:34,234 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/bitvector/byte_add-1.i [2021-08-25 19:53:34,280 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d4ac67516/21c604abfe8a4d5bbabf16fce5e7d504/FLAG47c0bddc6 [2021-08-25 19:53:34,601 INFO L306 CDTParser]: Found 1 translation units. [2021-08-25 19:53:34,603 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/byte_add-1.i [2021-08-25 19:53:34,611 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d4ac67516/21c604abfe8a4d5bbabf16fce5e7d504/FLAG47c0bddc6 [2021-08-25 19:53:35,012 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d4ac67516/21c604abfe8a4d5bbabf16fce5e7d504 [2021-08-25 19:53:35,016 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-08-25 19:53:35,017 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-08-25 19:53:35,020 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-08-25 19:53:35,020 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-08-25 19:53:35,022 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-08-25 19:53:35,023 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.08 07:53:35" (1/1) ... [2021-08-25 19:53:35,025 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@a7a9c1e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 07:53:35, skipping insertion in model container [2021-08-25 19:53:35,025 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.08 07:53:35" (1/1) ... [2021-08-25 19:53:35,030 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-08-25 19:53:35,052 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-08-25 19:53:35,138 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/byte_add-1.i[861,874] [2021-08-25 19:53:35,161 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-25 19:53:35,170 INFO L203 MainTranslator]: Completed pre-run [2021-08-25 19:53:35,185 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/byte_add-1.i[861,874] [2021-08-25 19:53:35,203 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-25 19:53:35,217 INFO L208 MainTranslator]: Completed translation [2021-08-25 19:53:35,217 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 07:53:35 WrapperNode [2021-08-25 19:53:35,217 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-08-25 19:53:35,218 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-08-25 19:53:35,218 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-08-25 19:53:35,218 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-08-25 19:53:35,222 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 07:53:35" (1/1) ... [2021-08-25 19:53:35,247 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 07:53:35" (1/1) ... [2021-08-25 19:53:35,270 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-08-25 19:53:35,271 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-08-25 19:53:35,271 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-08-25 19:53:35,271 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-08-25 19:53:35,276 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 07:53:35" (1/1) ... [2021-08-25 19:53:35,276 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 07:53:35" (1/1) ... [2021-08-25 19:53:35,285 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 07:53:35" (1/1) ... [2021-08-25 19:53:35,285 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 07:53:35" (1/1) ... [2021-08-25 19:53:35,296 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 07:53:35" (1/1) ... [2021-08-25 19:53:35,299 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 07:53:35" (1/1) ... [2021-08-25 19:53:35,305 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 07:53:35" (1/1) ... [2021-08-25 19:53:35,307 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-08-25 19:53:35,307 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-08-25 19:53:35,311 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-08-25 19:53:35,311 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-08-25 19:53:35,312 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 07:53:35" (1/1) ... [2021-08-25 19:53:35,316 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-08-25 19:53:35,321 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-25 19:53:35,334 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-08-25 19:53:35,357 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-08-25 19:53:35,372 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-08-25 19:53:35,372 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-08-25 19:53:35,374 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-08-25 19:53:35,374 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-08-25 19:53:35,736 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-08-25 19:53:35,736 INFO L299 CfgBuilder]: Removed 10 assume(true) statements. [2021-08-25 19:53:35,737 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.08 07:53:35 BoogieIcfgContainer [2021-08-25 19:53:35,738 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-08-25 19:53:35,738 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-08-25 19:53:35,739 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-08-25 19:53:35,740 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-08-25 19:53:35,740 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.08 07:53:35" (1/3) ... [2021-08-25 19:53:35,741 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6e1296a1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.08 07:53:35, skipping insertion in model container [2021-08-25 19:53:35,741 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 07:53:35" (2/3) ... [2021-08-25 19:53:35,741 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6e1296a1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.08 07:53:35, skipping insertion in model container [2021-08-25 19:53:35,741 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.08 07:53:35" (3/3) ... [2021-08-25 19:53:35,742 INFO L111 eAbstractionObserver]: Analyzing ICFG byte_add-1.i [2021-08-25 19:53:35,745 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-08-25 19:53:35,745 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-08-25 19:53:35,779 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-08-25 19:53:35,783 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2021-08-25 19:53:35,784 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-08-25 19:53:35,792 INFO L276 IsEmpty]: Start isEmpty. Operand has 42 states, 40 states have (on average 1.775) internal successors, (71), 41 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 19:53:35,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2021-08-25 19:53:35,795 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 19:53:35,795 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 19:53:35,796 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 19:53:35,799 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 19:53:35,799 INFO L82 PathProgramCache]: Analyzing trace with hash 255061167, now seen corresponding path program 1 times [2021-08-25 19:53:35,804 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 19:53:35,804 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [132929796] [2021-08-25 19:53:35,804 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 19:53:35,805 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 19:53:35,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 19:53:35,888 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-25 19:53:35,889 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 19:53:35,889 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [132929796] [2021-08-25 19:53:35,889 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [132929796] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 19:53:35,890 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 19:53:35,890 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-08-25 19:53:35,891 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [185968201] [2021-08-25 19:53:35,894 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2021-08-25 19:53:35,894 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 19:53:35,903 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-08-25 19:53:35,904 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-08-25 19:53:35,905 INFO L87 Difference]: Start difference. First operand has 42 states, 40 states have (on average 1.775) internal successors, (71), 41 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 19:53:35,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 19:53:35,919 INFO L93 Difference]: Finished difference Result 57 states and 92 transitions. [2021-08-25 19:53:35,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-08-25 19:53:35,920 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), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2021-08-25 19:53:35,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 19:53:35,926 INFO L225 Difference]: With dead ends: 57 [2021-08-25 19:53:35,926 INFO L226 Difference]: Without dead ends: 38 [2021-08-25 19:53:35,928 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0ms TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-08-25 19:53:35,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2021-08-25 19:53:35,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2021-08-25 19:53:35,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 37 states have (on average 1.7297297297297298) internal successors, (64), 37 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 19:53:35,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 64 transitions. [2021-08-25 19:53:35,956 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 64 transitions. Word has length 12 [2021-08-25 19:53:35,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 19:53:35,957 INFO L470 AbstractCegarLoop]: Abstraction has 38 states and 64 transitions. [2021-08-25 19:53:35,957 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), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 19:53:35,957 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 64 transitions. [2021-08-25 19:53:35,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2021-08-25 19:53:35,959 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 19:53:35,959 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 19:53:35,959 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-08-25 19:53:35,959 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 19:53:35,962 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 19:53:35,962 INFO L82 PathProgramCache]: Analyzing trace with hash 1803477009, now seen corresponding path program 1 times [2021-08-25 19:53:35,962 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 19:53:35,962 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [929321296] [2021-08-25 19:53:35,963 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 19:53:35,963 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 19:53:36,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 19:53:36,080 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-25 19:53:36,080 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 19:53:36,081 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [929321296] [2021-08-25 19:53:36,081 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [929321296] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 19:53:36,081 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 19:53:36,081 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-25 19:53:36,081 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1393461751] [2021-08-25 19:53:36,082 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-25 19:53:36,082 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 19:53:36,083 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-25 19:53:36,083 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 19:53:36,083 INFO L87 Difference]: Start difference. First operand 38 states and 64 transitions. Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 19:53:36,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 19:53:36,217 INFO L93 Difference]: Finished difference Result 89 states and 156 transitions. [2021-08-25 19:53:36,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-25 19:53:36,218 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2021-08-25 19:53:36,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 19:53:36,219 INFO L225 Difference]: With dead ends: 89 [2021-08-25 19:53:36,219 INFO L226 Difference]: Without dead ends: 61 [2021-08-25 19:53:36,219 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.5ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 19:53:36,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2021-08-25 19:53:36,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 59. [2021-08-25 19:53:36,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 58 states have (on average 1.5344827586206897) internal successors, (89), 58 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 19:53:36,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 89 transitions. [2021-08-25 19:53:36,225 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 89 transitions. Word has length 12 [2021-08-25 19:53:36,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 19:53:36,225 INFO L470 AbstractCegarLoop]: Abstraction has 59 states and 89 transitions. [2021-08-25 19:53:36,225 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 19:53:36,225 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 89 transitions. [2021-08-25 19:53:36,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-08-25 19:53:36,226 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 19:53:36,226 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 19:53:36,226 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-08-25 19:53:36,226 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 19:53:36,227 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 19:53:36,227 INFO L82 PathProgramCache]: Analyzing trace with hash -1336656122, now seen corresponding path program 1 times [2021-08-25 19:53:36,227 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 19:53:36,227 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1646869134] [2021-08-25 19:53:36,227 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 19:53:36,227 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 19:53:36,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 19:53:36,361 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-08-25 19:53:36,361 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 19:53:36,361 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1646869134] [2021-08-25 19:53:36,362 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1646869134] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 19:53:36,362 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 19:53:36,362 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-25 19:53:36,362 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1676123568] [2021-08-25 19:53:36,362 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-25 19:53:36,362 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 19:53:36,363 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-25 19:53:36,363 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-25 19:53:36,363 INFO L87 Difference]: Start difference. First operand 59 states and 89 transitions. Second operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 19:53:36,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 19:53:36,543 INFO L93 Difference]: Finished difference Result 143 states and 218 transitions. [2021-08-25 19:53:36,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-25 19:53:36,544 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-08-25 19:53:36,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 19:53:36,545 INFO L225 Difference]: With dead ends: 143 [2021-08-25 19:53:36,545 INFO L226 Difference]: Without dead ends: 105 [2021-08-25 19:53:36,545 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 28.5ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-25 19:53:36,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2021-08-25 19:53:36,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 67. [2021-08-25 19:53:36,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 66 states have (on average 1.4848484848484849) internal successors, (98), 66 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 19:53:36,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 98 transitions. [2021-08-25 19:53:36,550 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 98 transitions. Word has length 18 [2021-08-25 19:53:36,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 19:53:36,551 INFO L470 AbstractCegarLoop]: Abstraction has 67 states and 98 transitions. [2021-08-25 19:53:36,551 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 19:53:36,551 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 98 transitions. [2021-08-25 19:53:36,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-08-25 19:53:36,551 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 19:53:36,552 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 19:53:36,552 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-08-25 19:53:36,552 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 19:53:36,552 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 19:53:36,552 INFO L82 PathProgramCache]: Analyzing trace with hash -640429161, now seen corresponding path program 1 times [2021-08-25 19:53:36,553 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 19:53:36,553 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [662406044] [2021-08-25 19:53:36,553 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 19:53:36,553 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 19:53:36,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 19:53:36,641 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-08-25 19:53:36,642 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 19:53:36,642 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [662406044] [2021-08-25 19:53:36,642 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [662406044] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 19:53:36,642 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 19:53:36,642 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-25 19:53:36,642 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [522819453] [2021-08-25 19:53:36,643 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-25 19:53:36,643 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 19:53:36,643 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-25 19:53:36,643 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-25 19:53:36,644 INFO L87 Difference]: Start difference. First operand 67 states and 98 transitions. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 19:53:36,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 19:53:36,793 INFO L93 Difference]: Finished difference Result 169 states and 250 transitions. [2021-08-25 19:53:36,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-25 19:53:36,794 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2021-08-25 19:53:36,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 19:53:36,797 INFO L225 Difference]: With dead ends: 169 [2021-08-25 19:53:36,797 INFO L226 Difference]: Without dead ends: 125 [2021-08-25 19:53:36,800 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 30.1ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-25 19:53:36,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2021-08-25 19:53:36,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 77. [2021-08-25 19:53:36,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 76 states have (on average 1.4605263157894737) internal successors, (111), 76 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 19:53:36,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 111 transitions. [2021-08-25 19:53:36,814 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 111 transitions. Word has length 19 [2021-08-25 19:53:36,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 19:53:36,814 INFO L470 AbstractCegarLoop]: Abstraction has 77 states and 111 transitions. [2021-08-25 19:53:36,814 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 19:53:36,814 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 111 transitions. [2021-08-25 19:53:36,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-08-25 19:53:36,815 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 19:53:36,815 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 19:53:36,815 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-08-25 19:53:36,815 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 19:53:36,815 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 19:53:36,815 INFO L82 PathProgramCache]: Analyzing trace with hash -170409323, now seen corresponding path program 1 times [2021-08-25 19:53:36,815 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 19:53:36,816 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [552107370] [2021-08-25 19:53:36,816 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 19:53:36,816 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 19:53:36,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 19:53:36,858 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-25 19:53:36,859 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 19:53:36,859 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [552107370] [2021-08-25 19:53:36,859 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [552107370] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-25 19:53:36,859 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [441559008] [2021-08-25 19:53:36,860 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 19:53:36,860 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-25 19:53:36,860 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-25 19:53:36,873 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-25 19:53:36,888 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2021-08-25 19:53:36,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 19:53:36,945 INFO L263 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 4 conjunts are in the unsatisfiable core [2021-08-25 19:53:36,948 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-25 19:53:37,111 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-25 19:53:37,112 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [441559008] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 19:53:37,112 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-08-25 19:53:37,112 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2021-08-25 19:53:37,112 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1397065446] [2021-08-25 19:53:37,112 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-25 19:53:37,112 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 19:53:37,112 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-25 19:53:37,113 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2021-08-25 19:53:37,113 INFO L87 Difference]: Start difference. First operand 77 states and 111 transitions. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 19:53:37,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 19:53:37,264 INFO L93 Difference]: Finished difference Result 146 states and 237 transitions. [2021-08-25 19:53:37,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-25 19:53:37,264 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2021-08-25 19:53:37,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 19:53:37,266 INFO L225 Difference]: With dead ends: 146 [2021-08-25 19:53:37,266 INFO L226 Difference]: Without dead ends: 118 [2021-08-25 19:53:37,266 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 20.8ms TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2021-08-25 19:53:37,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2021-08-25 19:53:37,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 100. [2021-08-25 19:53:37,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 99 states have (on average 1.393939393939394) internal successors, (138), 99 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 19:53:37,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 138 transitions. [2021-08-25 19:53:37,282 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 138 transitions. Word has length 20 [2021-08-25 19:53:37,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 19:53:37,282 INFO L470 AbstractCegarLoop]: Abstraction has 100 states and 138 transitions. [2021-08-25 19:53:37,282 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 19:53:37,282 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 138 transitions. [2021-08-25 19:53:37,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2021-08-25 19:53:37,283 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 19:53:37,283 INFO L512 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-08-25 19:53:37,304 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2021-08-25 19:53:37,490 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-25 19:53:37,490 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 19:53:37,491 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 19:53:37,491 INFO L82 PathProgramCache]: Analyzing trace with hash 1606169286, now seen corresponding path program 1 times [2021-08-25 19:53:37,491 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 19:53:37,491 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [91619514] [2021-08-25 19:53:37,491 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 19:53:37,491 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 19:53:37,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 19:53:37,545 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-25 19:53:37,545 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 19:53:37,547 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [91619514] [2021-08-25 19:53:37,547 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [91619514] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-25 19:53:37,547 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1824918307] [2021-08-25 19:53:37,547 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 19:53:37,547 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-25 19:53:37,547 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-25 19:53:37,550 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-25 19:53:37,562 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2021-08-25 19:53:37,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 19:53:37,610 INFO L263 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 5 conjunts are in the unsatisfiable core [2021-08-25 19:53:37,611 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-25 19:53:37,757 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-08-25 19:53:37,757 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1824918307] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 19:53:37,757 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-08-25 19:53:37,757 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 6 [2021-08-25 19:53:37,757 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [384288897] [2021-08-25 19:53:37,758 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-25 19:53:37,758 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 19:53:37,758 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-25 19:53:37,759 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-08-25 19:53:37,759 INFO L87 Difference]: Start difference. First operand 100 states and 138 transitions. Second operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 19:53:50,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 19:53:50,418 INFO L93 Difference]: Finished difference Result 212 states and 313 transitions. [2021-08-25 19:53:50,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-25 19:53:50,418 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2021-08-25 19:53:50,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 19:53:50,419 INFO L225 Difference]: With dead ends: 212 [2021-08-25 19:53:50,419 INFO L226 Difference]: Without dead ends: 145 [2021-08-25 19:53:50,420 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 25 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 27.4ms TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-08-25 19:53:50,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2021-08-25 19:53:50,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 123. [2021-08-25 19:53:50,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 122 states have (on average 1.3524590163934427) internal successors, (165), 122 states have internal predecessors, (165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 19:53:50,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 165 transitions. [2021-08-25 19:53:50,425 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 165 transitions. Word has length 26 [2021-08-25 19:53:50,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 19:53:50,425 INFO L470 AbstractCegarLoop]: Abstraction has 123 states and 165 transitions. [2021-08-25 19:53:50,425 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 19:53:50,425 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 165 transitions. [2021-08-25 19:53:50,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-08-25 19:53:50,426 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 19:53:50,426 INFO L512 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 19:53:50,447 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2021-08-25 19:53:50,639 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2021-08-25 19:53:50,639 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 19:53:50,639 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 19:53:50,639 INFO L82 PathProgramCache]: Analyzing trace with hash 23363195, now seen corresponding path program 1 times [2021-08-25 19:53:50,639 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 19:53:50,640 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [312871169] [2021-08-25 19:53:50,640 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 19:53:50,640 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 19:53:50,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 19:53:50,738 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-25 19:53:50,738 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 19:53:50,738 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [312871169] [2021-08-25 19:53:50,739 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [312871169] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-25 19:53:50,739 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [971421541] [2021-08-25 19:53:50,739 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 19:53:50,739 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-25 19:53:50,739 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-25 19:53:50,740 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-25 19:53:50,742 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2021-08-25 19:53:50,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 19:53:50,806 INFO L263 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 5 conjunts are in the unsatisfiable core [2021-08-25 19:53:50,808 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-25 19:53:50,950 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2021-08-25 19:53:50,951 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [971421541] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 19:53:50,951 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-08-25 19:53:50,951 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 7 [2021-08-25 19:53:50,951 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2042828705] [2021-08-25 19:53:50,951 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-25 19:53:50,952 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 19:53:50,952 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-25 19:53:50,952 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-08-25 19:53:50,952 INFO L87 Difference]: Start difference. First operand 123 states and 165 transitions. Second operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 19:53:51,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 19:53:51,173 INFO L93 Difference]: Finished difference Result 258 states and 365 transitions. [2021-08-25 19:53:51,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-25 19:53:51,173 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2021-08-25 19:53:51,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 19:53:51,174 INFO L225 Difference]: With dead ends: 258 [2021-08-25 19:53:51,174 INFO L226 Difference]: Without dead ends: 168 [2021-08-25 19:53:51,174 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 31 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 33.4ms TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-08-25 19:53:51,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2021-08-25 19:53:51,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 146. [2021-08-25 19:53:51,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 146 states, 145 states have (on average 1.3241379310344827) internal successors, (192), 145 states have internal predecessors, (192), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 19:53:51,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 192 transitions. [2021-08-25 19:53:51,178 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 192 transitions. Word has length 32 [2021-08-25 19:53:51,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 19:53:51,178 INFO L470 AbstractCegarLoop]: Abstraction has 146 states and 192 transitions. [2021-08-25 19:53:51,178 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 19:53:51,178 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 192 transitions. [2021-08-25 19:53:51,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-08-25 19:53:51,179 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 19:53:51,179 INFO L512 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 19:53:51,200 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2021-08-25 19:53:51,379 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-25 19:53:51,380 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 19:53:51,380 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 19:53:51,380 INFO L82 PathProgramCache]: Analyzing trace with hash 86397356, now seen corresponding path program 1 times [2021-08-25 19:53:51,380 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 19:53:51,380 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [847496186] [2021-08-25 19:53:51,380 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 19:53:51,381 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 19:53:51,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 19:53:51,446 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2021-08-25 19:53:51,446 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 19:53:51,447 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [847496186] [2021-08-25 19:53:51,447 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [847496186] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 19:53:51,447 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 19:53:51,447 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-08-25 19:53:51,447 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [352600154] [2021-08-25 19:53:51,447 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-08-25 19:53:51,448 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 19:53:51,448 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-08-25 19:53:51,448 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-08-25 19:53:51,448 INFO L87 Difference]: Start difference. First operand 146 states and 192 transitions. Second operand has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 19:53:51,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 19:53:51,722 INFO L93 Difference]: Finished difference Result 538 states and 696 transitions. [2021-08-25 19:53:51,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-08-25 19:53:51,723 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2021-08-25 19:53:51,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 19:53:51,724 INFO L225 Difference]: With dead ends: 538 [2021-08-25 19:53:51,724 INFO L226 Difference]: Without dead ends: 422 [2021-08-25 19:53:51,725 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 39.4ms TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-08-25 19:53:51,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 422 states. [2021-08-25 19:53:51,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 422 to 146. [2021-08-25 19:53:51,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 146 states, 145 states have (on average 1.3241379310344827) internal successors, (192), 145 states have internal predecessors, (192), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 19:53:51,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 192 transitions. [2021-08-25 19:53:51,729 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 192 transitions. Word has length 38 [2021-08-25 19:53:51,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 19:53:51,730 INFO L470 AbstractCegarLoop]: Abstraction has 146 states and 192 transitions. [2021-08-25 19:53:51,730 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 19:53:51,730 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 192 transitions. [2021-08-25 19:53:51,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2021-08-25 19:53:51,731 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 19:53:51,731 INFO L512 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 19:53:51,731 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-08-25 19:53:51,731 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 19:53:51,731 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 19:53:51,732 INFO L82 PathProgramCache]: Analyzing trace with hash -345904797, now seen corresponding path program 1 times [2021-08-25 19:53:51,732 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 19:53:51,732 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1421135862] [2021-08-25 19:53:51,732 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 19:53:51,732 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 19:53:51,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 19:53:51,814 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2021-08-25 19:53:51,814 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 19:53:51,814 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1421135862] [2021-08-25 19:53:51,814 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1421135862] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 19:53:51,815 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 19:53:51,815 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-08-25 19:53:51,816 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2092189148] [2021-08-25 19:53:51,816 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-08-25 19:53:51,818 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 19:53:51,818 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-08-25 19:53:51,819 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-08-25 19:53:51,819 INFO L87 Difference]: Start difference. First operand 146 states and 192 transitions. Second operand has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 19:53:52,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 19:53:52,102 INFO L93 Difference]: Finished difference Result 518 states and 671 transitions. [2021-08-25 19:53:52,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-08-25 19:53:52,103 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 39 [2021-08-25 19:53:52,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 19:53:52,104 INFO L225 Difference]: With dead ends: 518 [2021-08-25 19:53:52,104 INFO L226 Difference]: Without dead ends: 403 [2021-08-25 19:53:52,105 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 36.5ms TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-08-25 19:53:52,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 403 states. [2021-08-25 19:53:52,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 403 to 146. [2021-08-25 19:53:52,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 146 states, 145 states have (on average 1.3241379310344827) internal successors, (192), 145 states have internal predecessors, (192), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 19:53:52,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 192 transitions. [2021-08-25 19:53:52,110 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 192 transitions. Word has length 39 [2021-08-25 19:53:52,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 19:53:52,110 INFO L470 AbstractCegarLoop]: Abstraction has 146 states and 192 transitions. [2021-08-25 19:53:52,110 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 19:53:52,110 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 192 transitions. [2021-08-25 19:53:52,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2021-08-25 19:53:52,111 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 19:53:52,111 INFO L512 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 19:53:52,112 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-08-25 19:53:52,112 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 19:53:52,112 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 19:53:52,112 INFO L82 PathProgramCache]: Analyzing trace with hash 190859729, now seen corresponding path program 1 times [2021-08-25 19:53:52,112 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 19:53:52,112 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [686895057] [2021-08-25 19:53:52,113 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 19:53:52,113 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 19:53:52,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 19:53:52,192 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2021-08-25 19:53:52,192 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 19:53:52,192 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [686895057] [2021-08-25 19:53:52,192 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [686895057] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 19:53:52,192 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 19:53:52,192 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-08-25 19:53:52,193 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [211456678] [2021-08-25 19:53:52,194 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-08-25 19:53:52,194 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 19:53:52,194 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-08-25 19:53:52,194 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-08-25 19:53:52,194 INFO L87 Difference]: Start difference. First operand 146 states and 192 transitions. Second operand has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 6 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 19:53:52,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 19:53:52,594 INFO L93 Difference]: Finished difference Result 652 states and 841 transitions. [2021-08-25 19:53:52,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-08-25 19:53:52,595 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 6 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 40 [2021-08-25 19:53:52,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 19:53:52,596 INFO L225 Difference]: With dead ends: 652 [2021-08-25 19:53:52,596 INFO L226 Difference]: Without dead ends: 537 [2021-08-25 19:53:52,596 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 53.9ms TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2021-08-25 19:53:52,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 537 states. [2021-08-25 19:53:52,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 537 to 146. [2021-08-25 19:53:52,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 146 states, 145 states have (on average 1.3241379310344827) internal successors, (192), 145 states have internal predecessors, (192), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 19:53:52,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 192 transitions. [2021-08-25 19:53:52,601 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 192 transitions. Word has length 40 [2021-08-25 19:53:52,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 19:53:52,601 INFO L470 AbstractCegarLoop]: Abstraction has 146 states and 192 transitions. [2021-08-25 19:53:52,601 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 6 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 19:53:52,601 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 192 transitions. [2021-08-25 19:53:52,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2021-08-25 19:53:52,602 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 19:53:52,602 INFO L512 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 19:53:52,602 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-08-25 19:53:52,602 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 19:53:52,602 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 19:53:52,602 INFO L82 PathProgramCache]: Analyzing trace with hash -83899885, now seen corresponding path program 1 times [2021-08-25 19:53:52,602 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 19:53:52,602 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [596059127] [2021-08-25 19:53:52,602 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 19:53:52,602 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 19:53:52,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 19:53:52,685 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2021-08-25 19:53:52,685 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 19:53:52,685 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [596059127] [2021-08-25 19:53:52,685 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [596059127] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 19:53:52,685 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 19:53:52,685 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-08-25 19:53:52,686 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1705924609] [2021-08-25 19:53:52,686 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-08-25 19:53:52,686 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 19:53:52,686 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-08-25 19:53:52,687 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-08-25 19:53:52,687 INFO L87 Difference]: Start difference. First operand 146 states and 192 transitions. Second operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 7 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 19:53:53,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 19:53:53,208 INFO L93 Difference]: Finished difference Result 693 states and 892 transitions. [2021-08-25 19:53:53,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-08-25 19:53:53,208 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 7 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 40 [2021-08-25 19:53:53,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 19:53:53,210 INFO L225 Difference]: With dead ends: 693 [2021-08-25 19:53:53,210 INFO L226 Difference]: Without dead ends: 577 [2021-08-25 19:53:53,210 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 84.4ms TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2021-08-25 19:53:53,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 577 states. [2021-08-25 19:53:53,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 577 to 134. [2021-08-25 19:53:53,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 133 states have (on average 1.3082706766917294) internal successors, (174), 133 states have internal predecessors, (174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 19:53:53,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 174 transitions. [2021-08-25 19:53:53,217 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 174 transitions. Word has length 40 [2021-08-25 19:53:53,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 19:53:53,219 INFO L470 AbstractCegarLoop]: Abstraction has 134 states and 174 transitions. [2021-08-25 19:53:53,219 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 7 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 19:53:53,219 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 174 transitions. [2021-08-25 19:53:53,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2021-08-25 19:53:53,220 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 19:53:53,221 INFO L512 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 19:53:53,221 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-08-25 19:53:53,221 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 19:53:53,225 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 19:53:53,225 INFO L82 PathProgramCache]: Analyzing trace with hash -565879240, now seen corresponding path program 1 times [2021-08-25 19:53:53,225 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 19:53:53,226 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [5974088] [2021-08-25 19:53:53,226 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 19:53:53,226 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 19:53:53,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 19:53:53,260 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2021-08-25 19:53:53,260 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 19:53:53,260 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [5974088] [2021-08-25 19:53:53,260 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [5974088] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 19:53:53,260 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 19:53:53,260 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-25 19:53:53,261 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [277430285] [2021-08-25 19:53:53,261 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-25 19:53:53,261 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 19:53:53,261 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-25 19:53:53,261 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 19:53:53,262 INFO L87 Difference]: Start difference. First operand 134 states and 174 transitions. Second operand has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 19:53:53,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 19:53:53,272 INFO L93 Difference]: Finished difference Result 194 states and 246 transitions. [2021-08-25 19:53:53,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-25 19:53:53,272 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 45 [2021-08-25 19:53:53,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 19:53:53,273 INFO L225 Difference]: With dead ends: 194 [2021-08-25 19:53:53,273 INFO L226 Difference]: Without dead ends: 162 [2021-08-25 19:53:53,273 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 19:53:53,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2021-08-25 19:53:53,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 162. [2021-08-25 19:53:53,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 162 states, 161 states have (on average 1.279503105590062) internal successors, (206), 161 states have internal predecessors, (206), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 19:53:53,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 206 transitions. [2021-08-25 19:53:53,278 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 206 transitions. Word has length 45 [2021-08-25 19:53:53,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 19:53:53,278 INFO L470 AbstractCegarLoop]: Abstraction has 162 states and 206 transitions. [2021-08-25 19:53:53,278 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 19:53:53,278 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 206 transitions. [2021-08-25 19:53:53,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2021-08-25 19:53:53,279 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 19:53:53,279 INFO L512 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 19:53:53,279 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-08-25 19:53:53,279 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 19:53:53,280 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 19:53:53,280 INFO L82 PathProgramCache]: Analyzing trace with hash -543246986, now seen corresponding path program 1 times [2021-08-25 19:53:53,280 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 19:53:53,280 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1363312296] [2021-08-25 19:53:53,280 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 19:53:53,280 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 19:53:53,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 19:53:53,399 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2021-08-25 19:53:53,399 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 19:53:53,399 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1363312296] [2021-08-25 19:53:53,399 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1363312296] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-25 19:53:53,399 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [352076252] [2021-08-25 19:53:53,400 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 19:53:53,400 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-25 19:53:53,400 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-25 19:53:53,417 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-25 19:53:53,418 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2021-08-25 19:53:53,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 19:53:53,497 INFO L263 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 6 conjunts are in the unsatisfiable core [2021-08-25 19:53:53,499 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-25 19:53:53,723 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2021-08-25 19:53:53,723 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [352076252] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 19:53:53,723 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-08-25 19:53:53,723 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 7 [2021-08-25 19:53:53,725 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [298437634] [2021-08-25 19:53:53,726 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-08-25 19:53:53,726 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 19:53:53,726 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-08-25 19:53:53,726 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-08-25 19:53:53,727 INFO L87 Difference]: Start difference. First operand 162 states and 206 transitions. Second operand has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 19:53:53,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 19:53:53,888 INFO L93 Difference]: Finished difference Result 486 states and 625 transitions. [2021-08-25 19:53:53,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-08-25 19:53:53,889 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 45 [2021-08-25 19:53:53,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 19:53:53,889 INFO L225 Difference]: With dead ends: 486 [2021-08-25 19:53:53,889 INFO L226 Difference]: Without dead ends: 309 [2021-08-25 19:53:53,890 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 43 SyntacticMatches, 4 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 59.8ms TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2021-08-25 19:53:53,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 309 states. [2021-08-25 19:53:53,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 309 to 284. [2021-08-25 19:53:53,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 284 states, 283 states have (on average 1.2756183745583038) internal successors, (361), 283 states have internal predecessors, (361), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 19:53:53,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 284 states to 284 states and 361 transitions. [2021-08-25 19:53:53,896 INFO L78 Accepts]: Start accepts. Automaton has 284 states and 361 transitions. Word has length 45 [2021-08-25 19:53:53,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 19:53:53,896 INFO L470 AbstractCegarLoop]: Abstraction has 284 states and 361 transitions. [2021-08-25 19:53:53,896 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 19:53:53,896 INFO L276 IsEmpty]: Start isEmpty. Operand 284 states and 361 transitions. [2021-08-25 19:53:53,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2021-08-25 19:53:53,898 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 19:53:53,898 INFO L512 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 19:53:53,917 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2021-08-25 19:53:54,108 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-25 19:53:54,109 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 19:53:54,109 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 19:53:54,109 INFO L82 PathProgramCache]: Analyzing trace with hash 1776534260, now seen corresponding path program 1 times [2021-08-25 19:53:54,109 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 19:53:54,109 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [204945976] [2021-08-25 19:53:54,109 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 19:53:54,110 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 19:53:54,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 19:53:54,213 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2021-08-25 19:53:54,214 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 19:53:54,214 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [204945976] [2021-08-25 19:53:54,214 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [204945976] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-25 19:53:54,214 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [75132054] [2021-08-25 19:53:54,214 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 19:53:54,214 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-25 19:53:54,214 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-25 19:53:54,215 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-25 19:53:54,216 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2021-08-25 19:53:54,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 19:53:54,360 INFO L263 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 10 conjunts are in the unsatisfiable core [2021-08-25 19:53:54,361 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-25 19:53:54,525 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2021-08-25 19:53:54,526 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [75132054] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 19:53:54,526 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-08-25 19:53:54,526 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [7] total 12 [2021-08-25 19:53:54,526 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2004444210] [2021-08-25 19:53:54,527 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-08-25 19:53:54,527 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 19:53:54,527 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-08-25 19:53:54,527 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2021-08-25 19:53:54,527 INFO L87 Difference]: Start difference. First operand 284 states and 361 transitions. Second operand has 7 states, 7 states have (on average 5.285714285714286) internal successors, (37), 7 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 19:53:54,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 19:53:54,792 INFO L93 Difference]: Finished difference Result 1277 states and 1620 transitions. [2021-08-25 19:53:54,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-08-25 19:53:54,792 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.285714285714286) internal successors, (37), 7 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 46 [2021-08-25 19:53:54,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 19:53:54,795 INFO L225 Difference]: With dead ends: 1277 [2021-08-25 19:53:54,795 INFO L226 Difference]: Without dead ends: 1023 [2021-08-25 19:53:54,796 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 42 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 75.3ms TimeCoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2021-08-25 19:53:54,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1023 states. [2021-08-25 19:53:54,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1023 to 462. [2021-08-25 19:53:54,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 462 states, 461 states have (on average 1.2711496746203905) internal successors, (586), 461 states have internal predecessors, (586), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 19:53:54,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 462 states to 462 states and 586 transitions. [2021-08-25 19:53:54,808 INFO L78 Accepts]: Start accepts. Automaton has 462 states and 586 transitions. Word has length 46 [2021-08-25 19:53:54,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 19:53:54,809 INFO L470 AbstractCegarLoop]: Abstraction has 462 states and 586 transitions. [2021-08-25 19:53:54,809 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.285714285714286) internal successors, (37), 7 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 19:53:54,809 INFO L276 IsEmpty]: Start isEmpty. Operand 462 states and 586 transitions. [2021-08-25 19:53:54,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2021-08-25 19:53:54,809 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 19:53:54,810 INFO L512 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 19:53:54,828 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2021-08-25 19:53:55,018 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2021-08-25 19:53:55,019 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 19:53:55,019 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 19:53:55,019 INFO L82 PathProgramCache]: Analyzing trace with hash 1701631379, now seen corresponding path program 1 times [2021-08-25 19:53:55,019 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 19:53:55,019 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [955460520] [2021-08-25 19:53:55,019 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 19:53:55,019 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 19:53:55,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 19:53:55,110 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2021-08-25 19:53:55,110 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 19:53:55,110 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [955460520] [2021-08-25 19:53:55,110 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [955460520] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-25 19:53:55,110 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [685074542] [2021-08-25 19:53:55,110 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 19:53:55,110 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-25 19:53:55,111 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-25 19:53:55,111 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-25 19:53:55,118 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2021-08-25 19:53:55,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 19:53:55,228 INFO L263 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 5 conjunts are in the unsatisfiable core [2021-08-25 19:53:55,229 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-25 19:53:55,425 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2021-08-25 19:53:55,425 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [685074542] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 19:53:55,425 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-08-25 19:53:55,425 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 6 [2021-08-25 19:53:55,425 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2126033428] [2021-08-25 19:53:55,426 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-25 19:53:55,426 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 19:53:55,426 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-25 19:53:55,426 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-08-25 19:53:55,427 INFO L87 Difference]: Start difference. First operand 462 states and 586 transitions. Second operand has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 19:53:55,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 19:53:55,518 INFO L93 Difference]: Finished difference Result 1022 states and 1305 transitions. [2021-08-25 19:53:55,519 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-08-25 19:53:55,519 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 48 [2021-08-25 19:53:55,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 19:53:55,521 INFO L225 Difference]: With dead ends: 1022 [2021-08-25 19:53:55,521 INFO L226 Difference]: Without dead ends: 730 [2021-08-25 19:53:55,521 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 47 SyntacticMatches, 4 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 37.7ms TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2021-08-25 19:53:55,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 730 states. [2021-08-25 19:53:55,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 730 to 675. [2021-08-25 19:53:55,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 675 states, 674 states have (on average 1.2655786350148368) internal successors, (853), 674 states have internal predecessors, (853), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 19:53:55,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 675 states to 675 states and 853 transitions. [2021-08-25 19:53:55,535 INFO L78 Accepts]: Start accepts. Automaton has 675 states and 853 transitions. Word has length 48 [2021-08-25 19:53:55,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 19:53:55,536 INFO L470 AbstractCegarLoop]: Abstraction has 675 states and 853 transitions. [2021-08-25 19:53:55,536 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 19:53:55,536 INFO L276 IsEmpty]: Start isEmpty. Operand 675 states and 853 transitions. [2021-08-25 19:53:55,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2021-08-25 19:53:55,537 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 19:53:55,537 INFO L512 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 19:53:55,553 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2021-08-25 19:53:55,753 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2021-08-25 19:53:55,753 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 19:53:55,754 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 19:53:55,754 INFO L82 PathProgramCache]: Analyzing trace with hash -1042781594, now seen corresponding path program 1 times [2021-08-25 19:53:55,754 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 19:53:55,754 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [898740999] [2021-08-25 19:53:55,754 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 19:53:55,754 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 19:53:55,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 19:53:55,834 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2021-08-25 19:53:55,834 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 19:53:55,834 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [898740999] [2021-08-25 19:53:55,835 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [898740999] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-25 19:53:55,835 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1409107761] [2021-08-25 19:53:55,835 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 19:53:55,835 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-25 19:53:55,835 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-25 19:53:55,837 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-25 19:53:55,838 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2021-08-25 19:53:56,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 19:53:56,002 INFO L263 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 8 conjunts are in the unsatisfiable core [2021-08-25 19:53:56,004 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-25 19:53:56,370 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2021-08-25 19:53:56,370 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1409107761] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 19:53:56,370 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-08-25 19:53:56,370 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [7] total 9 [2021-08-25 19:53:56,370 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [327740180] [2021-08-25 19:53:56,371 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-08-25 19:53:56,371 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 19:53:56,371 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-08-25 19:53:56,371 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2021-08-25 19:53:56,371 INFO L87 Difference]: Start difference. First operand 675 states and 853 transitions. Second operand has 6 states, 6 states have (on average 7.0) internal successors, (42), 6 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 19:53:56,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 19:53:56,715 INFO L93 Difference]: Finished difference Result 1916 states and 2488 transitions. [2021-08-25 19:53:56,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-08-25 19:53:56,716 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.0) internal successors, (42), 6 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 49 [2021-08-25 19:53:56,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 19:53:56,720 INFO L225 Difference]: With dead ends: 1916 [2021-08-25 19:53:56,720 INFO L226 Difference]: Without dead ends: 1224 [2021-08-25 19:53:56,721 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 46 SyntacticMatches, 4 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 90.5ms TimeCoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2021-08-25 19:53:56,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1224 states. [2021-08-25 19:53:56,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1224 to 1065. [2021-08-25 19:53:56,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1065 states, 1064 states have (on average 1.2575187969924813) internal successors, (1338), 1064 states have internal predecessors, (1338), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 19:53:56,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1065 states to 1065 states and 1338 transitions. [2021-08-25 19:53:56,751 INFO L78 Accepts]: Start accepts. Automaton has 1065 states and 1338 transitions. Word has length 49 [2021-08-25 19:53:56,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 19:53:56,751 INFO L470 AbstractCegarLoop]: Abstraction has 1065 states and 1338 transitions. [2021-08-25 19:53:56,751 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.0) internal successors, (42), 6 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 19:53:56,752 INFO L276 IsEmpty]: Start isEmpty. Operand 1065 states and 1338 transitions. [2021-08-25 19:53:56,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2021-08-25 19:53:56,752 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 19:53:56,753 INFO L512 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 19:53:56,774 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2021-08-25 19:53:56,960 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-25 19:53:56,961 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 19:53:56,961 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 19:53:56,961 INFO L82 PathProgramCache]: Analyzing trace with hash -2126140849, now seen corresponding path program 1 times [2021-08-25 19:53:56,961 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 19:53:56,961 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1257131317] [2021-08-25 19:53:56,961 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 19:53:56,961 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 19:53:56,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 19:53:57,060 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2021-08-25 19:53:57,060 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 19:53:57,061 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1257131317] [2021-08-25 19:53:57,061 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1257131317] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-25 19:53:57,061 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1423076390] [2021-08-25 19:53:57,061 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 19:53:57,061 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-25 19:53:57,061 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-25 19:53:57,062 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-25 19:53:57,063 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2021-08-25 19:53:57,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 19:53:57,277 INFO L263 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 8 conjunts are in the unsatisfiable core [2021-08-25 19:53:57,279 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-25 19:53:57,633 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2021-08-25 19:53:57,634 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1423076390] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 19:53:57,634 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-08-25 19:53:57,634 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [7] total 9 [2021-08-25 19:53:57,635 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1579293841] [2021-08-25 19:53:57,635 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-08-25 19:53:57,635 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 19:53:57,636 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-08-25 19:53:57,636 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2021-08-25 19:53:57,636 INFO L87 Difference]: Start difference. First operand 1065 states and 1338 transitions. Second operand has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 6 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 19:53:58,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 19:53:58,006 INFO L93 Difference]: Finished difference Result 2044 states and 2588 transitions. [2021-08-25 19:53:58,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-08-25 19:53:58,006 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 6 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 50 [2021-08-25 19:53:58,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 19:53:58,010 INFO L225 Difference]: With dead ends: 2044 [2021-08-25 19:53:58,010 INFO L226 Difference]: Without dead ends: 1626 [2021-08-25 19:53:58,011 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 47 SyntacticMatches, 4 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 91.2ms TimeCoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2021-08-25 19:53:58,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1626 states. [2021-08-25 19:53:58,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1626 to 1406. [2021-08-25 19:53:58,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1406 states, 1405 states have (on average 1.2555160142348754) internal successors, (1764), 1405 states have internal predecessors, (1764), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 19:53:58,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1406 states to 1406 states and 1764 transitions. [2021-08-25 19:53:58,040 INFO L78 Accepts]: Start accepts. Automaton has 1406 states and 1764 transitions. Word has length 50 [2021-08-25 19:53:58,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 19:53:58,040 INFO L470 AbstractCegarLoop]: Abstraction has 1406 states and 1764 transitions. [2021-08-25 19:53:58,040 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 6 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 19:53:58,040 INFO L276 IsEmpty]: Start isEmpty. Operand 1406 states and 1764 transitions. [2021-08-25 19:53:58,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2021-08-25 19:53:58,041 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 19:53:58,041 INFO L512 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 19:53:58,062 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2021-08-25 19:53:58,254 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2021-08-25 19:53:58,254 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 19:53:58,254 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 19:53:58,255 INFO L82 PathProgramCache]: Analyzing trace with hash 48257313, now seen corresponding path program 1 times [2021-08-25 19:53:58,255 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 19:53:58,255 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1479694130] [2021-08-25 19:53:58,255 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 19:53:58,255 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 19:53:58,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 19:53:58,359 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2021-08-25 19:53:58,359 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 19:53:58,359 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1479694130] [2021-08-25 19:53:58,359 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1479694130] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-25 19:53:58,359 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1075705551] [2021-08-25 19:53:58,359 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 19:53:58,360 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-25 19:53:58,360 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-25 19:53:58,369 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-25 19:53:58,370 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2021-08-25 19:53:58,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 19:53:58,616 INFO L263 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 10 conjunts are in the unsatisfiable core [2021-08-25 19:53:58,617 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-25 19:54:00,207 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2021-08-25 19:54:00,208 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1075705551] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 19:54:00,208 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-08-25 19:54:00,208 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [8] total 11 [2021-08-25 19:54:00,208 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [920569858] [2021-08-25 19:54:00,208 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-08-25 19:54:00,208 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 19:54:00,209 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-08-25 19:54:00,209 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2021-08-25 19:54:00,209 INFO L87 Difference]: Start difference. First operand 1406 states and 1764 transitions. Second operand has 7 states, 7 states have (on average 6.285714285714286) internal successors, (44), 7 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 19:54:00,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 19:54:00,788 INFO L93 Difference]: Finished difference Result 2041 states and 2573 transitions. [2021-08-25 19:54:00,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-08-25 19:54:00,789 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.285714285714286) internal successors, (44), 7 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 51 [2021-08-25 19:54:00,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 19:54:00,792 INFO L225 Difference]: With dead ends: 2041 [2021-08-25 19:54:00,792 INFO L226 Difference]: Without dead ends: 1645 [2021-08-25 19:54:00,793 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 46 SyntacticMatches, 5 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 161.5ms TimeCoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2021-08-25 19:54:00,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1645 states. [2021-08-25 19:54:00,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1645 to 1390. [2021-08-25 19:54:00,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1390 states, 1389 states have (on average 1.2512598992080635) internal successors, (1738), 1389 states have internal predecessors, (1738), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 19:54:00,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1390 states to 1390 states and 1738 transitions. [2021-08-25 19:54:00,819 INFO L78 Accepts]: Start accepts. Automaton has 1390 states and 1738 transitions. Word has length 51 [2021-08-25 19:54:00,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 19:54:00,820 INFO L470 AbstractCegarLoop]: Abstraction has 1390 states and 1738 transitions. [2021-08-25 19:54:00,820 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.285714285714286) internal successors, (44), 7 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 19:54:00,820 INFO L276 IsEmpty]: Start isEmpty. Operand 1390 states and 1738 transitions. [2021-08-25 19:54:00,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2021-08-25 19:54:00,821 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 19:54:00,821 INFO L512 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 19:54:00,840 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2021-08-25 19:54:01,036 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2021-08-25 19:54:01,037 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 19:54:01,037 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 19:54:01,037 INFO L82 PathProgramCache]: Analyzing trace with hash 945650591, now seen corresponding path program 1 times [2021-08-25 19:54:01,037 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 19:54:01,037 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [445441925] [2021-08-25 19:54:01,037 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 19:54:01,037 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 19:54:01,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-25 19:54:01,049 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-25 19:54:01,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-25 19:54:01,072 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-25 19:54:01,073 INFO L626 BasicCegarLoop]: Counterexample is feasible [2021-08-25 19:54:01,074 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION [2021-08-25 19:54:01,075 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-08-25 19:54:01,078 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-08-25 19:54:01,106 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.08 07:54:01 BoogieIcfgContainer [2021-08-25 19:54:01,106 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-08-25 19:54:01,106 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-08-25 19:54:01,107 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-08-25 19:54:01,107 INFO L275 PluginConnector]: Witness Printer initialized [2021-08-25 19:54:01,111 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.08 07:53:35" (3/4) ... [2021-08-25 19:54:01,112 INFO L140 WitnessPrinter]: No result that supports witness generation found [2021-08-25 19:54:01,113 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-08-25 19:54:01,113 INFO L168 Benchmark]: Toolchain (without parser) took 26095.61 ms. Allocated memory was 67.1 MB in the beginning and 188.7 MB in the end (delta: 121.6 MB). Free memory was 47.9 MB in the beginning and 87.3 MB in the end (delta: -39.4 MB). Peak memory consumption was 82.4 MB. Max. memory is 16.1 GB. [2021-08-25 19:54:01,114 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 67.1 MB. Free memory was 48.1 MB in the beginning and 48.1 MB in the end (delta: 32.2 kB). There was no memory consumed. Max. memory is 16.1 GB. [2021-08-25 19:54:01,114 INFO L168 Benchmark]: CACSL2BoogieTranslator took 198.07 ms. Allocated memory is still 67.1 MB. Free memory was 47.7 MB in the beginning and 50.5 MB in the end (delta: -2.8 MB). Peak memory consumption was 13.9 MB. Max. memory is 16.1 GB. [2021-08-25 19:54:01,114 INFO L168 Benchmark]: Boogie Procedure Inliner took 52.07 ms. Allocated memory is still 67.1 MB. Free memory was 50.5 MB in the beginning and 48.6 MB in the end (delta: 1.8 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-08-25 19:54:01,114 INFO L168 Benchmark]: Boogie Preprocessor took 35.79 ms. Allocated memory is still 67.1 MB. Free memory was 48.6 MB in the beginning and 47.2 MB in the end (delta: 1.4 MB). There was no memory consumed. Max. memory is 16.1 GB. [2021-08-25 19:54:01,114 INFO L168 Benchmark]: RCFGBuilder took 430.15 ms. Allocated memory is still 67.1 MB. Free memory was 47.2 MB in the beginning and 46.7 MB in the end (delta: 519.8 kB). Peak memory consumption was 22.3 MB. Max. memory is 16.1 GB. [2021-08-25 19:54:01,114 INFO L168 Benchmark]: TraceAbstraction took 25367.63 ms. Allocated memory was 67.1 MB in the beginning and 188.7 MB in the end (delta: 121.6 MB). Free memory was 46.1 MB in the beginning and 87.3 MB in the end (delta: -41.2 MB). Peak memory consumption was 79.8 MB. Max. memory is 16.1 GB. [2021-08-25 19:54:01,115 INFO L168 Benchmark]: Witness Printer took 6.09 ms. Allocated memory is still 188.7 MB. Free memory was 87.3 MB in the beginning and 87.3 MB in the end (delta: 2.0 kB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-08-25 19:54:01,116 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.14 ms. Allocated memory is still 67.1 MB. Free memory was 48.1 MB in the beginning and 48.1 MB in the end (delta: 32.2 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 198.07 ms. Allocated memory is still 67.1 MB. Free memory was 47.7 MB in the beginning and 50.5 MB in the end (delta: -2.8 MB). Peak memory consumption was 13.9 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 52.07 ms. Allocated memory is still 67.1 MB. Free memory was 50.5 MB in the beginning and 48.6 MB in the end (delta: 1.8 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 35.79 ms. Allocated memory is still 67.1 MB. Free memory was 48.6 MB in the beginning and 47.2 MB in the end (delta: 1.4 MB). There was no memory consumed. Max. memory is 16.1 GB. * RCFGBuilder took 430.15 ms. Allocated memory is still 67.1 MB. Free memory was 47.2 MB in the beginning and 46.7 MB in the end (delta: 519.8 kB). Peak memory consumption was 22.3 MB. Max. memory is 16.1 GB. * TraceAbstraction took 25367.63 ms. Allocated memory was 67.1 MB in the beginning and 188.7 MB in the end (delta: 121.6 MB). Free memory was 46.1 MB in the beginning and 87.3 MB in the end (delta: -41.2 MB). Peak memory consumption was 79.8 MB. Max. memory is 16.1 GB. * Witness Printer took 6.09 ms. Allocated memory is still 188.7 MB. Free memory was 87.3 MB in the beginning and 87.3 MB in the end (delta: 2.0 kB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0ms ErrorAutomatonConstructionTimeTotal, 0.0ms FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0ms ErrorAutomatonConstructionTimeAvg, 0.0ms ErrorAutomatonDifferenceTimeAvg, 0.0ms ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 17]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: overapproximation of bitwiseOr at line 108. Possible FailurePath: [L116] unsigned int a, b, r; [L118] a = __VERIFIER_nondet_uint() [L119] b = __VERIFIER_nondet_uint() [L34] unsigned char a0, a1, a2, a3; [L35] unsigned char b0, b1, b2, b3; [L36] unsigned char r0, r1, r2, r3; [L37] unsigned short carry; [L38] unsigned short partial_sum; [L39] unsigned int r; [L40] unsigned char i; [L41] unsigned char na, nb; [L42] a0 = a [L43] a1 = a >> 8 [L44] a2 = a >> 16U [L45] a3 = a >> 24U [L46] b0 = b [L47] b1 = b >> 8U [L48] b2 = b >> 16U [L49] b3 = b >> 24U [L50] na = (unsigned char)4 [L51] COND TRUE a3 == (unsigned char)0 [L52] na = na - 1 [L53] COND TRUE a2 == (unsigned char)0 [L54] na = na - 1 [L55] COND TRUE a1 == (unsigned char)0 [L56] na = na - 1 [L60] nb = (unsigned char)4 [L61] COND TRUE b3 == (unsigned char)0 [L62] nb = nb - 1 [L63] COND TRUE b2 == (unsigned char)0 [L64] nb = nb - 1 [L65] COND TRUE b1 == (unsigned char)0 [L66] nb = nb - 1 [L70] carry = (unsigned short)0 [L71] i = (unsigned char)0 [L72] COND TRUE (i < na) || (i < nb) || (carry != (unsigned short)0) [L73] partial_sum = carry [L74] carry = (unsigned short)0 [L75] COND TRUE i < na [L76] COND TRUE i == (unsigned char)0 [L76] partial_sum = partial_sum + a0 [L77] COND FALSE !(i == (unsigned char)1) [L78] COND FALSE !(i == (unsigned char)2) [L79] COND FALSE !(i == (unsigned char)3) [L81] COND TRUE i < nb [L82] COND TRUE i == (unsigned char)0 [L82] partial_sum = partial_sum + b0 [L83] COND FALSE !(i == (unsigned char)1) [L84] COND FALSE !(i == (unsigned char)2) [L85] COND FALSE !(i == (unsigned char)3) [L87] COND FALSE !(partial_sum > ((unsigned char)254)) [L91] COND TRUE i == (unsigned char)0 [L91] r0 = (unsigned char)partial_sum [L92] COND FALSE !(i == (unsigned char)1) [L93] COND FALSE !(i == (unsigned char)2) [L94] COND FALSE !(i == (unsigned char)3) [L96] i = i + (unsigned char)1 [L72] COND FALSE !((i < na) || (i < nb) || (carry != (unsigned short)0)) [L99] COND TRUE i < (unsigned char)4 [L100] COND FALSE !(i == (unsigned char)0) [L101] COND TRUE i == (unsigned char)1 [L101] r1 = (unsigned char)0 [L102] COND FALSE !(i == (unsigned char)2) [L103] COND FALSE !(i == (unsigned char)3) [L105] i = i + (unsigned char)1 [L99] COND TRUE i < (unsigned char)4 [L100] COND FALSE !(i == (unsigned char)0) [L101] COND FALSE !(i == (unsigned char)1) [L102] COND TRUE i == (unsigned char)2 [L102] r2 = (unsigned char)0 [L103] COND FALSE !(i == (unsigned char)3) [L105] i = i + (unsigned char)1 [L99] COND TRUE i < (unsigned char)4 [L100] COND FALSE !(i == (unsigned char)0) [L101] COND FALSE !(i == (unsigned char)1) [L102] COND FALSE !(i == (unsigned char)2) [L103] COND TRUE i == (unsigned char)3 [L103] r3 = (unsigned char)0 [L105] i = i + (unsigned char)1 [L99] COND FALSE !(i < (unsigned char)4) [L108] r = r0 | (r1 << 8U) | (r2 << 16U) | ((unsigned int)r3 << 24U) [L110] return r; [L121] r = mp_add(a, b) [L16] COND TRUE !(cond) [L17] reach_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 42 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 25299.1ms, OverallIterations: 19, TraceHistogramMax: 4, EmptinessCheckTime: 20.8ms, AutomataDifference: 16889.5ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 5.9ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 1618 SDtfs, 2077 SDslu, 2929 SDs, 0 SdLazy, 3759 SolverSat, 245 SolverUnsat, 4 SolverUnknown, 0 SolverNotchecked, 15222.9ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 500 GetRequests, 377 SyntacticMatches, 25 SemanticMatches, 98 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 876.3ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=1406occurred in iteration=17, InterpolantAutomatonStates: 102, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: 210.4ms AutomataMinimizationTime, 18 MinimizatonAttempts, 2792 StatesRemovedByMinimization, 16 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 82.8ms SsaConstructionTime, 562.1ms SatisfiabilityAnalysisTime, 4577.8ms InterpolantComputationTime, 1048 NumberOfCodeBlocks, 1048 NumberOfCodeBlocksAsserted, 28 NumberOfCheckSat, 970 ConstructedInterpolants, 22 QuantifiedInterpolants, 6265 SizeOfPredicates, 19 NumberOfNonLiveVariables, 1219 ConjunctsInSsa, 61 ConjunctsInUnsatCore, 27 InterpolantComputations, 18 PerfectInterpolantSequences, 472/508 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2021-08-25 19:54:01,137 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... ### Bit-precise run ### This is Ultimate 0.2.1-dev-20ed64e [2021-08-25 19:54:02,631 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-08-25 19:54:02,635 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-08-25 19:54:02,666 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-08-25 19:54:02,666 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-08-25 19:54:02,669 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-08-25 19:54:02,670 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-08-25 19:54:02,674 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-08-25 19:54:02,675 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-08-25 19:54:02,679 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-08-25 19:54:02,679 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-08-25 19:54:02,689 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-08-25 19:54:02,689 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-08-25 19:54:02,691 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-08-25 19:54:02,692 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-08-25 19:54:02,695 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-08-25 19:54:02,695 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-08-25 19:54:02,696 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-08-25 19:54:02,698 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-08-25 19:54:02,702 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-08-25 19:54:02,703 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-08-25 19:54:02,704 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-08-25 19:54:02,705 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-08-25 19:54:02,706 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-08-25 19:54:02,709 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-08-25 19:54:02,709 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-08-25 19:54:02,710 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-08-25 19:54:02,711 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-08-25 19:54:02,711 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-08-25 19:54:02,712 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-08-25 19:54:02,712 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-08-25 19:54:02,712 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-08-25 19:54:02,713 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-08-25 19:54:02,714 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-08-25 19:54:02,715 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-08-25 19:54:02,715 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-08-25 19:54:02,715 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-08-25 19:54:02,715 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-08-25 19:54:02,716 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-08-25 19:54:02,717 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-08-25 19:54:02,717 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-08-25 19:54:02,720 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2021-08-25 19:54:02,748 INFO L113 SettingsManager]: Loading preferences was successful [2021-08-25 19:54:02,748 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-08-25 19:54:02,749 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-08-25 19:54:02,749 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-08-25 19:54:02,750 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-08-25 19:54:02,750 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-08-25 19:54:02,750 INFO L138 SettingsManager]: * Use SBE=true [2021-08-25 19:54:02,751 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-08-25 19:54:02,751 INFO L138 SettingsManager]: * sizeof long=4 [2021-08-25 19:54:02,751 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-08-25 19:54:02,751 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-08-25 19:54:02,752 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-08-25 19:54:02,752 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-08-25 19:54:02,752 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-08-25 19:54:02,752 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2021-08-25 19:54:02,752 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2021-08-25 19:54:02,752 INFO L138 SettingsManager]: * sizeof long double=12 [2021-08-25 19:54:02,752 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-08-25 19:54:02,752 INFO L138 SettingsManager]: * Use constant arrays=true [2021-08-25 19:54:02,752 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-08-25 19:54:02,752 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-08-25 19:54:02,753 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-08-25 19:54:02,753 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-08-25 19:54:02,753 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-08-25 19:54:02,753 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-08-25 19:54:02,753 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-08-25 19:54:02,753 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-08-25 19:54:02,753 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2021-08-25 19:54:02,753 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2021-08-25 19:54:02,753 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-08-25 19:54:02,753 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-08-25 19:54:02,753 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-08-25 19:54:02,754 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 -> 409f93cc3fb27e0335e986593862ddeb482b815c [2021-08-25 19:54:02,992 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-08-25 19:54:03,005 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-08-25 19:54:03,007 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-08-25 19:54:03,008 INFO L271 PluginConnector]: Initializing CDTParser... [2021-08-25 19:54:03,008 INFO L275 PluginConnector]: CDTParser initialized [2021-08-25 19:54:03,009 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/bitvector/byte_add-1.i [2021-08-25 19:54:03,050 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0c9528f71/a7d906e9a50647fe99e9f6e352b1f756/FLAG73000e1b4 [2021-08-25 19:54:03,367 INFO L306 CDTParser]: Found 1 translation units. [2021-08-25 19:54:03,367 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/byte_add-1.i [2021-08-25 19:54:03,372 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0c9528f71/a7d906e9a50647fe99e9f6e352b1f756/FLAG73000e1b4 [2021-08-25 19:54:03,790 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0c9528f71/a7d906e9a50647fe99e9f6e352b1f756 [2021-08-25 19:54:03,792 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-08-25 19:54:03,794 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-08-25 19:54:03,796 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-08-25 19:54:03,796 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-08-25 19:54:03,799 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-08-25 19:54:03,799 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.08 07:54:03" (1/1) ... [2021-08-25 19:54:03,800 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@32941835 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 07:54:03, skipping insertion in model container [2021-08-25 19:54:03,801 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.08 07:54:03" (1/1) ... [2021-08-25 19:54:03,805 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-08-25 19:54:03,823 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-08-25 19:54:03,908 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/byte_add-1.i[861,874] [2021-08-25 19:54:03,928 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-25 19:54:03,937 INFO L203 MainTranslator]: Completed pre-run [2021-08-25 19:54:03,972 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/byte_add-1.i[861,874] [2021-08-25 19:54:03,990 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-25 19:54:03,999 INFO L208 MainTranslator]: Completed translation [2021-08-25 19:54:04,000 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 07:54:03 WrapperNode [2021-08-25 19:54:04,000 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-08-25 19:54:04,001 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-08-25 19:54:04,001 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-08-25 19:54:04,001 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-08-25 19:54:04,005 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 07:54:03" (1/1) ... [2021-08-25 19:54:04,011 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 07:54:03" (1/1) ... [2021-08-25 19:54:04,038 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-08-25 19:54:04,038 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-08-25 19:54:04,038 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-08-25 19:54:04,038 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-08-25 19:54:04,043 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 07:54:03" (1/1) ... [2021-08-25 19:54:04,043 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 07:54:03" (1/1) ... [2021-08-25 19:54:04,046 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 07:54:03" (1/1) ... [2021-08-25 19:54:04,047 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 07:54:03" (1/1) ... [2021-08-25 19:54:04,051 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 07:54:03" (1/1) ... [2021-08-25 19:54:04,054 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 07:54:03" (1/1) ... [2021-08-25 19:54:04,055 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 07:54:03" (1/1) ... [2021-08-25 19:54:04,057 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-08-25 19:54:04,057 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-08-25 19:54:04,057 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-08-25 19:54:04,057 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-08-25 19:54:04,058 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 07:54:03" (1/1) ... [2021-08-25 19:54:04,073 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-08-25 19:54:04,078 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-25 19:54:04,088 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-08-25 19:54:04,092 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-08-25 19:54:04,115 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2021-08-25 19:54:04,115 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-08-25 19:54:04,115 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-08-25 19:54:04,115 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-08-25 19:54:04,368 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-08-25 19:54:04,371 INFO L299 CfgBuilder]: Removed 10 assume(true) statements. [2021-08-25 19:54:04,372 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.08 07:54:04 BoogieIcfgContainer [2021-08-25 19:54:04,372 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-08-25 19:54:04,373 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-08-25 19:54:04,375 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-08-25 19:54:04,377 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-08-25 19:54:04,377 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.08 07:54:03" (1/3) ... [2021-08-25 19:54:04,378 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@483558ec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.08 07:54:04, skipping insertion in model container [2021-08-25 19:54:04,378 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 07:54:03" (2/3) ... [2021-08-25 19:54:04,378 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@483558ec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.08 07:54:04, skipping insertion in model container [2021-08-25 19:54:04,378 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.08 07:54:04" (3/3) ... [2021-08-25 19:54:04,379 INFO L111 eAbstractionObserver]: Analyzing ICFG byte_add-1.i [2021-08-25 19:54:04,383 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-08-25 19:54:04,383 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-08-25 19:54:04,444 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-08-25 19:54:04,448 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2021-08-25 19:54:04,449 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-08-25 19:54:04,458 INFO L276 IsEmpty]: Start isEmpty. Operand has 42 states, 40 states have (on average 1.775) internal successors, (71), 41 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 19:54:04,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2021-08-25 19:54:04,461 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 19:54:04,461 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 19:54:04,462 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 19:54:04,471 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 19:54:04,471 INFO L82 PathProgramCache]: Analyzing trace with hash 255061167, now seen corresponding path program 1 times [2021-08-25 19:54:04,479 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-25 19:54:04,479 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1530755960] [2021-08-25 19:54:04,479 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 19:54:04,480 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-25 19:54:04,480 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-25 19:54:04,485 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-08-25 19:54:04,520 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2021-08-25 19:54:04,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 19:54:04,585 INFO L263 TraceCheckSpWp]: Trace formula consists of 46 conjuncts, 1 conjunts are in the unsatisfiable core [2021-08-25 19:54:04,588 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-25 19:54:04,647 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-25 19:54:04,647 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-25 19:54:04,687 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-25 19:54:04,687 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-25 19:54:04,688 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1530755960] [2021-08-25 19:54:04,688 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1530755960] provided 2 perfect and 0 imperfect interpolant sequences [2021-08-25 19:54:04,688 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-08-25 19:54:04,688 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2021-08-25 19:54:04,689 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1567205684] [2021-08-25 19:54:04,692 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2021-08-25 19:54:04,693 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-25 19:54:04,701 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-08-25 19:54:04,702 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-08-25 19:54:04,704 INFO L87 Difference]: Start difference. First operand has 42 states, 40 states have (on average 1.775) internal successors, (71), 41 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 19:54:04,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 19:54:04,718 INFO L93 Difference]: Finished difference Result 57 states and 92 transitions. [2021-08-25 19:54:04,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-08-25 19:54:04,719 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), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2021-08-25 19:54:04,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 19:54:04,726 INFO L225 Difference]: With dead ends: 57 [2021-08-25 19:54:04,726 INFO L226 Difference]: Without dead ends: 38 [2021-08-25 19:54:04,728 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1ms TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-08-25 19:54:04,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2021-08-25 19:54:04,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2021-08-25 19:54:04,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 37 states have (on average 1.7297297297297298) internal successors, (64), 37 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 19:54:04,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 64 transitions. [2021-08-25 19:54:04,752 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 64 transitions. Word has length 12 [2021-08-25 19:54:04,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 19:54:04,752 INFO L470 AbstractCegarLoop]: Abstraction has 38 states and 64 transitions. [2021-08-25 19:54:04,753 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), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 19:54:04,753 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 64 transitions. [2021-08-25 19:54:04,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2021-08-25 19:54:04,754 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 19:54:04,755 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 19:54:04,763 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2021-08-25 19:54:04,955 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-08-25 19:54:04,955 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 19:54:04,958 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 19:54:04,958 INFO L82 PathProgramCache]: Analyzing trace with hash 1803477009, now seen corresponding path program 1 times [2021-08-25 19:54:04,958 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-25 19:54:04,958 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [698848674] [2021-08-25 19:54:04,958 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 19:54:04,959 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-25 19:54:04,959 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-25 19:54:04,959 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-08-25 19:54:04,971 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2021-08-25 19:54:05,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 19:54:05,033 INFO L263 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 3 conjunts are in the unsatisfiable core [2021-08-25 19:54:05,041 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-25 19:54:05,123 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-25 19:54:05,123 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-25 19:54:05,171 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-25 19:54:05,171 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-25 19:54:05,171 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [698848674] [2021-08-25 19:54:05,171 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [698848674] provided 2 perfect and 0 imperfect interpolant sequences [2021-08-25 19:54:05,172 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-08-25 19:54:05,172 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2021-08-25 19:54:05,172 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [921028011] [2021-08-25 19:54:05,174 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-08-25 19:54:05,174 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-25 19:54:05,175 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-08-25 19:54:05,175 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2021-08-25 19:54:05,176 INFO L87 Difference]: Start difference. First operand 38 states and 64 transitions. Second operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 19:54:05,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 19:54:05,437 INFO L93 Difference]: Finished difference Result 180 states and 315 transitions. [2021-08-25 19:54:05,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-08-25 19:54:05,438 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2021-08-25 19:54:05,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 19:54:05,442 INFO L225 Difference]: With dead ends: 180 [2021-08-25 19:54:05,442 INFO L226 Difference]: Without dead ends: 152 [2021-08-25 19:54:05,443 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 23.3ms TimeCoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2021-08-25 19:54:05,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2021-08-25 19:54:05,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 97. [2021-08-25 19:54:05,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 96 states have (on average 1.5833333333333333) internal successors, (152), 96 states have internal predecessors, (152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 19:54:05,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 152 transitions. [2021-08-25 19:54:05,452 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 152 transitions. Word has length 12 [2021-08-25 19:54:05,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 19:54:05,452 INFO L470 AbstractCegarLoop]: Abstraction has 97 states and 152 transitions. [2021-08-25 19:54:05,452 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 19:54:05,453 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 152 transitions. [2021-08-25 19:54:05,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2021-08-25 19:54:05,453 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 19:54:05,453 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 19:54:05,462 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2021-08-25 19:54:05,659 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-08-25 19:54:05,660 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 19:54:05,660 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 19:54:05,660 INFO L82 PathProgramCache]: Analyzing trace with hash -1251593412, now seen corresponding path program 1 times [2021-08-25 19:54:05,661 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-25 19:54:05,661 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [719750270] [2021-08-25 19:54:05,661 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 19:54:05,661 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-25 19:54:05,661 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-25 19:54:05,663 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-08-25 19:54:05,672 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2021-08-25 19:54:05,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 19:54:05,722 INFO L263 TraceCheckSpWp]: Trace formula consists of 53 conjuncts, 6 conjunts are in the unsatisfiable core [2021-08-25 19:54:05,723 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-25 19:54:05,800 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-25 19:54:05,800 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-25 19:54:05,892 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-25 19:54:05,893 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-25 19:54:05,893 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [719750270] [2021-08-25 19:54:05,893 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [719750270] provided 2 perfect and 0 imperfect interpolant sequences [2021-08-25 19:54:05,893 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-08-25 19:54:05,893 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7, 7] imperfect sequences [] total 12 [2021-08-25 19:54:05,893 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2109276924] [2021-08-25 19:54:05,894 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-08-25 19:54:05,894 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-25 19:54:05,894 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-08-25 19:54:05,894 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2021-08-25 19:54:05,894 INFO L87 Difference]: Start difference. First operand 97 states and 152 transitions. Second operand has 12 states, 12 states have (on average 1.8333333333333333) internal successors, (22), 12 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 19:54:06,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 19:54:06,377 INFO L93 Difference]: Finished difference Result 251 states and 421 transitions. [2021-08-25 19:54:06,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-08-25 19:54:06,378 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 1.8333333333333333) internal successors, (22), 12 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2021-08-25 19:54:06,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 19:54:06,379 INFO L225 Difference]: With dead ends: 251 [2021-08-25 19:54:06,379 INFO L226 Difference]: Without dead ends: 223 [2021-08-25 19:54:06,380 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 74.7ms TimeCoverageRelationStatistics Valid=62, Invalid=148, Unknown=0, NotChecked=0, Total=210 [2021-08-25 19:54:06,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states. [2021-08-25 19:54:06,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 191. [2021-08-25 19:54:06,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 191 states, 190 states have (on average 1.5947368421052632) internal successors, (303), 190 states have internal predecessors, (303), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 19:54:06,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 303 transitions. [2021-08-25 19:54:06,395 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 303 transitions. Word has length 14 [2021-08-25 19:54:06,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 19:54:06,395 INFO L470 AbstractCegarLoop]: Abstraction has 191 states and 303 transitions. [2021-08-25 19:54:06,396 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 1.8333333333333333) internal successors, (22), 12 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 19:54:06,396 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 303 transitions. [2021-08-25 19:54:06,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2021-08-25 19:54:06,397 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 19:54:06,397 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 19:54:06,405 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Ended with exit code 0 [2021-08-25 19:54:06,603 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-08-25 19:54:06,604 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 19:54:06,604 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 19:54:06,604 INFO L82 PathProgramCache]: Analyzing trace with hash 2087887882, now seen corresponding path program 1 times [2021-08-25 19:54:06,605 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-25 19:54:06,605 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1247186728] [2021-08-25 19:54:06,605 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 19:54:06,605 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-25 19:54:06,605 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-25 19:54:06,606 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-08-25 19:54:06,632 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2021-08-25 19:54:06,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 19:54:06,665 INFO L263 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 2 conjunts are in the unsatisfiable core [2021-08-25 19:54:06,666 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-25 19:54:06,732 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-25 19:54:06,733 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-25 19:54:06,813 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-25 19:54:06,814 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-25 19:54:06,815 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1247186728] [2021-08-25 19:54:06,815 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1247186728] provided 2 perfect and 0 imperfect interpolant sequences [2021-08-25 19:54:06,815 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-08-25 19:54:06,815 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2021-08-25 19:54:06,815 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1005725639] [2021-08-25 19:54:06,816 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-25 19:54:06,816 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-25 19:54:06,816 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-25 19:54:06,817 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-08-25 19:54:06,817 INFO L87 Difference]: Start difference. First operand 191 states and 303 transitions. Second operand has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 19:54:06,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 19:54:06,914 INFO L93 Difference]: Finished difference Result 449 states and 722 transitions. [2021-08-25 19:54:06,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-25 19:54:06,915 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2021-08-25 19:54:06,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 19:54:06,916 INFO L225 Difference]: With dead ends: 449 [2021-08-25 19:54:06,916 INFO L226 Difference]: Without dead ends: 292 [2021-08-25 19:54:06,917 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.9ms TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-08-25 19:54:06,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 292 states. [2021-08-25 19:54:06,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 292 to 257. [2021-08-25 19:54:06,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 257 states, 256 states have (on average 1.55078125) internal successors, (397), 256 states have internal predecessors, (397), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 19:54:06,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 397 transitions. [2021-08-25 19:54:06,927 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 397 transitions. Word has length 26 [2021-08-25 19:54:06,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 19:54:06,927 INFO L470 AbstractCegarLoop]: Abstraction has 257 states and 397 transitions. [2021-08-25 19:54:06,928 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 19:54:06,928 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 397 transitions. [2021-08-25 19:54:06,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2021-08-25 19:54:06,929 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 19:54:06,929 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 19:54:06,939 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2021-08-25 19:54:07,135 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-08-25 19:54:07,136 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 19:54:07,136 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 19:54:07,136 INFO L82 PathProgramCache]: Analyzing trace with hash 73987210, now seen corresponding path program 1 times [2021-08-25 19:54:07,137 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-25 19:54:07,137 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1270369501] [2021-08-25 19:54:07,137 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 19:54:07,137 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-25 19:54:07,137 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-25 19:54:07,138 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-08-25 19:54:07,140 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2021-08-25 19:54:07,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 19:54:07,207 INFO L263 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 3 conjunts are in the unsatisfiable core [2021-08-25 19:54:07,208 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-25 19:54:07,309 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-25 19:54:07,310 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-25 19:54:07,387 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-25 19:54:07,388 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-25 19:54:07,388 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1270369501] [2021-08-25 19:54:07,388 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1270369501] provided 2 perfect and 0 imperfect interpolant sequences [2021-08-25 19:54:07,388 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-08-25 19:54:07,388 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2021-08-25 19:54:07,388 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1392466958] [2021-08-25 19:54:07,389 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-08-25 19:54:07,389 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-25 19:54:07,389 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-08-25 19:54:07,391 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2021-08-25 19:54:07,391 INFO L87 Difference]: Start difference. First operand 257 states and 397 transitions. Second operand has 6 states, 6 states have (on average 6.0) internal successors, (36), 6 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 19:54:07,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 19:54:07,643 INFO L93 Difference]: Finished difference Result 1005 states and 1558 transitions. [2021-08-25 19:54:07,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-08-25 19:54:07,651 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.0) internal successors, (36), 6 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2021-08-25 19:54:07,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 19:54:07,653 INFO L225 Difference]: With dead ends: 1005 [2021-08-25 19:54:07,653 INFO L226 Difference]: Without dead ends: 784 [2021-08-25 19:54:07,654 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 18.0ms TimeCoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2021-08-25 19:54:07,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 784 states. [2021-08-25 19:54:07,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 784 to 636. [2021-08-25 19:54:07,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 636 states, 635 states have (on average 1.5181102362204724) internal successors, (964), 635 states have internal predecessors, (964), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 19:54:07,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 636 states to 636 states and 964 transitions. [2021-08-25 19:54:07,672 INFO L78 Accepts]: Start accepts. Automaton has 636 states and 964 transitions. Word has length 26 [2021-08-25 19:54:07,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 19:54:07,672 INFO L470 AbstractCegarLoop]: Abstraction has 636 states and 964 transitions. [2021-08-25 19:54:07,672 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.0) internal successors, (36), 6 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 19:54:07,672 INFO L276 IsEmpty]: Start isEmpty. Operand 636 states and 964 transitions. [2021-08-25 19:54:07,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2021-08-25 19:54:07,673 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 19:54:07,673 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 19:54:07,682 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2021-08-25 19:54:07,882 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-08-25 19:54:07,883 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 19:54:07,883 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 19:54:07,883 INFO L82 PathProgramCache]: Analyzing trace with hash -1742793183, now seen corresponding path program 1 times [2021-08-25 19:54:07,883 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-25 19:54:07,884 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [801794876] [2021-08-25 19:54:07,884 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 19:54:07,884 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-25 19:54:07,884 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-25 19:54:07,885 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-08-25 19:54:07,887 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2021-08-25 19:54:07,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 19:54:07,994 INFO L263 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 5 conjunts are in the unsatisfiable core [2021-08-25 19:54:07,995 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-25 19:54:08,083 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-25 19:54:08,083 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-25 19:54:08,297 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-25 19:54:08,297 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-25 19:54:08,297 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [801794876] [2021-08-25 19:54:08,297 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [801794876] provided 2 perfect and 0 imperfect interpolant sequences [2021-08-25 19:54:08,298 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-08-25 19:54:08,298 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [] total 10 [2021-08-25 19:54:08,298 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [46785411] [2021-08-25 19:54:08,298 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-08-25 19:54:08,298 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-25 19:54:08,299 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-08-25 19:54:08,299 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2021-08-25 19:54:08,299 INFO L87 Difference]: Start difference. First operand 636 states and 964 transitions. Second operand has 10 states, 10 states have (on average 4.2) internal successors, (42), 10 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 19:54:09,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 19:54:09,031 INFO L93 Difference]: Finished difference Result 2019 states and 3076 transitions. [2021-08-25 19:54:09,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-08-25 19:54:09,032 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.2) internal successors, (42), 10 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2021-08-25 19:54:09,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 19:54:09,036 INFO L225 Difference]: With dead ends: 2019 [2021-08-25 19:54:09,036 INFO L226 Difference]: Without dead ends: 1433 [2021-08-25 19:54:09,037 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 225.9ms TimeCoverageRelationStatistics Valid=141, Invalid=321, Unknown=0, NotChecked=0, Total=462 [2021-08-25 19:54:09,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1433 states. [2021-08-25 19:54:09,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1433 to 851. [2021-08-25 19:54:09,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 851 states, 850 states have (on average 1.4388235294117646) internal successors, (1223), 850 states have internal predecessors, (1223), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 19:54:09,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 851 states to 851 states and 1223 transitions. [2021-08-25 19:54:09,068 INFO L78 Accepts]: Start accepts. Automaton has 851 states and 1223 transitions. Word has length 28 [2021-08-25 19:54:09,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 19:54:09,068 INFO L470 AbstractCegarLoop]: Abstraction has 851 states and 1223 transitions. [2021-08-25 19:54:09,069 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.2) internal successors, (42), 10 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 19:54:09,069 INFO L276 IsEmpty]: Start isEmpty. Operand 851 states and 1223 transitions. [2021-08-25 19:54:09,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2021-08-25 19:54:09,070 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 19:54:09,070 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 19:54:09,079 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2021-08-25 19:54:09,276 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-08-25 19:54:09,277 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 19:54:09,277 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 19:54:09,277 INFO L82 PathProgramCache]: Analyzing trace with hash 2075339537, now seen corresponding path program 1 times [2021-08-25 19:54:09,278 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-25 19:54:09,278 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [916115531] [2021-08-25 19:54:09,278 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 19:54:09,278 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-25 19:54:09,278 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-25 19:54:09,279 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-08-25 19:54:09,279 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2021-08-25 19:54:09,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 19:54:09,396 INFO L263 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 2 conjunts are in the unsatisfiable core [2021-08-25 19:54:09,397 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-25 19:54:09,476 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-25 19:54:09,477 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-25 19:54:09,544 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-25 19:54:09,545 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-25 19:54:09,545 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [916115531] [2021-08-25 19:54:09,545 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [916115531] provided 2 perfect and 0 imperfect interpolant sequences [2021-08-25 19:54:09,545 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-08-25 19:54:09,545 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2021-08-25 19:54:09,546 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [460123917] [2021-08-25 19:54:09,546 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-25 19:54:09,546 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-25 19:54:09,549 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-25 19:54:09,549 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-08-25 19:54:09,549 INFO L87 Difference]: Start difference. First operand 851 states and 1223 transitions. Second operand has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 19:54:09,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 19:54:09,572 INFO L93 Difference]: Finished difference Result 1165 states and 1644 transitions. [2021-08-25 19:54:09,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-25 19:54:09,572 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2021-08-25 19:54:09,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 19:54:09,575 INFO L225 Difference]: With dead ends: 1165 [2021-08-25 19:54:09,575 INFO L226 Difference]: Without dead ends: 1069 [2021-08-25 19:54:09,576 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.1ms TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-08-25 19:54:09,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1069 states. [2021-08-25 19:54:09,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1069 to 1027. [2021-08-25 19:54:09,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1027 states, 1026 states have (on average 1.4132553606237817) internal successors, (1450), 1026 states have internal predecessors, (1450), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 19:54:09,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1027 states to 1027 states and 1450 transitions. [2021-08-25 19:54:09,592 INFO L78 Accepts]: Start accepts. Automaton has 1027 states and 1450 transitions. Word has length 31 [2021-08-25 19:54:09,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 19:54:09,593 INFO L470 AbstractCegarLoop]: Abstraction has 1027 states and 1450 transitions. [2021-08-25 19:54:09,593 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 19:54:09,593 INFO L276 IsEmpty]: Start isEmpty. Operand 1027 states and 1450 transitions. [2021-08-25 19:54:09,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2021-08-25 19:54:09,594 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 19:54:09,594 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 19:54:09,601 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2021-08-25 19:54:09,800 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-08-25 19:54:09,800 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 19:54:09,801 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 19:54:09,801 INFO L82 PathProgramCache]: Analyzing trace with hash -1961462321, now seen corresponding path program 1 times [2021-08-25 19:54:09,801 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-25 19:54:09,801 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1606048290] [2021-08-25 19:54:09,801 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 19:54:09,801 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-25 19:54:09,801 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-25 19:54:09,802 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-08-25 19:54:09,803 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2021-08-25 19:54:09,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 19:54:09,914 INFO L263 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 5 conjunts are in the unsatisfiable core [2021-08-25 19:54:09,915 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-25 19:54:10,086 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-25 19:54:10,086 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-25 19:54:10,203 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-25 19:54:10,203 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-25 19:54:10,204 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1606048290] [2021-08-25 19:54:10,204 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1606048290] provided 0 perfect and 2 imperfect interpolant sequences [2021-08-25 19:54:10,204 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-25 19:54:10,204 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2021-08-25 19:54:10,204 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [55122426] [2021-08-25 19:54:10,205 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-08-25 19:54:10,205 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-25 19:54:10,205 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-08-25 19:54:10,205 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2021-08-25 19:54:10,205 INFO L87 Difference]: Start difference. First operand 1027 states and 1450 transitions. Second operand has 10 states, 10 states have (on average 5.6) internal successors, (56), 10 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 19:54:10,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 19:54:10,819 INFO L93 Difference]: Finished difference Result 2278 states and 3209 transitions. [2021-08-25 19:54:10,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-08-25 19:54:10,820 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.6) internal successors, (56), 10 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2021-08-25 19:54:10,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 19:54:10,823 INFO L225 Difference]: With dead ends: 2278 [2021-08-25 19:54:10,824 INFO L226 Difference]: Without dead ends: 1435 [2021-08-25 19:54:10,825 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 150.0ms TimeCoverageRelationStatistics Valid=122, Invalid=220, Unknown=0, NotChecked=0, Total=342 [2021-08-25 19:54:10,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1435 states. [2021-08-25 19:54:10,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1435 to 1146. [2021-08-25 19:54:10,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1146 states, 1145 states have (on average 1.3694323144104803) internal successors, (1568), 1145 states have internal predecessors, (1568), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 19:54:10,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1146 states to 1146 states and 1568 transitions. [2021-08-25 19:54:10,845 INFO L78 Accepts]: Start accepts. Automaton has 1146 states and 1568 transitions. Word has length 31 [2021-08-25 19:54:10,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 19:54:10,845 INFO L470 AbstractCegarLoop]: Abstraction has 1146 states and 1568 transitions. [2021-08-25 19:54:10,845 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.6) internal successors, (56), 10 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 19:54:10,845 INFO L276 IsEmpty]: Start isEmpty. Operand 1146 states and 1568 transitions. [2021-08-25 19:54:10,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-08-25 19:54:10,846 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 19:54:10,846 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 19:54:10,856 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2021-08-25 19:54:11,055 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-08-25 19:54:11,055 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 19:54:11,056 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 19:54:11,056 INFO L82 PathProgramCache]: Analyzing trace with hash 1953500664, now seen corresponding path program 1 times [2021-08-25 19:54:11,056 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-25 19:54:11,056 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [886367906] [2021-08-25 19:54:11,056 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 19:54:11,056 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-25 19:54:11,056 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-25 19:54:11,058 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-08-25 19:54:11,058 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2021-08-25 19:54:11,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 19:54:11,201 INFO L263 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 5 conjunts are in the unsatisfiable core [2021-08-25 19:54:11,202 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-25 19:54:11,340 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-25 19:54:11,340 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-25 19:54:11,532 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-25 19:54:11,532 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-25 19:54:11,532 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [886367906] [2021-08-25 19:54:11,532 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [886367906] provided 1 perfect and 1 imperfect interpolant sequences [2021-08-25 19:54:11,532 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-08-25 19:54:11,532 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 10 [2021-08-25 19:54:11,532 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1782101594] [2021-08-25 19:54:11,533 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-08-25 19:54:11,533 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-25 19:54:11,534 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-08-25 19:54:11,534 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2021-08-25 19:54:11,534 INFO L87 Difference]: Start difference. First operand 1146 states and 1568 transitions. Second operand has 6 states, 6 states have (on average 5.333333333333333) internal successors, (32), 6 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 19:54:11,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 19:54:11,768 INFO L93 Difference]: Finished difference Result 1797 states and 2473 transitions. [2021-08-25 19:54:11,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-08-25 19:54:11,769 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.333333333333333) internal successors, (32), 6 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2021-08-25 19:54:11,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 19:54:11,772 INFO L225 Difference]: With dead ends: 1797 [2021-08-25 19:54:11,772 INFO L226 Difference]: Without dead ends: 1570 [2021-08-25 19:54:11,773 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 46.0ms TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2021-08-25 19:54:11,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1570 states. [2021-08-25 19:54:11,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1570 to 1384. [2021-08-25 19:54:11,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1384 states, 1383 states have (on average 1.3593637020968907) internal successors, (1880), 1383 states have internal predecessors, (1880), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 19:54:11,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1384 states to 1384 states and 1880 transitions. [2021-08-25 19:54:11,796 INFO L78 Accepts]: Start accepts. Automaton has 1384 states and 1880 transitions. Word has length 32 [2021-08-25 19:54:11,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 19:54:11,796 INFO L470 AbstractCegarLoop]: Abstraction has 1384 states and 1880 transitions. [2021-08-25 19:54:11,796 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.333333333333333) internal successors, (32), 6 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 19:54:11,797 INFO L276 IsEmpty]: Start isEmpty. Operand 1384 states and 1880 transitions. [2021-08-25 19:54:11,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2021-08-25 19:54:11,797 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 19:54:11,798 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 19:54:11,806 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2021-08-25 19:54:12,004 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-08-25 19:54:12,004 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 19:54:12,005 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 19:54:12,005 INFO L82 PathProgramCache]: Analyzing trace with hash -1914622646, now seen corresponding path program 1 times [2021-08-25 19:54:12,005 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-25 19:54:12,005 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1348161426] [2021-08-25 19:54:12,005 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 19:54:12,005 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-25 19:54:12,005 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-25 19:54:12,006 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-08-25 19:54:12,009 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2021-08-25 19:54:12,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 19:54:12,195 INFO L263 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 6 conjunts are in the unsatisfiable core [2021-08-25 19:54:12,196 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-25 19:54:12,333 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-25 19:54:12,334 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-25 19:54:12,553 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-25 19:54:12,553 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-25 19:54:12,553 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1348161426] [2021-08-25 19:54:12,553 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1348161426] provided 1 perfect and 1 imperfect interpolant sequences [2021-08-25 19:54:12,553 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-08-25 19:54:12,553 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [7] total 12 [2021-08-25 19:54:12,554 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2087841024] [2021-08-25 19:54:12,554 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-08-25 19:54:12,554 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-25 19:54:12,554 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-08-25 19:54:12,555 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2021-08-25 19:54:12,555 INFO L87 Difference]: Start difference. First operand 1384 states and 1880 transitions. Second operand has 7 states, 7 states have (on average 4.714285714285714) internal successors, (33), 7 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 19:54:12,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 19:54:12,849 INFO L93 Difference]: Finished difference Result 1865 states and 2541 transitions. [2021-08-25 19:54:12,850 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-08-25 19:54:12,850 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.714285714285714) internal successors, (33), 7 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 33 [2021-08-25 19:54:12,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 19:54:12,854 INFO L225 Difference]: With dead ends: 1865 [2021-08-25 19:54:12,854 INFO L226 Difference]: Without dead ends: 1646 [2021-08-25 19:54:12,855 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 61.9ms TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2021-08-25 19:54:12,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1646 states. [2021-08-25 19:54:12,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1646 to 1340. [2021-08-25 19:54:12,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1340 states, 1339 states have (on average 1.3495145631067962) internal successors, (1807), 1339 states have internal predecessors, (1807), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 19:54:12,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1340 states to 1340 states and 1807 transitions. [2021-08-25 19:54:12,879 INFO L78 Accepts]: Start accepts. Automaton has 1340 states and 1807 transitions. Word has length 33 [2021-08-25 19:54:12,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 19:54:12,881 INFO L470 AbstractCegarLoop]: Abstraction has 1340 states and 1807 transitions. [2021-08-25 19:54:12,881 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.714285714285714) internal successors, (33), 7 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 19:54:12,881 INFO L276 IsEmpty]: Start isEmpty. Operand 1340 states and 1807 transitions. [2021-08-25 19:54:12,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2021-08-25 19:54:12,882 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 19:54:12,883 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 19:54:12,892 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2021-08-25 19:54:13,089 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-08-25 19:54:13,089 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 19:54:13,089 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 19:54:13,090 INFO L82 PathProgramCache]: Analyzing trace with hash -2055171256, now seen corresponding path program 1 times [2021-08-25 19:54:13,090 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-25 19:54:13,090 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [458745575] [2021-08-25 19:54:13,090 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 19:54:13,090 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-25 19:54:13,090 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-25 19:54:13,091 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-08-25 19:54:13,091 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2021-08-25 19:54:13,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 19:54:13,286 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 3 conjunts are in the unsatisfiable core [2021-08-25 19:54:13,295 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-25 19:54:13,387 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-25 19:54:13,388 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-25 19:54:13,465 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-25 19:54:13,466 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-25 19:54:13,466 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [458745575] [2021-08-25 19:54:13,466 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [458745575] provided 2 perfect and 0 imperfect interpolant sequences [2021-08-25 19:54:13,466 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-08-25 19:54:13,466 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2021-08-25 19:54:13,466 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1362291869] [2021-08-25 19:54:13,466 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-08-25 19:54:13,466 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-25 19:54:13,467 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-08-25 19:54:13,467 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2021-08-25 19:54:13,467 INFO L87 Difference]: Start difference. First operand 1340 states and 1807 transitions. Second operand has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 6 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 19:54:13,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 19:54:13,727 INFO L93 Difference]: Finished difference Result 3524 states and 4922 transitions. [2021-08-25 19:54:13,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-08-25 19:54:13,728 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 6 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 33 [2021-08-25 19:54:13,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 19:54:13,733 INFO L225 Difference]: With dead ends: 3524 [2021-08-25 19:54:13,733 INFO L226 Difference]: Without dead ends: 2252 [2021-08-25 19:54:13,734 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 20.5ms TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2021-08-25 19:54:13,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2252 states. [2021-08-25 19:54:13,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2252 to 1435. [2021-08-25 19:54:13,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1435 states, 1434 states have (on average 1.3661087866108788) internal successors, (1959), 1434 states have internal predecessors, (1959), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 19:54:13,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1435 states to 1435 states and 1959 transitions. [2021-08-25 19:54:13,762 INFO L78 Accepts]: Start accepts. Automaton has 1435 states and 1959 transitions. Word has length 33 [2021-08-25 19:54:13,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 19:54:13,762 INFO L470 AbstractCegarLoop]: Abstraction has 1435 states and 1959 transitions. [2021-08-25 19:54:13,762 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 6 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 19:54:13,762 INFO L276 IsEmpty]: Start isEmpty. Operand 1435 states and 1959 transitions. [2021-08-25 19:54:13,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2021-08-25 19:54:13,764 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 19:54:13,764 INFO L512 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 19:54:13,771 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (12)] Forceful destruction successful, exit code 0 [2021-08-25 19:54:13,971 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-08-25 19:54:13,972 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 19:54:13,972 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 19:54:13,972 INFO L82 PathProgramCache]: Analyzing trace with hash 945650591, now seen corresponding path program 1 times [2021-08-25 19:54:13,973 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-25 19:54:13,973 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [834631161] [2021-08-25 19:54:13,973 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 19:54:13,973 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-25 19:54:13,973 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-25 19:54:13,974 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-08-25 19:54:13,996 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2021-08-25 19:54:14,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 19:54:14,217 INFO L263 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 33 conjunts are in the unsatisfiable core [2021-08-25 19:54:14,219 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-25 19:54:16,432 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 19 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-08-25 19:54:16,432 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-25 19:54:18,056 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-08-25 19:54:18,057 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-25 19:54:18,057 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [834631161] [2021-08-25 19:54:18,057 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [834631161] provided 0 perfect and 2 imperfect interpolant sequences [2021-08-25 19:54:18,057 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-25 19:54:18,057 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20] total 38 [2021-08-25 19:54:18,058 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [505482635] [2021-08-25 19:54:18,058 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2021-08-25 19:54:18,058 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-25 19:54:18,058 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2021-08-25 19:54:18,059 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=164, Invalid=1242, Unknown=0, NotChecked=0, Total=1406 [2021-08-25 19:54:18,059 INFO L87 Difference]: Start difference. First operand 1435 states and 1959 transitions. Second operand has 38 states, 38 states have (on average 2.6315789473684212) internal successors, (100), 38 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 19:54:24,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 19:54:24,784 INFO L93 Difference]: Finished difference Result 3221 states and 4351 transitions. [2021-08-25 19:54:24,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2021-08-25 19:54:24,784 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 38 states have (on average 2.6315789473684212) internal successors, (100), 38 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 51 [2021-08-25 19:54:24,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 19:54:24,791 INFO L225 Difference]: With dead ends: 3221 [2021-08-25 19:54:24,791 INFO L226 Difference]: Without dead ends: 3073 [2021-08-25 19:54:24,793 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 876 ImplicationChecksByTransitivity, 5671.3ms TimeCoverageRelationStatistics Valid=1663, Invalid=4817, Unknown=0, NotChecked=0, Total=6480 [2021-08-25 19:54:24,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3073 states. [2021-08-25 19:54:24,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3073 to 1671. [2021-08-25 19:54:24,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1671 states, 1670 states have (on average 1.3712574850299402) internal successors, (2290), 1670 states have internal predecessors, (2290), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 19:54:24,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1671 states to 1671 states and 2290 transitions. [2021-08-25 19:54:24,832 INFO L78 Accepts]: Start accepts. Automaton has 1671 states and 2290 transitions. Word has length 51 [2021-08-25 19:54:24,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 19:54:24,832 INFO L470 AbstractCegarLoop]: Abstraction has 1671 states and 2290 transitions. [2021-08-25 19:54:24,832 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 38 states have (on average 2.6315789473684212) internal successors, (100), 38 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 19:54:24,832 INFO L276 IsEmpty]: Start isEmpty. Operand 1671 states and 2290 transitions. [2021-08-25 19:54:24,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2021-08-25 19:54:24,833 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 19:54:24,834 INFO L512 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 19:54:24,842 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (13)] Forceful destruction successful, exit code 0 [2021-08-25 19:54:25,040 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-08-25 19:54:25,041 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 19:54:25,041 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 19:54:25,041 INFO L82 PathProgramCache]: Analyzing trace with hash -65466659, now seen corresponding path program 1 times [2021-08-25 19:54:25,041 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-25 19:54:25,042 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1797611705] [2021-08-25 19:54:25,042 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 19:54:25,042 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-25 19:54:25,042 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-25 19:54:25,043 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-08-25 19:54:25,044 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2021-08-25 19:54:25,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 19:54:25,410 INFO L263 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 4 conjunts are in the unsatisfiable core [2021-08-25 19:54:25,416 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-25 19:54:25,582 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 15 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-08-25 19:54:25,582 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-25 19:54:25,690 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 15 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-08-25 19:54:25,690 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-25 19:54:25,690 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1797611705] [2021-08-25 19:54:25,690 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1797611705] provided 0 perfect and 2 imperfect interpolant sequences [2021-08-25 19:54:25,690 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-25 19:54:25,690 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2021-08-25 19:54:25,691 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [345618630] [2021-08-25 19:54:25,691 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-08-25 19:54:25,691 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-25 19:54:25,691 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-08-25 19:54:25,691 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-08-25 19:54:25,691 INFO L87 Difference]: Start difference. First operand 1671 states and 2290 transitions. Second operand has 7 states, 7 states have (on average 8.857142857142858) internal successors, (62), 7 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 19:54:25,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 19:54:25,883 INFO L93 Difference]: Finished difference Result 3359 states and 4598 transitions. [2021-08-25 19:54:25,884 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-08-25 19:54:25,884 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.857142857142858) internal successors, (62), 7 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 51 [2021-08-25 19:54:25,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 19:54:25,888 INFO L225 Difference]: With dead ends: 3359 [2021-08-25 19:54:25,888 INFO L226 Difference]: Without dead ends: 1745 [2021-08-25 19:54:25,890 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 94 SyntacticMatches, 5 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 2 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 32.4ms TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-08-25 19:54:25,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1745 states. [2021-08-25 19:54:25,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1745 to 1595. [2021-08-25 19:54:25,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1595 states, 1594 states have (on average 1.3268506900878294) internal successors, (2115), 1594 states have internal predecessors, (2115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 19:54:25,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1595 states to 1595 states and 2115 transitions. [2021-08-25 19:54:25,923 INFO L78 Accepts]: Start accepts. Automaton has 1595 states and 2115 transitions. Word has length 51 [2021-08-25 19:54:25,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 19:54:25,923 INFO L470 AbstractCegarLoop]: Abstraction has 1595 states and 2115 transitions. [2021-08-25 19:54:25,923 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.857142857142858) internal successors, (62), 7 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 19:54:25,923 INFO L276 IsEmpty]: Start isEmpty. Operand 1595 states and 2115 transitions. [2021-08-25 19:54:25,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2021-08-25 19:54:25,925 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 19:54:25,925 INFO L512 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 19:54:25,936 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (14)] Forceful destruction successful, exit code 0 [2021-08-25 19:54:26,132 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-08-25 19:54:26,132 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 19:54:26,132 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 19:54:26,133 INFO L82 PathProgramCache]: Analyzing trace with hash -1950719985, now seen corresponding path program 1 times [2021-08-25 19:54:26,133 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-25 19:54:26,133 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2107783032] [2021-08-25 19:54:26,133 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 19:54:26,133 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-25 19:54:26,133 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-25 19:54:26,134 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-08-25 19:54:26,134 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2021-08-25 19:54:26,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-25 19:54:26,527 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-25 19:54:26,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-25 19:54:26,593 INFO L133 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2021-08-25 19:54:26,594 INFO L626 BasicCegarLoop]: Counterexample is feasible [2021-08-25 19:54:26,594 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION [2021-08-25 19:54:26,610 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (15)] Forceful destruction successful, exit code 0 [2021-08-25 19:54:26,803 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-08-25 19:54:26,807 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-08-25 19:54:26,858 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.08 07:54:26 BoogieIcfgContainer [2021-08-25 19:54:26,858 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-08-25 19:54:26,859 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-08-25 19:54:26,859 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-08-25 19:54:26,859 INFO L275 PluginConnector]: Witness Printer initialized [2021-08-25 19:54:26,859 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.08 07:54:04" (3/4) ... [2021-08-25 19:54:26,861 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2021-08-25 19:54:26,913 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2021-08-25 19:54:26,913 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-08-25 19:54:26,914 INFO L168 Benchmark]: Toolchain (without parser) took 23119.99 ms. Allocated memory was 52.4 MB in the beginning and 220.2 MB in the end (delta: 167.8 MB). Free memory was 30.1 MB in the beginning and 110.9 MB in the end (delta: -80.8 MB). Peak memory consumption was 85.4 MB. Max. memory is 16.1 GB. [2021-08-25 19:54:26,914 INFO L168 Benchmark]: CDTParser took 0.09 ms. Allocated memory is still 52.4 MB. Free memory was 33.8 MB in the beginning and 33.7 MB in the end (delta: 35.2 kB). There was no memory consumed. Max. memory is 16.1 GB. [2021-08-25 19:54:26,915 INFO L168 Benchmark]: CACSL2BoogieTranslator took 203.71 ms. Allocated memory was 52.4 MB in the beginning and 71.3 MB in the end (delta: 18.9 MB). Free memory was 29.9 MB in the beginning and 53.7 MB in the end (delta: -23.8 MB). Peak memory consumption was 5.3 MB. Max. memory is 16.1 GB. [2021-08-25 19:54:26,915 INFO L168 Benchmark]: Boogie Procedure Inliner took 37.27 ms. Allocated memory is still 71.3 MB. Free memory was 53.7 MB in the beginning and 51.8 MB in the end (delta: 1.8 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-08-25 19:54:26,915 INFO L168 Benchmark]: Boogie Preprocessor took 18.54 ms. Allocated memory is still 71.3 MB. Free memory was 51.8 MB in the beginning and 50.2 MB in the end (delta: 1.6 MB). There was no memory consumed. Max. memory is 16.1 GB. [2021-08-25 19:54:26,916 INFO L168 Benchmark]: RCFGBuilder took 314.81 ms. Allocated memory is still 71.3 MB. Free memory was 50.2 MB in the beginning and 47.6 MB in the end (delta: 2.6 MB). Peak memory consumption was 20.9 MB. Max. memory is 16.1 GB. [2021-08-25 19:54:26,916 INFO L168 Benchmark]: TraceAbstraction took 22485.20 ms. Allocated memory was 71.3 MB in the beginning and 220.2 MB in the end (delta: 148.9 MB). Free memory was 47.3 MB in the beginning and 116.2 MB in the end (delta: -68.9 MB). Peak memory consumption was 79.7 MB. Max. memory is 16.1 GB. [2021-08-25 19:54:26,916 INFO L168 Benchmark]: Witness Printer took 54.16 ms. Allocated memory is still 220.2 MB. Free memory was 116.2 MB in the beginning and 110.9 MB in the end (delta: 5.2 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. [2021-08-25 19:54:26,917 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.09 ms. Allocated memory is still 52.4 MB. Free memory was 33.8 MB in the beginning and 33.7 MB in the end (delta: 35.2 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 203.71 ms. Allocated memory was 52.4 MB in the beginning and 71.3 MB in the end (delta: 18.9 MB). Free memory was 29.9 MB in the beginning and 53.7 MB in the end (delta: -23.8 MB). Peak memory consumption was 5.3 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 37.27 ms. Allocated memory is still 71.3 MB. Free memory was 53.7 MB in the beginning and 51.8 MB in the end (delta: 1.8 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 18.54 ms. Allocated memory is still 71.3 MB. Free memory was 51.8 MB in the beginning and 50.2 MB in the end (delta: 1.6 MB). There was no memory consumed. Max. memory is 16.1 GB. * RCFGBuilder took 314.81 ms. Allocated memory is still 71.3 MB. Free memory was 50.2 MB in the beginning and 47.6 MB in the end (delta: 2.6 MB). Peak memory consumption was 20.9 MB. Max. memory is 16.1 GB. * TraceAbstraction took 22485.20 ms. Allocated memory was 71.3 MB in the beginning and 220.2 MB in the end (delta: 148.9 MB). Free memory was 47.3 MB in the beginning and 116.2 MB in the end (delta: -68.9 MB). Peak memory consumption was 79.7 MB. Max. memory is 16.1 GB. * Witness Printer took 54.16 ms. Allocated memory is still 220.2 MB. Free memory was 116.2 MB in the beginning and 110.9 MB in the end (delta: 5.2 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0ms ErrorAutomatonConstructionTimeTotal, 0.0ms FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0ms ErrorAutomatonConstructionTimeAvg, 0.0ms ErrorAutomatonDifferenceTimeAvg, 0.0ms ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 17]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L116] unsigned int a, b, r; [L118] a = __VERIFIER_nondet_uint() [L119] b = __VERIFIER_nondet_uint() [L34] unsigned char a0, a1, a2, a3; [L35] unsigned char b0, b1, b2, b3; [L36] unsigned char r0, r1, r2, r3; [L37] unsigned short carry; [L38] unsigned short partial_sum; [L39] unsigned int r; [L40] unsigned char i; [L41] unsigned char na, nb; [L42] a0 = a [L43] a1 = a >> 8 [L44] a2 = a >> 16U [L45] a3 = a >> 24U [L46] b0 = b [L47] b1 = b >> 8U [L48] b2 = b >> 16U [L49] b3 = b >> 24U [L50] na = (unsigned char)4 [L51] COND TRUE a3 == (unsigned char)0 [L52] na = na - 1 [L53] COND TRUE a2 == (unsigned char)0 [L54] na = na - 1 [L55] COND TRUE a1 == (unsigned char)0 [L56] na = na - 1 [L60] nb = (unsigned char)4 [L61] COND TRUE b3 == (unsigned char)0 [L62] nb = nb - 1 [L63] COND TRUE b2 == (unsigned char)0 [L64] nb = nb - 1 [L65] COND TRUE b1 == (unsigned char)0 [L66] nb = nb - 1 [L70] carry = (unsigned short)0 [L71] i = (unsigned char)0 [L72] COND TRUE (i < na) || (i < nb) || (carry != (unsigned short)0) [L73] partial_sum = carry [L74] carry = (unsigned short)0 [L75] COND TRUE i < na [L76] COND TRUE i == (unsigned char)0 [L76] partial_sum = partial_sum + a0 [L77] COND FALSE !(i == (unsigned char)1) [L78] COND FALSE !(i == (unsigned char)2) [L79] COND FALSE !(i == (unsigned char)3) [L81] COND TRUE i < nb [L82] COND TRUE i == (unsigned char)0 [L82] partial_sum = partial_sum + b0 [L83] COND FALSE !(i == (unsigned char)1) [L84] COND FALSE !(i == (unsigned char)2) [L85] COND FALSE !(i == (unsigned char)3) [L87] COND TRUE partial_sum > ((unsigned char)254) [L88] partial_sum = partial_sum & ((unsigned char)255) [L89] carry = (unsigned short)1 [L91] COND TRUE i == (unsigned char)0 [L91] r0 = (unsigned char)partial_sum [L92] COND FALSE !(i == (unsigned char)1) [L93] COND FALSE !(i == (unsigned char)2) [L94] COND FALSE !(i == (unsigned char)3) [L96] i = i + (unsigned char)1 [L72] COND TRUE (i < na) || (i < nb) || (carry != (unsigned short)0) [L73] partial_sum = carry [L74] carry = (unsigned short)0 [L75] COND FALSE !(i < na) [L81] COND FALSE !(i < nb) [L87] COND FALSE !(partial_sum > ((unsigned char)254)) [L91] COND FALSE !(i == (unsigned char)0) [L92] COND TRUE i == (unsigned char)1 [L92] r1 = (unsigned char)partial_sum [L93] COND FALSE !(i == (unsigned char)2) [L94] COND FALSE !(i == (unsigned char)3) [L96] i = i + (unsigned char)1 [L72] COND FALSE !((i < na) || (i < nb) || (carry != (unsigned short)0)) [L99] COND TRUE i < (unsigned char)4 [L100] COND FALSE !(i == (unsigned char)0) [L101] COND FALSE !(i == (unsigned char)1) [L102] COND TRUE i == (unsigned char)2 [L102] r2 = (unsigned char)0 [L103] COND FALSE !(i == (unsigned char)3) [L105] i = i + (unsigned char)1 [L99] COND TRUE i < (unsigned char)4 [L100] COND FALSE !(i == (unsigned char)0) [L101] COND FALSE !(i == (unsigned char)1) [L102] COND FALSE !(i == (unsigned char)2) [L103] COND TRUE i == (unsigned char)3 [L103] r3 = (unsigned char)0 [L105] i = i + (unsigned char)1 [L99] COND FALSE !(i < (unsigned char)4) [L108] r = r0 | (r1 << 8U) | (r2 << 16U) | ((unsigned int)r3 << 24U) [L110] return r; [L121] r = mp_add(a, b) [L16] COND TRUE !(cond) [L17] reach_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 42 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 22363.0ms, OverallIterations: 14, TraceHistogramMax: 3, EmptinessCheckTime: 19.6ms, AutomataDifference: 10284.8ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 6.4ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 1271 SDtfs, 5056 SDslu, 7292 SDs, 0 SdLazy, 6189 SolverSat, 662 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 4316.2ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 809 GetRequests, 633 SyntacticMatches, 5 SemanticMatches, 171 ConstructedPredicates, 0 IntricatePredicates, 2 DeprecatedPredicates, 1064 ImplicationChecksByTransitivity, 6332.7ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=1671occurred in iteration=12, InterpolantAutomatonStates: 137, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: 279.0ms AutomataMinimizationTime, 13 MinimizatonAttempts, 4044 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 111.6ms SsaConstructionTime, 295.3ms SatisfiabilityAnalysisTime, 6490.1ms InterpolantComputationTime, 434 NumberOfCodeBlocks, 434 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 734 ConstructedInterpolants, 54 QuantifiedInterpolants, 6516 SizeOfPredicates, 45 NumberOfNonLiveVariables, 949 ConjunctsInSsa, 78 ConjunctsInUnsatCore, 26 InterpolantComputations, 18 PerfectInterpolantSequences, 71/104 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 proved your program to be incorrect! [2021-08-25 19:54:26,947 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...