./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/bitvector/byte_add_1-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version ae007674 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-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 0ba3e3db8f44a5e9ad151b8422bee8deebac1dcf47a42cba5485daeafd8d8e80 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-ae00767 [2021-12-27 21:52:20,026 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-27 21:52:20,029 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-27 21:52:20,058 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-27 21:52:20,058 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-27 21:52:20,061 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-27 21:52:20,062 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-27 21:52:20,065 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-27 21:52:20,067 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-27 21:52:20,070 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-27 21:52:20,071 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-27 21:52:20,074 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-27 21:52:20,074 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-27 21:52:20,076 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-27 21:52:20,077 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-27 21:52:20,079 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-27 21:52:20,080 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-27 21:52:20,080 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-27 21:52:20,082 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-27 21:52:20,086 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-27 21:52:20,087 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-27 21:52:20,087 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-27 21:52:20,088 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-27 21:52:20,089 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-27 21:52:20,094 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-27 21:52:20,094 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-27 21:52:20,094 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-27 21:52:20,095 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-27 21:52:20,100 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-27 21:52:20,101 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-27 21:52:20,101 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-27 21:52:20,101 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-27 21:52:20,102 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-27 21:52:20,103 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-27 21:52:20,104 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-27 21:52:20,104 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-27 21:52:20,104 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-27 21:52:20,104 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-27 21:52:20,105 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-27 21:52:20,106 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-27 21:52:20,106 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-27 21:52:20,109 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2021-12-27 21:52:20,135 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-27 21:52:20,136 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-27 21:52:20,136 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-27 21:52:20,136 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-27 21:52:20,137 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-27 21:52:20,137 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-27 21:52:20,138 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-27 21:52:20,138 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-27 21:52:20,138 INFO L138 SettingsManager]: * Use SBE=true [2021-12-27 21:52:20,138 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-27 21:52:20,139 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-27 21:52:20,139 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-27 21:52:20,139 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-27 21:52:20,139 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-27 21:52:20,140 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-12-27 21:52:20,140 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-27 21:52:20,140 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-12-27 21:52:20,140 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-27 21:52:20,140 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-12-27 21:52:20,140 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-27 21:52:20,140 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-12-27 21:52:20,141 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-27 21:52:20,141 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-27 21:52:20,141 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-27 21:52:20,141 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-27 21:52:20,141 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-27 21:52:20,141 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-27 21:52:20,141 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-12-27 21:52:20,141 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-27 21:52:20,142 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-12-27 21:52:20,142 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-12-27 21:52:20,142 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-12-27 21:52:20,142 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-12-27 21:52:20,142 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 -> 0ba3e3db8f44a5e9ad151b8422bee8deebac1dcf47a42cba5485daeafd8d8e80 [2021-12-27 21:52:20,386 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-27 21:52:20,406 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-27 21:52:20,408 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-27 21:52:20,409 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-27 21:52:20,409 INFO L275 PluginConnector]: CDTParser initialized [2021-12-27 21:52:20,410 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/bitvector/byte_add_1-1.i [2021-12-27 21:52:20,457 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a35b64b21/08fe526f2fe94622b81a46dd14b4a3ae/FLAG61e1f44a4 [2021-12-27 21:52:20,854 INFO L306 CDTParser]: Found 1 translation units. [2021-12-27 21:52:20,854 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/byte_add_1-1.i [2021-12-27 21:52:20,861 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a35b64b21/08fe526f2fe94622b81a46dd14b4a3ae/FLAG61e1f44a4 [2021-12-27 21:52:20,871 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a35b64b21/08fe526f2fe94622b81a46dd14b4a3ae [2021-12-27 21:52:20,873 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-27 21:52:20,874 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-27 21:52:20,876 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-27 21:52:20,876 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-27 21:52:20,879 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-27 21:52:20,879 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 09:52:20" (1/1) ... [2021-12-27 21:52:20,880 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4acfbcb1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:52:20, skipping insertion in model container [2021-12-27 21:52:20,880 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 09:52:20" (1/1) ... [2021-12-27 21:52:20,885 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-27 21:52:20,906 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-27 21:52:21,025 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/byte_add_1-1.i[1168,1181] [2021-12-27 21:52:21,096 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-27 21:52:21,102 INFO L203 MainTranslator]: Completed pre-run [2021-12-27 21:52:21,116 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/byte_add_1-1.i[1168,1181] [2021-12-27 21:52:21,125 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-27 21:52:21,136 INFO L208 MainTranslator]: Completed translation [2021-12-27 21:52:21,137 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:52:21 WrapperNode [2021-12-27 21:52:21,137 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-27 21:52:21,137 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-27 21:52:21,138 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-27 21:52:21,138 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-27 21:52:21,142 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:52:21" (1/1) ... [2021-12-27 21:52:21,153 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:52:21" (1/1) ... [2021-12-27 21:52:21,176 INFO L137 Inliner]: procedures = 16, calls = 8, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 123 [2021-12-27 21:52:21,176 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-27 21:52:21,177 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-27 21:52:21,177 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-27 21:52:21,177 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-27 21:52:21,182 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:52:21" (1/1) ... [2021-12-27 21:52:21,182 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:52:21" (1/1) ... [2021-12-27 21:52:21,194 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:52:21" (1/1) ... [2021-12-27 21:52:21,194 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:52:21" (1/1) ... [2021-12-27 21:52:21,197 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:52:21" (1/1) ... [2021-12-27 21:52:21,209 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:52:21" (1/1) ... [2021-12-27 21:52:21,210 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:52:21" (1/1) ... [2021-12-27 21:52:21,212 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-27 21:52:21,213 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-27 21:52:21,213 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-27 21:52:21,213 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-27 21:52:21,214 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:52:21" (1/1) ... [2021-12-27 21:52:21,219 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-27 21:52:21,228 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-27 21:52:21,246 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-12-27 21:52:21,268 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-12-27 21:52:21,280 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-27 21:52:21,280 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-12-27 21:52:21,280 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-27 21:52:21,281 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-27 21:52:21,330 INFO L234 CfgBuilder]: Building ICFG [2021-12-27 21:52:21,331 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-27 21:52:21,513 INFO L275 CfgBuilder]: Performing block encoding [2021-12-27 21:52:21,517 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-27 21:52:21,517 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2021-12-27 21:52:21,518 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 09:52:21 BoogieIcfgContainer [2021-12-27 21:52:21,519 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-27 21:52:21,520 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-12-27 21:52:21,520 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-12-27 21:52:21,522 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-12-27 21:52:21,522 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 09:52:20" (1/3) ... [2021-12-27 21:52:21,522 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5a8f2716 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 09:52:21, skipping insertion in model container [2021-12-27 21:52:21,522 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:52:21" (2/3) ... [2021-12-27 21:52:21,523 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5a8f2716 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 09:52:21, skipping insertion in model container [2021-12-27 21:52:21,523 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 09:52:21" (3/3) ... [2021-12-27 21:52:21,523 INFO L111 eAbstractionObserver]: Analyzing ICFG byte_add_1-1.i [2021-12-27 21:52:21,526 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-12-27 21:52:21,527 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-12-27 21:52:21,580 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-12-27 21:52:21,587 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2021-12-27 21:52:21,587 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-12-27 21:52:21,598 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-12-27 21:52:21,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2021-12-27 21:52:21,602 INFO L506 BasicCegarLoop]: Found error trace [2021-12-27 21:52:21,603 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-27 21:52:21,603 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-27 21:52:21,607 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-27 21:52:21,607 INFO L85 PathProgramCache]: Analyzing trace with hash 255061167, now seen corresponding path program 1 times [2021-12-27 21:52:21,613 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-27 21:52:21,614 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1674662088] [2021-12-27 21:52:21,614 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-27 21:52:21,615 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-27 21:52:21,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-27 21:52:21,742 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-27 21:52:21,743 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-27 21:52:21,743 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1674662088] [2021-12-27 21:52:21,745 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1674662088] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-27 21:52:21,745 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-27 21:52:21,745 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-27 21:52:21,746 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [289635466] [2021-12-27 21:52:21,747 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-27 21:52:21,749 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2021-12-27 21:52:21,749 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-27 21:52:21,788 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-12-27 21:52:21,788 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-12-27 21:52:21,790 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-12-27 21:52:21,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-27 21:52:21,806 INFO L93 Difference]: Finished difference Result 57 states and 92 transitions. [2021-12-27 21:52:21,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-12-27 21:52:21,807 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-12-27 21:52:21,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-27 21:52:21,814 INFO L225 Difference]: With dead ends: 57 [2021-12-27 21:52:21,814 INFO L226 Difference]: Without dead ends: 38 [2021-12-27 21:52:21,816 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-12-27 21:52:21,819 INFO L933 BasicCegarLoop]: 68 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-27 21:52:21,820 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-27 21:52:21,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2021-12-27 21:52:21,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2021-12-27 21:52:21,844 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-12-27 21:52:21,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 64 transitions. [2021-12-27 21:52:21,846 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 64 transitions. Word has length 12 [2021-12-27 21:52:21,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-27 21:52:21,847 INFO L470 AbstractCegarLoop]: Abstraction has 38 states and 64 transitions. [2021-12-27 21:52:21,847 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-12-27 21:52:21,847 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 64 transitions. [2021-12-27 21:52:21,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2021-12-27 21:52:21,848 INFO L506 BasicCegarLoop]: Found error trace [2021-12-27 21:52:21,848 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-27 21:52:21,849 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-12-27 21:52:21,850 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-27 21:52:21,851 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-27 21:52:21,851 INFO L85 PathProgramCache]: Analyzing trace with hash 1803477009, now seen corresponding path program 1 times [2021-12-27 21:52:21,851 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-27 21:52:21,851 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1675013745] [2021-12-27 21:52:21,852 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-27 21:52:21,852 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-27 21:52:21,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-27 21:52:21,949 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-27 21:52:21,950 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-27 21:52:21,950 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1675013745] [2021-12-27 21:52:21,950 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1675013745] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-27 21:52:21,951 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-27 21:52:21,951 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-27 21:52:21,951 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1370943066] [2021-12-27 21:52:21,951 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-27 21:52:21,952 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-27 21:52:21,952 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-27 21:52:21,953 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-27 21:52:21,954 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-27 21:52:21,954 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-12-27 21:52:22,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-27 21:52:22,080 INFO L93 Difference]: Finished difference Result 89 states and 156 transitions. [2021-12-27 21:52:22,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-27 21:52:22,081 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-12-27 21:52:22,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-27 21:52:22,084 INFO L225 Difference]: With dead ends: 89 [2021-12-27 21:52:22,084 INFO L226 Difference]: Without dead ends: 61 [2021-12-27 21:52:22,086 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-27 21:52:22,088 INFO L933 BasicCegarLoop]: 39 mSDtfsCounter, 24 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 59 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-27 21:52:22,089 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [24 Valid, 59 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-27 21:52:22,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2021-12-27 21:52:22,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 59. [2021-12-27 21:52:22,096 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-12-27 21:52:22,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 89 transitions. [2021-12-27 21:52:22,098 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 89 transitions. Word has length 12 [2021-12-27 21:52:22,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-27 21:52:22,099 INFO L470 AbstractCegarLoop]: Abstraction has 59 states and 89 transitions. [2021-12-27 21:52:22,100 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-12-27 21:52:22,100 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 89 transitions. [2021-12-27 21:52:22,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-12-27 21:52:22,101 INFO L506 BasicCegarLoop]: Found error trace [2021-12-27 21:52:22,102 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-27 21:52:22,102 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-12-27 21:52:22,103 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-27 21:52:22,104 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-27 21:52:22,105 INFO L85 PathProgramCache]: Analyzing trace with hash -1336656122, now seen corresponding path program 1 times [2021-12-27 21:52:22,105 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-27 21:52:22,105 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [426087575] [2021-12-27 21:52:22,105 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-27 21:52:22,105 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-27 21:52:22,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-27 21:52:22,220 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-27 21:52:22,220 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-27 21:52:22,220 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [426087575] [2021-12-27 21:52:22,220 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [426087575] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-27 21:52:22,220 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-27 21:52:22,220 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-27 21:52:22,220 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [575338668] [2021-12-27 21:52:22,221 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-27 21:52:22,221 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-27 21:52:22,221 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-27 21:52:22,221 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-27 21:52:22,221 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-27 21:52:22,221 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-12-27 21:52:22,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-27 21:52:22,400 INFO L93 Difference]: Finished difference Result 143 states and 218 transitions. [2021-12-27 21:52:22,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-27 21:52:22,401 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-12-27 21:52:22,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-27 21:52:22,401 INFO L225 Difference]: With dead ends: 143 [2021-12-27 21:52:22,402 INFO L226 Difference]: Without dead ends: 105 [2021-12-27 21:52:22,402 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-12-27 21:52:22,403 INFO L933 BasicCegarLoop]: 80 mSDtfsCounter, 85 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 118 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 156 SdHoareTripleChecker+Invalid, 120 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 118 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-27 21:52:22,403 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [85 Valid, 156 Invalid, 120 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 118 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-27 21:52:22,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2021-12-27 21:52:22,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 67. [2021-12-27 21:52:22,408 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-12-27 21:52:22,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 98 transitions. [2021-12-27 21:52:22,408 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 98 transitions. Word has length 18 [2021-12-27 21:52:22,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-27 21:52:22,408 INFO L470 AbstractCegarLoop]: Abstraction has 67 states and 98 transitions. [2021-12-27 21:52:22,408 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-12-27 21:52:22,408 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 98 transitions. [2021-12-27 21:52:22,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-12-27 21:52:22,409 INFO L506 BasicCegarLoop]: Found error trace [2021-12-27 21:52:22,409 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-27 21:52:22,409 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-12-27 21:52:22,409 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-27 21:52:22,409 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-27 21:52:22,409 INFO L85 PathProgramCache]: Analyzing trace with hash -640429161, now seen corresponding path program 1 times [2021-12-27 21:52:22,410 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-27 21:52:22,410 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [881211655] [2021-12-27 21:52:22,410 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-27 21:52:22,410 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-27 21:52:22,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-27 21:52:22,470 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-27 21:52:22,470 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-27 21:52:22,470 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [881211655] [2021-12-27 21:52:22,470 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [881211655] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-27 21:52:22,471 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-27 21:52:22,471 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-27 21:52:22,471 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1004062265] [2021-12-27 21:52:22,471 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-27 21:52:22,477 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-27 21:52:22,477 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-27 21:52:22,478 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-27 21:52:22,478 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-27 21:52:22,478 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-12-27 21:52:22,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-27 21:52:22,605 INFO L93 Difference]: Finished difference Result 169 states and 250 transitions. [2021-12-27 21:52:22,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-27 21:52:22,606 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-12-27 21:52:22,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-27 21:52:22,607 INFO L225 Difference]: With dead ends: 169 [2021-12-27 21:52:22,608 INFO L226 Difference]: Without dead ends: 125 [2021-12-27 21:52:22,609 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-12-27 21:52:22,610 INFO L933 BasicCegarLoop]: 86 mSDtfsCounter, 89 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 116 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 164 SdHoareTripleChecker+Invalid, 118 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 116 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-27 21:52:22,613 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [89 Valid, 164 Invalid, 118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 116 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-27 21:52:22,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2021-12-27 21:52:22,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 77. [2021-12-27 21:52:22,623 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-12-27 21:52:22,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 111 transitions. [2021-12-27 21:52:22,627 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 111 transitions. Word has length 19 [2021-12-27 21:52:22,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-27 21:52:22,627 INFO L470 AbstractCegarLoop]: Abstraction has 77 states and 111 transitions. [2021-12-27 21:52:22,627 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-12-27 21:52:22,627 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 111 transitions. [2021-12-27 21:52:22,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-12-27 21:52:22,628 INFO L506 BasicCegarLoop]: Found error trace [2021-12-27 21:52:22,628 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-27 21:52:22,628 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-12-27 21:52:22,629 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-27 21:52:22,629 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-27 21:52:22,629 INFO L85 PathProgramCache]: Analyzing trace with hash -170409323, now seen corresponding path program 1 times [2021-12-27 21:52:22,629 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-27 21:52:22,629 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2001573303] [2021-12-27 21:52:22,629 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-27 21:52:22,630 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-27 21:52:22,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-27 21:52:22,677 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-27 21:52:22,677 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-27 21:52:22,677 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2001573303] [2021-12-27 21:52:22,677 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2001573303] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-27 21:52:22,677 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-27 21:52:22,677 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-27 21:52:22,678 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [456599604] [2021-12-27 21:52:22,678 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-27 21:52:22,678 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-27 21:52:22,678 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-27 21:52:22,679 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-27 21:52:22,679 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-27 21:52:22,679 INFO L87 Difference]: Start difference. First operand 77 states and 111 transitions. Second operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 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-12-27 21:52:22,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-27 21:52:22,684 INFO L93 Difference]: Finished difference Result 124 states and 180 transitions. [2021-12-27 21:52:22,684 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-27 21:52:22,684 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 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-12-27 21:52:22,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-27 21:52:22,685 INFO L225 Difference]: With dead ends: 124 [2021-12-27 21:52:22,685 INFO L226 Difference]: Without dead ends: 60 [2021-12-27 21:52:22,685 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-27 21:52:22,686 INFO L933 BasicCegarLoop]: 57 mSDtfsCounter, 57 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-27 21:52:22,686 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [57 Valid, 58 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-27 21:52:22,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2021-12-27 21:52:22,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2021-12-27 21:52:22,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 59 states have (on average 1.4406779661016949) internal successors, (85), 59 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-27 21:52:22,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 85 transitions. [2021-12-27 21:52:22,695 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 85 transitions. Word has length 20 [2021-12-27 21:52:22,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-27 21:52:22,696 INFO L470 AbstractCegarLoop]: Abstraction has 60 states and 85 transitions. [2021-12-27 21:52:22,696 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 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-12-27 21:52:22,696 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 85 transitions. [2021-12-27 21:52:22,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2021-12-27 21:52:22,696 INFO L506 BasicCegarLoop]: Found error trace [2021-12-27 21:52:22,697 INFO L514 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-12-27 21:52:22,697 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-12-27 21:52:22,698 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-27 21:52:22,699 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-27 21:52:22,699 INFO L85 PathProgramCache]: Analyzing trace with hash -1388506533, now seen corresponding path program 1 times [2021-12-27 21:52:22,699 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-27 21:52:22,702 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2005271741] [2021-12-27 21:52:22,702 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-27 21:52:22,703 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-27 21:52:22,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-27 21:52:22,754 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-27 21:52:22,755 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-27 21:52:22,755 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2005271741] [2021-12-27 21:52:22,755 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2005271741] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-27 21:52:22,755 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-27 21:52:22,755 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-27 21:52:22,755 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1153660996] [2021-12-27 21:52:22,756 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-27 21:52:22,756 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-27 21:52:22,757 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-27 21:52:22,757 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-27 21:52:22,757 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-27 21:52:22,757 INFO L87 Difference]: Start difference. First operand 60 states and 85 transitions. Second operand has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 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-12-27 21:52:22,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-27 21:52:22,765 INFO L93 Difference]: Finished difference Result 81 states and 115 transitions. [2021-12-27 21:52:22,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-27 21:52:22,766 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 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 26 [2021-12-27 21:52:22,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-27 21:52:22,767 INFO L225 Difference]: With dead ends: 81 [2021-12-27 21:52:22,767 INFO L226 Difference]: Without dead ends: 70 [2021-12-27 21:52:22,767 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-27 21:52:22,768 INFO L933 BasicCegarLoop]: 59 mSDtfsCounter, 4 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 113 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-27 21:52:22,768 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4 Valid, 113 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-27 21:52:22,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2021-12-27 21:52:22,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2021-12-27 21:52:22,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 69 states have (on average 1.434782608695652) internal successors, (99), 69 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-27 21:52:22,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 99 transitions. [2021-12-27 21:52:22,772 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 99 transitions. Word has length 26 [2021-12-27 21:52:22,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-27 21:52:22,772 INFO L470 AbstractCegarLoop]: Abstraction has 70 states and 99 transitions. [2021-12-27 21:52:22,773 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 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-12-27 21:52:22,773 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 99 transitions. [2021-12-27 21:52:22,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2021-12-27 21:52:22,773 INFO L506 BasicCegarLoop]: Found error trace [2021-12-27 21:52:22,773 INFO L514 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-12-27 21:52:22,774 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-12-27 21:52:22,774 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-27 21:52:22,774 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-27 21:52:22,774 INFO L85 PathProgramCache]: Analyzing trace with hash -1130341095, now seen corresponding path program 1 times [2021-12-27 21:52:22,774 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-27 21:52:22,774 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1154259903] [2021-12-27 21:52:22,775 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-27 21:52:22,775 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-27 21:52:22,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-27 21:52:22,840 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-27 21:52:22,841 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-27 21:52:22,841 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1154259903] [2021-12-27 21:52:22,841 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1154259903] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-27 21:52:22,841 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1667109896] [2021-12-27 21:52:22,841 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-27 21:52:22,841 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-27 21:52:22,842 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-27 21:52:22,843 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-12-27 21:52:22,851 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-12-27 21:52:22,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-27 21:52:22,889 INFO L263 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 4 conjunts are in the unsatisfiable core [2021-12-27 21:52:22,892 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-27 21:52:23,073 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-27 21:52:23,073 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-27 21:52:23,073 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1667109896] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-27 21:52:23,073 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-27 21:52:23,074 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2021-12-27 21:52:23,074 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1048043138] [2021-12-27 21:52:23,075 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-27 21:52:23,075 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-27 21:52:23,075 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-27 21:52:23,075 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-27 21:52:23,075 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2021-12-27 21:52:23,076 INFO L87 Difference]: Start difference. First operand 70 states and 99 transitions. Second operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 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-12-27 21:52:23,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-27 21:52:23,208 INFO L93 Difference]: Finished difference Result 156 states and 254 transitions. [2021-12-27 21:52:23,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-27 21:52:23,208 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 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 26 [2021-12-27 21:52:23,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-27 21:52:23,209 INFO L225 Difference]: With dead ends: 156 [2021-12-27 21:52:23,209 INFO L226 Difference]: Without dead ends: 122 [2021-12-27 21:52:23,209 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2021-12-27 21:52:23,210 INFO L933 BasicCegarLoop]: 29 mSDtfsCounter, 35 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 131 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 59 SdHoareTripleChecker+Invalid, 166 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 131 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-27 21:52:23,210 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [35 Valid, 59 Invalid, 166 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 131 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-27 21:52:23,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2021-12-27 21:52:23,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 102. [2021-12-27 21:52:23,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 101 states have (on average 1.3366336633663367) internal successors, (135), 101 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-27 21:52:23,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 135 transitions. [2021-12-27 21:52:23,216 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 135 transitions. Word has length 26 [2021-12-27 21:52:23,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-27 21:52:23,216 INFO L470 AbstractCegarLoop]: Abstraction has 102 states and 135 transitions. [2021-12-27 21:52:23,216 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 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-12-27 21:52:23,216 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 135 transitions. [2021-12-27 21:52:23,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-12-27 21:52:23,217 INFO L506 BasicCegarLoop]: Found error trace [2021-12-27 21:52:23,217 INFO L514 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-12-27 21:52:23,238 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-12-27 21:52:23,417 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-27 21:52:23,417 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-27 21:52:23,418 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-27 21:52:23,418 INFO L85 PathProgramCache]: Analyzing trace with hash -1226843574, now seen corresponding path program 1 times [2021-12-27 21:52:23,418 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-27 21:52:23,418 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1852183630] [2021-12-27 21:52:23,418 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-27 21:52:23,418 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-27 21:52:23,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-27 21:52:23,522 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-27 21:52:23,522 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-27 21:52:23,523 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1852183630] [2021-12-27 21:52:23,523 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1852183630] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-27 21:52:23,523 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [486666447] [2021-12-27 21:52:23,523 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-27 21:52:23,523 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-27 21:52:23,523 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-27 21:52:23,524 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-12-27 21:52:23,525 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-12-27 21:52:23,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-27 21:52:23,565 INFO L263 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 5 conjunts are in the unsatisfiable core [2021-12-27 21:52:23,566 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-27 21:52:23,626 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-27 21:52:23,626 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-27 21:52:23,626 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [486666447] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-27 21:52:23,627 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-27 21:52:23,627 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 8 [2021-12-27 21:52:23,627 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1036264678] [2021-12-27 21:52:23,627 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-27 21:52:23,627 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-27 21:52:23,627 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-27 21:52:23,628 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-27 21:52:23,628 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2021-12-27 21:52:23,628 INFO L87 Difference]: Start difference. First operand 102 states and 135 transitions. Second operand has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 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-12-27 21:52:23,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-27 21:52:23,754 INFO L93 Difference]: Finished difference Result 243 states and 351 transitions. [2021-12-27 21:52:23,754 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-27 21:52:23,755 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 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-12-27 21:52:23,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-27 21:52:23,756 INFO L225 Difference]: With dead ends: 243 [2021-12-27 21:52:23,756 INFO L226 Difference]: Without dead ends: 160 [2021-12-27 21:52:23,758 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 31 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2021-12-27 21:52:23,763 INFO L933 BasicCegarLoop]: 55 mSDtfsCounter, 37 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 158 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 89 SdHoareTripleChecker+Invalid, 190 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 158 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-27 21:52:23,763 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [37 Valid, 89 Invalid, 190 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 158 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-27 21:52:23,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2021-12-27 21:52:23,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 131. [2021-12-27 21:52:23,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 130 states have (on average 1.2923076923076924) internal successors, (168), 130 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-27 21:52:23,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 168 transitions. [2021-12-27 21:52:23,780 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 168 transitions. Word has length 32 [2021-12-27 21:52:23,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-27 21:52:23,781 INFO L470 AbstractCegarLoop]: Abstraction has 131 states and 168 transitions. [2021-12-27 21:52:23,781 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 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-12-27 21:52:23,781 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 168 transitions. [2021-12-27 21:52:23,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-12-27 21:52:23,782 INFO L506 BasicCegarLoop]: Found error trace [2021-12-27 21:52:23,782 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-27 21:52:23,801 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-12-27 21:52:23,982 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,SelfDestructingSolverStorable7 [2021-12-27 21:52:23,983 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-27 21:52:23,983 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-27 21:52:23,983 INFO L85 PathProgramCache]: Analyzing trace with hash -1448774913, now seen corresponding path program 1 times [2021-12-27 21:52:23,983 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-27 21:52:23,983 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [888291382] [2021-12-27 21:52:23,983 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-27 21:52:23,983 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-27 21:52:23,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-27 21:52:24,063 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-12-27 21:52:24,063 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-27 21:52:24,063 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [888291382] [2021-12-27 21:52:24,063 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [888291382] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-27 21:52:24,063 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1951542929] [2021-12-27 21:52:24,064 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-27 21:52:24,064 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-27 21:52:24,064 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-27 21:52:24,065 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-12-27 21:52:24,066 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-12-27 21:52:24,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-27 21:52:24,105 INFO L263 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 5 conjunts are in the unsatisfiable core [2021-12-27 21:52:24,106 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-27 21:52:24,174 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-12-27 21:52:24,174 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-27 21:52:24,174 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1951542929] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-27 21:52:24,174 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-27 21:52:24,174 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 8 [2021-12-27 21:52:24,174 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1598075283] [2021-12-27 21:52:24,175 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-27 21:52:24,175 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-27 21:52:24,175 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-27 21:52:24,175 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-27 21:52:24,175 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2021-12-27 21:52:24,176 INFO L87 Difference]: Start difference. First operand 131 states and 168 transitions. Second operand has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 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-12-27 21:52:24,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-27 21:52:24,292 INFO L93 Difference]: Finished difference Result 302 states and 416 transitions. [2021-12-27 21:52:24,292 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-27 21:52:24,292 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 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 38 [2021-12-27 21:52:24,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-27 21:52:24,293 INFO L225 Difference]: With dead ends: 302 [2021-12-27 21:52:24,293 INFO L226 Difference]: Without dead ends: 190 [2021-12-27 21:52:24,293 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 37 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2021-12-27 21:52:24,294 INFO L933 BasicCegarLoop]: 59 mSDtfsCounter, 36 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 160 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 93 SdHoareTripleChecker+Invalid, 190 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 160 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-27 21:52:24,294 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [36 Valid, 93 Invalid, 190 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 160 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-27 21:52:24,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2021-12-27 21:52:24,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 160. [2021-12-27 21:52:24,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 160 states, 159 states have (on average 1.2641509433962264) internal successors, (201), 159 states have internal predecessors, (201), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-27 21:52:24,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 201 transitions. [2021-12-27 21:52:24,299 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 201 transitions. Word has length 38 [2021-12-27 21:52:24,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-27 21:52:24,299 INFO L470 AbstractCegarLoop]: Abstraction has 160 states and 201 transitions. [2021-12-27 21:52:24,299 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 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-12-27 21:52:24,299 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 201 transitions. [2021-12-27 21:52:24,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2021-12-27 21:52:24,300 INFO L506 BasicCegarLoop]: Found error trace [2021-12-27 21:52:24,300 INFO L514 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] [2021-12-27 21:52:24,325 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2021-12-27 21:52:24,516 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-27 21:52:24,517 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-27 21:52:24,517 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-27 21:52:24,517 INFO L85 PathProgramCache]: Analyzing trace with hash 882299696, now seen corresponding path program 1 times [2021-12-27 21:52:24,517 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-27 21:52:24,517 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1986045934] [2021-12-27 21:52:24,517 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-27 21:52:24,518 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-27 21:52:24,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-27 21:52:24,618 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2021-12-27 21:52:24,619 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-27 21:52:24,619 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1986045934] [2021-12-27 21:52:24,619 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1986045934] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-27 21:52:24,619 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [245579813] [2021-12-27 21:52:24,619 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-27 21:52:24,619 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-27 21:52:24,619 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-27 21:52:24,630 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-12-27 21:52:24,631 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-12-27 21:52:24,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-27 21:52:24,690 INFO L263 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 6 conjunts are in the unsatisfiable core [2021-12-27 21:52:24,691 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-27 21:52:24,840 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2021-12-27 21:52:24,840 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-27 21:52:24,840 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [245579813] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-27 21:52:24,840 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-27 21:52:24,840 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 7 [2021-12-27 21:52:24,840 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1692787732] [2021-12-27 21:52:24,841 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-27 21:52:24,841 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-27 21:52:24,841 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-27 21:52:24,841 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-27 21:52:24,841 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-12-27 21:52:24,841 INFO L87 Difference]: Start difference. First operand 160 states and 201 transitions. Second operand has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 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-12-27 21:52:24,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-27 21:52:24,907 INFO L93 Difference]: Finished difference Result 327 states and 422 transitions. [2021-12-27 21:52:24,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-27 21:52:24,907 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 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 44 [2021-12-27 21:52:24,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-27 21:52:24,908 INFO L225 Difference]: With dead ends: 327 [2021-12-27 21:52:24,908 INFO L226 Difference]: Without dead ends: 150 [2021-12-27 21:52:24,908 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 42 SyntacticMatches, 4 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2021-12-27 21:52:24,909 INFO L933 BasicCegarLoop]: 19 mSDtfsCounter, 66 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 92 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 46 SdHoareTripleChecker+Invalid, 103 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 92 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-27 21:52:24,910 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [66 Valid, 46 Invalid, 103 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 92 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-27 21:52:24,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2021-12-27 21:52:24,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 130. [2021-12-27 21:52:24,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 129 states have (on average 1.255813953488372) internal successors, (162), 129 states have internal predecessors, (162), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-27 21:52:24,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 162 transitions. [2021-12-27 21:52:24,923 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 162 transitions. Word has length 44 [2021-12-27 21:52:24,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-27 21:52:24,924 INFO L470 AbstractCegarLoop]: Abstraction has 130 states and 162 transitions. [2021-12-27 21:52:24,924 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 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-12-27 21:52:24,924 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 162 transitions. [2021-12-27 21:52:24,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2021-12-27 21:52:24,930 INFO L506 BasicCegarLoop]: Found error trace [2021-12-27 21:52:24,930 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-27 21:52:24,946 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-12-27 21:52:25,135 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-27 21:52:25,135 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-27 21:52:25,136 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-27 21:52:25,136 INFO L85 PathProgramCache]: Analyzing trace with hash -1716436880, now seen corresponding path program 1 times [2021-12-27 21:52:25,136 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-27 21:52:25,136 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [634469277] [2021-12-27 21:52:25,136 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-27 21:52:25,136 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-27 21:52:25,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-27 21:52:25,234 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2021-12-27 21:52:25,234 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-27 21:52:25,234 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [634469277] [2021-12-27 21:52:25,234 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [634469277] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-27 21:52:25,234 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-27 21:52:25,234 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-27 21:52:25,234 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1676683804] [2021-12-27 21:52:25,235 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-27 21:52:25,235 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-27 21:52:25,236 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-27 21:52:25,236 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-27 21:52:25,236 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-27 21:52:25,236 INFO L87 Difference]: Start difference. First operand 130 states and 162 transitions. Second operand has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 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-12-27 21:52:25,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-27 21:52:25,413 INFO L93 Difference]: Finished difference Result 491 states and 613 transitions. [2021-12-27 21:52:25,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-27 21:52:25,414 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 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 65 [2021-12-27 21:52:25,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-27 21:52:25,415 INFO L225 Difference]: With dead ends: 491 [2021-12-27 21:52:25,415 INFO L226 Difference]: Without dead ends: 380 [2021-12-27 21:52:25,415 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-12-27 21:52:25,415 INFO L933 BasicCegarLoop]: 77 mSDtfsCounter, 135 mSDsluCounter, 123 mSDsCounter, 0 mSdLazyCounter, 188 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 135 SdHoareTripleChecker+Valid, 200 SdHoareTripleChecker+Invalid, 191 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 188 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-27 21:52:25,416 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [135 Valid, 200 Invalid, 191 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 188 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-27 21:52:25,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 380 states. [2021-12-27 21:52:25,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 380 to 130. [2021-12-27 21:52:25,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 129 states have (on average 1.255813953488372) internal successors, (162), 129 states have internal predecessors, (162), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-27 21:52:25,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 162 transitions. [2021-12-27 21:52:25,420 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 162 transitions. Word has length 65 [2021-12-27 21:52:25,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-27 21:52:25,421 INFO L470 AbstractCegarLoop]: Abstraction has 130 states and 162 transitions. [2021-12-27 21:52:25,421 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 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-12-27 21:52:25,421 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 162 transitions. [2021-12-27 21:52:25,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2021-12-27 21:52:25,421 INFO L506 BasicCegarLoop]: Found error trace [2021-12-27 21:52:25,421 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-27 21:52:25,421 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-12-27 21:52:25,421 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-27 21:52:25,422 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-27 21:52:25,422 INFO L85 PathProgramCache]: Analyzing trace with hash -865911640, now seen corresponding path program 1 times [2021-12-27 21:52:25,422 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-27 21:52:25,423 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [504454436] [2021-12-27 21:52:25,423 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-27 21:52:25,423 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-27 21:52:25,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-27 21:52:25,470 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2021-12-27 21:52:25,470 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-27 21:52:25,470 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [504454436] [2021-12-27 21:52:25,470 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [504454436] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-27 21:52:25,470 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-27 21:52:25,470 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-27 21:52:25,471 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1344023504] [2021-12-27 21:52:25,471 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-27 21:52:25,471 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-27 21:52:25,471 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-27 21:52:25,471 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-27 21:52:25,471 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-12-27 21:52:25,472 INFO L87 Difference]: Start difference. First operand 130 states and 162 transitions. Second operand has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 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-12-27 21:52:25,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-27 21:52:25,538 INFO L93 Difference]: Finished difference Result 386 states and 482 transitions. [2021-12-27 21:52:25,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-27 21:52:25,538 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 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 66 [2021-12-27 21:52:25,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-27 21:52:25,539 INFO L225 Difference]: With dead ends: 386 [2021-12-27 21:52:25,539 INFO L226 Difference]: Without dead ends: 275 [2021-12-27 21:52:25,540 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2021-12-27 21:52:25,540 INFO L933 BasicCegarLoop]: 55 mSDtfsCounter, 110 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 145 SdHoareTripleChecker+Invalid, 89 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-27 21:52:25,540 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [110 Valid, 145 Invalid, 89 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-27 21:52:25,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states. [2021-12-27 21:52:25,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 202. [2021-12-27 21:52:25,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 202 states, 201 states have (on average 1.263681592039801) internal successors, (254), 201 states have internal predecessors, (254), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-27 21:52:25,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 254 transitions. [2021-12-27 21:52:25,546 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 254 transitions. Word has length 66 [2021-12-27 21:52:25,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-27 21:52:25,547 INFO L470 AbstractCegarLoop]: Abstraction has 202 states and 254 transitions. [2021-12-27 21:52:25,547 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 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-12-27 21:52:25,547 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 254 transitions. [2021-12-27 21:52:25,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2021-12-27 21:52:25,548 INFO L506 BasicCegarLoop]: Found error trace [2021-12-27 21:52:25,548 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-27 21:52:25,548 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-12-27 21:52:25,548 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-27 21:52:25,548 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-27 21:52:25,548 INFO L85 PathProgramCache]: Analyzing trace with hash 511658858, now seen corresponding path program 1 times [2021-12-27 21:52:25,549 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-27 21:52:25,549 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1617365026] [2021-12-27 21:52:25,549 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-27 21:52:25,549 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-27 21:52:25,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-27 21:52:25,614 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2021-12-27 21:52:25,614 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-27 21:52:25,614 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1617365026] [2021-12-27 21:52:25,614 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1617365026] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-27 21:52:25,614 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-27 21:52:25,615 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-27 21:52:25,615 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1119614353] [2021-12-27 21:52:25,615 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-27 21:52:25,615 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-27 21:52:25,615 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-27 21:52:25,616 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-27 21:52:25,616 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-27 21:52:25,616 INFO L87 Difference]: Start difference. First operand 202 states and 254 transitions. Second operand has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 6 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-12-27 21:52:25,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-27 21:52:25,871 INFO L93 Difference]: Finished difference Result 995 states and 1247 transitions. [2021-12-27 21:52:25,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-12-27 21:52:25,871 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 6 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 66 [2021-12-27 21:52:25,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-27 21:52:25,874 INFO L225 Difference]: With dead ends: 995 [2021-12-27 21:52:25,874 INFO L226 Difference]: Without dead ends: 812 [2021-12-27 21:52:25,874 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2021-12-27 21:52:25,874 INFO L933 BasicCegarLoop]: 96 mSDtfsCounter, 203 mSDsluCounter, 239 mSDsCounter, 0 mSdLazyCounter, 317 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 203 SdHoareTripleChecker+Valid, 335 SdHoareTripleChecker+Invalid, 322 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 317 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-27 21:52:25,875 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [203 Valid, 335 Invalid, 322 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 317 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-27 21:52:25,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 812 states. [2021-12-27 21:52:25,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 812 to 202. [2021-12-27 21:52:25,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 202 states, 201 states have (on average 1.263681592039801) internal successors, (254), 201 states have internal predecessors, (254), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-27 21:52:25,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 254 transitions. [2021-12-27 21:52:25,891 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 254 transitions. Word has length 66 [2021-12-27 21:52:25,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-27 21:52:25,891 INFO L470 AbstractCegarLoop]: Abstraction has 202 states and 254 transitions. [2021-12-27 21:52:25,891 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 6 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-12-27 21:52:25,891 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 254 transitions. [2021-12-27 21:52:25,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2021-12-27 21:52:25,892 INFO L506 BasicCegarLoop]: Found error trace [2021-12-27 21:52:25,892 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-27 21:52:25,892 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-12-27 21:52:25,892 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-27 21:52:25,893 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-27 21:52:25,893 INFO L85 PathProgramCache]: Analyzing trace with hash 309834924, now seen corresponding path program 1 times [2021-12-27 21:52:25,893 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-27 21:52:25,893 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [91137914] [2021-12-27 21:52:25,893 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-27 21:52:25,893 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-27 21:52:25,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-27 21:52:25,968 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2021-12-27 21:52:25,968 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-27 21:52:25,968 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [91137914] [2021-12-27 21:52:25,968 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [91137914] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-27 21:52:25,968 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-27 21:52:25,968 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-27 21:52:25,969 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1964032745] [2021-12-27 21:52:25,969 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-27 21:52:25,969 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-27 21:52:25,969 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-27 21:52:25,969 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-27 21:52:25,969 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-12-27 21:52:25,970 INFO L87 Difference]: Start difference. First operand 202 states and 254 transitions. Second operand has 7 states, 7 states have (on average 5.857142857142857) internal successors, (41), 7 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-12-27 21:52:26,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-27 21:52:26,297 INFO L93 Difference]: Finished difference Result 1014 states and 1267 transitions. [2021-12-27 21:52:26,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-27 21:52:26,297 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.857142857142857) internal successors, (41), 7 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 66 [2021-12-27 21:52:26,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-27 21:52:26,299 INFO L225 Difference]: With dead ends: 1014 [2021-12-27 21:52:26,299 INFO L226 Difference]: Without dead ends: 831 [2021-12-27 21:52:26,300 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2021-12-27 21:52:26,300 INFO L933 BasicCegarLoop]: 91 mSDtfsCounter, 271 mSDsluCounter, 298 mSDsCounter, 0 mSdLazyCounter, 440 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 271 SdHoareTripleChecker+Valid, 389 SdHoareTripleChecker+Invalid, 447 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 440 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-27 21:52:26,300 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [271 Valid, 389 Invalid, 447 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 440 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-27 21:52:26,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 831 states. [2021-12-27 21:52:26,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 831 to 198. [2021-12-27 21:52:26,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 198 states, 197 states have (on average 1.2690355329949239) internal successors, (250), 197 states have internal predecessors, (250), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-27 21:52:26,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 250 transitions. [2021-12-27 21:52:26,310 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 250 transitions. Word has length 66 [2021-12-27 21:52:26,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-27 21:52:26,310 INFO L470 AbstractCegarLoop]: Abstraction has 198 states and 250 transitions. [2021-12-27 21:52:26,310 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.857142857142857) internal successors, (41), 7 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-12-27 21:52:26,310 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 250 transitions. [2021-12-27 21:52:26,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2021-12-27 21:52:26,311 INFO L506 BasicCegarLoop]: Found error trace [2021-12-27 21:52:26,311 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 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-12-27 21:52:26,311 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-12-27 21:52:26,311 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-27 21:52:26,311 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-27 21:52:26,312 INFO L85 PathProgramCache]: Analyzing trace with hash -1499003605, now seen corresponding path program 1 times [2021-12-27 21:52:26,312 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-27 21:52:26,312 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [370353758] [2021-12-27 21:52:26,312 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-27 21:52:26,312 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-27 21:52:26,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-27 21:52:26,411 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 51 proven. 3 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2021-12-27 21:52:26,411 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-27 21:52:26,411 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [370353758] [2021-12-27 21:52:26,412 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [370353758] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-27 21:52:26,412 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [100663798] [2021-12-27 21:52:26,412 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-27 21:52:26,412 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-27 21:52:26,412 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-27 21:52:26,413 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-12-27 21:52:26,414 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-12-27 21:52:26,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-27 21:52:26,492 INFO L263 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 6 conjunts are in the unsatisfiable core [2021-12-27 21:52:26,493 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-27 21:52:26,629 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 48 proven. 4 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2021-12-27 21:52:26,629 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-27 21:52:26,797 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 52 proven. 3 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2021-12-27 21:52:26,797 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [100663798] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-27 21:52:26,797 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-27 21:52:26,797 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 6] total 12 [2021-12-27 21:52:26,798 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [962253880] [2021-12-27 21:52:26,798 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-27 21:52:26,798 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-12-27 21:52:26,798 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-27 21:52:26,798 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-12-27 21:52:26,798 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=77, Unknown=0, NotChecked=0, Total=132 [2021-12-27 21:52:26,799 INFO L87 Difference]: Start difference. First operand 198 states and 250 transitions. Second operand has 12 states, 12 states have (on average 8.916666666666666) internal successors, (107), 12 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-27 21:52:27,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-27 21:52:27,042 INFO L93 Difference]: Finished difference Result 936 states and 1184 transitions. [2021-12-27 21:52:27,043 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-12-27 21:52:27,043 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 8.916666666666666) internal successors, (107), 12 states have internal predecessors, (107), 0 states have call successors, (0), 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 68 [2021-12-27 21:52:27,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-27 21:52:27,045 INFO L225 Difference]: With dead ends: 936 [2021-12-27 21:52:27,045 INFO L226 Difference]: Without dead ends: 753 [2021-12-27 21:52:27,045 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 131 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=76, Invalid=106, Unknown=0, NotChecked=0, Total=182 [2021-12-27 21:52:27,046 INFO L933 BasicCegarLoop]: 33 mSDtfsCounter, 389 mSDsluCounter, 116 mSDsCounter, 0 mSdLazyCounter, 322 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 389 SdHoareTripleChecker+Valid, 149 SdHoareTripleChecker+Invalid, 367 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 322 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-27 21:52:27,046 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [389 Valid, 149 Invalid, 367 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 322 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-27 21:52:27,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 753 states. [2021-12-27 21:52:27,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 753 to 600. [2021-12-27 21:52:27,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 600 states, 599 states have (on average 1.2771285475792988) internal successors, (765), 599 states have internal predecessors, (765), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-27 21:52:27,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 600 states to 600 states and 765 transitions. [2021-12-27 21:52:27,072 INFO L78 Accepts]: Start accepts. Automaton has 600 states and 765 transitions. Word has length 68 [2021-12-27 21:52:27,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-27 21:52:27,073 INFO L470 AbstractCegarLoop]: Abstraction has 600 states and 765 transitions. [2021-12-27 21:52:27,073 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 8.916666666666666) internal successors, (107), 12 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-27 21:52:27,073 INFO L276 IsEmpty]: Start isEmpty. Operand 600 states and 765 transitions. [2021-12-27 21:52:27,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2021-12-27 21:52:27,074 INFO L506 BasicCegarLoop]: Found error trace [2021-12-27 21:52:27,074 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 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-12-27 21:52:27,099 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-12-27 21:52:27,291 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,SelfDestructingSolverStorable14 [2021-12-27 21:52:27,292 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-27 21:52:27,292 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-27 21:52:27,292 INFO L85 PathProgramCache]: Analyzing trace with hash 1439601588, now seen corresponding path program 1 times [2021-12-27 21:52:27,292 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-27 21:52:27,292 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1101516894] [2021-12-27 21:52:27,293 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-27 21:52:27,293 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-27 21:52:27,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-27 21:52:27,390 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 48 proven. 7 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2021-12-27 21:52:27,390 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-27 21:52:27,390 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1101516894] [2021-12-27 21:52:27,390 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1101516894] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-27 21:52:27,390 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1235910583] [2021-12-27 21:52:27,391 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-27 21:52:27,391 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-27 21:52:27,392 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-27 21:52:27,392 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-12-27 21:52:27,394 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-12-27 21:52:27,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-27 21:52:27,553 INFO L263 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 19 conjunts are in the unsatisfiable core [2021-12-27 21:52:27,554 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-27 21:52:27,705 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 57 proven. 6 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2021-12-27 21:52:27,705 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-27 21:52:27,881 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 47 proven. 21 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2021-12-27 21:52:27,881 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1235910583] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-27 21:52:27,881 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-27 21:52:27,881 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6, 6] total 16 [2021-12-27 21:52:27,881 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1778617832] [2021-12-27 21:52:27,881 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-27 21:52:27,881 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2021-12-27 21:52:27,881 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-27 21:52:27,882 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-12-27 21:52:27,882 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=197, Unknown=0, NotChecked=0, Total=240 [2021-12-27 21:52:27,882 INFO L87 Difference]: Start difference. First operand 600 states and 765 transitions. Second operand has 16 states, 16 states have (on average 8.5) internal successors, (136), 16 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-27 21:52:30,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-27 21:52:30,510 INFO L93 Difference]: Finished difference Result 1944 states and 2423 transitions. [2021-12-27 21:52:30,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2021-12-27 21:52:30,511 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 8.5) internal successors, (136), 16 states have internal predecessors, (136), 0 states have call successors, (0), 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 70 [2021-12-27 21:52:30,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-27 21:52:30,514 INFO L225 Difference]: With dead ends: 1944 [2021-12-27 21:52:30,514 INFO L226 Difference]: Without dead ends: 1353 [2021-12-27 21:52:30,517 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 227 GetRequests, 130 SyntacticMatches, 4 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2912 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1437, Invalid=7493, Unknown=0, NotChecked=0, Total=8930 [2021-12-27 21:52:30,517 INFO L933 BasicCegarLoop]: 125 mSDtfsCounter, 923 mSDsluCounter, 709 mSDsCounter, 0 mSdLazyCounter, 2405 mSolverCounterSat, 209 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 923 SdHoareTripleChecker+Valid, 834 SdHoareTripleChecker+Invalid, 2614 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 209 IncrementalHoareTripleChecker+Valid, 2405 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2021-12-27 21:52:30,517 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [923 Valid, 834 Invalid, 2614 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [209 Valid, 2405 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2021-12-27 21:52:30,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1353 states. [2021-12-27 21:52:30,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1353 to 691. [2021-12-27 21:52:30,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 691 states, 690 states have (on average 1.271014492753623) internal successors, (877), 690 states have internal predecessors, (877), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-27 21:52:30,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 691 states to 691 states and 877 transitions. [2021-12-27 21:52:30,546 INFO L78 Accepts]: Start accepts. Automaton has 691 states and 877 transitions. Word has length 70 [2021-12-27 21:52:30,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-27 21:52:30,547 INFO L470 AbstractCegarLoop]: Abstraction has 691 states and 877 transitions. [2021-12-27 21:52:30,547 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 8.5) internal successors, (136), 16 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-27 21:52:30,547 INFO L276 IsEmpty]: Start isEmpty. Operand 691 states and 877 transitions. [2021-12-27 21:52:30,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2021-12-27 21:52:30,548 INFO L506 BasicCegarLoop]: Found error trace [2021-12-27 21:52:30,548 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 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] [2021-12-27 21:52:30,565 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2021-12-27 21:52:30,764 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,SelfDestructingSolverStorable15 [2021-12-27 21:52:30,764 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-27 21:52:30,765 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-27 21:52:30,765 INFO L85 PathProgramCache]: Analyzing trace with hash 1634543096, now seen corresponding path program 1 times [2021-12-27 21:52:30,765 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-27 21:52:30,765 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [876684418] [2021-12-27 21:52:30,765 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-27 21:52:30,765 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-27 21:52:30,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-27 21:52:30,844 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 53 proven. 4 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2021-12-27 21:52:30,844 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-27 21:52:30,844 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [876684418] [2021-12-27 21:52:30,845 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [876684418] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-27 21:52:30,845 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1692088157] [2021-12-27 21:52:30,845 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-27 21:52:30,845 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-27 21:52:30,845 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-27 21:52:30,846 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-12-27 21:52:30,847 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-12-27 21:52:31,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-27 21:52:31,010 INFO L263 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 22 conjunts are in the unsatisfiable core [2021-12-27 21:52:31,012 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-27 21:52:31,113 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 53 proven. 4 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2021-12-27 21:52:31,114 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-27 21:52:31,291 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 47 proven. 29 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-12-27 21:52:31,292 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1692088157] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-27 21:52:31,292 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-27 21:52:31,292 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 9] total 17 [2021-12-27 21:52:31,292 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [59867022] [2021-12-27 21:52:31,292 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-27 21:52:31,292 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2021-12-27 21:52:31,292 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-27 21:52:31,292 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-12-27 21:52:31,292 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=214, Unknown=0, NotChecked=0, Total=272 [2021-12-27 21:52:31,293 INFO L87 Difference]: Start difference. First operand 691 states and 877 transitions. Second operand has 17 states, 17 states have (on average 7.882352941176471) internal successors, (134), 17 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-27 21:52:31,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-27 21:52:31,538 INFO L93 Difference]: Finished difference Result 1341 states and 1673 transitions. [2021-12-27 21:52:31,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-27 21:52:31,538 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 7.882352941176471) internal successors, (134), 17 states have internal predecessors, (134), 0 states have call successors, (0), 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 70 [2021-12-27 21:52:31,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-27 21:52:31,541 INFO L225 Difference]: With dead ends: 1341 [2021-12-27 21:52:31,541 INFO L226 Difference]: Without dead ends: 1043 [2021-12-27 21:52:31,542 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 129 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 102 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=121, Invalid=385, Unknown=0, NotChecked=0, Total=506 [2021-12-27 21:52:31,542 INFO L933 BasicCegarLoop]: 84 mSDtfsCounter, 279 mSDsluCounter, 391 mSDsCounter, 0 mSdLazyCounter, 268 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 279 SdHoareTripleChecker+Valid, 475 SdHoareTripleChecker+Invalid, 292 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 268 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-27 21:52:31,543 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [279 Valid, 475 Invalid, 292 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 268 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-27 21:52:31,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1043 states. [2021-12-27 21:52:31,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1043 to 678. [2021-12-27 21:52:31,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 678 states, 677 states have (on average 1.2732644017725259) internal successors, (862), 677 states have internal predecessors, (862), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-27 21:52:31,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 678 states to 678 states and 862 transitions. [2021-12-27 21:52:31,570 INFO L78 Accepts]: Start accepts. Automaton has 678 states and 862 transitions. Word has length 70 [2021-12-27 21:52:31,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-27 21:52:31,571 INFO L470 AbstractCegarLoop]: Abstraction has 678 states and 862 transitions. [2021-12-27 21:52:31,571 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 7.882352941176471) internal successors, (134), 17 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-27 21:52:31,571 INFO L276 IsEmpty]: Start isEmpty. Operand 678 states and 862 transitions. [2021-12-27 21:52:31,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2021-12-27 21:52:31,572 INFO L506 BasicCegarLoop]: Found error trace [2021-12-27 21:52:31,572 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 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-12-27 21:52:31,581 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-12-27 21:52:31,776 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-27 21:52:31,776 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-27 21:52:31,777 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-27 21:52:31,777 INFO L85 PathProgramCache]: Analyzing trace with hash 605183798, now seen corresponding path program 2 times [2021-12-27 21:52:31,777 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-27 21:52:31,777 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1856692896] [2021-12-27 21:52:31,777 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-27 21:52:31,777 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-27 21:52:31,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-27 21:52:31,806 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-27 21:52:31,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-27 21:52:31,845 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-27 21:52:31,845 INFO L628 BasicCegarLoop]: Counterexample is feasible [2021-12-27 21:52:31,846 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2021-12-27 21:52:31,848 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-12-27 21:52:31,850 INFO L732 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-27 21:52:31,851 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-12-27 21:52:31,922 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 09:52:31 BoogieIcfgContainer [2021-12-27 21:52:31,922 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-12-27 21:52:31,923 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-12-27 21:52:31,923 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-12-27 21:52:31,923 INFO L275 PluginConnector]: Witness Printer initialized [2021-12-27 21:52:31,923 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 09:52:21" (3/4) ... [2021-12-27 21:52:31,925 INFO L140 WitnessPrinter]: No result that supports witness generation found [2021-12-27 21:52:31,925 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-12-27 21:52:31,926 INFO L158 Benchmark]: Toolchain (without parser) took 11051.45ms. Allocated memory was 60.8MB in the beginning and 121.6MB in the end (delta: 60.8MB). Free memory was 39.1MB in the beginning and 60.7MB in the end (delta: -21.7MB). Peak memory consumption was 38.8MB. Max. memory is 16.1GB. [2021-12-27 21:52:31,926 INFO L158 Benchmark]: CDTParser took 0.32ms. Allocated memory is still 60.8MB. Free memory is still 41.4MB. There was no memory consumed. Max. memory is 16.1GB. [2021-12-27 21:52:31,926 INFO L158 Benchmark]: CACSL2BoogieTranslator took 260.63ms. Allocated memory is still 60.8MB. Free memory was 38.8MB in the beginning and 41.8MB in the end (delta: -3.0MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2021-12-27 21:52:31,927 INFO L158 Benchmark]: Boogie Procedure Inliner took 38.72ms. Allocated memory is still 60.8MB. Free memory was 41.6MB in the beginning and 39.9MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-27 21:52:31,927 INFO L158 Benchmark]: Boogie Preprocessor took 35.24ms. Allocated memory is still 60.8MB. Free memory was 39.9MB in the beginning and 38.5MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-27 21:52:31,927 INFO L158 Benchmark]: RCFGBuilder took 306.16ms. Allocated memory is still 60.8MB. Free memory was 38.5MB in the beginning and 40.8MB in the end (delta: -2.3MB). Peak memory consumption was 14.5MB. Max. memory is 16.1GB. [2021-12-27 21:52:31,927 INFO L158 Benchmark]: TraceAbstraction took 10402.44ms. Allocated memory was 60.8MB in the beginning and 121.6MB in the end (delta: 60.8MB). Free memory was 40.3MB in the beginning and 60.7MB in the end (delta: -20.4MB). Peak memory consumption was 42.4MB. Max. memory is 16.1GB. [2021-12-27 21:52:31,927 INFO L158 Benchmark]: Witness Printer took 2.62ms. Allocated memory is still 121.6MB. Free memory is still 60.7MB. There was no memory consumed. Max. memory is 16.1GB. [2021-12-27 21:52:31,932 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.32ms. Allocated memory is still 60.8MB. Free memory is still 41.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 260.63ms. Allocated memory is still 60.8MB. Free memory was 38.8MB in the beginning and 41.8MB in the end (delta: -3.0MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 38.72ms. Allocated memory is still 60.8MB. Free memory was 41.6MB in the beginning and 39.9MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 35.24ms. Allocated memory is still 60.8MB. Free memory was 39.9MB in the beginning and 38.5MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 306.16ms. Allocated memory is still 60.8MB. Free memory was 38.5MB in the beginning and 40.8MB in the end (delta: -2.3MB). Peak memory consumption was 14.5MB. Max. memory is 16.1GB. * TraceAbstraction took 10402.44ms. Allocated memory was 60.8MB in the beginning and 121.6MB in the end (delta: 60.8MB). Free memory was 40.3MB in the beginning and 60.7MB in the end (delta: -20.4MB). Peak memory consumption was 42.4MB. Max. memory is 16.1GB. * Witness Printer took 2.62ms. Allocated memory is still 121.6MB. Free memory is still 60.7MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 25]: 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 116, overapproximation of bitwiseAnd at line 96. Possible FailurePath: [L124] unsigned int a, b, r; [L126] b = __VERIFIER_nondet_uint() [L128] a = 234770789 [L130] CALL, EXPR mp_add(a, b) [L42] unsigned char a0, a1, a2, a3; [L43] unsigned char b0, b1, b2, b3; [L44] unsigned char r0, r1, r2, r3; [L45] unsigned short carry; [L46] unsigned short partial_sum; [L47] unsigned int r; [L48] unsigned char i; [L49] unsigned char na, nb; [L50] a0 = a [L51] a1 = a >> 8 [L52] a2 = a >> 16U [L53] a3 = a >> 24U [L54] b0 = b [L55] b1 = b >> 8U [L56] b2 = b >> 16U [L57] b3 = b >> 24U [L58] na = (unsigned char)4 VAL [\old(a)=234770789, \old(b)=255, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=255, b0=-4294967041, b1=-16777216, b2=-65536, b3=-256, na=4] [L59] COND FALSE !(a3 == (unsigned char)0) VAL [\old(a)=234770789, \old(b)=255, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=255, b0=-4294967041, b1=-16777216, b2=-65536, b3=-256, na=4] [L68] nb = (unsigned char)4 VAL [\old(a)=234770789, \old(b)=255, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=255, b0=-4294967041, b1=-16777216, b2=-65536, b3=-256, na=4, nb=4] [L69] COND TRUE b3 == (unsigned char)0 [L70] nb = nb - 1 VAL [\old(a)=234770789, \old(b)=255, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=255, b0=-4294967041, b1=-16777216, b2=-65536, b3=-256, na=4, nb=3] [L71] COND TRUE b2 == (unsigned char)0 [L72] nb = nb - 1 VAL [\old(a)=234770789, \old(b)=255, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=255, b0=-4294967041, b1=-16777216, b2=-65536, b3=-256, na=4, nb=2] [L73] COND TRUE b1 == (unsigned char)0 [L74] nb = nb - 1 VAL [\old(a)=234770789, \old(b)=255, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=255, b0=-4294967041, b1=-16777216, b2=-65536, b3=-256, na=4, nb=1] [L78] carry = (unsigned short)0 [L79] i = (unsigned char)0 VAL [\old(a)=234770789, \old(b)=255, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=255, b0=-4294967041, b1=-16777216, b2=-65536, b3=-256, carry=0, i=0, na=4, nb=1] [L80] COND TRUE (i < na) || (i < nb) || (carry != (unsigned short)0) [L81] partial_sum = carry [L82] carry = (unsigned short)0 VAL [\old(a)=234770789, \old(b)=255, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=255, b0=-4294967041, b1=-16777216, b2=-65536, b3=-256, carry=0, i=0, na=4, nb=1, partial_sum=0] [L83] COND TRUE i < na VAL [\old(a)=234770789, \old(b)=255, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=255, b0=-4294967041, b1=-16777216, b2=-65536, b3=-256, carry=0, i=0, na=4, nb=1, partial_sum=0] [L84] COND TRUE i == (unsigned char)0 [L84] partial_sum = partial_sum + a0 VAL [\old(a)=234770789, \old(b)=255, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=255, b0=-4294967041, b1=-16777216, b2=-65536, b3=-256, carry=0, i=0, na=4, nb=1, partial_sum=101] [L85] COND FALSE !(i == (unsigned char)1) VAL [\old(a)=234770789, \old(b)=255, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=255, b0=-4294967041, b1=-16777216, b2=-65536, b3=-256, carry=0, i=0, na=4, nb=1, partial_sum=101] [L86] COND FALSE !(i == (unsigned char)2) VAL [\old(a)=234770789, \old(b)=255, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=255, b0=-4294967041, b1=-16777216, b2=-65536, b3=-256, carry=0, i=0, na=4, nb=1, partial_sum=101] [L87] COND FALSE !(i == (unsigned char)3) VAL [\old(a)=234770789, \old(b)=255, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=255, b0=-4294967041, b1=-16777216, b2=-65536, b3=-256, carry=0, i=0, na=4, nb=1, partial_sum=101] [L89] COND TRUE i < nb VAL [\old(a)=234770789, \old(b)=255, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=255, b0=-4294967041, b1=-16777216, b2=-65536, b3=-256, carry=0, i=0, na=4, nb=1, partial_sum=101] [L90] COND TRUE i == (unsigned char)0 [L90] partial_sum = partial_sum + b0 VAL [\old(a)=234770789, \old(b)=255, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=255, b0=-4294967041, b1=-16777216, b2=-65536, b3=-256, carry=0, i=0, na=4, nb=1, partial_sum=356] [L91] COND FALSE !(i == (unsigned char)1) VAL [\old(a)=234770789, \old(b)=255, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=255, b0=-4294967041, b1=-16777216, b2=-65536, b3=-256, carry=0, i=0, na=4, nb=1, partial_sum=356] [L92] COND FALSE !(i == (unsigned char)2) VAL [\old(a)=234770789, \old(b)=255, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=255, b0=-4294967041, b1=-16777216, b2=-65536, b3=-256, carry=0, i=0, na=4, nb=1, partial_sum=356] [L93] COND FALSE !(i == (unsigned char)3) VAL [\old(a)=234770789, \old(b)=255, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=255, b0=-4294967041, b1=-16777216, b2=-65536, b3=-256, carry=0, i=0, na=4, nb=1, partial_sum=356] [L95] COND TRUE partial_sum > ((unsigned char)255) [L96] partial_sum = partial_sum & ((unsigned char)255) [L97] carry = (unsigned short)1 VAL [\old(a)=234770789, \old(b)=255, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=255, b0=-4294967041, b1=-16777216, b2=-65536, b3=-256, carry=1, i=0, na=4, nb=1] [L99] COND TRUE i == (unsigned char)0 [L99] r0 = (unsigned char)partial_sum VAL [\old(a)=234770789, \old(b)=255, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=255, b0=-4294967041, b1=-16777216, b2=-65536, b3=-256, carry=1, i=0, na=4, nb=1, partial_sum=20838, r0=234770790] [L100] COND FALSE !(i == (unsigned char)1) VAL [\old(a)=234770789, \old(b)=255, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=255, b0=-4294967041, b1=-16777216, b2=-65536, b3=-256, carry=1, i=0, na=4, nb=1, partial_sum=20838, r0=234770790] [L101] COND FALSE !(i == (unsigned char)2) VAL [\old(a)=234770789, \old(b)=255, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=255, b0=-4294967041, b1=-16777216, b2=-65536, b3=-256, carry=1, i=0, na=4, nb=1, partial_sum=20838, r0=234770790] [L102] COND FALSE !(i == (unsigned char)3) VAL [\old(a)=234770789, \old(b)=255, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=255, b0=-4294967041, b1=-16777216, b2=-65536, b3=-256, carry=1, i=0, na=4, nb=1, partial_sum=20838, r0=234770790] [L104] i = i + (unsigned char)1 VAL [\old(a)=234770789, \old(b)=255, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=255, b0=-4294967041, b1=-16777216, b2=-65536, b3=-256, carry=1, i=1, na=4, nb=1, partial_sum=20838, r0=234770790] [L80] COND TRUE (i < na) || (i < nb) || (carry != (unsigned short)0) [L81] partial_sum = carry [L82] carry = (unsigned short)0 VAL [\old(a)=234770789, \old(b)=255, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=255, b0=-4294967041, b1=-16777216, b2=-65536, b3=-256, carry=0, i=1, na=4, nb=1, partial_sum=1, r0=234770790] [L83] COND TRUE i < na VAL [\old(a)=234770789, \old(b)=255, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=255, b0=-4294967041, b1=-16777216, b2=-65536, b3=-256, carry=0, i=1, na=4, nb=1, partial_sum=1, r0=234770790] [L84] COND FALSE !(i == (unsigned char)0) VAL [\old(a)=234770789, \old(b)=255, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=255, b0=-4294967041, b1=-16777216, b2=-65536, b3=-256, carry=0, i=1, na=4, nb=1, partial_sum=1, r0=234770790] [L85] COND TRUE i == (unsigned char)1 [L85] partial_sum = partial_sum + a1 VAL [\old(a)=234770789, \old(b)=255, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=255, b0=-4294967041, b1=-16777216, b2=-65536, b3=-256, carry=0, i=1, na=4, nb=1, partial_sum=82, r0=234770790] [L86] COND FALSE !(i == (unsigned char)2) VAL [\old(a)=234770789, \old(b)=255, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=255, b0=-4294967041, b1=-16777216, b2=-65536, b3=-256, carry=0, i=1, na=4, nb=1, partial_sum=82, r0=234770790] [L87] COND FALSE !(i == (unsigned char)3) VAL [\old(a)=234770789, \old(b)=255, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=255, b0=-4294967041, b1=-16777216, b2=-65536, b3=-256, carry=0, i=1, na=4, nb=1, partial_sum=82, r0=234770790] [L89] COND FALSE !(i < nb) VAL [\old(a)=234770789, \old(b)=255, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=255, b0=-4294967041, b1=-16777216, b2=-65536, b3=-256, carry=0, i=1, na=4, nb=1, partial_sum=82, r0=234770790] [L95] COND FALSE !(partial_sum > ((unsigned char)255)) VAL [\old(a)=234770789, \old(b)=255, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=255, b0=-4294967041, b1=-16777216, b2=-65536, b3=-256, carry=0, i=1, na=4, nb=1, partial_sum=82, r0=234770790] [L99] COND FALSE !(i == (unsigned char)0) VAL [\old(a)=234770789, \old(b)=255, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=255, b0=-4294967041, b1=-16777216, b2=-65536, b3=-256, carry=0, i=1, na=4, nb=1, partial_sum=82, r0=234770790] [L100] COND TRUE i == (unsigned char)1 [L100] r1 = (unsigned char)partial_sum VAL [\old(a)=234770789, \old(b)=255, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=255, b0=-4294967041, b1=-16777216, b2=-65536, b3=-256, carry=0, i=1, na=4, nb=1, partial_sum=82, r0=234770790, r1=82] [L101] COND FALSE !(i == (unsigned char)2) VAL [\old(a)=234770789, \old(b)=255, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=255, b0=-4294967041, b1=-16777216, b2=-65536, b3=-256, carry=0, i=1, na=4, nb=1, partial_sum=82, r0=234770790, r1=82] [L102] COND FALSE !(i == (unsigned char)3) VAL [\old(a)=234770789, \old(b)=255, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=255, b0=-4294967041, b1=-16777216, b2=-65536, b3=-256, carry=0, i=1, na=4, nb=1, partial_sum=82, r0=234770790, r1=82] [L104] i = i + (unsigned char)1 VAL [\old(a)=234770789, \old(b)=255, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=255, b0=-4294967041, b1=-16777216, b2=-65536, b3=-256, carry=0, i=2, na=4, nb=1, partial_sum=82, r0=234770790, r1=82] [L80] COND TRUE (i < na) || (i < nb) || (carry != (unsigned short)0) [L81] partial_sum = carry [L82] carry = (unsigned short)0 VAL [\old(a)=234770789, \old(b)=255, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=255, b0=-4294967041, b1=-16777216, b2=-65536, b3=-256, carry=0, i=2, na=4, nb=1, partial_sum=0, r0=234770790, r1=82] [L83] COND TRUE i < na VAL [\old(a)=234770789, \old(b)=255, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=255, b0=-4294967041, b1=-16777216, b2=-65536, b3=-256, carry=0, i=2, na=4, nb=1, partial_sum=0, r0=234770790, r1=82] [L84] COND FALSE !(i == (unsigned char)0) VAL [\old(a)=234770789, \old(b)=255, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=255, b0=-4294967041, b1=-16777216, b2=-65536, b3=-256, carry=0, i=2, na=4, nb=1, partial_sum=0, r0=234770790, r1=82] [L85] COND FALSE !(i == (unsigned char)1) VAL [\old(a)=234770789, \old(b)=255, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=255, b0=-4294967041, b1=-16777216, b2=-65536, b3=-256, carry=0, i=2, na=4, nb=1, partial_sum=0, r0=234770790, r1=82] [L86] COND TRUE i == (unsigned char)2 [L86] partial_sum = partial_sum + a2 VAL [\old(a)=234770789, \old(b)=255, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=255, b0=-4294967041, b1=-16777216, b2=-65536, b3=-256, carry=0, i=2, na=4, nb=1, partial_sum=254, r0=234770790, r1=82] [L87] COND FALSE !(i == (unsigned char)3) VAL [\old(a)=234770789, \old(b)=255, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=255, b0=-4294967041, b1=-16777216, b2=-65536, b3=-256, carry=0, i=2, na=4, nb=1, partial_sum=254, r0=234770790, r1=82] [L89] COND FALSE !(i < nb) VAL [\old(a)=234770789, \old(b)=255, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=255, b0=-4294967041, b1=-16777216, b2=-65536, b3=-256, carry=0, i=2, na=4, nb=1, partial_sum=254, r0=234770790, r1=82] [L95] COND FALSE !(partial_sum > ((unsigned char)255)) VAL [\old(a)=234770789, \old(b)=255, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=255, b0=-4294967041, b1=-16777216, b2=-65536, b3=-256, carry=0, i=2, na=4, nb=1, partial_sum=254, r0=234770790, r1=82] [L99] COND FALSE !(i == (unsigned char)0) VAL [\old(a)=234770789, \old(b)=255, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=255, b0=-4294967041, b1=-16777216, b2=-65536, b3=-256, carry=0, i=2, na=4, nb=1, partial_sum=254, r0=234770790, r1=82] [L100] COND FALSE !(i == (unsigned char)1) VAL [\old(a)=234770789, \old(b)=255, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=255, b0=-4294967041, b1=-16777216, b2=-65536, b3=-256, carry=0, i=2, na=4, nb=1, partial_sum=254, r0=234770790, r1=82] [L101] COND TRUE i == (unsigned char)2 [L101] r2 = (unsigned char)partial_sum VAL [\old(a)=234770789, \old(b)=255, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=255, b0=-4294967041, b1=-16777216, b2=-65536, b3=-256, carry=0, i=2, na=4, nb=1, partial_sum=254, r0=234770790, r1=82, r2=254] [L102] COND FALSE !(i == (unsigned char)3) VAL [\old(a)=234770789, \old(b)=255, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=255, b0=-4294967041, b1=-16777216, b2=-65536, b3=-256, carry=0, i=2, na=4, nb=1, partial_sum=254, r0=234770790, r1=82, r2=254] [L104] i = i + (unsigned char)1 VAL [\old(a)=234770789, \old(b)=255, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=255, b0=-4294967041, b1=-16777216, b2=-65536, b3=-256, carry=0, i=3, na=4, nb=1, partial_sum=254, r0=234770790, r1=82, r2=254] [L80] COND TRUE (i < na) || (i < nb) || (carry != (unsigned short)0) [L81] partial_sum = carry [L82] carry = (unsigned short)0 VAL [\old(a)=234770789, \old(b)=255, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=255, b0=-4294967041, b1=-16777216, b2=-65536, b3=-256, carry=0, i=3, na=4, nb=1, partial_sum=0, r0=234770790, r1=82, r2=254] [L83] COND TRUE i < na VAL [\old(a)=234770789, \old(b)=255, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=255, b0=-4294967041, b1=-16777216, b2=-65536, b3=-256, carry=0, i=3, na=4, nb=1, partial_sum=0, r0=234770790, r1=82, r2=254] [L84] COND FALSE !(i == (unsigned char)0) VAL [\old(a)=234770789, \old(b)=255, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=255, b0=-4294967041, b1=-16777216, b2=-65536, b3=-256, carry=0, i=3, na=4, nb=1, partial_sum=0, r0=234770790, r1=82, r2=254] [L85] COND FALSE !(i == (unsigned char)1) VAL [\old(a)=234770789, \old(b)=255, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=255, b0=-4294967041, b1=-16777216, b2=-65536, b3=-256, carry=0, i=3, na=4, nb=1, partial_sum=0, r0=234770790, r1=82, r2=254] [L86] COND FALSE !(i == (unsigned char)2) VAL [\old(a)=234770789, \old(b)=255, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=255, b0=-4294967041, b1=-16777216, b2=-65536, b3=-256, carry=0, i=3, na=4, nb=1, partial_sum=0, r0=234770790, r1=82, r2=254] [L87] COND TRUE i == (unsigned char)3 [L87] partial_sum = partial_sum + a3 VAL [\old(a)=234770789, \old(b)=255, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=255, b0=-4294967041, b1=-16777216, b2=-65536, b3=-256, carry=0, i=3, na=4, nb=1, partial_sum=13, r0=234770790, r1=82, r2=254] [L89] COND FALSE !(i < nb) VAL [\old(a)=234770789, \old(b)=255, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=255, b0=-4294967041, b1=-16777216, b2=-65536, b3=-256, carry=0, i=3, na=4, nb=1, partial_sum=13, r0=234770790, r1=82, r2=254] [L95] COND FALSE !(partial_sum > ((unsigned char)255)) VAL [\old(a)=234770789, \old(b)=255, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=255, b0=-4294967041, b1=-16777216, b2=-65536, b3=-256, carry=0, i=3, na=4, nb=1, partial_sum=13, r0=234770790, r1=82, r2=254] [L99] COND FALSE !(i == (unsigned char)0) VAL [\old(a)=234770789, \old(b)=255, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=255, b0=-4294967041, b1=-16777216, b2=-65536, b3=-256, carry=0, i=3, na=4, nb=1, partial_sum=13, r0=234770790, r1=82, r2=254] [L100] COND FALSE !(i == (unsigned char)1) VAL [\old(a)=234770789, \old(b)=255, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=255, b0=-4294967041, b1=-16777216, b2=-65536, b3=-256, carry=0, i=3, na=4, nb=1, partial_sum=13, r0=234770790, r1=82, r2=254] [L101] COND FALSE !(i == (unsigned char)2) VAL [\old(a)=234770789, \old(b)=255, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=255, b0=-4294967041, b1=-16777216, b2=-65536, b3=-256, carry=0, i=3, na=4, nb=1, partial_sum=13, r0=234770790, r1=82, r2=254] [L102] COND TRUE i == (unsigned char)3 [L102] r3 = (unsigned char)partial_sum VAL [\old(a)=234770789, \old(b)=255, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=255, b0=-4294967041, b1=-16777216, b2=-65536, b3=-256, carry=0, i=3, na=4, nb=1, partial_sum=13, r0=234770790, r1=82, r2=254, r3=13] [L104] i = i + (unsigned char)1 VAL [\old(a)=234770789, \old(b)=255, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=255, b0=-4294967041, b1=-16777216, b2=-65536, b3=-256, carry=0, i=4, na=4, nb=1, partial_sum=13, r0=234770790, r1=82, r2=254, r3=13] [L80] COND FALSE !((i < na) || (i < nb) || (carry != (unsigned short)0)) VAL [\old(a)=234770789, \old(b)=255, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=255, b0=-4294967041, b1=-16777216, b2=-65536, b3=-256, carry=0, i=4, na=4, nb=1, partial_sum=13, r0=234770790, r1=82, r2=254, r3=13] [L107] COND FALSE !(i < (unsigned char)4) VAL [\old(a)=234770789, \old(b)=255, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=255, b0=-4294967041, b1=-16777216, b2=-65536, b3=-256, carry=0, i=4, na=4, nb=1, partial_sum=13, r0=234770790, r1=82, r2=254, r3=13] [L116] r = r0 | (r1 << 8U) | (r2 << 16U) | ((unsigned int)r3 << 24U) [L118] return r; VAL [\old(a)=234770789, \old(b)=255, \result=3, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=255, b0=-4294967041, b1=-16777216, b2=-65536, b3=-256, carry=0, i=4, na=4, nb=1, partial_sum=13, r=3, r0=234770790, r1=82, r2=254, r3=13] [L130] RET, EXPR mp_add(a, b) [L130] r = mp_add(a, b) [L132] CALL __VERIFIER_assert(r == a + b) [L24] COND TRUE !(cond) VAL [\old(cond)=0, cond=0] [L25] reach_error() VAL [\old(cond)=0, cond=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 42 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 10.3s, OverallIterations: 18, TraceHistogramMax: 4, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 5.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2743 SdHoareTripleChecker+Valid, 3.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2743 mSDsluCounter, 3432 SdHoareTripleChecker+Invalid, 2.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2320 mSDsCounter, 439 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4862 IncrementalHoareTripleChecker+Invalid, 5301 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 439 mSolverCounterUnsat, 1112 mSDtfsCounter, 4862 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 755 GetRequests, 560 SyntacticMatches, 12 SemanticMatches, 183 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3078 ImplicationChecksByTransitivity, 1.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=691occurred in iteration=16, InterpolantAutomatonStates: 169, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 17 MinimizatonAttempts, 2933 StatesRemovedByMinimization, 14 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 2.3s InterpolantComputationTime, 1136 NumberOfCodeBlocks, 1136 NumberOfCodeBlocksAsserted, 25 NumberOfCheckSat, 1247 ConstructedInterpolants, 0 QuantifiedInterpolants, 5395 SizeOfPredicates, 21 NumberOfNonLiveVariables, 1027 ConjunctsInSsa, 67 ConjunctsInUnsatCore, 27 InterpolantComputations, 14 PerfectInterpolantSequences, 1053/1138 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2021-12-27 21:52:31,948 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/bitvector/byte_add_1-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 0ba3e3db8f44a5e9ad151b8422bee8deebac1dcf47a42cba5485daeafd8d8e80 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-ae00767 [2021-12-27 21:52:33,447 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-27 21:52:33,448 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-27 21:52:33,474 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-27 21:52:33,475 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-27 21:52:33,477 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-27 21:52:33,479 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-27 21:52:33,482 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-27 21:52:33,484 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-27 21:52:33,487 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-27 21:52:33,487 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-27 21:52:33,499 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-27 21:52:33,499 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-27 21:52:33,501 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-27 21:52:33,502 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-27 21:52:33,505 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-27 21:52:33,505 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-27 21:52:33,506 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-27 21:52:33,508 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-27 21:52:33,513 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-27 21:52:33,514 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-27 21:52:33,514 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-27 21:52:33,516 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-27 21:52:33,516 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-27 21:52:33,521 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-27 21:52:33,521 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-27 21:52:33,521 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-27 21:52:33,522 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-27 21:52:33,522 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-27 21:52:33,523 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-27 21:52:33,523 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-27 21:52:33,524 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-27 21:52:33,525 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-27 21:52:33,525 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-27 21:52:33,526 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-27 21:52:33,526 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-27 21:52:33,527 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-27 21:52:33,527 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-27 21:52:33,527 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-27 21:52:33,528 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-27 21:52:33,528 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-27 21:52:33,531 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2021-12-27 21:52:33,561 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-27 21:52:33,562 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-27 21:52:33,562 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-27 21:52:33,562 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-27 21:52:33,563 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-27 21:52:33,563 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-27 21:52:33,564 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-27 21:52:33,564 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-27 21:52:33,564 INFO L138 SettingsManager]: * Use SBE=true [2021-12-27 21:52:33,564 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-27 21:52:33,565 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-27 21:52:33,565 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-27 21:52:33,565 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-27 21:52:33,565 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-12-27 21:52:33,565 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-27 21:52:33,565 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-12-27 21:52:33,565 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-12-27 21:52:33,565 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2021-12-27 21:52:33,566 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2021-12-27 21:52:33,566 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-27 21:52:33,566 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-12-27 21:52:33,566 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-27 21:52:33,566 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-12-27 21:52:33,566 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-27 21:52:33,566 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-27 21:52:33,566 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-27 21:52:33,566 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-27 21:52:33,566 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-27 21:52:33,566 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-27 21:52:33,567 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-12-27 21:52:33,567 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2021-12-27 21:52:33,567 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2021-12-27 21:52:33,567 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-12-27 21:52:33,567 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-12-27 21:52:33,567 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-12-27 21:52:33,567 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-12-27 21:52:33,567 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 -> 0ba3e3db8f44a5e9ad151b8422bee8deebac1dcf47a42cba5485daeafd8d8e80 [2021-12-27 21:52:33,818 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-27 21:52:33,838 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-27 21:52:33,839 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-27 21:52:33,840 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-27 21:52:33,840 INFO L275 PluginConnector]: CDTParser initialized [2021-12-27 21:52:33,841 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/bitvector/byte_add_1-1.i [2021-12-27 21:52:33,878 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9a28b888d/eaecda1073754e57afcf47d3d31b82b4/FLAGe1bc1ba4a [2021-12-27 21:52:34,243 INFO L306 CDTParser]: Found 1 translation units. [2021-12-27 21:52:34,243 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/byte_add_1-1.i [2021-12-27 21:52:34,250 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9a28b888d/eaecda1073754e57afcf47d3d31b82b4/FLAGe1bc1ba4a [2021-12-27 21:52:34,261 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9a28b888d/eaecda1073754e57afcf47d3d31b82b4 [2021-12-27 21:52:34,263 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-27 21:52:34,264 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-27 21:52:34,266 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-27 21:52:34,266 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-27 21:52:34,269 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-27 21:52:34,269 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 09:52:34" (1/1) ... [2021-12-27 21:52:34,270 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6a7943a2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:52:34, skipping insertion in model container [2021-12-27 21:52:34,270 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 09:52:34" (1/1) ... [2021-12-27 21:52:34,274 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-27 21:52:34,296 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-27 21:52:34,415 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/byte_add_1-1.i[1168,1181] [2021-12-27 21:52:34,463 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-27 21:52:34,472 INFO L203 MainTranslator]: Completed pre-run [2021-12-27 21:52:34,489 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/byte_add_1-1.i[1168,1181] [2021-12-27 21:52:34,523 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-27 21:52:34,539 INFO L208 MainTranslator]: Completed translation [2021-12-27 21:52:34,540 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:52:34 WrapperNode [2021-12-27 21:52:34,540 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-27 21:52:34,541 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-27 21:52:34,541 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-27 21:52:34,541 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-27 21:52:34,545 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:52:34" (1/1) ... [2021-12-27 21:52:34,557 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:52:34" (1/1) ... [2021-12-27 21:52:34,578 INFO L137 Inliner]: procedures = 16, calls = 8, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 123 [2021-12-27 21:52:34,579 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-27 21:52:34,580 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-27 21:52:34,580 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-27 21:52:34,580 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-27 21:52:34,586 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:52:34" (1/1) ... [2021-12-27 21:52:34,586 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:52:34" (1/1) ... [2021-12-27 21:52:34,589 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:52:34" (1/1) ... [2021-12-27 21:52:34,589 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:52:34" (1/1) ... [2021-12-27 21:52:34,597 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:52:34" (1/1) ... [2021-12-27 21:52:34,608 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:52:34" (1/1) ... [2021-12-27 21:52:34,609 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:52:34" (1/1) ... [2021-12-27 21:52:34,611 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-27 21:52:34,611 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-27 21:52:34,611 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-27 21:52:34,611 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-27 21:52:34,612 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:52:34" (1/1) ... [2021-12-27 21:52:34,621 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-27 21:52:34,628 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-27 21:52:34,637 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-12-27 21:52:34,655 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-12-27 21:52:34,662 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-27 21:52:34,662 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2021-12-27 21:52:34,662 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-27 21:52:34,662 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-27 21:52:34,715 INFO L234 CfgBuilder]: Building ICFG [2021-12-27 21:52:34,716 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-27 21:52:34,950 INFO L275 CfgBuilder]: Performing block encoding [2021-12-27 21:52:34,964 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-27 21:52:34,964 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2021-12-27 21:52:34,965 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 09:52:34 BoogieIcfgContainer [2021-12-27 21:52:34,965 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-27 21:52:34,966 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-12-27 21:52:34,966 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-12-27 21:52:34,968 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-12-27 21:52:34,968 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 09:52:34" (1/3) ... [2021-12-27 21:52:34,968 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2f478ad1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 09:52:34, skipping insertion in model container [2021-12-27 21:52:34,969 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:52:34" (2/3) ... [2021-12-27 21:52:34,969 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2f478ad1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 09:52:34, skipping insertion in model container [2021-12-27 21:52:34,969 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 09:52:34" (3/3) ... [2021-12-27 21:52:34,969 INFO L111 eAbstractionObserver]: Analyzing ICFG byte_add_1-1.i [2021-12-27 21:52:34,973 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-12-27 21:52:34,973 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-12-27 21:52:35,013 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-12-27 21:52:35,020 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2021-12-27 21:52:35,021 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-12-27 21:52:35,032 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-12-27 21:52:35,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2021-12-27 21:52:35,035 INFO L506 BasicCegarLoop]: Found error trace [2021-12-27 21:52:35,036 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-27 21:52:35,037 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-27 21:52:35,040 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-27 21:52:35,040 INFO L85 PathProgramCache]: Analyzing trace with hash 255061167, now seen corresponding path program 1 times [2021-12-27 21:52:35,047 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-27 21:52:35,047 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [561468696] [2021-12-27 21:52:35,047 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-27 21:52:35,048 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-27 21:52:35,048 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-27 21:52:35,050 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-27 21:52:35,050 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2021-12-27 21:52:35,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-27 21:52:35,095 INFO L263 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 1 conjunts are in the unsatisfiable core [2021-12-27 21:52:35,102 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-27 21:52:35,130 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-27 21:52:35,131 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-27 21:52:35,131 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-27 21:52:35,131 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [561468696] [2021-12-27 21:52:35,131 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [561468696] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-27 21:52:35,131 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-27 21:52:35,132 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-27 21:52:35,132 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [87533839] [2021-12-27 21:52:35,133 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-27 21:52:35,135 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2021-12-27 21:52:35,135 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-27 21:52:35,149 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-12-27 21:52:35,150 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-12-27 21:52:35,151 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-12-27 21:52:35,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-27 21:52:35,161 INFO L93 Difference]: Finished difference Result 57 states and 92 transitions. [2021-12-27 21:52:35,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-12-27 21:52:35,162 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-12-27 21:52:35,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-27 21:52:35,166 INFO L225 Difference]: With dead ends: 57 [2021-12-27 21:52:35,166 INFO L226 Difference]: Without dead ends: 38 [2021-12-27 21:52:35,168 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-12-27 21:52:35,170 INFO L933 BasicCegarLoop]: 68 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-27 21:52:35,171 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-27 21:52:35,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2021-12-27 21:52:35,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2021-12-27 21:52:35,193 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-12-27 21:52:35,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 64 transitions. [2021-12-27 21:52:35,195 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 64 transitions. Word has length 12 [2021-12-27 21:52:35,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-27 21:52:35,196 INFO L470 AbstractCegarLoop]: Abstraction has 38 states and 64 transitions. [2021-12-27 21:52:35,196 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-12-27 21:52:35,196 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 64 transitions. [2021-12-27 21:52:35,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2021-12-27 21:52:35,197 INFO L506 BasicCegarLoop]: Found error trace [2021-12-27 21:52:35,197 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-27 21:52:35,205 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Ended with exit code 0 [2021-12-27 21:52:35,403 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-27 21:52:35,403 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-27 21:52:35,403 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-27 21:52:35,404 INFO L85 PathProgramCache]: Analyzing trace with hash 1803477009, now seen corresponding path program 1 times [2021-12-27 21:52:35,404 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-27 21:52:35,404 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1771126132] [2021-12-27 21:52:35,404 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-27 21:52:35,405 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-27 21:52:35,405 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-27 21:52:35,406 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-27 21:52:35,406 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2021-12-27 21:52:35,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-27 21:52:35,448 INFO L263 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 3 conjunts are in the unsatisfiable core [2021-12-27 21:52:35,449 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-27 21:52:35,489 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-27 21:52:35,489 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-27 21:52:35,489 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-27 21:52:35,489 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1771126132] [2021-12-27 21:52:35,490 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1771126132] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-27 21:52:35,490 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-27 21:52:35,490 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-27 21:52:35,490 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [164459721] [2021-12-27 21:52:35,490 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-27 21:52:35,491 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-27 21:52:35,491 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-27 21:52:35,491 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-27 21:52:35,492 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-12-27 21:52:35,492 INFO L87 Difference]: Start difference. First operand 38 states and 64 transitions. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 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-12-27 21:52:35,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-27 21:52:35,648 INFO L93 Difference]: Finished difference Result 116 states and 201 transitions. [2021-12-27 21:52:35,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-27 21:52:35,648 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 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-12-27 21:52:35,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-27 21:52:35,649 INFO L225 Difference]: With dead ends: 116 [2021-12-27 21:52:35,649 INFO L226 Difference]: Without dead ends: 88 [2021-12-27 21:52:35,650 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-12-27 21:52:35,651 INFO L933 BasicCegarLoop]: 76 mSDtfsCounter, 66 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 118 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 152 SdHoareTripleChecker+Invalid, 140 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 118 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-27 21:52:35,651 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [66 Valid, 152 Invalid, 140 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 118 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-27 21:52:35,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2021-12-27 21:52:35,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 81. [2021-12-27 21:52:35,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 80 states have (on average 1.625) internal successors, (130), 80 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-27 21:52:35,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 130 transitions. [2021-12-27 21:52:35,657 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 130 transitions. Word has length 12 [2021-12-27 21:52:35,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-27 21:52:35,658 INFO L470 AbstractCegarLoop]: Abstraction has 81 states and 130 transitions. [2021-12-27 21:52:35,658 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 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-12-27 21:52:35,658 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 130 transitions. [2021-12-27 21:52:35,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2021-12-27 21:52:35,658 INFO L506 BasicCegarLoop]: Found error trace [2021-12-27 21:52:35,658 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-27 21:52:35,668 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2021-12-27 21:52:35,868 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-27 21:52:35,868 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-27 21:52:35,869 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-27 21:52:35,869 INFO L85 PathProgramCache]: Analyzing trace with hash -1087802014, now seen corresponding path program 1 times [2021-12-27 21:52:35,870 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-27 21:52:35,870 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [511366557] [2021-12-27 21:52:35,870 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-27 21:52:35,870 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-27 21:52:35,870 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-27 21:52:35,872 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-27 21:52:35,873 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2021-12-27 21:52:35,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-27 21:52:35,903 INFO L263 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 4 conjunts are in the unsatisfiable core [2021-12-27 21:52:35,904 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-27 21:52:35,967 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-27 21:52:35,967 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-27 21:52:35,967 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-27 21:52:35,967 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [511366557] [2021-12-27 21:52:35,968 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [511366557] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-27 21:52:35,968 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-27 21:52:35,968 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-27 21:52:35,968 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1127968577] [2021-12-27 21:52:35,968 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-27 21:52:35,968 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-27 21:52:35,968 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-27 21:52:35,969 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-27 21:52:35,969 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-12-27 21:52:35,969 INFO L87 Difference]: Start difference. First operand 81 states and 130 transitions. Second operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-27 21:52:36,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-27 21:52:36,083 INFO L93 Difference]: Finished difference Result 164 states and 271 transitions. [2021-12-27 21:52:36,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-27 21:52:36,085 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 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 13 [2021-12-27 21:52:36,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-27 21:52:36,086 INFO L225 Difference]: With dead ends: 164 [2021-12-27 21:52:36,086 INFO L226 Difference]: Without dead ends: 136 [2021-12-27 21:52:36,086 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-12-27 21:52:36,087 INFO L933 BasicCegarLoop]: 120 mSDtfsCounter, 141 mSDsluCounter, 164 mSDsCounter, 0 mSdLazyCounter, 107 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 141 SdHoareTripleChecker+Valid, 284 SdHoareTripleChecker+Invalid, 129 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 107 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-27 21:52:36,087 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [141 Valid, 284 Invalid, 129 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 107 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-27 21:52:36,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2021-12-27 21:52:36,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 81. [2021-12-27 21:52:36,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 80 states have (on average 1.625) internal successors, (130), 80 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-27 21:52:36,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 130 transitions. [2021-12-27 21:52:36,093 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 130 transitions. Word has length 13 [2021-12-27 21:52:36,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-27 21:52:36,094 INFO L470 AbstractCegarLoop]: Abstraction has 81 states and 130 transitions. [2021-12-27 21:52:36,094 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-27 21:52:36,094 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 130 transitions. [2021-12-27 21:52:36,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2021-12-27 21:52:36,094 INFO L506 BasicCegarLoop]: Found error trace [2021-12-27 21:52:36,094 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-27 21:52:36,104 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2021-12-27 21:52:36,300 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-27 21:52:36,301 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-27 21:52:36,301 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-27 21:52:36,301 INFO L85 PathProgramCache]: Analyzing trace with hash 583572890, now seen corresponding path program 1 times [2021-12-27 21:52:36,301 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-27 21:52:36,301 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1699943168] [2021-12-27 21:52:36,301 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-27 21:52:36,302 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-27 21:52:36,302 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-27 21:52:36,302 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-27 21:52:36,304 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2021-12-27 21:52:36,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-27 21:52:36,326 INFO L263 TraceCheckSpWp]: Trace formula consists of 46 conjuncts, 5 conjunts are in the unsatisfiable core [2021-12-27 21:52:36,327 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-27 21:52:36,385 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-27 21:52:36,385 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-27 21:52:36,385 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-27 21:52:36,385 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1699943168] [2021-12-27 21:52:36,392 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1699943168] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-27 21:52:36,392 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-27 21:52:36,392 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-27 21:52:36,392 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [74119999] [2021-12-27 21:52:36,393 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-27 21:52:36,393 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-27 21:52:36,393 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-27 21:52:36,393 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-27 21:52:36,394 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-12-27 21:52:36,394 INFO L87 Difference]: Start difference. First operand 81 states and 130 transitions. Second operand has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-27 21:52:36,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-27 21:52:36,629 INFO L93 Difference]: Finished difference Result 212 states and 341 transitions. [2021-12-27 21:52:36,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-27 21:52:36,629 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 0 states have call successors, (0), 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-12-27 21:52:36,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-27 21:52:36,631 INFO L225 Difference]: With dead ends: 212 [2021-12-27 21:52:36,631 INFO L226 Difference]: Without dead ends: 184 [2021-12-27 21:52:36,631 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-12-27 21:52:36,632 INFO L933 BasicCegarLoop]: 164 mSDtfsCounter, 166 mSDsluCounter, 395 mSDsCounter, 0 mSdLazyCounter, 273 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 166 SdHoareTripleChecker+Valid, 559 SdHoareTripleChecker+Invalid, 295 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 273 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-27 21:52:36,632 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [166 Valid, 559 Invalid, 295 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 273 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-27 21:52:36,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2021-12-27 21:52:36,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 81. [2021-12-27 21:52:36,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 80 states have (on average 1.625) internal successors, (130), 80 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-27 21:52:36,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 130 transitions. [2021-12-27 21:52:36,649 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 130 transitions. Word has length 14 [2021-12-27 21:52:36,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-27 21:52:36,649 INFO L470 AbstractCegarLoop]: Abstraction has 81 states and 130 transitions. [2021-12-27 21:52:36,649 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-27 21:52:36,650 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 130 transitions. [2021-12-27 21:52:36,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2021-12-27 21:52:36,650 INFO L506 BasicCegarLoop]: Found error trace [2021-12-27 21:52:36,650 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-27 21:52:36,662 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2021-12-27 21:52:36,859 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-27 21:52:36,860 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-27 21:52:36,860 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-27 21:52:36,860 INFO L85 PathProgramCache]: Analyzing trace with hash 1392919516, now seen corresponding path program 1 times [2021-12-27 21:52:36,860 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-27 21:52:36,860 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [242486223] [2021-12-27 21:52:36,860 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-27 21:52:36,861 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-27 21:52:36,861 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-27 21:52:36,862 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-27 21:52:36,863 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2021-12-27 21:52:36,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-27 21:52:36,892 INFO L263 TraceCheckSpWp]: Trace formula consists of 47 conjuncts, 6 conjunts are in the unsatisfiable core [2021-12-27 21:52:36,893 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-27 21:52:36,943 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-27 21:52:36,943 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-27 21:52:36,943 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-27 21:52:36,943 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [242486223] [2021-12-27 21:52:36,943 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [242486223] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-27 21:52:36,943 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-27 21:52:36,943 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-27 21:52:36,943 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [333030295] [2021-12-27 21:52:36,944 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-27 21:52:36,944 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-27 21:52:36,944 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-27 21:52:36,944 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-27 21:52:36,944 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-12-27 21:52:36,944 INFO L87 Difference]: Start difference. First operand 81 states and 130 transitions. Second operand has 7 states, 7 states have (on average 2.0) internal successors, (14), 7 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-27 21:52:37,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-27 21:52:37,095 INFO L93 Difference]: Finished difference Result 227 states and 354 transitions. [2021-12-27 21:52:37,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-27 21:52:37,095 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.0) internal successors, (14), 7 states have internal predecessors, (14), 0 states have call successors, (0), 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-12-27 21:52:37,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-27 21:52:37,096 INFO L225 Difference]: With dead ends: 227 [2021-12-27 21:52:37,096 INFO L226 Difference]: Without dead ends: 199 [2021-12-27 21:52:37,097 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-12-27 21:52:37,097 INFO L933 BasicCegarLoop]: 169 mSDtfsCounter, 233 mSDsluCounter, 514 mSDsCounter, 0 mSdLazyCounter, 190 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 233 SdHoareTripleChecker+Valid, 683 SdHoareTripleChecker+Invalid, 212 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 190 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-27 21:52:37,097 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [233 Valid, 683 Invalid, 212 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 190 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-27 21:52:37,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2021-12-27 21:52:37,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 87. [2021-12-27 21:52:37,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 86 states have (on average 1.5) internal successors, (129), 86 states have internal predecessors, (129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-27 21:52:37,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 129 transitions. [2021-12-27 21:52:37,103 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 129 transitions. Word has length 14 [2021-12-27 21:52:37,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-27 21:52:37,103 INFO L470 AbstractCegarLoop]: Abstraction has 87 states and 129 transitions. [2021-12-27 21:52:37,103 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.0) internal successors, (14), 7 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-27 21:52:37,103 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 129 transitions. [2021-12-27 21:52:37,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-12-27 21:52:37,104 INFO L506 BasicCegarLoop]: Found error trace [2021-12-27 21:52:37,104 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-27 21:52:37,111 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2021-12-27 21:52:37,309 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-27 21:52:37,310 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-27 21:52:37,310 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-27 21:52:37,310 INFO L85 PathProgramCache]: Analyzing trace with hash 1480128500, now seen corresponding path program 1 times [2021-12-27 21:52:37,310 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-27 21:52:37,311 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1775310929] [2021-12-27 21:52:37,311 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-27 21:52:37,311 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-27 21:52:37,311 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-27 21:52:37,312 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-27 21:52:37,313 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2021-12-27 21:52:37,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-27 21:52:37,347 INFO L263 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 3 conjunts are in the unsatisfiable core [2021-12-27 21:52:37,348 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-27 21:52:37,418 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-27 21:52:37,419 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-27 21:52:37,419 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-27 21:52:37,419 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1775310929] [2021-12-27 21:52:37,419 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1775310929] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-27 21:52:37,419 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-27 21:52:37,419 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-27 21:52:37,420 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [769793809] [2021-12-27 21:52:37,420 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-27 21:52:37,420 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-27 21:52:37,420 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-27 21:52:37,420 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-27 21:52:37,421 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-12-27 21:52:37,421 INFO L87 Difference]: Start difference. First operand 87 states and 129 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-12-27 21:52:37,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-27 21:52:37,508 INFO L93 Difference]: Finished difference Result 243 states and 358 transitions. [2021-12-27 21:52:37,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-27 21:52:37,508 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 25 [2021-12-27 21:52:37,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-27 21:52:37,509 INFO L225 Difference]: With dead ends: 243 [2021-12-27 21:52:37,509 INFO L226 Difference]: Without dead ends: 173 [2021-12-27 21:52:37,509 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-12-27 21:52:37,510 INFO L933 BasicCegarLoop]: 83 mSDtfsCounter, 70 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 115 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 161 SdHoareTripleChecker+Invalid, 121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 115 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-27 21:52:37,510 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [70 Valid, 161 Invalid, 121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 115 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-27 21:52:37,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2021-12-27 21:52:37,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 97. [2021-12-27 21:52:37,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 96 states have (on average 1.4791666666666667) internal successors, (142), 96 states have internal predecessors, (142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-27 21:52:37,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 142 transitions. [2021-12-27 21:52:37,515 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 142 transitions. Word has length 25 [2021-12-27 21:52:37,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-27 21:52:37,515 INFO L470 AbstractCegarLoop]: Abstraction has 97 states and 142 transitions. [2021-12-27 21:52:37,515 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-12-27 21:52:37,515 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 142 transitions. [2021-12-27 21:52:37,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2021-12-27 21:52:37,516 INFO L506 BasicCegarLoop]: Found error trace [2021-12-27 21:52:37,516 INFO L514 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-12-27 21:52:37,525 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2021-12-27 21:52:37,716 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-27 21:52:37,717 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-27 21:52:37,717 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-27 21:52:37,717 INFO L85 PathProgramCache]: Analyzing trace with hash -1384042382, now seen corresponding path program 1 times [2021-12-27 21:52:37,717 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-27 21:52:37,717 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2024199844] [2021-12-27 21:52:37,717 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-27 21:52:37,717 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-27 21:52:37,717 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-27 21:52:37,718 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-27 21:52:37,719 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2021-12-27 21:52:37,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-27 21:52:37,745 INFO L263 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 5 conjunts are in the unsatisfiable core [2021-12-27 21:52:37,746 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-27 21:52:37,784 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-27 21:52:37,785 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-27 21:52:37,785 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-27 21:52:37,785 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2024199844] [2021-12-27 21:52:37,785 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2024199844] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-27 21:52:37,785 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-27 21:52:37,785 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-27 21:52:37,786 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1942846647] [2021-12-27 21:52:37,786 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-27 21:52:37,786 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-27 21:52:37,786 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-27 21:52:37,786 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-27 21:52:37,787 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-27 21:52:37,787 INFO L87 Difference]: Start difference. First operand 97 states and 142 transitions. Second operand has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 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-12-27 21:52:37,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-27 21:52:37,790 INFO L93 Difference]: Finished difference Result 169 states and 248 transitions. [2021-12-27 21:52:37,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-27 21:52:37,791 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 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 26 [2021-12-27 21:52:37,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-27 21:52:37,791 INFO L225 Difference]: With dead ends: 169 [2021-12-27 21:52:37,791 INFO L226 Difference]: Without dead ends: 85 [2021-12-27 21:52:37,792 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-27 21:52:37,792 INFO L933 BasicCegarLoop]: 57 mSDtfsCounter, 57 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-27 21:52:37,792 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [57 Valid, 58 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-27 21:52:37,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2021-12-27 21:52:37,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2021-12-27 21:52:37,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 84 states have (on average 1.4523809523809523) internal successors, (122), 84 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-27 21:52:37,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 122 transitions. [2021-12-27 21:52:37,796 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 122 transitions. Word has length 26 [2021-12-27 21:52:37,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-27 21:52:37,797 INFO L470 AbstractCegarLoop]: Abstraction has 85 states and 122 transitions. [2021-12-27 21:52:37,797 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 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-12-27 21:52:37,797 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 122 transitions. [2021-12-27 21:52:37,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-12-27 21:52:37,798 INFO L506 BasicCegarLoop]: Found error trace [2021-12-27 21:52:37,798 INFO L514 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] [2021-12-27 21:52:37,807 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2021-12-27 21:52:38,007 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-27 21:52:38,007 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-27 21:52:38,008 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-27 21:52:38,008 INFO L85 PathProgramCache]: Analyzing trace with hash 221982208, now seen corresponding path program 1 times [2021-12-27 21:52:38,008 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-27 21:52:38,008 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1663817492] [2021-12-27 21:52:38,008 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-27 21:52:38,008 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-27 21:52:38,009 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-27 21:52:38,009 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-27 21:52:38,012 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2021-12-27 21:52:38,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-27 21:52:38,035 INFO L263 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 4 conjunts are in the unsatisfiable core [2021-12-27 21:52:38,036 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-27 21:52:38,135 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-27 21:52:38,135 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-27 21:52:38,135 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-27 21:52:38,135 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1663817492] [2021-12-27 21:52:38,135 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1663817492] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-27 21:52:38,135 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-27 21:52:38,135 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-27 21:52:38,135 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1813126830] [2021-12-27 21:52:38,135 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-27 21:52:38,136 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-27 21:52:38,136 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-27 21:52:38,136 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-27 21:52:38,136 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-12-27 21:52:38,136 INFO L87 Difference]: Start difference. First operand 85 states and 122 transitions. Second operand has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-27 21:52:38,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-27 21:52:38,190 INFO L93 Difference]: Finished difference Result 150 states and 213 transitions. [2021-12-27 21:52:38,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-27 21:52:38,190 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 0 states have call successors, (0), 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 29 [2021-12-27 21:52:38,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-27 21:52:38,190 INFO L225 Difference]: With dead ends: 150 [2021-12-27 21:52:38,191 INFO L226 Difference]: Without dead ends: 136 [2021-12-27 21:52:38,191 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-12-27 21:52:38,191 INFO L933 BasicCegarLoop]: 52 mSDtfsCounter, 60 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 115 SdHoareTripleChecker+Invalid, 120 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 45 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-27 21:52:38,191 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [60 Valid, 115 Invalid, 120 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 69 Invalid, 0 Unknown, 45 Unchecked, 0.0s Time] [2021-12-27 21:52:38,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2021-12-27 21:52:38,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 121. [2021-12-27 21:52:38,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 120 states have (on average 1.4583333333333333) internal successors, (175), 120 states have internal predecessors, (175), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-27 21:52:38,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 175 transitions. [2021-12-27 21:52:38,196 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 175 transitions. Word has length 29 [2021-12-27 21:52:38,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-27 21:52:38,196 INFO L470 AbstractCegarLoop]: Abstraction has 121 states and 175 transitions. [2021-12-27 21:52:38,196 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-27 21:52:38,196 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 175 transitions. [2021-12-27 21:52:38,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2021-12-27 21:52:38,197 INFO L506 BasicCegarLoop]: Found error trace [2021-12-27 21:52:38,197 INFO L514 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] [2021-12-27 21:52:38,205 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2021-12-27 21:52:38,404 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-27 21:52:38,404 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-27 21:52:38,405 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-27 21:52:38,405 INFO L85 PathProgramCache]: Analyzing trace with hash 1570096335, now seen corresponding path program 1 times [2021-12-27 21:52:38,405 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-27 21:52:38,405 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [654949841] [2021-12-27 21:52:38,405 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-27 21:52:38,405 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-27 21:52:38,405 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-27 21:52:38,406 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-27 21:52:38,407 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2021-12-27 21:52:38,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-27 21:52:38,430 INFO L263 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 5 conjunts are in the unsatisfiable core [2021-12-27 21:52:38,431 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-27 21:52:38,521 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-27 21:52:38,522 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-27 21:52:38,522 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-27 21:52:38,522 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [654949841] [2021-12-27 21:52:38,522 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [654949841] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-27 21:52:38,522 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-27 21:52:38,522 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-27 21:52:38,523 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1714176728] [2021-12-27 21:52:38,523 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-27 21:52:38,523 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-27 21:52:38,523 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-27 21:52:38,523 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-27 21:52:38,524 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-12-27 21:52:38,524 INFO L87 Difference]: Start difference. First operand 121 states and 175 transitions. Second operand has 6 states, 6 states have (on average 5.0) internal successors, (30), 6 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-27 21:52:38,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-27 21:52:38,556 INFO L93 Difference]: Finished difference Result 210 states and 294 transitions. [2021-12-27 21:52:38,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-27 21:52:38,556 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.0) internal successors, (30), 6 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2021-12-27 21:52:38,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-27 21:52:38,557 INFO L225 Difference]: With dead ends: 210 [2021-12-27 21:52:38,557 INFO L226 Difference]: Without dead ends: 156 [2021-12-27 21:52:38,557 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 25 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-12-27 21:52:38,558 INFO L933 BasicCegarLoop]: 74 mSDtfsCounter, 84 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 181 SdHoareTripleChecker+Invalid, 111 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 54 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-27 21:52:38,558 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [84 Valid, 181 Invalid, 111 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 55 Invalid, 0 Unknown, 54 Unchecked, 0.0s Time] [2021-12-27 21:52:38,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2021-12-27 21:52:38,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 142. [2021-12-27 21:52:38,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 142 states, 141 states have (on average 1.4042553191489362) internal successors, (198), 141 states have internal predecessors, (198), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-27 21:52:38,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 198 transitions. [2021-12-27 21:52:38,563 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 198 transitions. Word has length 30 [2021-12-27 21:52:38,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-27 21:52:38,563 INFO L470 AbstractCegarLoop]: Abstraction has 142 states and 198 transitions. [2021-12-27 21:52:38,563 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.0) internal successors, (30), 6 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-27 21:52:38,563 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 198 transitions. [2021-12-27 21:52:38,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2021-12-27 21:52:38,564 INFO L506 BasicCegarLoop]: Found error trace [2021-12-27 21:52:38,564 INFO L514 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-12-27 21:52:38,584 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2021-12-27 21:52:38,770 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-27 21:52:38,770 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-27 21:52:38,770 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-27 21:52:38,770 INFO L85 PathProgramCache]: Analyzing trace with hash -1760226409, now seen corresponding path program 1 times [2021-12-27 21:52:38,770 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-27 21:52:38,771 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1455260841] [2021-12-27 21:52:38,771 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-27 21:52:38,771 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-27 21:52:38,771 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-27 21:52:38,771 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-27 21:52:38,774 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2021-12-27 21:52:38,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-27 21:52:38,796 INFO L263 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 6 conjunts are in the unsatisfiable core [2021-12-27 21:52:38,797 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-27 21:52:38,903 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-27 21:52:38,903 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-27 21:52:38,993 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-27 21:52:38,993 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-27 21:52:38,993 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1455260841] [2021-12-27 21:52:38,993 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1455260841] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-27 21:52:38,993 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-27 21:52:38,993 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2021-12-27 21:52:38,993 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1971913768] [2021-12-27 21:52:38,994 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-27 21:52:38,994 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-12-27 21:52:38,994 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-27 21:52:38,994 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-12-27 21:52:38,994 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2021-12-27 21:52:38,995 INFO L87 Difference]: Start difference. First operand 142 states and 198 transitions. Second operand has 12 states, 12 states have (on average 4.5) internal successors, (54), 12 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-27 21:52:39,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-27 21:52:39,491 INFO L93 Difference]: Finished difference Result 381 states and 580 transitions. [2021-12-27 21:52:39,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-12-27 21:52:39,491 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.5) internal successors, (54), 12 states have internal predecessors, (54), 0 states have call successors, (0), 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-12-27 21:52:39,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-27 21:52:39,492 INFO L225 Difference]: With dead ends: 381 [2021-12-27 21:52:39,492 INFO L226 Difference]: Without dead ends: 305 [2021-12-27 21:52:39,493 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=77, Invalid=229, Unknown=0, NotChecked=0, Total=306 [2021-12-27 21:52:39,493 INFO L933 BasicCegarLoop]: 71 mSDtfsCounter, 743 mSDsluCounter, 320 mSDsCounter, 0 mSdLazyCounter, 1034 mSolverCounterSat, 139 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 743 SdHoareTripleChecker+Valid, 391 SdHoareTripleChecker+Invalid, 1173 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 139 IncrementalHoareTripleChecker+Valid, 1034 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-12-27 21:52:39,493 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [743 Valid, 391 Invalid, 1173 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [139 Valid, 1034 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2021-12-27 21:52:39,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 305 states. [2021-12-27 21:52:39,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 305 to 273. [2021-12-27 21:52:39,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 273 states, 272 states have (on average 1.4485294117647058) internal successors, (394), 272 states have internal predecessors, (394), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-27 21:52:39,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 273 states to 273 states and 394 transitions. [2021-12-27 21:52:39,500 INFO L78 Accepts]: Start accepts. Automaton has 273 states and 394 transitions. Word has length 31 [2021-12-27 21:52:39,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-27 21:52:39,500 INFO L470 AbstractCegarLoop]: Abstraction has 273 states and 394 transitions. [2021-12-27 21:52:39,500 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.5) internal successors, (54), 12 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-27 21:52:39,500 INFO L276 IsEmpty]: Start isEmpty. Operand 273 states and 394 transitions. [2021-12-27 21:52:39,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2021-12-27 21:52:39,501 INFO L506 BasicCegarLoop]: Found error trace [2021-12-27 21:52:39,501 INFO L514 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-12-27 21:52:39,509 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2021-12-27 21:52:39,704 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-27 21:52:39,704 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-27 21:52:39,704 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-27 21:52:39,704 INFO L85 PathProgramCache]: Analyzing trace with hash -1900775019, now seen corresponding path program 1 times [2021-12-27 21:52:39,705 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-27 21:52:39,705 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1825488923] [2021-12-27 21:52:39,705 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-27 21:52:39,705 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-27 21:52:39,705 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-27 21:52:39,706 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-27 21:52:39,706 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2021-12-27 21:52:39,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-27 21:52:39,735 INFO L263 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 4 conjunts are in the unsatisfiable core [2021-12-27 21:52:39,735 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-27 21:52:39,822 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-27 21:52:39,823 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-27 21:52:39,883 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-27 21:52:39,883 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-27 21:52:39,883 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1825488923] [2021-12-27 21:52:39,883 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1825488923] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-27 21:52:39,883 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-27 21:52:39,884 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2021-12-27 21:52:39,884 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1882673344] [2021-12-27 21:52:39,884 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-27 21:52:39,884 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-27 21:52:39,884 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-27 21:52:39,884 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-27 21:52:39,885 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-12-27 21:52:39,885 INFO L87 Difference]: Start difference. First operand 273 states and 394 transitions. Second operand has 8 states, 8 states have (on average 7.0) internal successors, (56), 8 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-12-27 21:52:40,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-27 21:52:40,050 INFO L93 Difference]: Finished difference Result 732 states and 1124 transitions. [2021-12-27 21:52:40,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-27 21:52:40,050 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.0) internal successors, (56), 8 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-12-27 21:52:40,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-27 21:52:40,052 INFO L225 Difference]: With dead ends: 732 [2021-12-27 21:52:40,052 INFO L226 Difference]: Without dead ends: 498 [2021-12-27 21:52:40,052 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2021-12-27 21:52:40,053 INFO L933 BasicCegarLoop]: 21 mSDtfsCounter, 405 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 185 mSolverCounterSat, 92 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 405 SdHoareTripleChecker+Valid, 69 SdHoareTripleChecker+Invalid, 277 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 92 IncrementalHoareTripleChecker+Valid, 185 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-27 21:52:40,053 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [405 Valid, 69 Invalid, 277 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [92 Valid, 185 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-27 21:52:40,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 498 states. [2021-12-27 21:52:40,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 498 to 396. [2021-12-27 21:52:40,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 396 states, 395 states have (on average 1.440506329113924) internal successors, (569), 395 states have internal predecessors, (569), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-27 21:52:40,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 396 states to 396 states and 569 transitions. [2021-12-27 21:52:40,063 INFO L78 Accepts]: Start accepts. Automaton has 396 states and 569 transitions. Word has length 31 [2021-12-27 21:52:40,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-27 21:52:40,063 INFO L470 AbstractCegarLoop]: Abstraction has 396 states and 569 transitions. [2021-12-27 21:52:40,063 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.0) internal successors, (56), 8 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-12-27 21:52:40,063 INFO L276 IsEmpty]: Start isEmpty. Operand 396 states and 569 transitions. [2021-12-27 21:52:40,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2021-12-27 21:52:40,065 INFO L506 BasicCegarLoop]: Found error trace [2021-12-27 21:52:40,065 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 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-12-27 21:52:40,072 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (12)] Forceful destruction successful, exit code 0 [2021-12-27 21:52:40,270 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-27 21:52:40,271 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-27 21:52:40,271 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-27 21:52:40,271 INFO L85 PathProgramCache]: Analyzing trace with hash 1235829048, now seen corresponding path program 1 times [2021-12-27 21:52:40,271 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-27 21:52:40,271 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [880754908] [2021-12-27 21:52:40,272 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-27 21:52:40,272 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-27 21:52:40,272 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-27 21:52:40,272 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-27 21:52:40,275 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2021-12-27 21:52:40,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-27 21:52:40,308 INFO L263 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 8 conjunts are in the unsatisfiable core [2021-12-27 21:52:40,309 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-27 21:52:40,435 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 53 proven. 4 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2021-12-27 21:52:40,435 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-27 21:52:40,561 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 49 proven. 8 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2021-12-27 21:52:40,561 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-27 21:52:40,562 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [880754908] [2021-12-27 21:52:40,562 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [880754908] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-27 21:52:40,562 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-27 21:52:40,562 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2021-12-27 21:52:40,562 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [783053446] [2021-12-27 21:52:40,562 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-27 21:52:40,562 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-12-27 21:52:40,563 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-27 21:52:40,563 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-12-27 21:52:40,563 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2021-12-27 21:52:40,563 INFO L87 Difference]: Start difference. First operand 396 states and 569 transitions. Second operand has 10 states, 10 states have (on average 8.9) internal successors, (89), 10 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-12-27 21:52:40,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-27 21:52:40,759 INFO L93 Difference]: Finished difference Result 1331 states and 1910 transitions. [2021-12-27 21:52:40,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-27 21:52:40,760 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 8.9) internal successors, (89), 10 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) Word has length 70 [2021-12-27 21:52:40,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-27 21:52:40,762 INFO L225 Difference]: With dead ends: 1331 [2021-12-27 21:52:40,762 INFO L226 Difference]: Without dead ends: 958 [2021-12-27 21:52:40,763 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 130 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=89, Invalid=183, Unknown=0, NotChecked=0, Total=272 [2021-12-27 21:52:40,763 INFO L933 BasicCegarLoop]: 87 mSDtfsCounter, 280 mSDsluCounter, 313 mSDsCounter, 0 mSdLazyCounter, 183 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 280 SdHoareTripleChecker+Valid, 400 SdHoareTripleChecker+Invalid, 212 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 183 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-27 21:52:40,763 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [280 Valid, 400 Invalid, 212 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 183 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-27 21:52:40,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 958 states. [2021-12-27 21:52:40,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 958 to 599. [2021-12-27 21:52:40,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 599 states, 598 states have (on average 1.4866220735785953) internal successors, (889), 598 states have internal predecessors, (889), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-27 21:52:40,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 599 states to 599 states and 889 transitions. [2021-12-27 21:52:40,781 INFO L78 Accepts]: Start accepts. Automaton has 599 states and 889 transitions. Word has length 70 [2021-12-27 21:52:40,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-27 21:52:40,781 INFO L470 AbstractCegarLoop]: Abstraction has 599 states and 889 transitions. [2021-12-27 21:52:40,781 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.9) internal successors, (89), 10 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-12-27 21:52:40,781 INFO L276 IsEmpty]: Start isEmpty. Operand 599 states and 889 transitions. [2021-12-27 21:52:40,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2021-12-27 21:52:40,782 INFO L506 BasicCegarLoop]: Found error trace [2021-12-27 21:52:40,782 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 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] [2021-12-27 21:52:40,790 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (13)] Forceful destruction successful, exit code 0 [2021-12-27 21:52:40,988 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-27 21:52:40,988 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-27 21:52:40,988 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-27 21:52:40,988 INFO L85 PathProgramCache]: Analyzing trace with hash 464635188, now seen corresponding path program 1 times [2021-12-27 21:52:40,988 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-27 21:52:40,989 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [703169217] [2021-12-27 21:52:40,989 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-27 21:52:40,989 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-27 21:52:40,989 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-27 21:52:40,990 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-27 21:52:40,991 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2021-12-27 21:52:41,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-27 21:52:41,022 INFO L263 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 8 conjunts are in the unsatisfiable core [2021-12-27 21:52:41,024 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-27 21:52:41,154 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 65 proven. 10 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2021-12-27 21:52:41,154 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-27 21:52:41,274 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 68 proven. 7 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2021-12-27 21:52:41,275 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-27 21:52:41,275 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [703169217] [2021-12-27 21:52:41,275 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [703169217] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-27 21:52:41,275 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-27 21:52:41,275 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 9 [2021-12-27 21:52:41,276 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [629855401] [2021-12-27 21:52:41,276 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-27 21:52:41,276 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-12-27 21:52:41,276 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-27 21:52:41,276 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-12-27 21:52:41,277 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2021-12-27 21:52:41,277 INFO L87 Difference]: Start difference. First operand 599 states and 889 transitions. Second operand has 9 states, 9 states have (on average 12.444444444444445) internal successors, (112), 9 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-27 21:52:41,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-27 21:52:41,451 INFO L93 Difference]: Finished difference Result 1536 states and 2181 transitions. [2021-12-27 21:52:41,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-27 21:52:41,451 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 12.444444444444445) internal successors, (112), 9 states have internal predecessors, (112), 0 states have call successors, (0), 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 70 [2021-12-27 21:52:41,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-27 21:52:41,453 INFO L225 Difference]: With dead ends: 1536 [2021-12-27 21:52:41,454 INFO L226 Difference]: Without dead ends: 960 [2021-12-27 21:52:41,454 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 137 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=70, Invalid=140, Unknown=0, NotChecked=0, Total=210 [2021-12-27 21:52:41,455 INFO L933 BasicCegarLoop]: 102 mSDtfsCounter, 235 mSDsluCounter, 262 mSDsCounter, 0 mSdLazyCounter, 165 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 235 SdHoareTripleChecker+Valid, 364 SdHoareTripleChecker+Invalid, 203 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 165 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-27 21:52:41,455 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [235 Valid, 364 Invalid, 203 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 165 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-27 21:52:41,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 960 states. [2021-12-27 21:52:41,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 960 to 540. [2021-12-27 21:52:41,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 540 states, 539 states have (on average 1.4267161410018554) internal successors, (769), 539 states have internal predecessors, (769), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-27 21:52:41,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 540 states to 540 states and 769 transitions. [2021-12-27 21:52:41,487 INFO L78 Accepts]: Start accepts. Automaton has 540 states and 769 transitions. Word has length 70 [2021-12-27 21:52:41,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-27 21:52:41,487 INFO L470 AbstractCegarLoop]: Abstraction has 540 states and 769 transitions. [2021-12-27 21:52:41,487 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.444444444444445) internal successors, (112), 9 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-27 21:52:41,488 INFO L276 IsEmpty]: Start isEmpty. Operand 540 states and 769 transitions. [2021-12-27 21:52:41,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2021-12-27 21:52:41,488 INFO L506 BasicCegarLoop]: Found error trace [2021-12-27 21:52:41,488 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 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-12-27 21:52:41,496 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (14)] Forceful destruction successful, exit code 0 [2021-12-27 21:52:41,694 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-27 21:52:41,694 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-27 21:52:41,695 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-27 21:52:41,695 INFO L85 PathProgramCache]: Analyzing trace with hash 605183798, now seen corresponding path program 2 times [2021-12-27 21:52:41,695 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-27 21:52:41,695 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1274331263] [2021-12-27 21:52:41,695 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-27 21:52:41,695 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-27 21:52:41,695 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-27 21:52:41,696 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-27 21:52:41,696 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2021-12-27 21:52:41,736 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-12-27 21:52:41,736 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-27 21:52:41,738 INFO L263 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 41 conjunts are in the unsatisfiable core [2021-12-27 21:52:41,740 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-27 21:52:44,044 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 0 proven. 82 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-27 21:52:44,044 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-27 21:52:46,019 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 0 proven. 82 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-27 21:52:46,020 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-27 21:52:46,020 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1274331263] [2021-12-27 21:52:46,020 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1274331263] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-27 21:52:46,020 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-27 21:52:46,020 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23] total 44 [2021-12-27 21:52:46,020 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1471511154] [2021-12-27 21:52:46,020 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-27 21:52:46,021 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2021-12-27 21:52:46,021 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-27 21:52:46,021 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2021-12-27 21:52:46,022 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=142, Invalid=1750, Unknown=0, NotChecked=0, Total=1892 [2021-12-27 21:52:46,022 INFO L87 Difference]: Start difference. First operand 540 states and 769 transitions. Second operand has 44 states, 44 states have (on average 3.1363636363636362) internal successors, (138), 44 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-12-27 21:52:57,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-27 21:52:57,896 INFO L93 Difference]: Finished difference Result 1608 states and 2176 transitions. [2021-12-27 21:52:57,897 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2021-12-27 21:52:57,897 INFO L78 Accepts]: Start accepts. Automaton has has 44 states, 44 states have (on average 3.1363636363636362) internal successors, (138), 44 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) Word has length 70 [2021-12-27 21:52:57,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-27 21:52:57,906 INFO L225 Difference]: With dead ends: 1608 [2021-12-27 21:52:57,907 INFO L226 Difference]: Without dead ends: 1500 [2021-12-27 21:52:57,910 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 222 GetRequests, 96 SyntacticMatches, 0 SemanticMatches, 126 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3336 ImplicationChecksByTransitivity, 10.1s TimeCoverageRelationStatistics Valid=2709, Invalid=13547, Unknown=0, NotChecked=0, Total=16256 [2021-12-27 21:52:57,911 INFO L933 BasicCegarLoop]: 450 mSDtfsCounter, 2317 mSDsluCounter, 8944 mSDsCounter, 0 mSdLazyCounter, 5454 mSolverCounterSat, 325 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2317 SdHoareTripleChecker+Valid, 9394 SdHoareTripleChecker+Invalid, 5779 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 325 IncrementalHoareTripleChecker+Valid, 5454 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.7s IncrementalHoareTripleChecker+Time [2021-12-27 21:52:57,911 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2317 Valid, 9394 Invalid, 5779 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [325 Valid, 5454 Invalid, 0 Unknown, 0 Unchecked, 3.7s Time] [2021-12-27 21:52:57,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1500 states. [2021-12-27 21:52:57,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1500 to 895. [2021-12-27 21:52:57,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 895 states, 894 states have (on average 1.4407158836689038) internal successors, (1288), 894 states have internal predecessors, (1288), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-27 21:52:57,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 895 states to 895 states and 1288 transitions. [2021-12-27 21:52:57,947 INFO L78 Accepts]: Start accepts. Automaton has 895 states and 1288 transitions. Word has length 70 [2021-12-27 21:52:57,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-27 21:52:57,949 INFO L470 AbstractCegarLoop]: Abstraction has 895 states and 1288 transitions. [2021-12-27 21:52:57,949 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 44 states, 44 states have (on average 3.1363636363636362) internal successors, (138), 44 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-12-27 21:52:57,949 INFO L276 IsEmpty]: Start isEmpty. Operand 895 states and 1288 transitions. [2021-12-27 21:52:57,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2021-12-27 21:52:57,950 INFO L506 BasicCegarLoop]: Found error trace [2021-12-27 21:52:57,950 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 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-12-27 21:52:57,958 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (15)] Forceful destruction successful, exit code 0 [2021-12-27 21:52:58,156 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-12-27 21:52:58,157 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-27 21:52:58,157 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-27 21:52:58,157 INFO L85 PathProgramCache]: Analyzing trace with hash 824038516, now seen corresponding path program 1 times [2021-12-27 21:52:58,157 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-27 21:52:58,158 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [234952431] [2021-12-27 21:52:58,158 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-27 21:52:58,158 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-27 21:52:58,158 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-27 21:52:58,159 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-27 21:52:58,160 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2021-12-27 21:52:58,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-27 21:52:58,191 INFO L263 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 4 conjunts are in the unsatisfiable core [2021-12-27 21:52:58,192 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-27 21:52:58,413 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 58 proven. 21 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-12-27 21:52:58,413 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-27 21:52:58,514 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 58 proven. 21 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-12-27 21:52:58,514 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-27 21:52:58,514 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [234952431] [2021-12-27 21:52:58,514 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [234952431] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-27 21:52:58,514 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-27 21:52:58,514 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2021-12-27 21:52:58,514 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [605150400] [2021-12-27 21:52:58,514 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-27 21:52:58,515 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-27 21:52:58,515 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-27 21:52:58,515 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-27 21:52:58,515 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-12-27 21:52:58,515 INFO L87 Difference]: Start difference. First operand 895 states and 1288 transitions. Second operand has 7 states, 7 states have (on average 13.428571428571429) internal successors, (94), 7 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-27 21:52:58,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-27 21:52:58,623 INFO L93 Difference]: Finished difference Result 1867 states and 2705 transitions. [2021-12-27 21:52:58,635 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-27 21:52:58,635 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 13.428571428571429) internal successors, (94), 7 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 70 [2021-12-27 21:52:58,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-27 21:52:58,638 INFO L225 Difference]: With dead ends: 1867 [2021-12-27 21:52:58,638 INFO L226 Difference]: Without dead ends: 992 [2021-12-27 21:52:58,639 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 132 SyntacticMatches, 5 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 2 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-12-27 21:52:58,639 INFO L933 BasicCegarLoop]: 33 mSDtfsCounter, 25 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 110 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 84 SdHoareTripleChecker+Invalid, 241 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 110 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 116 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-27 21:52:58,639 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [25 Valid, 84 Invalid, 241 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 110 Invalid, 0 Unknown, 116 Unchecked, 0.1s Time] [2021-12-27 21:52:58,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 992 states. [2021-12-27 21:52:58,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 992 to 840. [2021-12-27 21:52:58,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 840 states, 839 states have (on average 1.4159713945172825) internal successors, (1188), 839 states have internal predecessors, (1188), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-27 21:52:58,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 840 states to 840 states and 1188 transitions. [2021-12-27 21:52:58,681 INFO L78 Accepts]: Start accepts. Automaton has 840 states and 1188 transitions. Word has length 70 [2021-12-27 21:52:58,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-27 21:52:58,681 INFO L470 AbstractCegarLoop]: Abstraction has 840 states and 1188 transitions. [2021-12-27 21:52:58,681 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.428571428571429) internal successors, (94), 7 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-27 21:52:58,681 INFO L276 IsEmpty]: Start isEmpty. Operand 840 states and 1188 transitions. [2021-12-27 21:52:58,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2021-12-27 21:52:58,682 INFO L506 BasicCegarLoop]: Found error trace [2021-12-27 21:52:58,682 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2021-12-27 21:52:58,690 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (16)] Forceful destruction successful, exit code 0 [2021-12-27 21:52:58,888 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-27 21:52:58,889 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-27 21:52:58,889 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-27 21:52:58,889 INFO L85 PathProgramCache]: Analyzing trace with hash -1235371034, now seen corresponding path program 1 times [2021-12-27 21:52:58,889 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-27 21:52:58,889 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [548710427] [2021-12-27 21:52:58,889 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-27 21:52:58,889 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-27 21:52:58,890 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-27 21:52:58,890 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-27 21:52:58,892 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (17)] Waiting until timeout for monitored process [2021-12-27 21:52:58,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-27 21:52:58,925 INFO L263 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 43 conjunts are in the unsatisfiable core [2021-12-27 21:52:58,927 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-27 21:53:01,424 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 0 proven. 86 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-27 21:53:01,425 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-27 21:53:03,903 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 0 proven. 86 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-27 21:53:03,903 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-27 21:53:03,903 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [548710427] [2021-12-27 21:53:03,903 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [548710427] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-27 21:53:03,903 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-27 21:53:03,903 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24] total 46 [2021-12-27 21:53:03,903 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [263743398] [2021-12-27 21:53:03,903 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-27 21:53:03,904 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2021-12-27 21:53:03,904 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-27 21:53:03,904 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2021-12-27 21:53:03,904 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=149, Invalid=1921, Unknown=0, NotChecked=0, Total=2070 [2021-12-27 21:53:03,905 INFO L87 Difference]: Start difference. First operand 840 states and 1188 transitions. Second operand has 46 states, 46 states have (on average 3.1739130434782608) internal successors, (146), 46 states have internal predecessors, (146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)