./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/bitvector/byte_add_2-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c3fed411 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_2-2.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 de6decccd91c37b79cf607a5f07869bb0707e08de203e3ce6759a25f4e6e01ba --- Real Ultimate output --- This is Ultimate 0.2.2-tmp.no-commuhash-c3fed41 [2021-12-15 21:55:37,257 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-15 21:55:37,259 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-15 21:55:37,287 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-15 21:55:37,287 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-15 21:55:37,290 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-15 21:55:37,291 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-15 21:55:37,295 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-15 21:55:37,296 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-15 21:55:37,299 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-15 21:55:37,299 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-15 21:55:37,300 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-15 21:55:37,301 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-15 21:55:37,302 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-15 21:55:37,303 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-15 21:55:37,306 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-15 21:55:37,306 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-15 21:55:37,307 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-15 21:55:37,308 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-15 21:55:37,312 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-15 21:55:37,313 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-15 21:55:37,314 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-15 21:55:37,315 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-15 21:55:37,315 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-15 21:55:37,320 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-15 21:55:37,320 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-15 21:55:37,320 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-15 21:55:37,321 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-15 21:55:37,322 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-15 21:55:37,322 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-15 21:55:37,322 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-15 21:55:37,323 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-15 21:55:37,324 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-15 21:55:37,325 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-15 21:55:37,326 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-15 21:55:37,326 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-15 21:55:37,326 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-15 21:55:37,326 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-15 21:55:37,326 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-15 21:55:37,327 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-15 21:55:37,327 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-15 21:55:37,328 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2021-12-15 21:55:37,353 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-15 21:55:37,353 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-15 21:55:37,354 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-15 21:55:37,354 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-15 21:55:37,355 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-15 21:55:37,355 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-15 21:55:37,355 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-15 21:55:37,355 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-15 21:55:37,355 INFO L138 SettingsManager]: * Use SBE=true [2021-12-15 21:55:37,356 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-15 21:55:37,356 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-15 21:55:37,357 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-15 21:55:37,357 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-15 21:55:37,357 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-15 21:55:37,357 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-12-15 21:55:37,357 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-15 21:55:37,357 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-12-15 21:55:37,357 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-15 21:55:37,358 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-12-15 21:55:37,358 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-15 21:55:37,358 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-12-15 21:55:37,358 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-15 21:55:37,358 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-15 21:55:37,358 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-15 21:55:37,358 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-15 21:55:37,359 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-15 21:55:37,359 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-15 21:55:37,359 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-12-15 21:55:37,359 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-15 21:55:37,359 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-12-15 21:55:37,359 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-12-15 21:55:37,360 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-12-15 21:55:37,360 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-12-15 21:55:37,360 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-15 21:55:37,360 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 -> de6decccd91c37b79cf607a5f07869bb0707e08de203e3ce6759a25f4e6e01ba [2021-12-15 21:55:37,533 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-15 21:55:37,558 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-15 21:55:37,559 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-15 21:55:37,560 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-15 21:55:37,561 INFO L275 PluginConnector]: CDTParser initialized [2021-12-15 21:55:37,561 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/bitvector/byte_add_2-2.i [2021-12-15 21:55:37,601 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/80e20e9e4/0d1806c81031450698fc2bab8eb05f65/FLAGd6fc9b077 [2021-12-15 21:55:37,956 INFO L306 CDTParser]: Found 1 translation units. [2021-12-15 21:55:37,957 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/byte_add_2-2.i [2021-12-15 21:55:37,962 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/80e20e9e4/0d1806c81031450698fc2bab8eb05f65/FLAGd6fc9b077 [2021-12-15 21:55:37,974 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/80e20e9e4/0d1806c81031450698fc2bab8eb05f65 [2021-12-15 21:55:37,976 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-15 21:55:37,983 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-15 21:55:37,984 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-15 21:55:37,984 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-15 21:55:37,986 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-15 21:55:37,987 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.12 09:55:37" (1/1) ... [2021-12-15 21:55:37,988 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4a3125f2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:55:37, skipping insertion in model container [2021-12-15 21:55:37,988 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.12 09:55:37" (1/1) ... [2021-12-15 21:55:37,993 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-15 21:55:38,006 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-15 21:55:38,134 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_2-2.i[1168,1181] [2021-12-15 21:55:38,192 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-15 21:55:38,196 INFO L203 MainTranslator]: Completed pre-run [2021-12-15 21:55:38,209 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_2-2.i[1168,1181] [2021-12-15 21:55:38,231 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-15 21:55:38,240 INFO L208 MainTranslator]: Completed translation [2021-12-15 21:55:38,241 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:55:38 WrapperNode [2021-12-15 21:55:38,241 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-15 21:55:38,242 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-15 21:55:38,242 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-15 21:55:38,242 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-15 21:55:38,247 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:55:38" (1/1) ... [2021-12-15 21:55:38,253 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:55:38" (1/1) ... [2021-12-15 21:55:38,270 INFO L137 Inliner]: procedures = 16, calls = 8, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 123 [2021-12-15 21:55:38,270 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-15 21:55:38,271 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-15 21:55:38,271 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-15 21:55:38,271 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-15 21:55:38,277 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:55:38" (1/1) ... [2021-12-15 21:55:38,277 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:55:38" (1/1) ... [2021-12-15 21:55:38,278 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:55:38" (1/1) ... [2021-12-15 21:55:38,279 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:55:38" (1/1) ... [2021-12-15 21:55:38,282 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:55:38" (1/1) ... [2021-12-15 21:55:38,286 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:55:38" (1/1) ... [2021-12-15 21:55:38,287 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:55:38" (1/1) ... [2021-12-15 21:55:38,289 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-15 21:55:38,290 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-15 21:55:38,290 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-15 21:55:38,290 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-15 21:55:38,291 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:55:38" (1/1) ... [2021-12-15 21:55:38,310 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-15 21:55:38,319 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 21:55:38,344 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-15 21:55:38,374 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-15 21:55:38,423 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-15 21:55:38,424 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-12-15 21:55:38,424 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-15 21:55:38,424 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-15 21:55:38,508 INFO L236 CfgBuilder]: Building ICFG [2021-12-15 21:55:38,509 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-15 21:55:38,653 INFO L277 CfgBuilder]: Performing block encoding [2021-12-15 21:55:38,658 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-15 21:55:38,658 INFO L301 CfgBuilder]: Removed 2 assume(true) statements. [2021-12-15 21:55:38,659 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.12 09:55:38 BoogieIcfgContainer [2021-12-15 21:55:38,659 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-15 21:55:38,661 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-12-15 21:55:38,661 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-12-15 21:55:38,663 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-12-15 21:55:38,663 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.12 09:55:37" (1/3) ... [2021-12-15 21:55:38,664 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2a17c16 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.12 09:55:38, skipping insertion in model container [2021-12-15 21:55:38,664 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:55:38" (2/3) ... [2021-12-15 21:55:38,664 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2a17c16 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.12 09:55:38, skipping insertion in model container [2021-12-15 21:55:38,665 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.12 09:55:38" (3/3) ... [2021-12-15 21:55:38,666 INFO L111 eAbstractionObserver]: Analyzing ICFG byte_add_2-2.i [2021-12-15 21:55:38,669 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-12-15 21:55:38,670 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-12-15 21:55:38,701 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-12-15 21:55:38,706 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-15 21:55:38,706 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-12-15 21:55:38,732 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-15 21:55:38,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2021-12-15 21:55:38,736 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 21:55:38,737 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 21:55:38,737 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-15 21:55:38,740 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 21:55:38,741 INFO L85 PathProgramCache]: Analyzing trace with hash 255061167, now seen corresponding path program 1 times [2021-12-15 21:55:38,746 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 21:55:38,749 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [503183242] [2021-12-15 21:55:38,755 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 21:55:38,756 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 21:55:38,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 21:55:38,894 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 21:55:38,894 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 21:55:38,895 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [503183242] [2021-12-15 21:55:38,895 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [503183242] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 21:55:38,895 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 21:55:38,896 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-15 21:55:38,897 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1092070831] [2021-12-15 21:55:38,897 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 21:55:38,900 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2021-12-15 21:55:38,900 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 21:55:38,923 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-12-15 21:55:38,924 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-12-15 21:55:38,925 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-15 21:55:38,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 21:55:38,935 INFO L93 Difference]: Finished difference Result 57 states and 92 transitions. [2021-12-15 21:55:38,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-12-15 21:55:38,936 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-15 21:55:38,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 21:55:38,941 INFO L225 Difference]: With dead ends: 57 [2021-12-15 21:55:38,941 INFO L226 Difference]: Without dead ends: 38 [2021-12-15 21:55:38,944 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-15 21:55:38,947 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-15 21:55:38,947 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-15 21:55:38,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2021-12-15 21:55:38,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2021-12-15 21:55:38,965 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-15 21:55:38,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 64 transitions. [2021-12-15 21:55:38,967 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 64 transitions. Word has length 12 [2021-12-15 21:55:38,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 21:55:38,968 INFO L470 AbstractCegarLoop]: Abstraction has 38 states and 64 transitions. [2021-12-15 21:55:38,968 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-15 21:55:38,968 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 64 transitions. [2021-12-15 21:55:38,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2021-12-15 21:55:38,970 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 21:55:38,970 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 21:55:38,970 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-12-15 21:55:38,970 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-15 21:55:38,971 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 21:55:38,973 INFO L85 PathProgramCache]: Analyzing trace with hash 1803477009, now seen corresponding path program 1 times [2021-12-15 21:55:38,973 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 21:55:38,973 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1426563588] [2021-12-15 21:55:38,974 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 21:55:38,974 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 21:55:39,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 21:55:39,092 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-15 21:55:39,092 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 21:55:39,093 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1426563588] [2021-12-15 21:55:39,093 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1426563588] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 21:55:39,093 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 21:55:39,093 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-15 21:55:39,093 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1836681907] [2021-12-15 21:55:39,093 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 21:55:39,094 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-15 21:55:39,099 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 21:55:39,100 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-15 21:55:39,100 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-15 21:55:39,100 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-15 21:55:39,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 21:55:39,267 INFO L93 Difference]: Finished difference Result 89 states and 156 transitions. [2021-12-15 21:55:39,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-15 21:55:39,268 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-15 21:55:39,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 21:55:39,273 INFO L225 Difference]: With dead ends: 89 [2021-12-15 21:55:39,273 INFO L226 Difference]: Without dead ends: 61 [2021-12-15 21:55:39,279 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-15 21:55:39,281 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-15 21:55:39,282 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-15 21:55:39,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2021-12-15 21:55:39,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 59. [2021-12-15 21:55:39,292 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-15 21:55:39,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 89 transitions. [2021-12-15 21:55:39,293 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 89 transitions. Word has length 12 [2021-12-15 21:55:39,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 21:55:39,294 INFO L470 AbstractCegarLoop]: Abstraction has 59 states and 89 transitions. [2021-12-15 21:55:39,294 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-15 21:55:39,294 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 89 transitions. [2021-12-15 21:55:39,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-12-15 21:55:39,295 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 21:55:39,295 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-15 21:55:39,296 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-12-15 21:55:39,296 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-15 21:55:39,296 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 21:55:39,297 INFO L85 PathProgramCache]: Analyzing trace with hash -1336656122, now seen corresponding path program 1 times [2021-12-15 21:55:39,297 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 21:55:39,297 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1764963849] [2021-12-15 21:55:39,297 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 21:55:39,298 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 21:55:39,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 21:55:39,436 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-15 21:55:39,436 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 21:55:39,436 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1764963849] [2021-12-15 21:55:39,436 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1764963849] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 21:55:39,436 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 21:55:39,436 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-15 21:55:39,437 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [766239668] [2021-12-15 21:55:39,437 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 21:55:39,437 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-15 21:55:39,437 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 21:55:39,437 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-15 21:55:39,437 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-15 21:55:39,438 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-15 21:55:39,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 21:55:39,610 INFO L93 Difference]: Finished difference Result 143 states and 218 transitions. [2021-12-15 21:55:39,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-15 21:55:39,611 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-15 21:55:39,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 21:55:39,615 INFO L225 Difference]: With dead ends: 143 [2021-12-15 21:55:39,615 INFO L226 Difference]: Without dead ends: 105 [2021-12-15 21:55:39,615 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-15 21:55:39,621 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.1s IncrementalHoareTripleChecker+Time [2021-12-15 21:55:39,622 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.1s Time] [2021-12-15 21:55:39,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2021-12-15 21:55:39,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 67. [2021-12-15 21:55:39,633 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-15 21:55:39,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 98 transitions. [2021-12-15 21:55:39,636 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 98 transitions. Word has length 18 [2021-12-15 21:55:39,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 21:55:39,636 INFO L470 AbstractCegarLoop]: Abstraction has 67 states and 98 transitions. [2021-12-15 21:55:39,636 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-15 21:55:39,637 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 98 transitions. [2021-12-15 21:55:39,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-12-15 21:55:39,638 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 21:55:39,638 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-15 21:55:39,639 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-12-15 21:55:39,639 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-15 21:55:39,639 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 21:55:39,640 INFO L85 PathProgramCache]: Analyzing trace with hash -640429161, now seen corresponding path program 1 times [2021-12-15 21:55:39,640 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 21:55:39,640 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [485244035] [2021-12-15 21:55:39,640 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 21:55:39,640 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 21:55:39,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 21:55:39,687 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-15 21:55:39,688 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 21:55:39,688 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [485244035] [2021-12-15 21:55:39,688 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [485244035] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 21:55:39,688 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 21:55:39,688 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-15 21:55:39,688 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1469011108] [2021-12-15 21:55:39,689 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 21:55:39,689 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-15 21:55:39,689 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 21:55:39,689 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-15 21:55:39,689 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-15 21:55:39,690 INFO L87 Difference]: Start difference. First operand 67 states and 98 transitions. Second operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 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-15 21:55:39,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 21:55:39,693 INFO L93 Difference]: Finished difference Result 104 states and 156 transitions. [2021-12-15 21:55:39,693 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-15 21:55:39,694 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 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-15 21:55:39,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 21:55:39,694 INFO L225 Difference]: With dead ends: 104 [2021-12-15 21:55:39,694 INFO L226 Difference]: Without dead ends: 52 [2021-12-15 21:55:39,695 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-15 21:55:39,695 INFO L933 BasicCegarLoop]: 57 mSDtfsCounter, 55 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 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-15 21:55:39,695 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [55 Valid, 58 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-15 21:55:39,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2021-12-15 21:55:39,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2021-12-15 21:55:39,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 51 states have (on average 1.5098039215686274) internal successors, (77), 51 states have internal predecessors, (77), 0 states have call successors, (0), 0 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-15 21:55:39,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 77 transitions. [2021-12-15 21:55:39,699 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 77 transitions. Word has length 19 [2021-12-15 21:55:39,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 21:55:39,699 INFO L470 AbstractCegarLoop]: Abstraction has 52 states and 77 transitions. [2021-12-15 21:55:39,699 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 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-15 21:55:39,699 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 77 transitions. [2021-12-15 21:55:39,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-12-15 21:55:39,700 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 21:55:39,700 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-15 21:55:39,700 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-12-15 21:55:39,700 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-15 21:55:39,701 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 21:55:39,701 INFO L85 PathProgramCache]: Analyzing trace with hash 1480128500, now seen corresponding path program 1 times [2021-12-15 21:55:39,701 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 21:55:39,701 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1980468250] [2021-12-15 21:55:39,701 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 21:55:39,701 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 21:55:39,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 21:55:39,745 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-15 21:55:39,746 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 21:55:39,746 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1980468250] [2021-12-15 21:55:39,746 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1980468250] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 21:55:39,746 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 21:55:39,746 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-15 21:55:39,746 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1100059561] [2021-12-15 21:55:39,747 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 21:55:39,747 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-15 21:55:39,747 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 21:55:39,748 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-15 21:55:39,748 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-15 21:55:39,748 INFO L87 Difference]: Start difference. First operand 52 states and 77 transitions. Second operand has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 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-15 21:55:39,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 21:55:39,755 INFO L93 Difference]: Finished difference Result 73 states and 107 transitions. [2021-12-15 21:55:39,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-15 21:55:39,756 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 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-15 21:55:39,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 21:55:39,756 INFO L225 Difference]: With dead ends: 73 [2021-12-15 21:55:39,756 INFO L226 Difference]: Without dead ends: 62 [2021-12-15 21:55:39,757 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-15 21:55:39,757 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-15 21:55:39,758 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-15 21:55:39,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2021-12-15 21:55:39,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2021-12-15 21:55:39,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 61 states have (on average 1.4918032786885247) internal successors, (91), 61 states have internal predecessors, (91), 0 states have call successors, (0), 0 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-15 21:55:39,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 91 transitions. [2021-12-15 21:55:39,762 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 91 transitions. Word has length 25 [2021-12-15 21:55:39,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 21:55:39,763 INFO L470 AbstractCegarLoop]: Abstraction has 62 states and 91 transitions. [2021-12-15 21:55:39,763 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 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-15 21:55:39,763 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 91 transitions. [2021-12-15 21:55:39,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-12-15 21:55:39,764 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 21:55:39,764 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-15 21:55:39,764 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-12-15 21:55:39,764 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-15 21:55:39,765 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 21:55:39,765 INFO L85 PathProgramCache]: Analyzing trace with hash 1738293938, now seen corresponding path program 1 times [2021-12-15 21:55:39,765 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 21:55:39,765 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1229845559] [2021-12-15 21:55:39,765 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 21:55:39,765 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 21:55:39,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 21:55:39,862 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-15 21:55:39,863 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 21:55:39,863 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1229845559] [2021-12-15 21:55:39,863 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1229845559] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 21:55:39,863 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 21:55:39,863 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-15 21:55:39,864 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1146650533] [2021-12-15 21:55:39,864 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 21:55:39,864 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-15 21:55:39,864 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 21:55:39,865 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-15 21:55:39,865 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-15 21:55:39,865 INFO L87 Difference]: Start difference. First operand 62 states and 91 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-15 21:55:39,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 21:55:39,989 INFO L93 Difference]: Finished difference Result 169 states and 249 transitions. [2021-12-15 21:55:39,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-15 21:55:39,990 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-15 21:55:39,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 21:55:39,992 INFO L225 Difference]: With dead ends: 169 [2021-12-15 21:55:39,992 INFO L226 Difference]: Without dead ends: 121 [2021-12-15 21:55:39,992 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-12-15 21:55:39,994 INFO L933 BasicCegarLoop]: 82 mSDtfsCounter, 82 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 115 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 150 SdHoareTripleChecker+Invalid, 116 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 115 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-15 21:55:39,996 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [82 Valid, 150 Invalid, 116 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 115 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-15 21:55:39,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2021-12-15 21:55:40,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 67. [2021-12-15 21:55:40,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 66 states have (on average 1.4545454545454546) internal successors, (96), 66 states have internal predecessors, (96), 0 states have call successors, (0), 0 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-15 21:55:40,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 96 transitions. [2021-12-15 21:55:40,006 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 96 transitions. Word has length 25 [2021-12-15 21:55:40,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 21:55:40,007 INFO L470 AbstractCegarLoop]: Abstraction has 67 states and 96 transitions. [2021-12-15 21:55:40,007 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-15 21:55:40,007 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 96 transitions. [2021-12-15 21:55:40,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2021-12-15 21:55:40,008 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 21:55:40,008 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-15 21:55:40,008 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-12-15 21:55:40,008 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-15 21:55:40,008 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 21:55:40,009 INFO L85 PathProgramCache]: Analyzing trace with hash -1125876944, now seen corresponding path program 1 times [2021-12-15 21:55:40,009 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 21:55:40,009 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [148994277] [2021-12-15 21:55:40,009 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 21:55:40,009 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 21:55:40,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 21:55:40,050 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-15 21:55:40,050 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 21:55:40,050 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [148994277] [2021-12-15 21:55:40,050 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [148994277] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-15 21:55:40,051 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1659197780] [2021-12-15 21:55:40,051 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 21:55:40,051 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-15 21:55:40,051 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 21:55:40,052 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-15 21:55:40,085 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-15 21:55:40,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 21:55:40,116 INFO L263 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 4 conjunts are in the unsatisfiable core [2021-12-15 21:55:40,118 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 21:55:40,336 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-15 21:55:40,336 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-15 21:55:40,337 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1659197780] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 21:55:40,337 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-15 21:55:40,337 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2021-12-15 21:55:40,337 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1498515765] [2021-12-15 21:55:40,337 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 21:55:40,337 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-15 21:55:40,338 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 21:55:40,338 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-15 21:55:40,338 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2021-12-15 21:55:40,338 INFO L87 Difference]: Start difference. First operand 67 states and 96 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-15 21:55:40,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 21:55:40,483 INFO L93 Difference]: Finished difference Result 153 states and 251 transitions. [2021-12-15 21:55:40,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-15 21:55:40,484 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-15 21:55:40,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 21:55:40,486 INFO L225 Difference]: With dead ends: 153 [2021-12-15 21:55:40,486 INFO L226 Difference]: Without dead ends: 119 [2021-12-15 21:55:40,488 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-15 21:55:40,489 INFO L933 BasicCegarLoop]: 29 mSDtfsCounter, 37 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 133 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 59 SdHoareTripleChecker+Invalid, 168 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 133 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-15 21:55:40,490 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [37 Valid, 59 Invalid, 168 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 133 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-15 21:55:40,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2021-12-15 21:55:40,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 103. [2021-12-15 21:55:40,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 102 states have (on average 1.3431372549019607) internal successors, (137), 102 states have internal predecessors, (137), 0 states have call successors, (0), 0 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-15 21:55:40,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 137 transitions. [2021-12-15 21:55:40,501 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 137 transitions. Word has length 26 [2021-12-15 21:55:40,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 21:55:40,501 INFO L470 AbstractCegarLoop]: Abstraction has 103 states and 137 transitions. [2021-12-15 21:55:40,501 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-15 21:55:40,502 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 137 transitions. [2021-12-15 21:55:40,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-12-15 21:55:40,502 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 21:55:40,502 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-15 21:55:40,531 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-15 21:55:40,715 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-15 21:55:40,715 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-15 21:55:40,716 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 21:55:40,716 INFO L85 PathProgramCache]: Analyzing trace with hash 801426209, now seen corresponding path program 1 times [2021-12-15 21:55:40,716 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 21:55:40,716 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1665410216] [2021-12-15 21:55:40,716 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 21:55:40,717 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 21:55:40,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 21:55:40,839 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-15 21:55:40,839 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 21:55:40,840 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1665410216] [2021-12-15 21:55:40,840 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1665410216] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-15 21:55:40,840 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [749420284] [2021-12-15 21:55:40,840 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 21:55:40,840 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-15 21:55:40,840 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 21:55:40,850 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-15 21:55:40,851 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-15 21:55:40,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 21:55:40,917 INFO L263 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 6 conjunts are in the unsatisfiable core [2021-12-15 21:55:40,918 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 21:55:41,041 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-15 21:55:41,041 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-15 21:55:41,041 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [749420284] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 21:55:41,041 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-15 21:55:41,042 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 7 [2021-12-15 21:55:41,042 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [18242309] [2021-12-15 21:55:41,042 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 21:55:41,042 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-15 21:55:41,042 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 21:55:41,043 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-15 21:55:41,043 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-12-15 21:55:41,043 INFO L87 Difference]: Start difference. First operand 103 states and 137 transitions. Second operand has 5 states, 5 states have (on average 6.4) internal successors, (32), 5 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-15 21:55:41,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 21:55:41,151 INFO L93 Difference]: Finished difference Result 193 states and 267 transitions. [2021-12-15 21:55:41,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-15 21:55:41,152 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.4) internal successors, (32), 5 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-15 21:55:41,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 21:55:41,152 INFO L225 Difference]: With dead ends: 193 [2021-12-15 21:55:41,152 INFO L226 Difference]: Without dead ends: 104 [2021-12-15 21:55:41,154 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 30 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-15 21:55:41,155 INFO L933 BasicCegarLoop]: 21 mSDtfsCounter, 74 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 46 SdHoareTripleChecker+Invalid, 97 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-15 21:55:41,155 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [74 Valid, 46 Invalid, 97 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-15 21:55:41,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2021-12-15 21:55:41,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 87. [2021-12-15 21:55:41,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 86 states have (on average 1.3488372093023255) internal successors, (116), 86 states have internal predecessors, (116), 0 states have call successors, (0), 0 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-15 21:55:41,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 116 transitions. [2021-12-15 21:55:41,163 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 116 transitions. Word has length 32 [2021-12-15 21:55:41,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 21:55:41,164 INFO L470 AbstractCegarLoop]: Abstraction has 87 states and 116 transitions. [2021-12-15 21:55:41,164 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.4) internal successors, (32), 5 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-15 21:55:41,164 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 116 transitions. [2021-12-15 21:55:41,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2021-12-15 21:55:41,167 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 21:55:41,167 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 21:55:41,172 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-15 21:55:41,371 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-15 21:55:41,371 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-15 21:55:41,372 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 21:55:41,373 INFO L85 PathProgramCache]: Analyzing trace with hash 763937393, now seen corresponding path program 1 times [2021-12-15 21:55:41,373 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 21:55:41,373 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1765329319] [2021-12-15 21:55:41,373 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 21:55:41,373 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 21:55:41,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 21:55:41,440 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-12-15 21:55:41,441 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 21:55:41,441 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1765329319] [2021-12-15 21:55:41,441 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1765329319] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 21:55:41,441 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 21:55:41,441 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-15 21:55:41,441 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1715808804] [2021-12-15 21:55:41,442 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 21:55:41,442 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-15 21:55:41,442 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 21:55:41,443 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-15 21:55:41,443 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-15 21:55:41,443 INFO L87 Difference]: Start difference. First operand 87 states and 116 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-15 21:55:41,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 21:55:41,550 INFO L93 Difference]: Finished difference Result 253 states and 361 transitions. [2021-12-15 21:55:41,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-15 21:55:41,550 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 39 [2021-12-15 21:55:41,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 21:55:41,551 INFO L225 Difference]: With dead ends: 253 [2021-12-15 21:55:41,551 INFO L226 Difference]: Without dead ends: 181 [2021-12-15 21:55:41,553 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 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-15 21:55:41,555 INFO L933 BasicCegarLoop]: 21 mSDtfsCounter, 72 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 99 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 129 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 99 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-15 21:55:41,556 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [72 Valid, 53 Invalid, 129 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 99 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-15 21:55:41,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2021-12-15 21:55:41,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 121. [2021-12-15 21:55:41,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 120 states have (on average 1.425) internal successors, (171), 120 states have internal predecessors, (171), 0 states have call successors, (0), 0 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-15 21:55:41,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 171 transitions. [2021-12-15 21:55:41,566 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 171 transitions. Word has length 39 [2021-12-15 21:55:41,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 21:55:41,567 INFO L470 AbstractCegarLoop]: Abstraction has 121 states and 171 transitions. [2021-12-15 21:55:41,567 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-15 21:55:41,567 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 171 transitions. [2021-12-15 21:55:41,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2021-12-15 21:55:41,572 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 21:55:41,572 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 21:55:41,572 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-12-15 21:55:41,572 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-15 21:55:41,573 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 21:55:41,573 INFO L85 PathProgramCache]: Analyzing trace with hash 1940214352, now seen corresponding path program 1 times [2021-12-15 21:55:41,573 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 21:55:41,574 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [885574232] [2021-12-15 21:55:41,574 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 21:55:41,574 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 21:55:41,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 21:55:41,680 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2021-12-15 21:55:41,680 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 21:55:41,680 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [885574232] [2021-12-15 21:55:41,681 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [885574232] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 21:55:41,681 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 21:55:41,681 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-15 21:55:41,681 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [502149913] [2021-12-15 21:55:41,681 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 21:55:41,683 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-15 21:55:41,683 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 21:55:41,683 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-15 21:55:41,683 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-15 21:55:41,684 INFO L87 Difference]: Start difference. First operand 121 states and 171 transitions. Second operand has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 21:55:41,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 21:55:41,789 INFO L93 Difference]: Finished difference Result 342 states and 498 transitions. [2021-12-15 21:55:41,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-15 21:55:41,789 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 52 [2021-12-15 21:55:41,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 21:55:41,791 INFO L225 Difference]: With dead ends: 342 [2021-12-15 21:55:41,791 INFO L226 Difference]: Without dead ends: 236 [2021-12-15 21:55:41,791 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 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-15 21:55:41,792 INFO L933 BasicCegarLoop]: 18 mSDtfsCounter, 80 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 101 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 50 SdHoareTripleChecker+Invalid, 128 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 101 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-15 21:55:41,793 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [80 Valid, 50 Invalid, 128 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 101 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-15 21:55:41,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 236 states. [2021-12-15 21:55:41,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 236 to 155. [2021-12-15 21:55:41,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 155 states, 154 states have (on average 1.4870129870129871) internal successors, (229), 154 states have internal predecessors, (229), 0 states have call successors, (0), 0 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-15 21:55:41,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 229 transitions. [2021-12-15 21:55:41,799 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 229 transitions. Word has length 52 [2021-12-15 21:55:41,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 21:55:41,801 INFO L470 AbstractCegarLoop]: Abstraction has 155 states and 229 transitions. [2021-12-15 21:55:41,801 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 21:55:41,801 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 229 transitions. [2021-12-15 21:55:41,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2021-12-15 21:55:41,803 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 21:55:41,804 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-15 21:55:41,804 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-12-15 21:55:41,804 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-15 21:55:41,805 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 21:55:41,805 INFO L85 PathProgramCache]: Analyzing trace with hash -564670639, now seen corresponding path program 1 times [2021-12-15 21:55:41,805 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 21:55:41,805 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [135956007] [2021-12-15 21:55:41,805 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 21:55:41,806 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 21:55:41,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 21:55:41,926 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2021-12-15 21:55:41,926 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 21:55:41,926 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [135956007] [2021-12-15 21:55:41,927 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [135956007] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 21:55:41,927 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 21:55:41,927 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-15 21:55:41,931 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1029900275] [2021-12-15 21:55:41,932 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 21:55:41,932 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-15 21:55:41,932 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 21:55:41,933 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-15 21:55:41,933 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-15 21:55:41,933 INFO L87 Difference]: Start difference. First operand 155 states and 229 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-15 21:55:42,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 21:55:42,138 INFO L93 Difference]: Finished difference Result 607 states and 894 transitions. [2021-12-15 21:55:42,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-15 21:55:42,139 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 65 [2021-12-15 21:55:42,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 21:55:42,141 INFO L225 Difference]: With dead ends: 607 [2021-12-15 21:55:42,142 INFO L226 Difference]: Without dead ends: 468 [2021-12-15 21:55:42,142 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-15 21:55:42,143 INFO L933 BasicCegarLoop]: 84 mSDtfsCounter, 147 mSDsluCounter, 138 mSDsCounter, 0 mSdLazyCounter, 185 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 147 SdHoareTripleChecker+Valid, 222 SdHoareTripleChecker+Invalid, 188 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 185 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-15 21:55:42,143 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [147 Valid, 222 Invalid, 188 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 185 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-15 21:55:42,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 468 states. [2021-12-15 21:55:42,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 468 to 155. [2021-12-15 21:55:42,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 155 states, 154 states have (on average 1.4870129870129871) internal successors, (229), 154 states have internal predecessors, (229), 0 states have call successors, (0), 0 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-15 21:55:42,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 229 transitions. [2021-12-15 21:55:42,152 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 229 transitions. Word has length 65 [2021-12-15 21:55:42,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 21:55:42,152 INFO L470 AbstractCegarLoop]: Abstraction has 155 states and 229 transitions. [2021-12-15 21:55:42,152 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-15 21:55:42,153 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 229 transitions. [2021-12-15 21:55:42,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2021-12-15 21:55:42,153 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 21:55:42,153 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-15 21:55:42,154 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-12-15 21:55:42,154 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-15 21:55:42,155 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 21:55:42,155 INFO L85 PathProgramCache]: Analyzing trace with hash 1543642426, now seen corresponding path program 1 times [2021-12-15 21:55:42,155 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 21:55:42,155 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1881541075] [2021-12-15 21:55:42,156 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 21:55:42,156 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 21:55:42,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 21:55:42,264 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-15 21:55:42,264 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 21:55:42,265 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1881541075] [2021-12-15 21:55:42,265 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1881541075] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 21:55:42,265 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 21:55:42,265 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-15 21:55:42,266 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [677254697] [2021-12-15 21:55:42,266 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 21:55:42,266 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-15 21:55:42,267 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 21:55:42,267 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-15 21:55:42,267 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-12-15 21:55:42,268 INFO L87 Difference]: Start difference. First operand 155 states and 229 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-15 21:55:42,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 21:55:42,335 INFO L93 Difference]: Finished difference Result 503 states and 745 transitions. [2021-12-15 21:55:42,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-15 21:55:42,335 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-15 21:55:42,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 21:55:42,337 INFO L225 Difference]: With dead ends: 503 [2021-12-15 21:55:42,337 INFO L226 Difference]: Without dead ends: 364 [2021-12-15 21:55:42,337 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-15 21:55:42,338 INFO L933 BasicCegarLoop]: 50 mSDtfsCounter, 114 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 138 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-15 21:55:42,338 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [114 Valid, 138 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-15 21:55:42,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 364 states. [2021-12-15 21:55:42,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 364 to 269. [2021-12-15 21:55:42,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 269 states, 268 states have (on average 1.5037313432835822) internal successors, (403), 268 states have internal predecessors, (403), 0 states have call successors, (0), 0 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-15 21:55:42,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 269 states to 269 states and 403 transitions. [2021-12-15 21:55:42,347 INFO L78 Accepts]: Start accepts. Automaton has 269 states and 403 transitions. Word has length 66 [2021-12-15 21:55:42,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 21:55:42,347 INFO L470 AbstractCegarLoop]: Abstraction has 269 states and 403 transitions. [2021-12-15 21:55:42,347 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-15 21:55:42,347 INFO L276 IsEmpty]: Start isEmpty. Operand 269 states and 403 transitions. [2021-12-15 21:55:42,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2021-12-15 21:55:42,348 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 21:55:42,348 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-15 21:55:42,348 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-12-15 21:55:42,349 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-15 21:55:42,349 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 21:55:42,349 INFO L85 PathProgramCache]: Analyzing trace with hash -1373754372, now seen corresponding path program 1 times [2021-12-15 21:55:42,349 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 21:55:42,350 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1748926531] [2021-12-15 21:55:42,350 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 21:55:42,350 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 21:55:42,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 21:55:42,454 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2021-12-15 21:55:42,454 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 21:55:42,455 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1748926531] [2021-12-15 21:55:42,455 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1748926531] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 21:55:42,455 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 21:55:42,455 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-15 21:55:42,455 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [222053872] [2021-12-15 21:55:42,455 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 21:55:42,456 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-15 21:55:42,456 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 21:55:42,456 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-15 21:55:42,456 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-12-15 21:55:42,457 INFO L87 Difference]: Start difference. First operand 269 states and 403 transitions. Second operand has 7 states, 7 states have (on average 5.285714285714286) internal successors, (37), 7 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 21:55:42,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 21:55:42,934 INFO L93 Difference]: Finished difference Result 1362 states and 2021 transitions. [2021-12-15 21:55:42,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-15 21:55:42,935 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.285714285714286) internal successors, (37), 7 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 66 [2021-12-15 21:55:42,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 21:55:42,940 INFO L225 Difference]: With dead ends: 1362 [2021-12-15 21:55:42,940 INFO L226 Difference]: Without dead ends: 1109 [2021-12-15 21:55:42,941 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-15 21:55:42,942 INFO L933 BasicCegarLoop]: 97 mSDtfsCounter, 297 mSDsluCounter, 325 mSDsCounter, 0 mSdLazyCounter, 435 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 297 SdHoareTripleChecker+Valid, 422 SdHoareTripleChecker+Invalid, 442 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 435 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-12-15 21:55:42,942 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [297 Valid, 422 Invalid, 442 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 435 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2021-12-15 21:55:42,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1109 states. [2021-12-15 21:55:42,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1109 to 262. [2021-12-15 21:55:42,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 262 states, 261 states have (on average 1.5134099616858236) internal successors, (395), 261 states have internal predecessors, (395), 0 states have call successors, (0), 0 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-15 21:55:42,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 262 states to 262 states and 395 transitions. [2021-12-15 21:55:42,960 INFO L78 Accepts]: Start accepts. Automaton has 262 states and 395 transitions. Word has length 66 [2021-12-15 21:55:42,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 21:55:42,960 INFO L470 AbstractCegarLoop]: Abstraction has 262 states and 395 transitions. [2021-12-15 21:55:42,960 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.285714285714286) internal successors, (37), 7 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 21:55:42,960 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 395 transitions. [2021-12-15 21:55:42,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2021-12-15 21:55:42,961 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 21:55:42,961 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-15 21:55:42,962 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-12-15 21:55:42,962 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-15 21:55:42,962 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 21:55:42,962 INFO L85 PathProgramCache]: Analyzing trace with hash -1708732925, now seen corresponding path program 1 times [2021-12-15 21:55:42,963 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 21:55:42,963 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [792738280] [2021-12-15 21:55:42,963 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 21:55:42,963 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 21:55:42,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 21:55:43,043 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 47 proven. 3 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2021-12-15 21:55:43,043 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 21:55:43,044 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [792738280] [2021-12-15 21:55:43,044 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [792738280] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-15 21:55:43,044 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [876551116] [2021-12-15 21:55:43,044 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 21:55:43,044 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-15 21:55:43,045 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 21:55:43,069 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-15 21:55:43,070 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-15 21:55:43,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 21:55:43,172 INFO L263 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 7 conjunts are in the unsatisfiable core [2021-12-15 21:55:43,173 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 21:55:43,328 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 46 proven. 3 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2021-12-15 21:55:43,328 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-15 21:55:43,565 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 48 proven. 3 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2021-12-15 21:55:43,565 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [876551116] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-15 21:55:43,565 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-15 21:55:43,565 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 6] total 12 [2021-12-15 21:55:43,565 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1619757316] [2021-12-15 21:55:43,565 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-15 21:55:43,566 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-12-15 21:55:43,566 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 21:55:43,566 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-12-15 21:55:43,566 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2021-12-15 21:55:43,566 INFO L87 Difference]: Start difference. First operand 262 states and 395 transitions. Second operand has 12 states, 12 states have (on average 8.833333333333334) internal successors, (106), 12 states have internal predecessors, (106), 0 states have call successors, (0), 0 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-15 21:55:43,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 21:55:43,998 INFO L93 Difference]: Finished difference Result 1378 states and 2098 transitions. [2021-12-15 21:55:43,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-12-15 21:55:43,999 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 8.833333333333334) internal successors, (106), 12 states have internal predecessors, (106), 0 states have call successors, (0), 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-15 21:55:43,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 21:55:44,002 INFO L225 Difference]: With dead ends: 1378 [2021-12-15 21:55:44,003 INFO L226 Difference]: Without dead ends: 1115 [2021-12-15 21:55:44,003 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 131 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=95, Invalid=177, Unknown=0, NotChecked=0, Total=272 [2021-12-15 21:55:44,004 INFO L933 BasicCegarLoop]: 31 mSDtfsCounter, 294 mSDsluCounter, 110 mSDsCounter, 0 mSdLazyCounter, 453 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 294 SdHoareTripleChecker+Valid, 141 SdHoareTripleChecker+Invalid, 489 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 453 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-15 21:55:44,004 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [294 Valid, 141 Invalid, 489 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 453 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-15 21:55:44,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1115 states. [2021-12-15 21:55:44,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1115 to 937. [2021-12-15 21:55:44,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 937 states, 936 states have (on average 1.4145299145299146) internal successors, (1324), 936 states have internal predecessors, (1324), 0 states have call successors, (0), 0 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-15 21:55:44,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 937 states to 937 states and 1324 transitions. [2021-12-15 21:55:44,052 INFO L78 Accepts]: Start accepts. Automaton has 937 states and 1324 transitions. Word has length 68 [2021-12-15 21:55:44,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 21:55:44,052 INFO L470 AbstractCegarLoop]: Abstraction has 937 states and 1324 transitions. [2021-12-15 21:55:44,052 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 8.833333333333334) internal successors, (106), 12 states have internal predecessors, (106), 0 states have call successors, (0), 0 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-15 21:55:44,052 INFO L276 IsEmpty]: Start isEmpty. Operand 937 states and 1324 transitions. [2021-12-15 21:55:44,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2021-12-15 21:55:44,054 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 21:55:44,054 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-15 21:55:44,087 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2021-12-15 21:55:44,275 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-15 21:55:44,276 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-15 21:55:44,276 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 21:55:44,276 INFO L85 PathProgramCache]: Analyzing trace with hash 1373021230, now seen corresponding path program 1 times [2021-12-15 21:55:44,276 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 21:55:44,276 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1715043559] [2021-12-15 21:55:44,276 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 21:55:44,276 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 21:55:44,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 21:55:44,437 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 54 proven. 3 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2021-12-15 21:55:44,437 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 21:55:44,438 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1715043559] [2021-12-15 21:55:44,438 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1715043559] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-15 21:55:44,438 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [522679343] [2021-12-15 21:55:44,438 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 21:55:44,438 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-15 21:55:44,439 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 21:55:44,454 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-15 21:55:44,458 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-15 21:55:44,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 21:55:44,643 INFO L263 TraceCheckSpWp]: Trace formula consists of 193 conjuncts, 17 conjunts are in the unsatisfiable core [2021-12-15 21:55:44,645 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 21:55:44,943 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 54 proven. 3 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2021-12-15 21:55:44,944 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-15 21:55:45,108 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-15 21:55:45,108 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [522679343] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-15 21:55:45,108 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-15 21:55:45,108 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 11 [2021-12-15 21:55:45,109 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [394332866] [2021-12-15 21:55:45,109 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-15 21:55:45,109 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-12-15 21:55:45,109 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 21:55:45,109 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-12-15 21:55:45,110 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2021-12-15 21:55:45,110 INFO L87 Difference]: Start difference. First operand 937 states and 1324 transitions. Second operand has 11 states, 11 states have (on average 8.545454545454545) internal successors, (94), 11 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-15 21:55:45,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 21:55:45,353 INFO L93 Difference]: Finished difference Result 2110 states and 2922 transitions. [2021-12-15 21:55:45,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-15 21:55:45,354 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 8.545454545454545) internal successors, (94), 11 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-15 21:55:45,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 21:55:45,356 INFO L225 Difference]: With dead ends: 2110 [2021-12-15 21:55:45,357 INFO L226 Difference]: Without dead ends: 1196 [2021-12-15 21:55:45,358 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 134 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=87, Invalid=185, Unknown=0, NotChecked=0, Total=272 [2021-12-15 21:55:45,358 INFO L933 BasicCegarLoop]: 80 mSDtfsCounter, 226 mSDsluCounter, 232 mSDsCounter, 0 mSdLazyCounter, 177 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 226 SdHoareTripleChecker+Valid, 312 SdHoareTripleChecker+Invalid, 207 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 177 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-15 21:55:45,358 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [226 Valid, 312 Invalid, 207 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 177 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-15 21:55:45,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1196 states. [2021-12-15 21:55:45,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1196 to 826. [2021-12-15 21:55:45,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 826 states, 825 states have (on average 1.4084848484848485) internal successors, (1162), 825 states have internal predecessors, (1162), 0 states have call successors, (0), 0 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-15 21:55:45,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 826 states to 826 states and 1162 transitions. [2021-12-15 21:55:45,377 INFO L78 Accepts]: Start accepts. Automaton has 826 states and 1162 transitions. Word has length 70 [2021-12-15 21:55:45,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 21:55:45,378 INFO L470 AbstractCegarLoop]: Abstraction has 826 states and 1162 transitions. [2021-12-15 21:55:45,378 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.545454545454545) internal successors, (94), 11 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-15 21:55:45,378 INFO L276 IsEmpty]: Start isEmpty. Operand 826 states and 1162 transitions. [2021-12-15 21:55:45,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2021-12-15 21:55:45,379 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 21:55:45,379 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-15 21:55:45,406 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-15 21:55:45,595 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2021-12-15 21:55:45,596 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-15 21:55:45,596 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 21:55:45,596 INFO L85 PathProgramCache]: Analyzing trace with hash 484210542, now seen corresponding path program 2 times [2021-12-15 21:55:45,596 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 21:55:45,597 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [322411349] [2021-12-15 21:55:45,597 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 21:55:45,597 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 21:55:45,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 21:55:45,618 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-15 21:55:45,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 21:55:45,669 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-15 21:55:45,669 INFO L628 BasicCegarLoop]: Counterexample is feasible [2021-12-15 21:55:45,670 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2021-12-15 21:55:45,671 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-12-15 21:55:45,673 INFO L732 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 21:55:45,675 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-12-15 21:55:45,743 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.12 09:55:45 BoogieIcfgContainer [2021-12-15 21:55:45,743 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-12-15 21:55:45,744 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-12-15 21:55:45,744 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-12-15 21:55:45,744 INFO L275 PluginConnector]: Witness Printer initialized [2021-12-15 21:55:45,744 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.12 09:55:38" (3/4) ... [2021-12-15 21:55:45,746 INFO L140 WitnessPrinter]: No result that supports witness generation found [2021-12-15 21:55:45,746 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-12-15 21:55:45,747 INFO L158 Benchmark]: Toolchain (without parser) took 7764.10ms. Allocated memory was 111.1MB in the beginning and 161.5MB in the end (delta: 50.3MB). Free memory was 90.8MB in the beginning and 134.8MB in the end (delta: -44.0MB). Peak memory consumption was 4.6MB. Max. memory is 16.1GB. [2021-12-15 21:55:45,747 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 111.1MB. Free memory is still 66.1MB. There was no memory consumed. Max. memory is 16.1GB. [2021-12-15 21:55:45,747 INFO L158 Benchmark]: CACSL2BoogieTranslator took 257.35ms. Allocated memory is still 111.1MB. Free memory was 90.8MB in the beginning and 85.4MB in the end (delta: 5.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2021-12-15 21:55:45,747 INFO L158 Benchmark]: Boogie Procedure Inliner took 28.38ms. Allocated memory is still 111.1MB. Free memory was 85.4MB in the beginning and 83.7MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-15 21:55:45,747 INFO L158 Benchmark]: Boogie Preprocessor took 18.51ms. Allocated memory is still 111.1MB. Free memory was 83.7MB in the beginning and 82.1MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-15 21:55:45,748 INFO L158 Benchmark]: RCFGBuilder took 369.87ms. Allocated memory is still 111.1MB. Free memory was 82.1MB in the beginning and 69.9MB in the end (delta: 12.2MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2021-12-15 21:55:45,748 INFO L158 Benchmark]: TraceAbstraction took 7082.66ms. Allocated memory was 111.1MB in the beginning and 161.5MB in the end (delta: 50.3MB). Free memory was 69.5MB in the beginning and 134.8MB in the end (delta: -65.3MB). Peak memory consumption was 74.9MB. Max. memory is 16.1GB. [2021-12-15 21:55:45,748 INFO L158 Benchmark]: Witness Printer took 2.61ms. Allocated memory is still 161.5MB. Free memory is still 134.8MB. There was no memory consumed. Max. memory is 16.1GB. [2021-12-15 21:55:45,749 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.14ms. Allocated memory is still 111.1MB. Free memory is still 66.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 257.35ms. Allocated memory is still 111.1MB. Free memory was 90.8MB in the beginning and 85.4MB in the end (delta: 5.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 28.38ms. Allocated memory is still 111.1MB. Free memory was 85.4MB in the beginning and 83.7MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 18.51ms. Allocated memory is still 111.1MB. Free memory was 83.7MB in the beginning and 82.1MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 369.87ms. Allocated memory is still 111.1MB. Free memory was 82.1MB in the beginning and 69.9MB in the end (delta: 12.2MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * TraceAbstraction took 7082.66ms. Allocated memory was 111.1MB in the beginning and 161.5MB in the end (delta: 50.3MB). Free memory was 69.5MB in the beginning and 134.8MB in the end (delta: -65.3MB). Peak memory consumption was 74.9MB. Max. memory is 16.1GB. * Witness Printer took 2.61ms. Allocated memory is still 161.5MB. Free memory is still 134.8MB. 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; [L125] a = __VERIFIER_nondet_uint() [L127] b = 234770789 [L129] 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)=255, \old(b)=234770789, a=255, a0=-4294967041, a1=-16777216, a2=-65536, a3=-256, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, na=4] [L59] COND TRUE a3 == (unsigned char)0 [L60] na = na - 1 VAL [\old(a)=255, \old(b)=234770789, a=255, a0=-4294967041, a1=-16777216, a2=-65536, a3=-256, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, na=3] [L61] COND TRUE a2 == (unsigned char)0 [L62] na = na - 1 VAL [\old(a)=255, \old(b)=234770789, a=255, a0=-4294967041, a1=-16777216, a2=-65536, a3=-256, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, na=2] [L63] COND TRUE a1 == (unsigned char)0 [L64] na = na - 1 VAL [\old(a)=255, \old(b)=234770789, a=255, a0=-4294967041, a1=-16777216, a2=-65536, a3=-256, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, na=1] [L68] nb = (unsigned char)4 VAL [\old(a)=255, \old(b)=234770789, a=255, a0=-4294967041, a1=-16777216, a2=-65536, a3=-256, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, na=1, nb=4] [L69] COND FALSE !(b3 == (unsigned char)0) VAL [\old(a)=255, \old(b)=234770789, a=255, a0=-4294967041, a1=-16777216, a2=-65536, a3=-256, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, na=1, nb=4] [L78] carry = (unsigned short)0 [L79] i = (unsigned char)0 VAL [\old(a)=255, \old(b)=234770789, a=255, a0=-4294967041, a1=-16777216, a2=-65536, a3=-256, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=0, na=1, nb=4] [L80] COND TRUE (i < na) || (i < nb) || (carry != (unsigned short)0) [L81] partial_sum = carry [L82] carry = (unsigned short)0 VAL [\old(a)=255, \old(b)=234770789, a=255, a0=-4294967041, a1=-16777216, a2=-65536, a3=-256, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=0, na=1, nb=4, partial_sum=0] [L83] COND TRUE i < na VAL [\old(a)=255, \old(b)=234770789, a=255, a0=-4294967041, a1=-16777216, a2=-65536, a3=-256, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=0, na=1, nb=4, partial_sum=0] [L84] COND TRUE i == (unsigned char)0 [L84] partial_sum = partial_sum + a0 VAL [\old(a)=255, \old(b)=234770789, a=255, a0=-4294967041, a1=-16777216, a2=-65536, a3=-256, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=0, na=1, nb=4, partial_sum=255] [L85] COND FALSE !(i == (unsigned char)1) VAL [\old(a)=255, \old(b)=234770789, a=255, a0=-4294967041, a1=-16777216, a2=-65536, a3=-256, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=0, na=1, nb=4, partial_sum=255] [L86] COND FALSE !(i == (unsigned char)2) VAL [\old(a)=255, \old(b)=234770789, a=255, a0=-4294967041, a1=-16777216, a2=-65536, a3=-256, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=0, na=1, nb=4, partial_sum=255] [L87] COND FALSE !(i == (unsigned char)3) VAL [\old(a)=255, \old(b)=234770789, a=255, a0=-4294967041, a1=-16777216, a2=-65536, a3=-256, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=0, na=1, nb=4, partial_sum=255] [L89] COND TRUE i < nb VAL [\old(a)=255, \old(b)=234770789, a=255, a0=-4294967041, a1=-16777216, a2=-65536, a3=-256, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=0, na=1, nb=4, partial_sum=255] [L90] COND TRUE i == (unsigned char)0 [L90] partial_sum = partial_sum + b0 VAL [\old(a)=255, \old(b)=234770789, a=255, a0=-4294967041, a1=-16777216, a2=-65536, a3=-256, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=0, na=1, nb=4, partial_sum=356] [L91] COND FALSE !(i == (unsigned char)1) VAL [\old(a)=255, \old(b)=234770789, a=255, a0=-4294967041, a1=-16777216, a2=-65536, a3=-256, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=0, na=1, nb=4, partial_sum=356] [L92] COND FALSE !(i == (unsigned char)2) VAL [\old(a)=255, \old(b)=234770789, a=255, a0=-4294967041, a1=-16777216, a2=-65536, a3=-256, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=0, na=1, nb=4, partial_sum=356] [L93] COND FALSE !(i == (unsigned char)3) VAL [\old(a)=255, \old(b)=234770789, a=255, a0=-4294967041, a1=-16777216, a2=-65536, a3=-256, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=0, na=1, nb=4, 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)=255, \old(b)=234770789, a=255, a0=-4294967041, a1=-16777216, a2=-65536, a3=-256, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=1, i=0, na=1, nb=4] [L99] COND TRUE i == (unsigned char)0 [L99] r0 = (unsigned char)partial_sum VAL [\old(a)=255, \old(b)=234770789, a=255, a0=-4294967041, a1=-16777216, a2=-65536, a3=-256, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=1, i=0, na=1, nb=4, partial_sum=20838, r0=234770790] [L100] COND FALSE !(i == (unsigned char)1) VAL [\old(a)=255, \old(b)=234770789, a=255, a0=-4294967041, a1=-16777216, a2=-65536, a3=-256, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=1, i=0, na=1, nb=4, partial_sum=20838, r0=234770790] [L101] COND FALSE !(i == (unsigned char)2) VAL [\old(a)=255, \old(b)=234770789, a=255, a0=-4294967041, a1=-16777216, a2=-65536, a3=-256, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=1, i=0, na=1, nb=4, partial_sum=20838, r0=234770790] [L102] COND FALSE !(i == (unsigned char)3) VAL [\old(a)=255, \old(b)=234770789, a=255, a0=-4294967041, a1=-16777216, a2=-65536, a3=-256, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=1, i=0, na=1, nb=4, partial_sum=20838, r0=234770790] [L104] i = i + (unsigned char)1 VAL [\old(a)=255, \old(b)=234770789, a=255, a0=-4294967041, a1=-16777216, a2=-65536, a3=-256, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=1, i=1, na=1, nb=4, 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)=255, \old(b)=234770789, a=255, a0=-4294967041, a1=-16777216, a2=-65536, a3=-256, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=1, na=1, nb=4, partial_sum=1, r0=234770790] [L83] COND FALSE !(i < na) VAL [\old(a)=255, \old(b)=234770789, a=255, a0=-4294967041, a1=-16777216, a2=-65536, a3=-256, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=1, na=1, nb=4, partial_sum=1, r0=234770790] [L89] COND TRUE i < nb VAL [\old(a)=255, \old(b)=234770789, a=255, a0=-4294967041, a1=-16777216, a2=-65536, a3=-256, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=1, na=1, nb=4, partial_sum=1, r0=234770790] [L90] COND FALSE !(i == (unsigned char)0) VAL [\old(a)=255, \old(b)=234770789, a=255, a0=-4294967041, a1=-16777216, a2=-65536, a3=-256, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=1, na=1, nb=4, partial_sum=1, r0=234770790] [L91] COND TRUE i == (unsigned char)1 [L91] partial_sum = partial_sum + b1 VAL [\old(a)=255, \old(b)=234770789, a=255, a0=-4294967041, a1=-16777216, a2=-65536, a3=-256, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=1, na=1, nb=4, partial_sum=82, r0=234770790] [L92] COND FALSE !(i == (unsigned char)2) VAL [\old(a)=255, \old(b)=234770789, a=255, a0=-4294967041, a1=-16777216, a2=-65536, a3=-256, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=1, na=1, nb=4, partial_sum=82, r0=234770790] [L93] COND FALSE !(i == (unsigned char)3) VAL [\old(a)=255, \old(b)=234770789, a=255, a0=-4294967041, a1=-16777216, a2=-65536, a3=-256, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=1, na=1, nb=4, partial_sum=82, r0=234770790] [L95] COND FALSE !(partial_sum > ((unsigned char)255)) VAL [\old(a)=255, \old(b)=234770789, a=255, a0=-4294967041, a1=-16777216, a2=-65536, a3=-256, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=1, na=1, nb=4, partial_sum=82, r0=234770790] [L99] COND FALSE !(i == (unsigned char)0) VAL [\old(a)=255, \old(b)=234770789, a=255, a0=-4294967041, a1=-16777216, a2=-65536, a3=-256, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=1, na=1, nb=4, partial_sum=82, r0=234770790] [L100] COND TRUE i == (unsigned char)1 [L100] r1 = (unsigned char)partial_sum VAL [\old(a)=255, \old(b)=234770789, a=255, a0=-4294967041, a1=-16777216, a2=-65536, a3=-256, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=1, na=1, nb=4, partial_sum=82, r0=234770790, r1=82] [L101] COND FALSE !(i == (unsigned char)2) VAL [\old(a)=255, \old(b)=234770789, a=255, a0=-4294967041, a1=-16777216, a2=-65536, a3=-256, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=1, na=1, nb=4, partial_sum=82, r0=234770790, r1=82] [L102] COND FALSE !(i == (unsigned char)3) VAL [\old(a)=255, \old(b)=234770789, a=255, a0=-4294967041, a1=-16777216, a2=-65536, a3=-256, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=1, na=1, nb=4, partial_sum=82, r0=234770790, r1=82] [L104] i = i + (unsigned char)1 VAL [\old(a)=255, \old(b)=234770789, a=255, a0=-4294967041, a1=-16777216, a2=-65536, a3=-256, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=2, na=1, nb=4, 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)=255, \old(b)=234770789, a=255, a0=-4294967041, a1=-16777216, a2=-65536, a3=-256, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=2, na=1, nb=4, partial_sum=0, r0=234770790, r1=82] [L83] COND FALSE !(i < na) VAL [\old(a)=255, \old(b)=234770789, a=255, a0=-4294967041, a1=-16777216, a2=-65536, a3=-256, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=2, na=1, nb=4, partial_sum=0, r0=234770790, r1=82] [L89] COND TRUE i < nb VAL [\old(a)=255, \old(b)=234770789, a=255, a0=-4294967041, a1=-16777216, a2=-65536, a3=-256, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=2, na=1, nb=4, partial_sum=0, r0=234770790, r1=82] [L90] COND FALSE !(i == (unsigned char)0) VAL [\old(a)=255, \old(b)=234770789, a=255, a0=-4294967041, a1=-16777216, a2=-65536, a3=-256, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=2, na=1, nb=4, partial_sum=0, r0=234770790, r1=82] [L91] COND FALSE !(i == (unsigned char)1) VAL [\old(a)=255, \old(b)=234770789, a=255, a0=-4294967041, a1=-16777216, a2=-65536, a3=-256, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=2, na=1, nb=4, partial_sum=0, r0=234770790, r1=82] [L92] COND TRUE i == (unsigned char)2 [L92] partial_sum = partial_sum + b2 VAL [\old(a)=255, \old(b)=234770789, a=255, a0=-4294967041, a1=-16777216, a2=-65536, a3=-256, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=2, na=1, nb=4, partial_sum=254, r0=234770790, r1=82] [L93] COND FALSE !(i == (unsigned char)3) VAL [\old(a)=255, \old(b)=234770789, a=255, a0=-4294967041, a1=-16777216, a2=-65536, a3=-256, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=2, na=1, nb=4, partial_sum=254, r0=234770790, r1=82] [L95] COND FALSE !(partial_sum > ((unsigned char)255)) VAL [\old(a)=255, \old(b)=234770789, a=255, a0=-4294967041, a1=-16777216, a2=-65536, a3=-256, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=2, na=1, nb=4, partial_sum=254, r0=234770790, r1=82] [L99] COND FALSE !(i == (unsigned char)0) VAL [\old(a)=255, \old(b)=234770789, a=255, a0=-4294967041, a1=-16777216, a2=-65536, a3=-256, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=2, na=1, nb=4, partial_sum=254, r0=234770790, r1=82] [L100] COND FALSE !(i == (unsigned char)1) VAL [\old(a)=255, \old(b)=234770789, a=255, a0=-4294967041, a1=-16777216, a2=-65536, a3=-256, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=2, na=1, nb=4, partial_sum=254, r0=234770790, r1=82] [L101] COND TRUE i == (unsigned char)2 [L101] r2 = (unsigned char)partial_sum VAL [\old(a)=255, \old(b)=234770789, a=255, a0=-4294967041, a1=-16777216, a2=-65536, a3=-256, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=2, na=1, nb=4, partial_sum=254, r0=234770790, r1=82, r2=254] [L102] COND FALSE !(i == (unsigned char)3) VAL [\old(a)=255, \old(b)=234770789, a=255, a0=-4294967041, a1=-16777216, a2=-65536, a3=-256, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=2, na=1, nb=4, partial_sum=254, r0=234770790, r1=82, r2=254] [L104] i = i + (unsigned char)1 VAL [\old(a)=255, \old(b)=234770789, a=255, a0=-4294967041, a1=-16777216, a2=-65536, a3=-256, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=3, na=1, nb=4, 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)=255, \old(b)=234770789, a=255, a0=-4294967041, a1=-16777216, a2=-65536, a3=-256, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=3, na=1, nb=4, partial_sum=0, r0=234770790, r1=82, r2=254] [L83] COND FALSE !(i < na) VAL [\old(a)=255, \old(b)=234770789, a=255, a0=-4294967041, a1=-16777216, a2=-65536, a3=-256, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=3, na=1, nb=4, partial_sum=0, r0=234770790, r1=82, r2=254] [L89] COND TRUE i < nb VAL [\old(a)=255, \old(b)=234770789, a=255, a0=-4294967041, a1=-16777216, a2=-65536, a3=-256, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=3, na=1, nb=4, partial_sum=0, r0=234770790, r1=82, r2=254] [L90] COND FALSE !(i == (unsigned char)0) VAL [\old(a)=255, \old(b)=234770789, a=255, a0=-4294967041, a1=-16777216, a2=-65536, a3=-256, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=3, na=1, nb=4, partial_sum=0, r0=234770790, r1=82, r2=254] [L91] COND FALSE !(i == (unsigned char)1) VAL [\old(a)=255, \old(b)=234770789, a=255, a0=-4294967041, a1=-16777216, a2=-65536, a3=-256, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=3, na=1, nb=4, partial_sum=0, r0=234770790, r1=82, r2=254] [L92] COND FALSE !(i == (unsigned char)2) VAL [\old(a)=255, \old(b)=234770789, a=255, a0=-4294967041, a1=-16777216, a2=-65536, a3=-256, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=3, na=1, nb=4, partial_sum=0, r0=234770790, r1=82, r2=254] [L93] COND TRUE i == (unsigned char)3 [L93] partial_sum = partial_sum + b3 VAL [\old(a)=255, \old(b)=234770789, a=255, a0=-4294967041, a1=-16777216, a2=-65536, a3=-256, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=3, na=1, nb=4, partial_sum=13, r0=234770790, r1=82, r2=254] [L95] COND FALSE !(partial_sum > ((unsigned char)255)) VAL [\old(a)=255, \old(b)=234770789, a=255, a0=-4294967041, a1=-16777216, a2=-65536, a3=-256, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=3, na=1, nb=4, partial_sum=13, r0=234770790, r1=82, r2=254] [L99] COND FALSE !(i == (unsigned char)0) VAL [\old(a)=255, \old(b)=234770789, a=255, a0=-4294967041, a1=-16777216, a2=-65536, a3=-256, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=3, na=1, nb=4, partial_sum=13, r0=234770790, r1=82, r2=254] [L100] COND FALSE !(i == (unsigned char)1) VAL [\old(a)=255, \old(b)=234770789, a=255, a0=-4294967041, a1=-16777216, a2=-65536, a3=-256, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=3, na=1, nb=4, partial_sum=13, r0=234770790, r1=82, r2=254] [L101] COND FALSE !(i == (unsigned char)2) VAL [\old(a)=255, \old(b)=234770789, a=255, a0=-4294967041, a1=-16777216, a2=-65536, a3=-256, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=3, na=1, nb=4, 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)=255, \old(b)=234770789, a=255, a0=-4294967041, a1=-16777216, a2=-65536, a3=-256, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=3, na=1, nb=4, partial_sum=13, r0=234770790, r1=82, r2=254, r3=13] [L104] i = i + (unsigned char)1 VAL [\old(a)=255, \old(b)=234770789, a=255, a0=-4294967041, a1=-16777216, a2=-65536, a3=-256, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=4, na=1, nb=4, 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)=255, \old(b)=234770789, a=255, a0=-4294967041, a1=-16777216, a2=-65536, a3=-256, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=4, na=1, nb=4, partial_sum=13, r0=234770790, r1=82, r2=254, r3=13] [L107] COND FALSE !(i < (unsigned char)4) VAL [\old(a)=255, \old(b)=234770789, a=255, a0=-4294967041, a1=-16777216, a2=-65536, a3=-256, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=4, na=1, nb=4, 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)=255, \old(b)=234770789, \result=3, a=255, a0=-4294967041, a1=-16777216, a2=-65536, a3=-256, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=4, na=1, nb=4, partial_sum=13, r=3, r0=234770790, r1=82, r2=254, r3=13] [L129] RET, EXPR mp_add(a, b) [L129] r = mp_add(a, b) [L131] 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: 7.0s, OverallIterations: 16, TraceHistogramMax: 4, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 2.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1591 SdHoareTripleChecker+Valid, 1.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1591 mSDsluCounter, 2047 SdHoareTripleChecker+Invalid, 1.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1231 mSDsCounter, 218 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2043 IncrementalHoareTripleChecker+Invalid, 2261 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 218 mSolverCounterUnsat, 816 mSDtfsCounter, 2043 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 440 GetRequests, 360 SyntacticMatches, 6 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=937occurred in iteration=14, InterpolantAutomatonStates: 82, 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, 15 MinimizatonAttempts, 2071 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 2.2s InterpolantComputationTime, 861 NumberOfCodeBlocks, 861 NumberOfCodeBlocksAsserted, 20 NumberOfCheckSat, 908 ConstructedInterpolants, 0 QuantifiedInterpolants, 3186 SizeOfPredicates, 14 NumberOfNonLiveVariables, 587 ConjunctsInSsa, 34 ConjunctsInUnsatCore, 21 InterpolantComputations, 13 PerfectInterpolantSequences, 780/805 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-15 21:55:45,761 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_2-2.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 de6decccd91c37b79cf607a5f07869bb0707e08de203e3ce6759a25f4e6e01ba --- Real Ultimate output --- This is Ultimate 0.2.2-tmp.no-commuhash-c3fed41 [2021-12-15 21:55:47,587 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-15 21:55:47,588 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-15 21:55:47,606 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-15 21:55:47,609 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-15 21:55:47,611 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-15 21:55:47,613 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-15 21:55:47,615 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-15 21:55:47,616 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-15 21:55:47,617 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-15 21:55:47,618 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-15 21:55:47,618 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-15 21:55:47,619 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-15 21:55:47,619 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-15 21:55:47,620 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-15 21:55:47,621 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-15 21:55:47,621 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-15 21:55:47,622 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-15 21:55:47,623 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-15 21:55:47,624 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-15 21:55:47,625 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-15 21:55:47,626 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-15 21:55:47,627 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-15 21:55:47,627 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-15 21:55:47,629 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-15 21:55:47,629 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-15 21:55:47,629 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-15 21:55:47,630 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-15 21:55:47,646 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-15 21:55:47,647 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-15 21:55:47,648 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-15 21:55:47,648 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-15 21:55:47,649 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-15 21:55:47,649 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-15 21:55:47,650 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-15 21:55:47,650 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-15 21:55:47,650 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-15 21:55:47,651 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-15 21:55:47,651 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-15 21:55:47,651 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-15 21:55:47,652 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-15 21:55:47,653 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2021-12-15 21:55:47,688 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-15 21:55:47,688 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-15 21:55:47,689 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-15 21:55:47,689 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-15 21:55:47,690 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-15 21:55:47,690 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-15 21:55:47,691 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-15 21:55:47,691 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-15 21:55:47,691 INFO L138 SettingsManager]: * Use SBE=true [2021-12-15 21:55:47,691 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-15 21:55:47,692 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-15 21:55:47,692 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-15 21:55:47,692 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-15 21:55:47,693 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-12-15 21:55:47,693 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-15 21:55:47,693 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-12-15 21:55:47,693 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-12-15 21:55:47,693 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2021-12-15 21:55:47,693 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2021-12-15 21:55:47,693 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-15 21:55:47,694 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-12-15 21:55:47,694 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-15 21:55:47,694 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-12-15 21:55:47,694 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-15 21:55:47,694 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-15 21:55:47,694 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-15 21:55:47,695 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-15 21:55:47,695 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-15 21:55:47,695 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-15 21:55:47,695 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-12-15 21:55:47,695 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2021-12-15 21:55:47,695 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2021-12-15 21:55:47,696 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-12-15 21:55:47,696 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-12-15 21:55:47,696 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-12-15 21:55:47,696 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-15 21:55:47,696 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-12-15 21:55:47,696 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 -> de6decccd91c37b79cf607a5f07869bb0707e08de203e3ce6759a25f4e6e01ba [2021-12-15 21:55:47,932 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-15 21:55:47,948 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-15 21:55:47,951 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-15 21:55:47,952 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-15 21:55:47,952 INFO L275 PluginConnector]: CDTParser initialized [2021-12-15 21:55:47,953 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/bitvector/byte_add_2-2.i [2021-12-15 21:55:47,995 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d29e2c963/2d0b26bf688a40aab212003abeeb682e/FLAGc5e16015b [2021-12-15 21:55:48,368 INFO L306 CDTParser]: Found 1 translation units. [2021-12-15 21:55:48,368 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/byte_add_2-2.i [2021-12-15 21:55:48,375 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d29e2c963/2d0b26bf688a40aab212003abeeb682e/FLAGc5e16015b [2021-12-15 21:55:48,392 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d29e2c963/2d0b26bf688a40aab212003abeeb682e [2021-12-15 21:55:48,393 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-15 21:55:48,395 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-15 21:55:48,397 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-15 21:55:48,397 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-15 21:55:48,400 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-15 21:55:48,400 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.12 09:55:48" (1/1) ... [2021-12-15 21:55:48,401 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1b2bf17c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:55:48, skipping insertion in model container [2021-12-15 21:55:48,401 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.12 09:55:48" (1/1) ... [2021-12-15 21:55:48,405 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-15 21:55:48,432 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-15 21:55:48,525 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_2-2.i[1168,1181] [2021-12-15 21:55:48,546 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-15 21:55:48,565 INFO L203 MainTranslator]: Completed pre-run [2021-12-15 21:55:48,585 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_2-2.i[1168,1181] [2021-12-15 21:55:48,613 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-15 21:55:48,625 INFO L208 MainTranslator]: Completed translation [2021-12-15 21:55:48,626 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:55:48 WrapperNode [2021-12-15 21:55:48,626 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-15 21:55:48,627 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-15 21:55:48,627 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-15 21:55:48,627 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-15 21:55:48,631 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:55:48" (1/1) ... [2021-12-15 21:55:48,644 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:55:48" (1/1) ... [2021-12-15 21:55:48,667 INFO L137 Inliner]: procedures = 16, calls = 8, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 123 [2021-12-15 21:55:48,667 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-15 21:55:48,668 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-15 21:55:48,669 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-15 21:55:48,669 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-15 21:55:48,675 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:55:48" (1/1) ... [2021-12-15 21:55:48,675 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:55:48" (1/1) ... [2021-12-15 21:55:48,685 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:55:48" (1/1) ... [2021-12-15 21:55:48,685 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:55:48" (1/1) ... [2021-12-15 21:55:48,700 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:55:48" (1/1) ... [2021-12-15 21:55:48,704 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:55:48" (1/1) ... [2021-12-15 21:55:48,706 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:55:48" (1/1) ... [2021-12-15 21:55:48,711 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-15 21:55:48,711 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-15 21:55:48,711 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-15 21:55:48,712 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-15 21:55:48,712 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:55:48" (1/1) ... [2021-12-15 21:55:48,718 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-15 21:55:48,725 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 21:55:48,753 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-15 21:55:48,788 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-15 21:55:48,806 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-15 21:55:48,806 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2021-12-15 21:55:48,807 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-15 21:55:48,808 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-15 21:55:48,867 INFO L236 CfgBuilder]: Building ICFG [2021-12-15 21:55:48,868 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-15 21:55:49,118 INFO L277 CfgBuilder]: Performing block encoding [2021-12-15 21:55:49,122 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-15 21:55:49,122 INFO L301 CfgBuilder]: Removed 2 assume(true) statements. [2021-12-15 21:55:49,123 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.12 09:55:49 BoogieIcfgContainer [2021-12-15 21:55:49,123 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-15 21:55:49,124 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-12-15 21:55:49,124 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-12-15 21:55:49,139 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-12-15 21:55:49,140 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.12 09:55:48" (1/3) ... [2021-12-15 21:55:49,140 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@274dd337 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.12 09:55:49, skipping insertion in model container [2021-12-15 21:55:49,140 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:55:48" (2/3) ... [2021-12-15 21:55:49,141 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@274dd337 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.12 09:55:49, skipping insertion in model container [2021-12-15 21:55:49,141 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.12 09:55:49" (3/3) ... [2021-12-15 21:55:49,142 INFO L111 eAbstractionObserver]: Analyzing ICFG byte_add_2-2.i [2021-12-15 21:55:49,145 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-12-15 21:55:49,145 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-12-15 21:55:49,192 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-12-15 21:55:49,204 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-15 21:55:49,204 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-12-15 21:55:49,223 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-15 21:55:49,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2021-12-15 21:55:49,227 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 21:55:49,228 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 21:55:49,228 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-15 21:55:49,232 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 21:55:49,232 INFO L85 PathProgramCache]: Analyzing trace with hash 255061167, now seen corresponding path program 1 times [2021-12-15 21:55:49,240 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-15 21:55:49,240 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [242994696] [2021-12-15 21:55:49,240 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 21:55:49,241 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-15 21:55:49,241 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-15 21:55:49,258 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-15 21:55:49,262 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-15 21:55:49,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 21:55:49,336 INFO L263 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 1 conjunts are in the unsatisfiable core [2021-12-15 21:55:49,338 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 21:55:49,381 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-15 21:55:49,381 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-15 21:55:49,382 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-15 21:55:49,382 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [242994696] [2021-12-15 21:55:49,382 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [242994696] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 21:55:49,388 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 21:55:49,388 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-15 21:55:49,389 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2019498752] [2021-12-15 21:55:49,390 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 21:55:49,392 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2021-12-15 21:55:49,392 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-15 21:55:49,414 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-12-15 21:55:49,415 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-12-15 21:55:49,416 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-15 21:55:49,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 21:55:49,426 INFO L93 Difference]: Finished difference Result 57 states and 92 transitions. [2021-12-15 21:55:49,433 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-12-15 21:55:49,435 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-15 21:55:49,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 21:55:49,441 INFO L225 Difference]: With dead ends: 57 [2021-12-15 21:55:49,441 INFO L226 Difference]: Without dead ends: 38 [2021-12-15 21:55:49,444 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-15 21:55:49,447 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-15 21:55:49,447 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-15 21:55:49,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2021-12-15 21:55:49,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2021-12-15 21:55:49,473 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-15 21:55:49,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 64 transitions. [2021-12-15 21:55:49,474 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 64 transitions. Word has length 12 [2021-12-15 21:55:49,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 21:55:49,475 INFO L470 AbstractCegarLoop]: Abstraction has 38 states and 64 transitions. [2021-12-15 21:55:49,475 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-15 21:55:49,475 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 64 transitions. [2021-12-15 21:55:49,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2021-12-15 21:55:49,477 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 21:55:49,477 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 21:55:49,486 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Ended with exit code 0 [2021-12-15 21:55:49,688 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-15 21:55:49,688 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-15 21:55:49,689 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 21:55:49,689 INFO L85 PathProgramCache]: Analyzing trace with hash 1803477009, now seen corresponding path program 1 times [2021-12-15 21:55:49,689 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-15 21:55:49,689 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1323118932] [2021-12-15 21:55:49,689 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 21:55:49,689 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-15 21:55:49,690 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-15 21:55:49,690 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-15 21:55:49,694 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-15 21:55:49,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 21:55:49,718 INFO L263 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 3 conjunts are in the unsatisfiable core [2021-12-15 21:55:49,719 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 21:55:49,761 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-15 21:55:49,761 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-15 21:55:49,762 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-15 21:55:49,762 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1323118932] [2021-12-15 21:55:49,762 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1323118932] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 21:55:49,762 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 21:55:49,762 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-15 21:55:49,762 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [898932297] [2021-12-15 21:55:49,762 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 21:55:49,763 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-15 21:55:49,763 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-15 21:55:49,763 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-15 21:55:49,764 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-12-15 21:55:49,764 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-15 21:55:49,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 21:55:49,931 INFO L93 Difference]: Finished difference Result 116 states and 201 transitions. [2021-12-15 21:55:49,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-15 21:55:49,931 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-15 21:55:49,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 21:55:49,932 INFO L225 Difference]: With dead ends: 116 [2021-12-15 21:55:49,932 INFO L226 Difference]: Without dead ends: 88 [2021-12-15 21:55:49,933 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-15 21:55:49,934 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.2s IncrementalHoareTripleChecker+Time [2021-12-15 21:55:49,934 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.2s Time] [2021-12-15 21:55:49,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2021-12-15 21:55:49,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 81. [2021-12-15 21:55:49,940 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-15 21:55:49,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 130 transitions. [2021-12-15 21:55:49,941 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 130 transitions. Word has length 12 [2021-12-15 21:55:49,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 21:55:49,942 INFO L470 AbstractCegarLoop]: Abstraction has 81 states and 130 transitions. [2021-12-15 21:55:49,942 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-15 21:55:49,942 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 130 transitions. [2021-12-15 21:55:49,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2021-12-15 21:55:49,942 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 21:55:49,942 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 21:55:49,958 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-15 21:55:50,148 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-15 21:55:50,148 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-15 21:55:50,149 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 21:55:50,149 INFO L85 PathProgramCache]: Analyzing trace with hash -1087802014, now seen corresponding path program 1 times [2021-12-15 21:55:50,150 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-15 21:55:50,150 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2081782070] [2021-12-15 21:55:50,150 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 21:55:50,150 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-15 21:55:50,150 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-15 21:55:50,151 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-15 21:55:50,158 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-15 21:55:50,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 21:55:50,179 INFO L263 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 5 conjunts are in the unsatisfiable core [2021-12-15 21:55:50,180 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 21:55:50,206 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-15 21:55:50,206 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-15 21:55:50,207 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-15 21:55:50,207 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2081782070] [2021-12-15 21:55:50,207 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2081782070] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 21:55:50,207 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 21:55:50,207 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-15 21:55:50,207 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [361603510] [2021-12-15 21:55:50,208 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 21:55:50,208 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-15 21:55:50,208 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-15 21:55:50,208 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-15 21:55:50,209 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-15 21:55:50,209 INFO L87 Difference]: Start difference. First operand 81 states and 130 transitions. Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 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-15 21:55:50,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 21:55:50,215 INFO L93 Difference]: Finished difference Result 86 states and 134 transitions. [2021-12-15 21:55:50,218 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-15 21:55:50,218 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 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-15 21:55:50,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 21:55:50,219 INFO L225 Difference]: With dead ends: 86 [2021-12-15 21:55:50,219 INFO L226 Difference]: Without dead ends: 55 [2021-12-15 21:55:50,219 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 11 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-15 21:55:50,220 INFO L933 BasicCegarLoop]: 57 mSDtfsCounter, 55 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 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-15 21:55:50,220 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [55 Valid, 58 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-15 21:55:50,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2021-12-15 21:55:50,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2021-12-15 21:55:50,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 54 states have (on average 1.4814814814814814) internal successors, (80), 54 states have internal predecessors, (80), 0 states have call successors, (0), 0 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-15 21:55:50,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 80 transitions. [2021-12-15 21:55:50,226 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 80 transitions. Word has length 13 [2021-12-15 21:55:50,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 21:55:50,226 INFO L470 AbstractCegarLoop]: Abstraction has 55 states and 80 transitions. [2021-12-15 21:55:50,226 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 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-15 21:55:50,226 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 80 transitions. [2021-12-15 21:55:50,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-12-15 21:55:50,227 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 21:55:50,227 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-15 21:55:50,235 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Ended with exit code 0 [2021-12-15 21:55:50,433 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-15 21:55:50,433 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-15 21:55:50,434 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 21:55:50,434 INFO L85 PathProgramCache]: Analyzing trace with hash 1480128500, now seen corresponding path program 1 times [2021-12-15 21:55:50,435 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-15 21:55:50,435 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [388631351] [2021-12-15 21:55:50,435 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 21:55:50,435 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-15 21:55:50,436 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-15 21:55:50,437 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-15 21:55:50,438 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-15 21:55:50,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 21:55:50,466 INFO L263 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 3 conjunts are in the unsatisfiable core [2021-12-15 21:55:50,467 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 21:55:50,517 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-15 21:55:50,518 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-15 21:55:50,518 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-15 21:55:50,518 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [388631351] [2021-12-15 21:55:50,518 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [388631351] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 21:55:50,519 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 21:55:50,519 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-15 21:55:50,519 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1469090776] [2021-12-15 21:55:50,519 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 21:55:50,519 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-15 21:55:50,520 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-15 21:55:50,520 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-15 21:55:50,520 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-12-15 21:55:50,520 INFO L87 Difference]: Start difference. First operand 55 states and 80 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-15 21:55:50,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 21:55:50,616 INFO L93 Difference]: Finished difference Result 151 states and 219 transitions. [2021-12-15 21:55:50,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-15 21:55:50,616 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-15 21:55:50,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 21:55:50,617 INFO L225 Difference]: With dead ends: 151 [2021-12-15 21:55:50,617 INFO L226 Difference]: Without dead ends: 107 [2021-12-15 21:55:50,618 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-15 21:55:50,618 INFO L933 BasicCegarLoop]: 78 mSDtfsCounter, 65 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 115 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 146 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-15 21:55:50,619 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [65 Valid, 146 Invalid, 121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 115 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-15 21:55:50,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2021-12-15 21:55:50,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 60. [2021-12-15 21:55:50,623 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-15 21:55:50,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 85 transitions. [2021-12-15 21:55:50,624 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 85 transitions. Word has length 25 [2021-12-15 21:55:50,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 21:55:50,624 INFO L470 AbstractCegarLoop]: Abstraction has 60 states and 85 transitions. [2021-12-15 21:55:50,624 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-15 21:55:50,625 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 85 transitions. [2021-12-15 21:55:50,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2021-12-15 21:55:50,625 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 21:55:50,625 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-15 21:55:50,637 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-15 21:55:50,832 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-15 21:55:50,832 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-15 21:55:50,833 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 21:55:50,833 INFO L85 PathProgramCache]: Analyzing trace with hash -1384042382, now seen corresponding path program 1 times [2021-12-15 21:55:50,833 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-15 21:55:50,833 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1267207818] [2021-12-15 21:55:50,836 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 21:55:50,837 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-15 21:55:50,837 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-15 21:55:50,843 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-15 21:55:50,844 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-15 21:55:50,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 21:55:50,883 INFO L263 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 4 conjunts are in the unsatisfiable core [2021-12-15 21:55:50,884 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 21:55:50,952 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-15 21:55:50,953 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-15 21:55:50,953 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-15 21:55:50,953 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1267207818] [2021-12-15 21:55:50,953 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1267207818] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 21:55:50,953 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 21:55:50,953 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-15 21:55:50,954 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2038303406] [2021-12-15 21:55:50,954 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 21:55:50,954 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-15 21:55:50,954 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-15 21:55:50,955 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-15 21:55:50,955 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-12-15 21:55:50,955 INFO L87 Difference]: Start difference. First operand 60 states and 85 transitions. Second operand has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 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-15 21:55:51,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 21:55:51,033 INFO L93 Difference]: Finished difference Result 201 states and 290 transitions. [2021-12-15 21:55:51,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-15 21:55:51,034 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 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-15 21:55:51,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 21:55:51,035 INFO L225 Difference]: With dead ends: 201 [2021-12-15 21:55:51,035 INFO L226 Difference]: Without dead ends: 157 [2021-12-15 21:55:51,036 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 22 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-15 21:55:51,036 INFO L933 BasicCegarLoop]: 124 mSDtfsCounter, 140 mSDsluCounter, 171 mSDsCounter, 0 mSdLazyCounter, 103 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 140 SdHoareTripleChecker+Valid, 295 SdHoareTripleChecker+Invalid, 109 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-15 21:55:51,037 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [140 Valid, 295 Invalid, 109 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 103 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-15 21:55:51,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2021-12-15 21:55:51,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 60. [2021-12-15 21:55:51,041 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-15 21:55:51,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 85 transitions. [2021-12-15 21:55:51,042 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 85 transitions. Word has length 26 [2021-12-15 21:55:51,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 21:55:51,042 INFO L470 AbstractCegarLoop]: Abstraction has 60 states and 85 transitions. [2021-12-15 21:55:51,042 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 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-15 21:55:51,042 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 85 transitions. [2021-12-15 21:55:51,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-12-15 21:55:51,043 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 21:55:51,043 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] [2021-12-15 21:55:51,053 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-15 21:55:51,249 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-15 21:55:51,250 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-15 21:55:51,250 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 21:55:51,250 INFO L85 PathProgramCache]: Analyzing trace with hash 1985045161, now seen corresponding path program 1 times [2021-12-15 21:55:51,250 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-15 21:55:51,251 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1420322035] [2021-12-15 21:55:51,251 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 21:55:51,251 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-15 21:55:51,251 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-15 21:55:51,252 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-15 21:55:51,253 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-15 21:55:51,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 21:55:51,278 INFO L263 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 6 conjunts are in the unsatisfiable core [2021-12-15 21:55:51,279 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 21:55:51,340 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 21:55:51,341 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-15 21:55:51,341 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-15 21:55:51,341 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1420322035] [2021-12-15 21:55:51,341 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1420322035] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 21:55:51,341 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 21:55:51,342 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-15 21:55:51,342 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1697127684] [2021-12-15 21:55:51,342 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 21:55:51,342 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-15 21:55:51,342 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-15 21:55:51,343 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-15 21:55:51,343 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-12-15 21:55:51,343 INFO L87 Difference]: Start difference. First operand 60 states and 85 transitions. Second operand has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 7 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 21:55:51,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 21:55:51,435 INFO L93 Difference]: Finished difference Result 248 states and 355 transitions. [2021-12-15 21:55:51,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-15 21:55:51,436 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 7 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2021-12-15 21:55:51,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 21:55:51,437 INFO L225 Difference]: With dead ends: 248 [2021-12-15 21:55:51,437 INFO L226 Difference]: Without dead ends: 204 [2021-12-15 21:55:51,437 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 21 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-15 21:55:51,438 INFO L933 BasicCegarLoop]: 171 mSDtfsCounter, 236 mSDsluCounter, 519 mSDsCounter, 0 mSdLazyCounter, 182 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 236 SdHoareTripleChecker+Valid, 690 SdHoareTripleChecker+Invalid, 189 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 182 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-15 21:55:51,438 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [236 Valid, 690 Invalid, 189 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 182 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-15 21:55:51,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2021-12-15 21:55:51,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 92. [2021-12-15 21:55:51,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 91 states have (on average 1.4285714285714286) internal successors, (130), 91 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-15 21:55:51,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 130 transitions. [2021-12-15 21:55:51,449 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 130 transitions. Word has length 27 [2021-12-15 21:55:51,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 21:55:51,449 INFO L470 AbstractCegarLoop]: Abstraction has 92 states and 130 transitions. [2021-12-15 21:55:51,449 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 7 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 21:55:51,450 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 130 transitions. [2021-12-15 21:55:51,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-12-15 21:55:51,450 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 21:55:51,450 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] [2021-12-15 21:55:51,458 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-15 21:55:51,651 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-15 21:55:51,651 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-15 21:55:51,652 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 21:55:51,652 INFO L85 PathProgramCache]: Analyzing trace with hash 179606827, now seen corresponding path program 1 times [2021-12-15 21:55:51,652 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-15 21:55:51,652 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [821280431] [2021-12-15 21:55:51,652 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 21:55:51,652 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-15 21:55:51,652 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-15 21:55:51,653 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-15 21:55:51,655 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-15 21:55:51,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 21:55:51,683 INFO L263 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 5 conjunts are in the unsatisfiable core [2021-12-15 21:55:51,684 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 21:55:51,747 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-15 21:55:51,747 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-15 21:55:51,747 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-15 21:55:51,748 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [821280431] [2021-12-15 21:55:51,748 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [821280431] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 21:55:51,748 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 21:55:51,748 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-15 21:55:51,748 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1471384956] [2021-12-15 21:55:51,748 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 21:55:51,748 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-15 21:55:51,748 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-15 21:55:51,749 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-15 21:55:51,749 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-12-15 21:55:51,749 INFO L87 Difference]: Start difference. First operand 92 states and 130 transitions. Second operand has 6 states, 6 states have (on average 4.5) internal successors, (27), 6 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 21:55:51,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 21:55:51,834 INFO L93 Difference]: Finished difference Result 247 states and 352 transitions. [2021-12-15 21:55:51,834 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-15 21:55:51,835 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.5) internal successors, (27), 6 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2021-12-15 21:55:51,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 21:55:51,836 INFO L225 Difference]: With dead ends: 247 [2021-12-15 21:55:51,836 INFO L226 Difference]: Without dead ends: 203 [2021-12-15 21:55:51,836 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 22 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-15 21:55:51,837 INFO L933 BasicCegarLoop]: 128 mSDtfsCounter, 192 mSDsluCounter, 264 mSDsCounter, 0 mSdLazyCounter, 141 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 192 SdHoareTripleChecker+Valid, 392 SdHoareTripleChecker+Invalid, 147 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 141 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-15 21:55:51,837 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [192 Valid, 392 Invalid, 147 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 141 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-15 21:55:51,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2021-12-15 21:55:51,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 87. [2021-12-15 21:55:51,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 86 states have (on average 1.441860465116279) internal successors, (124), 86 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 21:55:51,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 124 transitions. [2021-12-15 21:55:51,843 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 124 transitions. Word has length 27 [2021-12-15 21:55:51,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 21:55:51,843 INFO L470 AbstractCegarLoop]: Abstraction has 87 states and 124 transitions. [2021-12-15 21:55:51,843 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.5) internal successors, (27), 6 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 21:55:51,843 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 124 transitions. [2021-12-15 21:55:51,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-12-15 21:55:51,844 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 21:55:51,844 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-15 21:55:51,863 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-15 21:55:52,064 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-15 21:55:52,064 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-15 21:55:52,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 21:55:52,069 INFO L85 PathProgramCache]: Analyzing trace with hash 221982208, now seen corresponding path program 1 times [2021-12-15 21:55:52,069 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-15 21:55:52,069 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2053620319] [2021-12-15 21:55:52,069 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 21:55:52,069 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-15 21:55:52,070 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-15 21:55:52,071 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-15 21:55:52,074 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-15 21:55:52,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 21:55:52,098 INFO L263 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 2 conjunts are in the unsatisfiable core [2021-12-15 21:55:52,099 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 21:55:52,134 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-15 21:55:52,134 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-15 21:55:52,135 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-15 21:55:52,135 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2053620319] [2021-12-15 21:55:52,135 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2053620319] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 21:55:52,135 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 21:55:52,135 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-15 21:55:52,135 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [444736940] [2021-12-15 21:55:52,135 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 21:55:52,135 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-15 21:55:52,135 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-15 21:55:52,136 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-15 21:55:52,136 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-15 21:55:52,136 INFO L87 Difference]: Start difference. First operand 87 states and 124 transitions. Second operand has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 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-15 21:55:52,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 21:55:52,142 INFO L93 Difference]: Finished difference Result 121 states and 172 transitions. [2021-12-15 21:55:52,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-15 21:55:52,142 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 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-15 21:55:52,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 21:55:52,143 INFO L225 Difference]: With dead ends: 121 [2021-12-15 21:55:52,143 INFO L226 Difference]: Without dead ends: 107 [2021-12-15 21:55:52,143 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 27 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-15 21:55:52,143 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-15 21:55:52,144 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-15 21:55:52,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2021-12-15 21:55:52,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2021-12-15 21:55:52,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 106 states have (on average 1.4339622641509433) internal successors, (152), 106 states have internal predecessors, (152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 21:55:52,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 152 transitions. [2021-12-15 21:55:52,152 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 152 transitions. Word has length 29 [2021-12-15 21:55:52,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 21:55:52,152 INFO L470 AbstractCegarLoop]: Abstraction has 107 states and 152 transitions. [2021-12-15 21:55:52,152 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 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-15 21:55:52,152 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 152 transitions. [2021-12-15 21:55:52,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-12-15 21:55:52,153 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 21:55:52,153 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-15 21:55:52,174 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-15 21:55:52,359 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-15 21:55:52,359 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-15 21:55:52,360 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 21:55:52,360 INFO L85 PathProgramCache]: Analyzing trace with hash 480147646, now seen corresponding path program 1 times [2021-12-15 21:55:52,360 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-15 21:55:52,360 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [166443747] [2021-12-15 21:55:52,360 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 21:55:52,361 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-15 21:55:52,361 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-15 21:55:52,361 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-15 21:55:52,363 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-15 21:55:52,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 21:55:52,386 INFO L263 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 4 conjunts are in the unsatisfiable core [2021-12-15 21:55:52,386 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 21:55:52,475 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-15 21:55:52,476 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-15 21:55:52,476 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-15 21:55:52,476 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [166443747] [2021-12-15 21:55:52,476 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [166443747] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 21:55:52,476 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 21:55:52,476 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-15 21:55:52,476 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [163753663] [2021-12-15 21:55:52,476 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 21:55:52,477 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-15 21:55:52,477 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-15 21:55:52,477 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-15 21:55:52,477 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-12-15 21:55:52,477 INFO L87 Difference]: Start difference. First operand 107 states and 152 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-15 21:55:52,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 21:55:52,527 INFO L93 Difference]: Finished difference Result 131 states and 182 transitions. [2021-12-15 21:55:52,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-15 21:55:52,527 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-15 21:55:52,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 21:55:52,528 INFO L225 Difference]: With dead ends: 131 [2021-12-15 21:55:52,528 INFO L226 Difference]: Without dead ends: 117 [2021-12-15 21:55:52,528 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-15 21:55:52,529 INFO L933 BasicCegarLoop]: 37 mSDtfsCounter, 60 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 122 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 54 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-15 21:55:52,529 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [60 Valid, 65 Invalid, 122 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 62 Invalid, 0 Unknown, 54 Unchecked, 0.0s Time] [2021-12-15 21:55:52,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2021-12-15 21:55:52,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 99. [2021-12-15 21:55:52,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 98 states have (on average 1.469387755102041) internal successors, (144), 98 states have internal predecessors, (144), 0 states have call successors, (0), 0 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-15 21:55:52,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 144 transitions. [2021-12-15 21:55:52,533 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 144 transitions. Word has length 29 [2021-12-15 21:55:52,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 21:55:52,534 INFO L470 AbstractCegarLoop]: Abstraction has 99 states and 144 transitions. [2021-12-15 21:55:52,534 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-15 21:55:52,534 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 144 transitions. [2021-12-15 21:55:52,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-12-15 21:55:52,535 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 21:55:52,535 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 21:55:52,542 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-15 21:55:52,741 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-15 21:55:52,742 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-15 21:55:52,742 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 21:55:52,742 INFO L85 PathProgramCache]: Analyzing trace with hash -1685904077, now seen corresponding path program 1 times [2021-12-15 21:55:52,743 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-15 21:55:52,743 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1366191729] [2021-12-15 21:55:52,743 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 21:55:52,743 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-15 21:55:52,743 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-15 21:55:52,744 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-15 21:55:52,747 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-15 21:55:52,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 21:55:52,793 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 4 conjunts are in the unsatisfiable core [2021-12-15 21:55:52,799 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 21:55:52,896 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 21:55:52,896 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-15 21:55:52,896 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-15 21:55:52,896 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1366191729] [2021-12-15 21:55:52,896 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1366191729] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 21:55:52,896 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 21:55:52,896 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-15 21:55:52,897 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [498168393] [2021-12-15 21:55:52,897 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 21:55:52,897 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-15 21:55:52,897 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-15 21:55:52,898 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-15 21:55:52,898 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-12-15 21:55:52,898 INFO L87 Difference]: Start difference. First operand 99 states and 144 transitions. Second operand has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 21:55:52,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 21:55:52,923 INFO L93 Difference]: Finished difference Result 182 states and 256 transitions. [2021-12-15 21:55:52,924 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-15 21:55:52,924 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2021-12-15 21:55:52,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 21:55:52,924 INFO L225 Difference]: With dead ends: 182 [2021-12-15 21:55:52,924 INFO L226 Difference]: Without dead ends: 122 [2021-12-15 21:55:52,924 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 34 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-12-15 21:55:52,925 INFO L933 BasicCegarLoop]: 43 mSDtfsCounter, 33 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 102 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 41 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-15 21:55:52,926 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [33 Valid, 102 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 26 Invalid, 0 Unknown, 41 Unchecked, 0.0s Time] [2021-12-15 21:55:52,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2021-12-15 21:55:52,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 122. [2021-12-15 21:55:52,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 121 states have (on average 1.3884297520661157) internal successors, (168), 121 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-15 21:55:52,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 168 transitions. [2021-12-15 21:55:52,933 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 168 transitions. Word has length 38 [2021-12-15 21:55:52,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 21:55:52,933 INFO L470 AbstractCegarLoop]: Abstraction has 122 states and 168 transitions. [2021-12-15 21:55:52,933 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 21:55:52,933 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 168 transitions. [2021-12-15 21:55:52,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2021-12-15 21:55:52,934 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 21:55:52,934 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 21:55:52,944 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-15 21:55:53,140 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-15 21:55:53,140 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-15 21:55:53,140 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 21:55:53,141 INFO L85 PathProgramCache]: Analyzing trace with hash -897635979, now seen corresponding path program 1 times [2021-12-15 21:55:53,141 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-15 21:55:53,141 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [505231877] [2021-12-15 21:55:53,141 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 21:55:53,141 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-15 21:55:53,141 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-15 21:55:53,155 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-15 21:55:53,156 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-15 21:55:53,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 21:55:53,179 INFO L263 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 5 conjunts are in the unsatisfiable core [2021-12-15 21:55:53,180 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 21:55:53,316 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 21:55:53,317 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-15 21:55:53,317 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-15 21:55:53,317 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [505231877] [2021-12-15 21:55:53,317 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [505231877] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 21:55:53,317 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 21:55:53,317 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-15 21:55:53,317 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1621540682] [2021-12-15 21:55:53,318 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 21:55:53,318 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-15 21:55:53,318 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-15 21:55:53,318 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-15 21:55:53,318 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-12-15 21:55:53,319 INFO L87 Difference]: Start difference. First operand 122 states and 168 transitions. Second operand has 6 states, 6 states have (on average 6.5) internal successors, (39), 6 states have internal predecessors, (39), 0 states have call successors, (0), 0 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-15 21:55:53,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 21:55:53,401 INFO L93 Difference]: Finished difference Result 245 states and 344 transitions. [2021-12-15 21:55:53,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-15 21:55:53,401 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.5) internal successors, (39), 6 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 39 [2021-12-15 21:55:53,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 21:55:53,402 INFO L225 Difference]: With dead ends: 245 [2021-12-15 21:55:53,402 INFO L226 Difference]: Without dead ends: 195 [2021-12-15 21:55:53,402 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-12-15 21:55:53,403 INFO L933 BasicCegarLoop]: 85 mSDtfsCounter, 65 mSDsluCounter, 89 mSDsCounter, 0 mSdLazyCounter, 114 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 174 SdHoareTripleChecker+Invalid, 206 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 114 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 89 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-15 21:55:53,403 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [65 Valid, 174 Invalid, 206 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 114 Invalid, 0 Unknown, 89 Unchecked, 0.1s Time] [2021-12-15 21:55:53,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2021-12-15 21:55:53,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 145. [2021-12-15 21:55:53,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 145 states, 144 states have (on average 1.3402777777777777) internal successors, (193), 144 states have internal predecessors, (193), 0 states have call successors, (0), 0 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-15 21:55:53,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 193 transitions. [2021-12-15 21:55:53,408 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 193 transitions. Word has length 39 [2021-12-15 21:55:53,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 21:55:53,408 INFO L470 AbstractCegarLoop]: Abstraction has 145 states and 193 transitions. [2021-12-15 21:55:53,408 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.5) internal successors, (39), 6 states have internal predecessors, (39), 0 states have call successors, (0), 0 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-15 21:55:53,408 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 193 transitions. [2021-12-15 21:55:53,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2021-12-15 21:55:53,409 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 21:55:53,409 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 21:55:53,425 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-15 21:55:53,615 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-15 21:55:53,616 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-15 21:55:53,616 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 21:55:53,616 INFO L85 PathProgramCache]: Analyzing trace with hash -1414100834, now seen corresponding path program 1 times [2021-12-15 21:55:53,617 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-15 21:55:53,617 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1394135068] [2021-12-15 21:55:53,617 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 21:55:53,617 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-15 21:55:53,617 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-15 21:55:53,618 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-15 21:55:53,619 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-15 21:55:53,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 21:55:53,663 INFO L263 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 4 conjunts are in the unsatisfiable core [2021-12-15 21:55:53,670 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 21:55:53,777 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 8 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 21:55:53,777 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-15 21:55:53,835 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 8 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 21:55:53,836 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-15 21:55:53,836 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1394135068] [2021-12-15 21:55:53,836 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1394135068] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-15 21:55:53,836 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-15 21:55:53,836 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2021-12-15 21:55:53,836 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [111037137] [2021-12-15 21:55:53,836 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-15 21:55:53,836 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-15 21:55:53,836 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-15 21:55:53,837 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-15 21:55:53,837 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-12-15 21:55:53,837 INFO L87 Difference]: Start difference. First operand 145 states and 193 transitions. Second operand has 8 states, 8 states have (on average 7.875) internal successors, (63), 8 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 21:55:53,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 21:55:53,976 INFO L93 Difference]: Finished difference Result 381 states and 582 transitions. [2021-12-15 21:55:53,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-15 21:55:53,976 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.875) internal successors, (63), 8 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 40 [2021-12-15 21:55:53,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 21:55:53,977 INFO L225 Difference]: With dead ends: 381 [2021-12-15 21:55:53,977 INFO L226 Difference]: Without dead ends: 280 [2021-12-15 21:55:53,977 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 72 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-15 21:55:53,978 INFO L933 BasicCegarLoop]: 21 mSDtfsCounter, 257 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 178 mSolverCounterSat, 87 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 257 SdHoareTripleChecker+Valid, 67 SdHoareTripleChecker+Invalid, 265 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 87 IncrementalHoareTripleChecker+Valid, 178 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-15 21:55:53,978 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [257 Valid, 67 Invalid, 265 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [87 Valid, 178 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-15 21:55:53,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 280 states. [2021-12-15 21:55:53,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 280 to 225. [2021-12-15 21:55:53,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 225 states, 224 states have (on average 1.4285714285714286) internal successors, (320), 224 states have internal predecessors, (320), 0 states have call successors, (0), 0 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-15 21:55:53,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 320 transitions. [2021-12-15 21:55:53,985 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 320 transitions. Word has length 40 [2021-12-15 21:55:53,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 21:55:53,985 INFO L470 AbstractCegarLoop]: Abstraction has 225 states and 320 transitions. [2021-12-15 21:55:53,986 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.875) internal successors, (63), 8 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 21:55:53,986 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 320 transitions. [2021-12-15 21:55:53,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2021-12-15 21:55:53,987 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 21:55:53,999 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-15 21:55:54,005 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-15 21:55:54,205 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-15 21:55:54,205 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-15 21:55:54,205 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 21:55:54,206 INFO L85 PathProgramCache]: Analyzing trace with hash 1373021230, now seen corresponding path program 1 times [2021-12-15 21:55:54,206 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-15 21:55:54,206 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [992971204] [2021-12-15 21:55:54,206 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 21:55:54,206 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-15 21:55:54,206 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-15 21:55:54,207 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-15 21:55:54,209 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-15 21:55:54,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 21:55:54,240 INFO L263 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 8 conjunts are in the unsatisfiable core [2021-12-15 21:55:54,241 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 21:55:54,372 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 54 proven. 3 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2021-12-15 21:55:54,372 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-15 21:55:54,513 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-15 21:55:54,513 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-15 21:55:54,513 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [992971204] [2021-12-15 21:55:54,513 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [992971204] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-15 21:55:54,514 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-15 21:55:54,514 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2021-12-15 21:55:54,514 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [610838958] [2021-12-15 21:55:54,514 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-15 21:55:54,514 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-12-15 21:55:54,514 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-15 21:55:54,514 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-12-15 21:55:54,514 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2021-12-15 21:55:54,514 INFO L87 Difference]: Start difference. First operand 225 states and 320 transitions. Second operand has 10 states, 10 states have (on average 9.0) internal successors, (90), 10 states have internal predecessors, (90), 0 states have call successors, (0), 0 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-15 21:55:54,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 21:55:54,673 INFO L93 Difference]: Finished difference Result 678 states and 958 transitions. [2021-12-15 21:55:54,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-15 21:55:54,673 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 9.0) internal successors, (90), 10 states have internal predecessors, (90), 0 states have call successors, (0), 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-15 21:55:54,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 21:55:54,674 INFO L225 Difference]: With dead ends: 678 [2021-12-15 21:55:54,675 INFO L226 Difference]: Without dead ends: 491 [2021-12-15 21:55:54,675 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-15 21:55:54,675 INFO L933 BasicCegarLoop]: 85 mSDtfsCounter, 293 mSDsluCounter, 258 mSDsCounter, 0 mSdLazyCounter, 151 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 293 SdHoareTripleChecker+Valid, 343 SdHoareTripleChecker+Invalid, 188 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 151 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-15 21:55:54,675 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [293 Valid, 343 Invalid, 188 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 151 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-15 21:55:54,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 491 states. [2021-12-15 21:55:54,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 491 to 304. [2021-12-15 21:55:54,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 304 states, 303 states have (on average 1.4554455445544554) internal successors, (441), 303 states have internal predecessors, (441), 0 states have call successors, (0), 0 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-15 21:55:54,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 304 states to 304 states and 441 transitions. [2021-12-15 21:55:54,685 INFO L78 Accepts]: Start accepts. Automaton has 304 states and 441 transitions. Word has length 70 [2021-12-15 21:55:54,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 21:55:54,685 INFO L470 AbstractCegarLoop]: Abstraction has 304 states and 441 transitions. [2021-12-15 21:55:54,685 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.0) internal successors, (90), 10 states have internal predecessors, (90), 0 states have call successors, (0), 0 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-15 21:55:54,685 INFO L276 IsEmpty]: Start isEmpty. Operand 304 states and 441 transitions. [2021-12-15 21:55:54,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2021-12-15 21:55:54,688 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 21:55:54,688 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-15 21:55:54,701 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-15 21:55:54,903 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-15 21:55:54,903 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-15 21:55:54,904 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 21:55:54,904 INFO L85 PathProgramCache]: Analyzing trace with hash 343661932, now seen corresponding path program 2 times [2021-12-15 21:55:54,904 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-15 21:55:54,904 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1193306564] [2021-12-15 21:55:54,904 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-15 21:55:54,904 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-15 21:55:54,904 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-15 21:55:54,920 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-15 21:55:54,933 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-15 21:55:54,972 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-12-15 21:55:54,972 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-15 21:55:54,973 INFO L263 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 8 conjunts are in the unsatisfiable core [2021-12-15 21:55:54,974 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 21:55:55,112 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 66 proven. 9 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2021-12-15 21:55:55,113 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-15 21:55:55,221 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-15 21:55:55,221 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-15 21:55:55,221 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1193306564] [2021-12-15 21:55:55,222 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1193306564] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-15 21:55:55,222 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-15 21:55:55,222 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 9 [2021-12-15 21:55:55,222 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [231081583] [2021-12-15 21:55:55,222 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-15 21:55:55,222 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-12-15 21:55:55,223 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-15 21:55:55,223 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-12-15 21:55:55,223 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2021-12-15 21:55:55,223 INFO L87 Difference]: Start difference. First operand 304 states and 441 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-15 21:55:55,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 21:55:55,384 INFO L93 Difference]: Finished difference Result 743 states and 1038 transitions. [2021-12-15 21:55:55,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-15 21:55:55,384 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-15 21:55:55,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 21:55:55,386 INFO L225 Difference]: With dead ends: 743 [2021-12-15 21:55:55,386 INFO L226 Difference]: Without dead ends: 477 [2021-12-15 21:55:55,387 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-15 21:55:55,388 INFO L933 BasicCegarLoop]: 89 mSDtfsCounter, 207 mSDsluCounter, 204 mSDsCounter, 0 mSdLazyCounter, 114 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 207 SdHoareTripleChecker+Valid, 293 SdHoareTripleChecker+Invalid, 142 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 114 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-15 21:55:55,388 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [207 Valid, 293 Invalid, 142 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 114 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-15 21:55:55,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 477 states. [2021-12-15 21:55:55,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 477 to 282. [2021-12-15 21:55:55,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 282 states, 281 states have (on average 1.4092526690391458) internal successors, (396), 281 states have internal predecessors, (396), 0 states have call successors, (0), 0 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-15 21:55:55,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 282 states to 282 states and 396 transitions. [2021-12-15 21:55:55,399 INFO L78 Accepts]: Start accepts. Automaton has 282 states and 396 transitions. Word has length 70 [2021-12-15 21:55:55,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 21:55:55,400 INFO L470 AbstractCegarLoop]: Abstraction has 282 states and 396 transitions. [2021-12-15 21:55:55,400 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-15 21:55:55,400 INFO L276 IsEmpty]: Start isEmpty. Operand 282 states and 396 transitions. [2021-12-15 21:55:55,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2021-12-15 21:55:55,401 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 21:55:55,401 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-15 21:55:55,425 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-15 21:55:55,610 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-15 21:55:55,611 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-15 21:55:55,611 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 21:55:55,611 INFO L85 PathProgramCache]: Analyzing trace with hash 484210542, now seen corresponding path program 3 times [2021-12-15 21:55:55,611 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-15 21:55:55,612 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1248328025] [2021-12-15 21:55:55,612 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-12-15 21:55:55,612 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-15 21:55:55,612 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-15 21:55:55,616 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-15 21:55:55,655 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-15 21:55:55,667 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2021-12-15 21:55:55,667 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-15 21:55:55,669 INFO L263 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 42 conjunts are in the unsatisfiable core [2021-12-15 21:55:55,671 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 21:55:58,530 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-15 21:55:58,530 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-15 21:56:00,895 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-15 21:56:00,895 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-15 21:56:00,895 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1248328025] [2021-12-15 21:56:00,895 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1248328025] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-15 21:56:00,895 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-15 21:56:00,895 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 24] total 45 [2021-12-15 21:56:00,896 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1897935943] [2021-12-15 21:56:00,896 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-15 21:56:00,896 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2021-12-15 21:56:00,896 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-15 21:56:00,897 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2021-12-15 21:56:00,897 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=148, Invalid=1832, Unknown=0, NotChecked=0, Total=1980 [2021-12-15 21:56:00,897 INFO L87 Difference]: Start difference. First operand 282 states and 396 transitions. Second operand has 45 states, 45 states have (on average 3.066666666666667) internal successors, (138), 45 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-15 21:56:13,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 21:56:13,727 INFO L93 Difference]: Finished difference Result 1658 states and 2264 transitions. [2021-12-15 21:56:13,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2021-12-15 21:56:13,732 INFO L78 Accepts]: Start accepts. Automaton has has 45 states, 45 states have (on average 3.066666666666667) internal successors, (138), 45 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-15 21:56:13,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 21:56:13,736 INFO L225 Difference]: With dead ends: 1658 [2021-12-15 21:56:13,736 INFO L226 Difference]: Without dead ends: 1552 [2021-12-15 21:56:13,739 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 214 GetRequests, 94 SyntacticMatches, 1 SemanticMatches, 119 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2766 ImplicationChecksByTransitivity, 11.7s TimeCoverageRelationStatistics Valid=2492, Invalid=12028, Unknown=0, NotChecked=0, Total=14520 [2021-12-15 21:56:13,740 INFO L933 BasicCegarLoop]: 413 mSDtfsCounter, 2569 mSDsluCounter, 7453 mSDsCounter, 0 mSdLazyCounter, 4632 mSolverCounterSat, 351 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2569 SdHoareTripleChecker+Valid, 7866 SdHoareTripleChecker+Invalid, 4983 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 351 IncrementalHoareTripleChecker+Valid, 4632 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.5s IncrementalHoareTripleChecker+Time [2021-12-15 21:56:13,740 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2569 Valid, 7866 Invalid, 4983 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [351 Valid, 4632 Invalid, 0 Unknown, 0 Unchecked, 3.5s Time] [2021-12-15 21:56:13,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1552 states. [2021-12-15 21:56:13,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1552 to 628. [2021-12-15 21:56:13,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 628 states, 627 states have (on average 1.4322169059011165) internal successors, (898), 627 states have internal predecessors, (898), 0 states have call successors, (0), 0 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-15 21:56:13,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 628 states to 628 states and 898 transitions. [2021-12-15 21:56:13,769 INFO L78 Accepts]: Start accepts. Automaton has 628 states and 898 transitions. Word has length 70 [2021-12-15 21:56:13,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 21:56:13,770 INFO L470 AbstractCegarLoop]: Abstraction has 628 states and 898 transitions. [2021-12-15 21:56:13,770 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 45 states, 45 states have (on average 3.066666666666667) internal successors, (138), 45 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-15 21:56:13,770 INFO L276 IsEmpty]: Start isEmpty. Operand 628 states and 898 transitions. [2021-12-15 21:56:13,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2021-12-15 21:56:13,771 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 21:56:13,772 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-15 21:56:13,795 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (16)] Ended with exit code 0 [2021-12-15 21:56:13,979 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-15 21:56:13,979 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-15 21:56:13,980 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 21:56:13,980 INFO L85 PathProgramCache]: Analyzing trace with hash 703065260, now seen corresponding path program 1 times [2021-12-15 21:56:13,980 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-15 21:56:13,981 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1475852738] [2021-12-15 21:56:13,981 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 21:56:13,981 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-15 21:56:13,981 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-15 21:56:13,982 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-15 21:56:13,983 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-15 21:56:14,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 21:56:14,022 INFO L263 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 4 conjunts are in the unsatisfiable core [2021-12-15 21:56:14,024 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 21:56:14,218 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 62 proven. 17 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-12-15 21:56:14,219 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-15 21:56:14,300 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 62 proven. 17 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-12-15 21:56:14,300 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-15 21:56:14,300 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1475852738] [2021-12-15 21:56:14,300 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1475852738] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-15 21:56:14,300 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-15 21:56:14,300 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2021-12-15 21:56:14,301 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1562474320] [2021-12-15 21:56:14,301 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-15 21:56:14,301 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-15 21:56:14,301 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-15 21:56:14,301 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-15 21:56:14,301 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-12-15 21:56:14,301 INFO L87 Difference]: Start difference. First operand 628 states and 898 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-15 21:56:14,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 21:56:14,408 INFO L93 Difference]: Finished difference Result 1259 states and 1812 transitions. [2021-12-15 21:56:14,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-15 21:56:14,410 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-15 21:56:14,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 21:56:14,411 INFO L225 Difference]: With dead ends: 1259 [2021-12-15 21:56:14,411 INFO L226 Difference]: Without dead ends: 664 [2021-12-15 21:56:14,412 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-15 21:56:14,412 INFO L933 BasicCegarLoop]: 33 mSDtfsCounter, 34 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 186 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 84 SdHoareTripleChecker+Invalid, 287 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 186 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 81 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-15 21:56:14,413 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [34 Valid, 84 Invalid, 287 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 186 Invalid, 0 Unknown, 81 Unchecked, 0.1s Time] [2021-12-15 21:56:14,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 664 states. [2021-12-15 21:56:14,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 664 to 527. [2021-12-15 21:56:14,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 527 states, 526 states have (on average 1.3954372623574145) internal successors, (734), 526 states have internal predecessors, (734), 0 states have call successors, (0), 0 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-15 21:56:14,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 527 states to 527 states and 734 transitions. [2021-12-15 21:56:14,434 INFO L78 Accepts]: Start accepts. Automaton has 527 states and 734 transitions. Word has length 70 [2021-12-15 21:56:14,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 21:56:14,435 INFO L470 AbstractCegarLoop]: Abstraction has 527 states and 734 transitions. [2021-12-15 21:56:14,435 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-15 21:56:14,435 INFO L276 IsEmpty]: Start isEmpty. Operand 527 states and 734 transitions. [2021-12-15 21:56:14,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2021-12-15 21:56:14,436 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 21:56:14,436 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-15 21:56:14,452 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (17)] Forceful destruction successful, exit code 0 [2021-12-15 21:56:14,645 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-15 21:56:14,646 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-15 21:56:14,647 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 21:56:14,647 INFO L85 PathProgramCache]: Analyzing trace with hash -247756884, now seen corresponding path program 1 times [2021-12-15 21:56:14,647 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-15 21:56:14,647 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1282099697] [2021-12-15 21:56:14,647 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 21:56:14,647 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-15 21:56:14,647 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-15 21:56:14,649 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-15 21:56:14,650 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (18)] Waiting until timeout for monitored process [2021-12-15 21:56:14,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 21:56:14,678 INFO L263 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 6 conjunts are in the unsatisfiable core [2021-12-15 21:56:14,679 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 21:56:14,831 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2021-12-15 21:56:14,831 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-15 21:56:14,831 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-15 21:56:14,831 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1282099697] [2021-12-15 21:56:14,831 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1282099697] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 21:56:14,831 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 21:56:14,832 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-15 21:56:14,832 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [740195888] [2021-12-15 21:56:14,832 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 21:56:14,832 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-15 21:56:14,832 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-15 21:56:14,832 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-15 21:56:14,832 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-12-15 21:56:14,833 INFO L87 Difference]: Start difference. First operand 527 states and 734 transitions. Second operand has 7 states, 7 states have (on average 7.428571428571429) internal successors, (52), 7 states have internal predecessors, (52), 0 states have call successors, (0), 0 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-15 21:56:14,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 21:56:14,974 INFO L93 Difference]: Finished difference Result 1088 states and 1520 transitions. [2021-12-15 21:56:14,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-15 21:56:14,974 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.428571428571429) internal successors, (52), 7 states have internal predecessors, (52), 0 states have call successors, (0), 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-15 21:56:14,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 21:56:14,976 INFO L225 Difference]: With dead ends: 1088 [2021-12-15 21:56:14,976 INFO L226 Difference]: Without dead ends: 914 [2021-12-15 21:56:14,977 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-12-15 21:56:14,977 INFO L933 BasicCegarLoop]: 126 mSDtfsCounter, 117 mSDsluCounter, 215 mSDsCounter, 0 mSdLazyCounter, 190 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 341 SdHoareTripleChecker+Invalid, 301 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 190 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 109 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-15 21:56:14,977 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [117 Valid, 341 Invalid, 301 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 190 Invalid, 0 Unknown, 109 Unchecked, 0.1s Time] [2021-12-15 21:56:14,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 914 states. [2021-12-15 21:56:14,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 914 to 521. [2021-12-15 21:56:14,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 521 states, 520 states have (on average 1.4) internal successors, (728), 520 states have internal predecessors, (728), 0 states have call successors, (0), 0 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-15 21:56:14,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 521 states to 521 states and 728 transitions. [2021-12-15 21:56:14,992 INFO L78 Accepts]: Start accepts. Automaton has 521 states and 728 transitions. Word has length 70 [2021-12-15 21:56:14,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 21:56:14,993 INFO L470 AbstractCegarLoop]: Abstraction has 521 states and 728 transitions. [2021-12-15 21:56:14,993 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.428571428571429) internal successors, (52), 7 states have internal predecessors, (52), 0 states have call successors, (0), 0 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-15 21:56:14,993 INFO L276 IsEmpty]: Start isEmpty. Operand 521 states and 728 transitions. [2021-12-15 21:56:14,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2021-12-15 21:56:14,993 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 21:56:14,993 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] [2021-12-15 21:56:15,000 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (18)] Forceful destruction successful, exit code 0 [2021-12-15 21:56:15,199 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-15 21:56:15,200 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-15 21:56:15,200 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 21:56:15,200 INFO L85 PathProgramCache]: Analyzing trace with hash 946149333, now seen corresponding path program 1 times [2021-12-15 21:56:15,200 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-15 21:56:15,200 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [307253927] [2021-12-15 21:56:15,201 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 21:56:15,201 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-15 21:56:15,201 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-15 21:56:15,202 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-15 21:56:15,202 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (19)] Waiting until timeout for monitored process [2021-12-15 21:56:15,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 21:56:15,231 INFO L263 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 5 conjunts are in the unsatisfiable core [2021-12-15 21:56:15,232 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 21:56:15,473 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 63 proven. 11 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2021-12-15 21:56:15,474 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-15 21:56:15,666 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 53 proven. 21 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2021-12-15 21:56:15,666 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-15 21:56:15,666 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [307253927] [2021-12-15 21:56:15,666 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [307253927] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-15 21:56:15,666 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-15 21:56:15,666 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2021-12-15 21:56:15,666 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [579041549] [2021-12-15 21:56:15,666 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-15 21:56:15,667 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-12-15 21:56:15,667 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-15 21:56:15,667 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-12-15 21:56:15,667 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2021-12-15 21:56:15,667 INFO L87 Difference]: Start difference. First operand 521 states and 728 transitions. Second operand has 10 states, 10 states have (on average 10.6) internal successors, (106), 10 states have internal predecessors, (106), 0 states have call successors, (0), 0 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-15 21:56:15,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 21:56:15,791 INFO L93 Difference]: Finished difference Result 767 states and 1055 transitions. [2021-12-15 21:56:15,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-12-15 21:56:15,792 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 10.6) internal successors, (106), 10 states have internal predecessors, (106), 0 states have call successors, (0), 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 72 [2021-12-15 21:56:15,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 21:56:15,793 INFO L225 Difference]: With dead ends: 767 [2021-12-15 21:56:15,793 INFO L226 Difference]: Without dead ends: 593 [2021-12-15 21:56:15,793 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 134 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2021-12-15 21:56:15,794 INFO L933 BasicCegarLoop]: 41 mSDtfsCounter, 78 mSDsluCounter, 104 mSDsCounter, 0 mSdLazyCounter, 176 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 145 SdHoareTripleChecker+Invalid, 313 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 176 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 128 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-15 21:56:15,794 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [78 Valid, 145 Invalid, 313 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 176 Invalid, 0 Unknown, 128 Unchecked, 0.1s Time] [2021-12-15 21:56:15,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 593 states. [2021-12-15 21:56:15,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 593 to 584. [2021-12-15 21:56:15,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 584 states, 583 states have (on average 1.3619210977701544) internal successors, (794), 583 states have internal predecessors, (794), 0 states have call successors, (0), 0 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-15 21:56:15,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 584 states to 584 states and 794 transitions. [2021-12-15 21:56:15,836 INFO L78 Accepts]: Start accepts. Automaton has 584 states and 794 transitions. Word has length 72 [2021-12-15 21:56:15,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 21:56:15,837 INFO L470 AbstractCegarLoop]: Abstraction has 584 states and 794 transitions. [2021-12-15 21:56:15,837 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.6) internal successors, (106), 10 states have internal predecessors, (106), 0 states have call successors, (0), 0 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-15 21:56:15,837 INFO L276 IsEmpty]: Start isEmpty. Operand 584 states and 794 transitions. [2021-12-15 21:56:15,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2021-12-15 21:56:15,838 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 21:56:15,838 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] [2021-12-15 21:56:15,846 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (19)] Forceful destruction successful, exit code 0 [2021-12-15 21:56:16,044 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-15 21:56:16,044 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-15 21:56:16,045 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 21:56:16,045 INFO L85 PathProgramCache]: Analyzing trace with hash -1891529833, now seen corresponding path program 1 times [2021-12-15 21:56:16,045 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-15 21:56:16,045 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [906880915] [2021-12-15 21:56:16,045 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 21:56:16,045 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-15 21:56:16,045 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-15 21:56:16,056 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-15 21:56:16,067 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (20)] Waiting until timeout for monitored process [2021-12-15 21:56:16,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 21:56:16,098 INFO L263 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 6 conjunts are in the unsatisfiable core [2021-12-15 21:56:16,099 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 21:56:16,296 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 63 proven. 11 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2021-12-15 21:56:16,307 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-15 21:56:16,481 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 53 proven. 21 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2021-12-15 21:56:16,481 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-15 21:56:16,481 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [906880915] [2021-12-15 21:56:16,481 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [906880915] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-15 21:56:16,481 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-15 21:56:16,482 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2021-12-15 21:56:16,482 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2033490594] [2021-12-15 21:56:16,482 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-15 21:56:16,482 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-12-15 21:56:16,482 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-15 21:56:16,482 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-12-15 21:56:16,482 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2021-12-15 21:56:16,483 INFO L87 Difference]: Start difference. First operand 584 states and 794 transitions. Second operand has 12 states, 12 states have (on average 9.0) internal successors, (108), 12 states have internal predecessors, (108), 0 states have call successors, (0), 0 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-15 21:56:16,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 21:56:16,690 INFO L93 Difference]: Finished difference Result 859 states and 1173 transitions. [2021-12-15 21:56:16,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-15 21:56:16,690 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 9.0) internal successors, (108), 12 states have internal predecessors, (108), 0 states have call successors, (0), 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 73 [2021-12-15 21:56:16,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 21:56:16,692 INFO L225 Difference]: With dead ends: 859 [2021-12-15 21:56:16,692 INFO L226 Difference]: Without dead ends: 685 [2021-12-15 21:56:16,692 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 134 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=131, Unknown=0, NotChecked=0, Total=182 [2021-12-15 21:56:16,693 INFO L933 BasicCegarLoop]: 44 mSDtfsCounter, 186 mSDsluCounter, 151 mSDsCounter, 0 mSdLazyCounter, 284 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 186 SdHoareTripleChecker+Valid, 195 SdHoareTripleChecker+Invalid, 560 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 284 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 270 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-15 21:56:16,693 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [186 Valid, 195 Invalid, 560 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 284 Invalid, 0 Unknown, 270 Unchecked, 0.2s Time] [2021-12-15 21:56:16,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 685 states. [2021-12-15 21:56:16,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 685 to 623. [2021-12-15 21:56:16,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 623 states, 622 states have (on average 1.342443729903537) internal successors, (835), 622 states have internal predecessors, (835), 0 states have call successors, (0), 0 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-15 21:56:16,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 623 states to 623 states and 835 transitions. [2021-12-15 21:56:16,712 INFO L78 Accepts]: Start accepts. Automaton has 623 states and 835 transitions. Word has length 73 [2021-12-15 21:56:16,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 21:56:16,712 INFO L470 AbstractCegarLoop]: Abstraction has 623 states and 835 transitions. [2021-12-15 21:56:16,712 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 9.0) internal successors, (108), 12 states have internal predecessors, (108), 0 states have call successors, (0), 0 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-15 21:56:16,712 INFO L276 IsEmpty]: Start isEmpty. Operand 623 states and 835 transitions. [2021-12-15 21:56:16,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2021-12-15 21:56:16,713 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 21:56:16,713 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-15 21:56:16,721 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (20)] Forceful destruction successful, exit code 0 [2021-12-15 21:56:16,922 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-15 21:56:16,922 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-15 21:56:16,922 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 21:56:16,923 INFO L85 PathProgramCache]: Analyzing trace with hash -1135042114, now seen corresponding path program 1 times [2021-12-15 21:56:16,923 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-15 21:56:16,923 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [520440421] [2021-12-15 21:56:16,923 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 21:56:16,923 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-15 21:56:16,924 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-15 21:56:16,925 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-15 21:56:16,926 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (21)] Waiting until timeout for monitored process [2021-12-15 21:56:16,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 21:56:16,970 INFO L263 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 43 conjunts are in the unsatisfiable core [2021-12-15 21:56:16,972 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 21:56:19,702 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-15 21:56:19,702 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-15 21:56:22,680 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-15 21:56:22,681 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-15 21:56:22,681 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [520440421] [2021-12-15 21:56:22,681 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [520440421] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-15 21:56:22,681 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-15 21:56:22,681 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24] total 46 [2021-12-15 21:56:22,682 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1513400396] [2021-12-15 21:56:22,682 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-15 21:56:22,682 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2021-12-15 21:56:22,682 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-15 21:56:22,683 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2021-12-15 21:56:22,683 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=149, Invalid=1921, Unknown=0, NotChecked=0, Total=2070 [2021-12-15 21:56:22,684 INFO L87 Difference]: Start difference. First operand 623 states and 835 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)